9,109 research outputs found
Extremum Seeking-based Iterative Learning Linear MPC
In this work we study the problem of adaptive MPC for linear time-invariant
uncertain models. We assume linear models with parametric uncertainties, and
propose an iterative multi-variable extremum seeking (MES)-based learning MPC
algorithm to learn on-line the uncertain parameters and update the MPC model.
We show the effectiveness of this algorithm on a DC servo motor control
example.Comment: To appear at the IEEE MSC 201
Robust Adaptive Control Barrier Functions: An Adaptive & Data-Driven Approach to Safety (Extended Version)
A new framework is developed for control of constrained nonlinear systems
with structured parametric uncertainties. Forward invariance of a safe set is
achieved through online parameter adaptation and data-driven model estimation.
The new adaptive data-driven safety paradigm is merged with a recent adaptive
control algorithm for systems nominally contracting in closed-loop. This
unification is more general than other safety controllers as closed-loop
contraction does not require the system be invertible or in a particular form.
Additionally, the approach is less expensive than nonlinear model predictive
control as it does not require a full desired trajectory, but rather only a
desired terminal state. The approach is illustrated on the pitch dynamics of an
aircraft with uncertain nonlinear aerodynamics.Comment: Added aCBF non-Lipschitz example and discussion on approach
implementatio
Min-Max MPC based on a computationally efficient upper bound of the worst case cost
Min-Max MPC (MMMPC) controllers [P.J. Campo, M. Morari, Robust model predictive control, in: Proc. American Control Conference, June 10–12, 1987, pp. 1021–1026] suffer from a great computational burden which limits their applicability in the industry. Sometimes upper bounds of the worst possible case of a performance index have been used to reduce the computational burden. This paper proposes a computationally efficient MMMPC control strategy in which the worst case cost is approximated by an upper bound based on a diagonalization scheme. The upper bound can be computed with O(n3) operations and using only simple matrix operations. This implies that the algorithm can be coded easily even in non-mathematical oriented programming languages such as those found in industrial embedded control hardware. A simulation example is given in the paper
A review of convex approaches for control, observation and safety of linear parameter varying and Takagi-Sugeno systems
This paper provides a review about the concept of convex systems based on Takagi-Sugeno, linear parameter varying (LPV) and quasi-LPV modeling. These paradigms are capable of hiding the nonlinearities by means of an equivalent description which uses a set of linear models interpolated by appropriately defined weighing functions. Convex systems have become very popular since they allow applying extended linear techniques based on linear matrix inequalities (LMIs) to complex nonlinear systems. This survey aims at providing the reader with a significant overview of the existing LMI-based techniques for convex systems in the fields of control, observation and safety. Firstly, a detailed review of stability, feedback, tracking and model predictive control (MPC) convex controllers is considered. Secondly, the problem of state estimation is addressed through the design of proportional, proportional-integral, unknown input and descriptor observers. Finally, safety of convex systems is discussed by describing popular techniques for fault diagnosis and fault tolerant control (FTC).Peer ReviewedPostprint (published version
Concurrent Learning Adaptive Model Predictive Control with Pseudospectral Implementation
This paper presents a control architecture in which a direct adaptive control
technique is used within the model predictive control framework, using the
concurrent learning based approach, to compensate for model uncertainties. At
each time step, the control sequences and the parameter estimates are both used
as the optimization arguments, thereby undermining the need for switching
between the learning phase and the control phase, as is the case with
hybrid-direct-indirect control architectures. The state derivatives are
approximated using pseudospectral methods, which are vastly used for numerical
optimal control problems. Theoretical results and numerical simulation examples
are used to establish the effectiveness of the architecture.Comment: 21 pages, 13 figure
- …