Quotient-method Algorithms for Input-affine Single-input Nonlinear Systems

Willson Sudarsandhari Shibani
EPFL, 2012
EPFL thesis

Abstract

Many real-world systems are intrinsically nonlinear. This thesis proposes various algorithms for designing control laws for input-affine single-input nonlinear systems. These algorithms, which are based on the concept of quotients used in nonlinear control design, can break down a single-input system into cascade of smaller subsystems of reduced dimension. These subsystems are well defined for feedback-linearizable systems. However, approximations are required to handle non-feedback-linearizable systems. The method proceeds iteratively and consists of two stages. During the forward stage, an equivalence relationship is defined to isolate the states that are not directly affected by the input, which reduces the dimension of the system. The resulting system is an input-affine single-input system controlled by a pseudo-input which represents a degree of freedom in the algorithm. The pseudo-input is a complementary state required to complete the diffeomorphism. This procedure is repeated (n − 1) times to give a one-dimensional system, where n is the dimension of the system. The backward stage begins with the one-dimensional system obtained at the end of the forward stage. It iteratively builds the control law required to stabilize the system. At every iteration, a desired profile of the pseudo-input is computed. In this next iteration, this desired profile is used to define an error that is driven asymptotically to zero using an appropriate control law. The quotient method is implemented through two algorithms, with and without diffeomorphism. The algorithm with diffeomorphism clearly depicts the dimension reduction at every iteration and provides a clear insight into the method. In this algorithm, a diffeomorphism is synthesized in order to obtain the normal form of the input vector field. The pseudo-input is the last coordinate of the new coordinate system. A normal projection is used to reduce the dimension of the system. For the algorithm to proceed without any approximation, it is essential that the last coordinate appears linearly in the projection of the transformed drift vector field. Necessary and sufficient conditions to achieve linearity in the last coordinate are given. Having the pseudo-input appearing linearly enables to represent the projected system as an input-affine system. Hence, the whole procedure can be repeated (n−1) times so as to obtain a one-dimensional system. In the second algorithm, a projection function based on the input vector field is defined that imitates both operators, the push forward operater and the normal projection operator of the previous algorithm. Due to the lack of an actual diffeomorphism, there is no apparent dimension reduction. Moreover, it is not directly possible to separate the drift vector field from the input vector field in the projected system. To overcome this obstacle, a bracket is defined that commutes with the projection function. This bracket provides the input vector field of the projected system. This enables the algorithm to proceed by repeating this procedure (n−1) times. As compared with the algorithm with diffeomorphism, the computational effort is reduced. The mathematical tools required to implement this algorithm are presented. A nice feature of these algorithms is the possibility to use the degrees of freedom to overcome singularities. This characteristic is demonstrated through a field-controlled DC motor. Furthermore, the algorithm also provides a way of approximating a non-feedback-linearizable system by a feedback-linearizable one. This has been demonstrated in the cases of the inverted pendulum and the acrobot. On the other hand, the algorithm without diffeomorphism has been demonstrated on the ball-on-a-wheel system. The quotient method can also be implemented whenever a simulation platform is available, that is when the differential equations for the system are not available in standard form. This is accomplished numerically by computing the required diffeomorphism based on the data available from the simulation platform. Two versions of the numerical algorithm are presented. One version leads to faster computations but uses approximation at various steps. The second version has better accuracy but requires considerably more computational time.

Official source

https://infoscience.epfl.ch/record/182627?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts

Related publications

Willson Sudarsandhari Shibani
EPFL, 2012
EPFL thesis

Abstract

Official source

https://infoscience.epfl.ch/record/182627?ln=en

About this result

Related concepts (9)

Related concepts

Related publications (9)

Related publications

Predictive Control of Fast Unstable and Nonminimum-phase Nonlinear Systems

Dominique Bonvin, Kahina Guemghar, Philippe Müllhaupt

