Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the Optimality and Convergence Properties of the Iterative Learning Model Predictive Controller
183
0
0.0
(
0
)
Added by
Ugo Rosolia
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this technical note we analyse the performance improvement and optimality properties of the Learning Model Predictive Control (LMPC) strategy for linear deterministic systems. The LMPC framework is a policy iteration scheme where closed-loop trajectories are used to update the control policy for the next execution of the control task. We show that, when a Linear Independence Constraint Qualification (LICQ) condition holds, the LMPC scheme guarantees strict iterative performance improvement and optimality, meaning that the closed-loop cost evaluated over the entire task converges asymptotically to the optimal cost of the infinite-horizon control problem. Compared to previous works this sufficient LICQ condition can be easily checked, it holds for a larger class of systems and it can be used to adaptively select the prediction horizon of the controller, as demonstrated by a numerical example.
rate research
Read More
To provide automatic generation control (AGC) service, wind farms (WFs) are required to control their operation dynamically to track the time-varying power reference. Wake effects impose significant aerodynamic interactions among turbines, which remarkably influence the WF dynamic power production. The nonlinear and high-dimensional nature of dynamic wake model, however, brings extremely high computation complexity and obscure the design of WF controllers. This paper overcomes the control difficulty brought by the dynamic wake model by proposing a novel control-oriented reduced order WF model and a deep-learning-aided model predictive control (MPC) method. Leveraging recent advances in computational fluid dynamics (CFD) to provide high-fidelity data that simulates WF dynamic wake flows, two novel deep neural network (DNN) architectures are specially designed to learn a dynamic WF reduced-order model (ROM) that can capture the dominant flow dynamics. Then, a novel MPC framework is constructed that explicitly incorporates the obtained WF ROM to coordinate different turbines while considering dynamic wake interactions. The proposed WF ROM and the control method are evaluated in a widely-accepted high-dimensional dynamic WF simulator whose accuracy has been validated by realistic measurement data. A 9-turbine WF case and a larger 25-turbine WF case are studied. By reducing WF model states by many orders of magnitude, the computational burden of the control method is reduced greatly. Besides, through the proposed method, the range of AGC signals that can be tracked by the WF in the dynamic operation is extended compared with the existing greedy controller.
We present a data-driven model predictive control scheme for chance-constrained Markovian switching systems with unknown switching probabilities. Using samples of the underlying Markov chain, ambiguity sets of transition probabilities are estimated which include the true conditional probability distributions with high probability. These sets are updated online and used to formulate a time-varying, risk-averse optimal control problem. We prove recursive feasibility of the resulting MPC scheme and show that the original chance constraints remain satisfied at every time step. Furthermore, we show that under sufficient decrease of the confidence levels, the resulting MPC scheme renders the closed-loop system mean-square stable with respect to the true-but-unknown distributions, while remaining less conservative than a fully robust approach.
In this paper, we introduce a sequential learning algorithm to address a probabilistically robust controller tuning problem. The algorithm leverages ideas from the areas of randomised algorithms and ordinal optimisation, which have both been proposed to find approximate solutions for difficult design problems in control. We formally prove that our algorithm yields a controller which meets a specified probabilisitic performance specification, assuming a Gaussian or near-Gaussian copula model for the controller performances. Additionally, we are able to characterise the computational requirement of the algorithm by using a lower bound on the distribution function of the algorithms stopping time. To validate our work, the algorithm is then demonstrated for the purpose of tuning model predictive controllers on a diesel engine air-path. It is shown that the algorithm is able to successfully tune a single controller to meet a desired performance threshold, even in the presence of uncertainty in the diesel engine model, that is inherent when a single representation is used across a fleet of vehicles.
We propose a fully distributed control system architecture, amenable to in-vehicle implementation, that aims to safely coordinate connected and automated vehicles (CAVs) in road intersections. For control purposes, we build upon a fully distributed model predictive control approach, in which the agents solve a nonconvex optimal control problem (OCP) locally and synchronously, and exchange their optimized trajectories via vehicle-to-vehicle (V2V) communication. To accommodate a fast solution of the nonconvex OCPs, we apply the penalty convex-concave procedure which aims to solve a convexified version of the original OCP. For experimental evaluation, we complement the predictive controller with a localization layer, being in charge of self-localization and the estimation of joint collision points with other agents. Moreover, we come up with a proprietary communication protocol to exchange trajectories with other agents. Experimental tests reveal the efficacy of proposed control system architecture.
In this paper, we propose a chance constrained stochastic model predictive control scheme for reference tracking of distributed linear time-invariant systems with additive stochastic uncertainty. The chance constraints are reformulated analytically based on mean-variance information, where we design suitable Probabilistic Reachable Sets for constraint tightening. Furthermore, the chance constraints are proven to be satisfied in closed-loop operation. The design of an invariant set for tracking complements the controller and ensures convergence to arbitrary admissible reference points, while a conditional initialization scheme provides the fundamental property of recursive feasibility. The paper closes with a numerical example, highlighting the convergence to changing output references and empirical constraint satisfaction.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
