Searcharxiv⌕ Search

arXiv subjects

Edward O'Dwyer

Publications and source records attributed to Edward O'Dwyer.

4 recordsLinked to original sources

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.

math.OC↗

Automatic Scenario Generation for Robust Optimal Control Problems

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.

math.OC↗

Data-driven predictive control with improved performance using segmented trajectories

A class of data-driven control methods has recently emerged based on Willems' fundamental lemma. Such methods can ease the modelling burden in control design but can be sensitive to disturbances acting on the system under control. In this paper, we propose a restructuring of the problem to incorporate segmented prediction trajectories. The proposed segmentation leads to reduced tracking error for longer prediction horizons in the presence of unmeasured disturbance and noise when compared to an unsegmented formulation. The performance characteristics are illustrated in a set-point tracking case study in which the segmented formulation enables more consistent performance over a wide range of prediction horizons. The method is then applied to a building energy management problem using a detailed simulation environment. The case studies show that good tracking performance is achieved for a range of horizon choices, whereas performance degrades with longer horizons without segmentation.

eess.SY↗

Integration of an Energy Management Tool and Digital Twin for Coordination and Control of Multi-vector Smart Energy Systems

As Internet of Things (IoT) technologies enable greater communication between energy assets in smart cities, the operational coordination of various energy networks in a city or district becomes more viable. Suitable tools are needed that can harness advanced control and machine learning techniques to achieve environmental, economic and resilience objectives. In this paper, an energy management tool is presented that can offer optimal control, scheduling, forecasting and coordination services to energy assets across a district, enabling optimal decisions under user-defined objectives. The tool presented here can coordinate different sub-systems in a district to avoid the violation of high-level system constraints and is designed in a generic fashion to enable transferable use across different energy sectors. The work demonstrates the potential for a single open-source optimisation framework to be applied across multiple energy vectors, providing local government the opportunity to manage different assets in a coordinated fashion. This is shown through case studies that integrate low-carbon communal heating for social housing with electric vehicle charge-point management to achieve high-level system constraints and local government objectives in the borough of Greenwich, London. The paper illustrates the theoretical methodology, the software architecture and the digital twin-based testing environment underpinning the proposed approach.

eess.SY↗