Predictive Control of Unstable Nonminimum-phase Systems K. Guemghar, B. Srinivasan, Ph. Mullhaupt, D. Bonvin ´ Institut d’Automatique, Ecole Polytechnique F´d´rale de Lausanne, ee CH-1015 Lausanne, Switzerland. Predictive control is a very eﬀective approach for tackling problems with constraints and nonlinear dynamics, especially when the analytical computation of the control law is diﬃcult. Standard predictive control involves predicting the system behavior over a prediction horizon and calculating the input that minimizes a criterion expressing the system behavior in the future. Only the ﬁrst part of the computed input is applied to the system, and this procedure is repeated with the advent of each new measurement. This methodology is widely used in the process industry where system dynamics are sufﬁciently slow to permit its implementation. In contrast, applications of predictive control to fast unstable dynamic systems are rather limited. Apart from computational considerations, a fundamental limitation arises from the accuracy of that prediction, which can be quite poor due to accumulation of numerical errors if the prediction horizon is large. In this paper, an upper bound on the prediction horizon based on the location of the unstable pole(s) of the linearized system will be provided. The problem becomes more acute when nonminimum-phase systems are considered. Nonminimum phase implies that the system starts in a direction opposite to its reference (inverse response). To control such systems, it is reasonable to predict the maneuvers, thus making predictive control a natural strategy. However, a large prediction horizon is required since it is necessary to look beyond the inverse response. In this context, a lower bound on the prediction horizon based on the location of the unstable zero(s) of the linearized system will be provided. The two bounds mentioned above may lead to the situation where there exist no value of the prediction horizon that can stabilize a given unstable nonmiminum-phase system. For such a case, a combination of tools from diﬀerential geometry and predictive control is proposed in this paper. The envisaged procedure has a cascade structure and is outlined below: 1. Using the input-output linearization technique, the nonlinear system is transformed into a linear subsystem and internal dynamics. However, since the original nonlinear system is nonminimum-phase, the internal dynamics are unstable. 2. The linear subsystem is made arbitrarily fast by using a stabilizing high-gain linear feedback (inner-loop). 3. A predictive control scheme is then used to stabilize the slow internal dynamics (outerloop) by manipulating the reference of the inner loop. The stability of the proposed procedure is analyzed using a singular perturbation approach. The results will be illustrated in simulation on a system consisting of an inverted pendulum on a cart. 1

2002

In Control System Theory, the study of continuous-time, finite dimensional, underdetermined systems of ordinary differential equations is an important topic. Classification of systems in different categories is a natural initial step to the analysis of a given control problem. Systems of equations can often be “transformed” into other “equivalent” ones. Then, a control system is associated to a set of equivalent equations. In this setting, a property of a control system can be defined as a property that has to be satisfied by some arbitrary system of equations in the set representing the control system. Assessing such a property can be a difficult task. In this thesis, we review and study a number of ways to determine whether a multi-input nonlinear system is flat, i.e. whether it is equivalent to a linear system after some dynamical extension and change of coordinates. This is a difficult as well as a well studied problem. Therefore, coming up with some altogether new approach or solution is to a certain extent illusory. A substantial part of the text is devoted to describing existing approaches and sometimes to propose either an original alternative or an original point of view. Another part of the thesis is dedicated to the study of a drastically reduced version of the problem, where more can be said in an algorithmic way. Nonlinear control systems are first modeled as the embedding of some fibered bundle to the first jet of the time-and-state-variables manifold. The exterior system, or Pfaffian system, corresponding to the ODE then arises naturally. Input prolongations are then introduced as lifts of the previously mentioned embedding. Various filtration techniques and their applications to static feedback linearization are discussed next. A full chapter is devoted to the infinite dimensional approach involving matrix differential operators. A now classical theorem, linking integrability of the basis of a differential module after application of one such an operator, and the flatness property is discussed. The relations obtained can be decomposed in an equivalent set of differentially closed equations. We state a version of the resulting theorem where the “curvature equations” are trivial. A subproblem that has attracted the attention of researchers is the question whether a given system — subject to some state constraints — is flat. In this setting, useful concepts are that of a covering of a system by another one and the accompanying result stating that a flat system can cover only a flat system. Hence, if a “large” linear system is given together with a set of nonlinear constraints, flatness of the constrained system is assessed if the unconstrained system can be shown to cover the constrained one. Starting with the classical notion of controlled invariance and a generalized notion coined dynamic controlled invariance, sufficient conditions are discussed which also involve the notion of right invertibility and the dynamic extension algorithm. Modeling of mechanical systems by free moving point masses subject to some control forces and quadratic constraints is often effective. The resulting unconstrained equations are linear and bilinear in the state and control/Lagrangian multiplier variables. We propose a relative derived flag that leads to a filtration with guaranteed integrability at each stage. This leads to a very effective sufficient condition for the flatness of the unconstrained model. The algorithm, together with the test described in the previous section, is used to show flatness of some generalized pendulum-like equations. They are also shown to specialize to the non-holonomic car equations and to the VTOL/pendulum equations when some specific parameters are suitably chosen.

EPFL2013

Robust control of constrained systems given an information structure

Luca Furieri

We study finite horizon optimal control where the controller is subject to sensor-information constraints, that is, each input has access to a fixed subset of states at all times. In particular, we consider linear systems affected by exogenous disturbances with state and input constraints. We establish the class of sensor-information structures that allows for the formulation of this optimization problem as a convex program. In the literature, Quadratic Invariance (QI) is a well-established result that is applicable to the infinite horizon unconstrained case. We show that, despite state and inputs constraints being enforced, QI results can be naturally adapted to our problem. To this end, we highlight and exploit the connection between Youla parametrization and disturbance-feedback policies. Additionally, we provide graph-theoretic visual insight which is consistent with Partially Nested (PN) interpretations.

IEEE2017

EPFL2013

Predictive Control of Fast Unstable and Nonminimum-phase Nonlinear Systems

Dominique Bonvin, Kahina Guemghar, Philippe Müllhaupt

2002