Random walks for probabilistic robustness

In this paper, we explore the use of Markov chain sampling techniques for applications in probabilistic robustness of control systems. First, we analyze the general hit-and-run (HR) method for uniform sampling in convex bodies, and discuss several key issues related to the so called mixing rate of this process and to Hoeffding-type inequalities for dependent samples. Then, we apply the HR method for uniform sampling in the interior of a generic LMI feasible set. Two specific applications of this latter problem which are relevant in probabilistic robust control are studied: the uniform generation of stable transfer functions bounded in the H/sub /spl infin// norm, and uniform sampling in matrix spectral (maximum singular value) norm balls.

[1]  Fabrizio Dabbene,et al.  Control design with hard/soft performance specifications: a Q-parameter randomization approach , 2004 .

[2]  Giuseppe Carlo Calafiore,et al.  A probabilistic framework for problems with real structured uncertainty in systems and control , 2002, Autom..

[3]  James C. Spall,et al.  Estimation via Markov chain Monte Carlo , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[4]  P. Glynn,et al.  Hoeffding's inequality for uniformly ergodic Markov chains , 2002 .

[5]  B. Barmish,et al.  An algorithm for generating transfer functions uniformly distributed over H/sub /spl infin// balls , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[6]  Giuseppe Carlo Calafiore,et al.  Randomized algorithms for probabilistic robustness with real and complex structured uncertainty , 2000, IEEE Trans. Autom. Control..

[7]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[8]  László Lovász,et al.  Hit-and-run mixes fast , 1999, Math. Program..

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

[10]  M. Simonovits,et al.  Random walks and an O * ( n 5 ) volume algorithm for convex bodies , 1997 .

[11]  B. Ross Barmish,et al.  The uniform distribution: A rigorous justification for its use in robustness analysis , 1996, Math. Control. Signals Syst..

[12]  R. Tempo,et al.  Probabilistic robustness analysis: explicit bounds for the minimum number of samples , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[13]  Pramod P. Khargonekar,et al.  Randomized algorithms for robust control analysis and synthesis have polynomial complexity , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[14]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

[15]  Robert F. Stengel,et al.  A monte carlo approach to the analysis of control system robustness , 1993, Autom..

[16]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[17]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1988, Algorithms and Combinatorics.

[18]  Robert L. Smith,et al.  Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions , 1984, Oper. Res..

[19]  W. Hoeffding.  Probability inequalities for sum of bounded random variables , 1963 .