Towards Efficient Maximum Likelihood Estimation of LPV-SS Models

How to efficiently identify multiple-input multiple-output (MIMO) linear parameter-varying (LPV) discrete-time state-space (SS) models with affine dependence on the scheduling variable still remains an open question, as identification methods proposed in the literature suffer heavily from the curse of dimensionality and/or depend on over-restrictive approximations of the measured signal behaviors. However, obtaining an SS model of the targeted system is crucial for many LPV control synthesis methods, as these synthesis tools are almost exclusively formulated for the aforementioned representation of the system dynamics. Therefore, in this paper, we tackle the problem by combining state-of-the-art LPV input-output (IO) identification methods with an LPV-IO to LPV-SS realization scheme and a maximum likelihood refinement step. The resulting modular LPV-SS identification approach achieves statical efficiency with a relatively low computational load. The method contains the following three steps: 1) estimation of the Markov coefficient sequence of the underlying system using correlation analysis or Bayesian impulse response estimation, then 2) LPV-SS realization of the estimated coefficients by using a basis reduced Ho-Kalman method, and 3) refinement of the LPV-SS model estimate from a maximum-likelihood point of view by a gradient-based or an expectation-maximization optimization methodology. The effectiveness of the full identification scheme is demonstrated by a Monte Carlo study where our proposed method is compared to existing schemes for identifying a MIMO LPV system

Moment Matching Based Model Reduction for LPV State-Space Models

We present a novel algorithm for reducing the state dimension, i.e. order, of linear parameter varying (LPV) discrete-time state-space (SS) models with affine dependence on the scheduling variable. The input-output behavior of the reduced order model approximates that of the original model. In fact, for input and scheduling sequences of a certain length, the input-output behaviors of the reduced and original model coincide. The proposed method can also be interpreted as a reachability and observability reduction (minimization) procedure for LPV-SS representations with affine dependence

Realization Theory for LPV State-Space Representations with Affine Dependence

In this paper we present a Kalman-style realization theory for linear parameter-varying state-space representations whose matrices depend on the scheduling variables in an affine way (abbreviated as LPV-SSA representations). We deal both with the discrete-time and the continuous-time cases. We show that such a LPV-SSA representation is a minimal (in the sense of having the least number of state-variables) representation of its input-output function, if and only if it is observable and span-reachable. We show that any two minimal LPV-SSA representations of the same input-output function are related by a linear isomorphism, and the isomorphism does not depend on the scheduling variable.We show that an input-output function can be represented by a LPV-SSA representation if and only if the Hankel-matrix of the input-output function has a finite rank. In fact, the rank of the Hankel-matrix gives the dimension of a minimal LPV-SSA representation. Moreover, we can formulate a counterpart of partial realization theory for LPV-SSA representation and prove correctness of the Kalman-Ho algorithm. These results thus represent the basis of systems theory for LPV-SSA representation.Comment: The main difference with respect to the previous version is as follows: typos have been fixe

Robust nonlinear control of vectored thrust aircraft

An interdisciplinary program in robust control for nonlinear systems with applications to a variety of engineering problems is outlined. Major emphasis will be placed on flight control, with both experimental and analytical studies. This program builds on recent new results in control theory for stability, stabilization, robust stability, robust performance, synthesis, and model reduction in a unified framework using Linear Fractional Transformations (LFT's), Linear Matrix Inequalities (LMI's), and the structured singular value micron. Most of these new advances have been accomplished by the Caltech controls group independently or in collaboration with researchers in other institutions. These recent results offer a new and remarkably unified framework for all aspects of robust control, but what is particularly important for this program is that they also have important implications for system identification and control of nonlinear systems. This combines well with Caltech's expertise in nonlinear control theory, both in geometric methods and methods for systems with constraints and saturations

Control of Flexible Manipulator Robots Based on Dynamic Confined Space of Velocities: Dynamic Programming Approach

Linear Parameter Varying models-based Model Predictive Control (LPV-MPC) has stood out in manipulator robots because it presents well-rejection to dynamic uncertainties in flexible joints. However, it has become too weak when the MPC's optimization problem does not include kinematic constraints-based conditions. This paper uses dynamic confined space of velocities (DCSV) to include these conditions as a recursive polytopic constraint, guaranteeing optimal dependency on a simplex scheduling parameter. To this end, the local frame's velocities and torque/force preload of joints (related to violation of kinematic constraints) are associated with different time scale dynamics such that DCSV correlates them as a polytope. So, a classical LPV-MPC will be updated using a dynamic programming approach according to the DCSV-based polytope. As a result, one lemma about DCSV-based recursive polytope and a five-step procedure for two decoupled close-loop schemes with different time scales compose the LPV-MPC proposed method. Numerical validation shows that even for relevant flexibility situations, trajectory tracking performance is improved by tuning finite horizons and optimization problem constraints regarding DCSV's behavior

LPV methods for fault-tolerant vehicle dynamic control

International audienceThis paper aims at presenting the interest of the Linear Parameter Varying methods for vehicle dynamics control, in particular when some actuators may be in failure. The cases of the semi-active suspension control problem and the yaw control using braking, steering and suspension actuators will be presented. In the first part, we will consider the semi-active suspension control problem, where some sensors or actuator (damper leakage) faults are considered. From a quarter-car vehicle model including a non linear semi-active damper model, an LPV model will be described, accounting for some actuator fault represented as some varying parameters. A single LPV fault-tolerant control approach is then developed to manage the system performances and constraints. In the second part the synthesis of a robust gain-scheduled H1 MIMO vehicle dynamic stability controller (VDSC), involving front steering, rear braking, and four active suspension actuators, is proposed to improve the yaw stability and lateral performances. An original LPV method for actuator coordination is proposed, when the actuator limitations and eventually failures, are taken into account. Some simulations on a complex full vehicle model (which has been validated on a real car), subject to critical driving situations (in particular a loss of some actuator), show the efficiency and robustness of the proposed solution