Control and verification of high-dimensional systems with DSOS and SDSOS programming

In this paper, we consider linear programming (LP) and second order cone programming (SOCP) based alternatives to sum of squares (SOS) programming and apply this framework to high-dimensional problems arising in control applications. Despite the wide acceptance of SOS programming in the control and optimization communities, scalability has been a key challenge due to its reliance on semidefinite programming (SDP) as its main computational engine. While SDPs have many appealing features, current SDP solvers do not approach the scalability or numerical maturity of LP and SOCP solvers. Our approach is based on the recent work of Ahmadi and Majumdar [1], which replaces the positive semidefiniteness constraint inherent in the SOS approach with stronger conditions based on diagonal dominance and scaled diagonal dominance. This leads to the DSOS and SDSOS cones of polynomials, which can be optimized over using LP and SOCP respectively. We demonstrate this approach on four high dimensional control problems that are currently well beyond the reach of SOS programming: computing a region of attraction for a 22 dimensional system, analysis of a 50 node network of oscillators, searching for degree 3 controllers and degree 8 Lyapunov functions for an Acrobot system (with the resulting controller validated on a hardware platform), and a balancing controller for a 30 state and 14 control input model of the ATLAS humanoid robot. While there is additional conservatism introduced by our approach, extensive numerical experiments on smaller instances of our problems demonstrate that this conservatism can be small compared to SOS programming.

[1]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[2]  Anil V. Rao,et al.  Practical Methods for Optimal Control Using Nonlinear Programming , 1987 .

[3]  Lennart Ljung,et al.  System identification toolbox for use with MATLAB , 1988 .

[4]  Mark W. Spong,et al.  The swing up control problem for the Acrobot , 1995 .

[5]  Olga Taussky-Todd.  SOME CONCRETE ASPECTS OF HILBERT'S 17TH PROBLEM , 1996 .

[6]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[7]  Donald Goldfarb,et al.  Second-order cone programming , 2003, Math. Program..

[8]  Ryan Feeley,et al.  Some controls applications of sum of squares programming , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[9]  Ali Jadbabaie,et al.  Safety Verification of Hybrid Systems Using Barrier Certificates , 2004, HSCC.

[10]  P. Parrilo.  Exploiting Algebraic Structure in Sum of Squares Programs , 2005 .

[11]  Ojas D. Parekh,et al.  On Factor Width and Symmetric H-matrices , 2005 .

[12]  Bogdan Dumitrescu,et al.  Interior-Point Algorithms for Sum-Of-Squares Optimization of Multidimensional Trigonometric Polynomials , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[13]  Ufuk Topcu,et al.  Local stability analysis using simulations and sum-of-squares programming , 2008, Autom..

[14]  D. Henrion,et al.  Guest Editorial: Special Issue on Positive Polynomials in Control , 2009 .

[15]  M. Jünger,et al.  50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art , 2010 .

[16]  A. Papachristodoulou,et al.  A network decomposition approach for efficient sum of squares programming based analysis , 2010, Proceedings of the 2010 American Control Conference.

[17]  Antonis Papachristodoulou,et al.  Dynamical system decomposition for efficient, sparse analysis , 2010, 49th IEEE Conference on Decision and Control (CDC).

[18]  Amir Ali Ahmadi.  Algebraic relaxations and hardness results in polynomial optimization and Lyapunov analysis , 2012, ArXiv.

[19]  Matthew M. Peet,et al.  Reducing the Complexity of the Sum-of-Squares Test for Stability of Delayed Linear Systems , 2011, IEEE Transactions on Automatic Control.

[20]  Mehdi Ghasemi,et al.  Lower Bounds for Polynomials Using Geometric Programming , 2012, SIAM J. Optim..

[21]  Amir Ali Ahmadi,et al.  Control design along trajectories with sums of squares programming , 2012, 2013 IEEE International Conference on Robotics and Automation.

[22]  Matthew M. Peet,et al.  Solving Large-Scale Robust Stability Problems by Exploiting the Parallel Structure of Polya's Theorem , 2014, IEEE Transactions on Automatic Control.

[23]  Amir Ali Ahmadi,et al.  Complexity of ten decision problems in continuous time dynamical systems , 2012, 2013 American Control Conference.

[24]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[25]  Didier Henrion,et al.  Convex Computation of the Region of Attraction of Polynomial Control Systems , 2012, IEEE Transactions on Automatic Control.