Efficient suboptimal solutions of switched LQR problems

This paper studies the discrete-time switched LQR (DSLQR) problem using a dynamic programming approach. Efficient algorithms are proposed to solve both the finite-horizon and the infinite-horizon suboptimal DSLQR problems. More importantly, we establish analytical conditions under which the strategies generated by the algorithms are stabilizing and suboptimal. These conditions are derived explicitly in terms of subsystem matrices and are thus easy to verify. The proposed algorithms and the analysis provide a systematical way of solving the DSLQR problem with guaranteed closed-loop stability and suboptimal performance. Simulation results indicate that the proposed algorithms can efficiently solve not only specific but also randomly generated DSLQR problems, making NP-hard problems numerically tractable.

[1]  E. Yaz.  Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[2]  Bo Lincoln,et al.  Relaxing dynamic programming , 2006, IEEE Transactions on Automatic Control.

[3]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[4]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[5]  A. Rantzer,et al.  Piecewise linear quadratic optimal control , 1997, Proceedings of the 1997 American Control Conference (Cat. No.97CH36041).

[6]  William Holderbaum,et al.  Optimal Control of Hybrid Systems , 2005 .

[7]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[8]  Alberto Bemporad,et al.  Synthesis of state-feedback optimal controllers for continuous-time switched linear systems , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[9]  A. Rantzer,et al.  Optimal control of hybrid systems , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[10]  Christos G. Cassandras,et al.  Optimal control of a class of hybrid systems , 2001, IEEE Trans. Autom. Control..

[11]  Alberto Bemporad,et al.  Optimal control of continuous-time switched affine systems , 2006, IEEE Transactions on Automatic Control.

[12]  J. W. Nieuwenhuis,et al.  Boekbespreking van D.P. Bertsekas (ed.), Dynamic programming and optimal control - volume 2 , 1999 .

[13]  Jianghai Hu,et al.  On the value functions of the optimal quadratic regulation problem for discrete-time switched linear systems , 2008, 2008 47th IEEE Conference on Decision and Control.

[14]  Y. Wardi,et al.  Optimal control of switching times in switched dynamical systems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[15]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Vol. II , 1976 .

[16]  Anders Rantzer,et al.  Convex dynamic programming for hybrid systems , 2002, IEEE Trans. Autom. Control..

[17]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[18]  Jianghai Hu,et al.  Dynamic buffer management using optimal control of hybrid systems , 2008, Autom..

[19]  Jianghai Hu,et al.  Optimal quadratic regulation for discrete-time switched linear systems: A numerical approach , 2008, 2008 American Control Conference.

[20]  Panos J. Antsaklis,et al.  Optimal control of switched systems based on parameterization of the switching instants , 2004, IEEE Transactions on Automatic Control.

[21]  Jianghai Hu,et al.  On Optimal Quadratic Regulation for Discrete-Time Switched Linear Systems , 2008, HSCC.

[22]  Alberto Bemporad,et al.  Dynamic programming for constrained optimal control of discrete-time linear hybrid systems , 2005, Autom..

[23]  Magnus Egerstedt,et al.  Transition-time optimization for switched-mode dynamical systems , 2006, IEEE Transactions on Automatic Control.