Degradation modelling in process control applications

Degradation of industrial equipment is often influenced by how a system is operated, with certain operating points likely to accelerate degradation. The ability to mitigate degradation of an industrial system would result in improved performance and decreased costs of operation. The thesis aims to provide ways for managing degradation by adjusting the operating conditions of a system. The thesis provides original insights and a new classification of models of degradation to facilitate the integration of degradation models into process control applications. The thesis also develops an adaptive algorithm for degradation detection and prediction in turbomachinery, which is able to predict the expected future values of a degradation indicator and to quantify the uncertainty of the prediction. The thesis then proposes two frameworks for load-sharing in a compressor station in which the compressors are subject to degradation. One framework considers management of degradation and the other one focuses on power consumption of the whole station. These examples show how modelling of degradation can have an impact on the operation of an industrial system. The approaches have been evaluated with case studies developed in collaboration with industrial partners. As demonstrated in the case studies, the outcomes of the research presented in this thesis provide new ways to take account of degradation in process control applications. The thesis discusses steps and directions for future work to facilitate the technology transfer from academic to industrial implementation.Open Acces

Automatic scenario generation for efficient solution of robust optimal control problems

Existing methods for nonlinear robust control often use scenario-based approaches to formulate the control problem as large nonlinear optimization problems. The optimization problems are challenging to solve due to their size, especially if the control problems include time-varying uncertainty. This paper draws from local reduction methods used in semi-infinite optimization to solve robust optimal control problems with parametric and time-varying uncertainty. By iteratively adding interim worst-case scenarios to the problem, methods based on local reduction provide a way to manage the total number of scenarios. We show that the local reduction method for optimal control problems consists of solving a series of simplified optimal control problems to find worst-case constraint violations. In particular, we present examples where local reduction methods find worst-case scenarios that are not on the boundary of the uncertainty set. We also provide bounds on the error if local solvers are used. The proposed approach is illustrated with two case studies with parametric and additive time-varying uncertainty. In the first case study, the number of scenarios obtained from local reduction is 101, smaller than in the case when all $2^{14+3\times192}$ extreme scenarios are considered. In the second case study, the number of scenarios obtained from the local reduction is two compared to 512 extreme scenarios. Our approach was able to satisfy the constraints both for parametric uncertainty and time-varying disturbances, whereas approaches from literature either violated the constraints or became computationally expensive.Comment: arXiv admin note: substantial text overlap with arXiv:2204.14145 (IFAC conference submission

Efficient sample selection for safe learning

Ensuring safety in industrial control systems usually involves imposing constraints at the design stage of the control algorithm. Enforcing constraints is challenging if the underlying functional form is unknown. The challenge can be addressed by using surrogate models, such as Gaussian processes, which provide confidence intervals used to find solutions that can be considered safe. This in turn involves an exhaustive search on the entire search space. That approach can quickly become computationally expensive. We reformulate the exhaustive search as a series of optimization problems to find the next recommended points. We show that the proposed reformulation allows using a wide range of available optimization solvers, such as derivative-free methods. We show that by exploiting the properties of the solver, we enable the introduction of new stopping criteria into safe learning methods and increase flexibility in trading off solver accuracy and computational time. The results from a non-convex optimization problem and an application for controller tuning confirm the flexibility and the performance of the proposed reformulation

Efficient safe learning for controller tuning with experimental validation

Optimization-based controller tuning is challenging because it requires formulating optimization problems explicitly as functions of controller parameters. Safe learning algorithms overcome the challenge by creating surrogate models from measured data. To ensure safety, such data-driven algorithms often rely on exhaustive grid search, which is computationally inefficient. In this paper, we propose a novel approach to safe learning by formulating a series of optimization problems instead of a grid search. We also develop a method for initializing the optimization problems to guarantee feasibility while using numerical solvers. The performance of the new method is first validated in a simulated precision motion system, demonstrating improved computational efficiency, and illustrating the role of exploiting numerical solvers to reach the desired precision. Experimental validation on an industrial-grade precision motion system confirms that the proposed algorithm achieves 30% better tracking at sub-micrometer precision as a state-of-the-art safe learning algorithm, improves the default auto-tuning solution, and reduces the computational cost seven times compared to learning algorithms based on exhaustive search

Unmanned and Autonomous Systems: Future of Automation in Process and Energy Industries

Process and energy industries have been recognised as adopters of high levels of automation compared to other sectors. Nonetheless, human cognitive input still plays a critical role in the operation of process plants and replication of these cognitive capabilities remains a key challenge for advancing automation levels. In this paper, we provide an analysis of process and energy industries based on a scenario of reduced availability of skilled labour and increased demands for safety, sustainability, and resilience. We consider the different mechanical, sensing, situational awareness, and decision-making tasks involved in the operation of plants and map them to possible realisations of unmanned and autonomous systems. We discuss the implications of current technology capabilities and future technology development perspectives, the factors influencing the complexity of operation in process plants, and the importance of human-machine collaboration. As part of autonomous system capabilities, we consider adaptation as a key capability and we make a connection to adaptation of model-based solutions. We argue that reaching higher and wider levels of autonomy requires a rethink of the design processes for both the physical plants as well as the way automation, control, and safety solutions are conceptualised.ISSN:2405-896

Efficient solution of robust optimal control problems using local reduction

Existing methods for nonlinear robust control often use scenario-based approaches to formulate the control problem as nonlinear optimization problems. Increasing the number of scenarios improves robustness, while increasing the size of the optimization problems. Mitigating the size of the problem by reducing the number of scenarios requires knowledge about how the uncertainty affects the system. This paper draws from local reduction methods used in semi-infinite optimization to solve robust optimal control problems with parametric uncertainty. We show that nonlinear robust optimal control problems are equivalent to semi-infinite optimization problems and can be solved by local reduction. By iteratively adding interim globally worst-case scenarios to the problem, methods based on local reduction provide a way to manage the total number of scenarios. In particular, we show that local reduction methods find worst case scenarios that are not on the boundary of the uncertainty set. The proposed approach is illustrated with a case study with both parametric and additive time-varying uncertainty. The number of scenarios obtained from local reduction is 101, smaller than in the case when all $2^{14+3\times192}$ boundary scenarios are considered. A validation with randomly drawn scenarios shows that our proposed approach reduces the number of scenarios and ensures robustness even if local solvers are used

Efficient sample selection for safe learning

Ensuring safety in optimization is challenging if the underlying functional forms of either the constraints or the objective function are unknown. The challenge can be addressed by using Gaussian processes to provide confidence intervals used to find solutions that can be considered safe. To iteratively find a trade-off between finding the solution and ensuring safety, the SafeOpt algorithm builds on algorithms using only the upper bounds (UCB-type algorithms) by performing an exhaustive search on the entire search space to find a safe iterate. That approach can quickly become computationally expensive. We reformulate the exhaustive search as a series of optimization problems to find the next recommended points. We show that the proposed reformulation allows using a wide range of available optimization solvers, such as derivative-free methods. We show that by exploiting the properties of the solver, we enable the introduction of new stopping criteria into safe learning methods and increase flexibility in trading off solver accuracy and computational time. The results from a non-convex optimization problem and an application for controller tuning confirm the flexibility and the performance of the proposed reformulation

Degradation-aware data-enabled predictive control of energy hubs

Mitigating the energy use in buildings, together with satisfaction of comfort requirements are the main objectives of efficient building control systems. Augmenting building energy systems with batteries can improve the energy use of a building, while posing the challenge of considering battery degradation during control operation. We demonstrate the performance of a data-enabled predictive control (DeePC) approach applied to a single multi- zone building and an energy hub comprising an electric heat pump and a battery. In a comparison with a standard rule-based controller, results demonstrate that the performance of DeePC is superior in terms of satisfaction of comfort constraints without increasing grid power consumption. Moreover, DeePC achieved two-fold decrease in battery degradation over one year, as compared to a rule-based controller

Adaptive detection and prediction of performance degradation in off-shore turbomachinery

Performance-based maintenance of machinery relies on detection and prediction of performance degradation. Degradation indicators calculated from process measurements need to be approximated with degradation models that smooth the variations in the measurements and give predictions of future values of the indicator. Existing models for performance degradation assume that the performance monotonically decreases with time. In consequence, the models yield suboptimal performance in performance-based maintenance as they do not take into account that performance degradation can reverse itself. For instance, deposits on the blades of a turbomachine can be self-cleaning in some conditions. In this study, a data-driven algorithm is proposed that detects if the performance degradation indicator is increasing or decreasing and adapts the model accordingly. A moving window approach is combined with adaptive regression analysis of operating data to predict the expected value of the performance degradation indicator and to quantify the uncertainty of predictions. The algorithm is tested on industrial performance degradation data from two independent offshore applications, and compared with four other approaches. The parameters of the algorithm are discussed and recommendations on the optimal choices are made. The algorithm proved to be portable and the results are promising for improving performance-based maintenance