A Sums-of-Squares Extension of Policy Iterations (original) (raw)
Related papers
On Optimal Quadratic Regulation for Discrete-Time Switched Linear Systems
2008
This paper studies the discrete-time linear quadratic regulation problem for switched linear systems (DLQRS) based on dynamic programming approach. The unique contribution of this paper is the analytical characterizations of both the value function and the optimal control strategies for the DLQRS problem. Based on the particular structures of these analytical expressions, an efficient algorithm suitable for solving an arbitrary DLQRS problem is proposed. Simulation results indicate that the proposed algorithm can solve randomly generated DLQRS problems with very low computational complexity. The theoretical analysis in this paper can significantly simplify the computation of the optimal strategy, making an NP hard problem numerically tractable.
Guaranteed cost controller synthesis for switched systems defined on semi-algebraic sets
Nonlinear Analysis: Hybrid Systems, 2014
A methodology to design guaranteed cost H ∞ controllers for a class of switched systems with polynomial vector fields is proposed. To this end, we use sum of squares programming techniques. In addition, instead of the customary Carathéodory solutions, the analysis is performed in the framework of Filippov solutions which subsumes solutions with infinite switching in finite time and sliding modes. Firstly, conditions assuring asymptotic stability of Filippov solutions pertained to a switched system defined on semi-algebraic sets are formulated. Accordingly, we derive a set of sum of squares feasibility tests leading to a stabilizing switching controller. Finally, we propose a scheme to synthesize stabilizing switching controllers with a guaranteed cost H ∞ disturbance attenuation performance. The applicability of the proposed methods is elucidated thorough simulation analysis.
Robust Control of Switched Linear Systems via Min of Quadratics
In this paper, we investigate the robust switching control problem for switched linear systems by using a class composite quadratic function, the min (of quadratics) function, to improve performance and enhance control design flexibility. The robustness is reflected in two prospectives including the H ∞ performance and arbitrary switching of subsystems. A hysteresis minswitching strategy will be employed to orchestrate the switching among a collection of controllers. The synthesis conditions for both state feedback and output feedback control problems are derived in terms of a set of linear matrix inequalities (LMIs) with linear search over scalar variables. The proposed min function based approach combines the existing single Lyapunov function based method and multiple Lyapunov function based method into a general framework, and the derived LMI conditions cover the existing LMI conditions as special cases. Numerical studies are included to demonstrate the advantages of the proposed control design approach.
A generalization of a polynomial optimal control of switched systems
A generalization of a polynomial approach to solve the optimal control problem of nonlinear switched systems is presented. We present a technique to deal with the more general non-polynomial switched systems, using the polynomial approach previously presented, combined with a recasting process. It is shown that the representation of the original switched problem into a continuous polynomial system allows us to use the generalized Maximum Principle. With this method and from a theoretical point of view, we provide necessary and sufficient conditions for the existence of minimizer by using particular features of its relaxed, convex formulation using the theory of moments.
SIAM Journal on Control and Optimization, 2013
Though switched dynamical systems have shown great utility in modeling a variety of physical phenomena, the construction of an optimal control of such systems has proven difficult since it demands some type of optimal mode scheduling. In this paper, we devise an algorithm for the computation of an optimal control of constrained nonlinear switched dynamical systems. The control parameter for such systems include a continuous-valued input and discrete-valued input, where the latter corresponds to the mode of the switched system that is active at a particular instance in time. Our approach, which we prove converges to local minimizers of the constrained optimal control problem, first relaxes the discrete-valued input, then performs traditional optimal control, and then projects the constructed relaxed discrete-valued input back to a pure discrete-valued input by employing an extension to the classical Chattering Lemma that we prove. We extend this algorithm by formulating a computationally implementable algorithm which works by discretizing the time interval over which the switched dynamical system is defined. Importantly, we prove that this implementable algorithm constructs a sequence of points by recursive application that converge to the local minimizers of the original constrained optimal control problem. Four simulation experiments are included to validate the theoretical developments.
A polynomial approach for stability analysis of switched systems
Systems & Control Letters, 2010
A polynomial approach to deal with the stability analysis of switched non-linear systems under arbitrary switching using dissipation inequalities is presented. It is shown that a representation of the original switched problem into a continuous polynomial system allows us to use dissipation inequalities for the stability analysis of polynomial systems. With this method and from a theoretical point of view, we provide an alternative way to search for a common Lyapunov function for switched non-linear systems.
A polynomial approach for optimal control of switched nonlinear systems
International Journal of Robust and Nonlinear Control, 2013
Optimal control problems for switched nonlinear systems are investigated. We propose an alternative approach for solving the optimal control problem for a nonlinear switched system based on the theory of moments. The essence of this method is the transformation of a nonlinear, nonconvex optimal control problem, that is, the switched system, into an equivalent optimal control problem with linear and convex structure, which allows us to obtain an equivalent convex formulation more appropriate to be solved by high-performance numerical computing. Consequently, we propose to convexify the control variables by means of the method of moments obtaining semidefinite programs.
52nd IEEE Conference on Decision and Control, 2013
We introduce the concept of sos-convex Lyapunov functions for stability analysis of discrete time switched systems. These are polynomial Lyapunov functions that have an algebraic certificate of convexity, and can be efficiently found by semidefinite programming. We show that convex polynomial Lyapunov functions are universal (i.e., necessary and sufficient) for stability analysis of switched linear systems. On the other hand, we show via an explicit example that the minimum degree of an sos-convex Lyapunov function can be arbitrarily higher than a (non-convex) polynomial Lyapunov function. (The proof is omitted.) In the second part, we show that if the switched system is defined as the convex hull of a finite number of nonlinear functions, then existence of a non-convex common Lyapunov function is not a sufficient condition for switched stability, but existence of a convex common Lyapunov function is. This shows the usefulness of the computational machinery of sos-convex Lyapunov functions which can be applied either directly to the switched nonlinear system, or to its linearization, to provide proof of local switched stability for the nonlinear system. An example is given where no polynomial of degree less than 14 can provide an estimate to the region of attraction under arbitrary switching.
Inner-approximating Reach-avoid Sets for Discrete-time Polynomial Systems
2020 59th IEEE Conference on Decision and Control (CDC), 2020
In this paper we propose a computational method based on semi-definite programming for synthesizing infinitetime reach-avoid sets in discrete-time polynomial systems. An infinite-time reach-avoid set is a set of initial states making the system eventually, i.e., within finite time enter the target set while remaining inside another specified (safe) set during each time step preceding the target hit. The reach-avoid set is first characterized equivalently as a strictly positive sublevel of a bounded value function, which in turn is shown to be a solution to a system of derived equations. The derived equations are further relaxed into a system of inequalities, which is encoded into semi-definite constraints based on the sum-of-squares decomposition for multivariate polynomials, such that the problem of synthesizing inner-approximations of the reach-avoid set can be addressed via solving a semidefinite programming problem. Two examples demonstrate the proposed approach.