Random walks for probabilistic robustness

Proceedings of the IEEE Conference on Decision and Control

Volumn 5, Issue , 2004, Pages 5316-5321

  Calafiore, Giuseppe ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTROL SYSTEM SYNTHESIS; MARKOV PROCESSES; MATRIX ALGEBRA; MONTE CARLO METHODS; PROBABILITY; ROBUSTNESS (CONTROL SYSTEMS); TRANSFER FUNCTIONS;

LINEAR MATRIX INEQUALITIES (LMI); PROBABILISTIC ROBUSTNESS; RANDOMIZED ALGORITHMS; ROBUST CONTROL ANALYSIS;

CONTROL SYSTEMS;

EID: 14544289650     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2004.1429653     Document Type: Conference Paper

References (21)

1. B.R. Barmish and C.M. Lagoa. The uniform distribution: A rigorous justification for its use in robustness analysis. Mathematics of Control, Signals, and Systems, 10:203-222, 1997.
2. V.D. Blondel and J.N. Tsitsiklis. A survey of computational complexity results in systems and control. Automarica, 36:1249-1274, 2000.
3. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan. Linear Matrix Inequalities in System and Control Theory, volume 15 of Studies in Applied Mathematics. SIAM, Philadelphia, PA, June 1994.
4. G. Calafiore and F. Dabbene. A probabilistic framework for problems with real structured uncertainty in systems and control. Automatica, 38(8): 1265-1276, 2002.
5. G. Calafiore and F. Dabbene. Control design with hard/soft performance specifications: a Q-parameter randomisation approach. Int. Journal of Control, 77(5):461 - 471, March 2004.
6. G. Calafiore, F. Dabbene, and R. Tempo. Randomized algorithms for probabilistic robustness with real and complex structured uncertainty. IEEE Trans. Aul. Control, 45(12):2218-2235, December 2000.
7. P.W. Glynn and D. Ormoneit. Hoeffding's inequality for uniformly ergodic Markov chains. Statistics and Probability Letters, 56(2): 143-146, January 2002.
8. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and combinatorics. Springer, Berlin, 1988.
9. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.
10. M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method: an approach to approximate counting and integration. In D.S.Hochbaum, editor, Approximation Algorithms for NP-hard Problems, pages 109-127. PWS Publishing, Boston, 1996.
11. 5) volume algorithms. Random Sir. and Alg., 11:1-50, 1997.
12. P.P. Khargonekar and A. Tikku. Randomized algorithms for robust control analysis have polynomial time complexity. In Proc. IEEE Conf. on Decision and Control, Kobe, Japan, December 1996.
13. C.M. Lagoa, M. Sznaier, and B.R. Barmish. An algorithm for generating transfer functions uniformly distributed over H∞ balls. In Proc. IEEE Conf. on Decision and Control, volume 5, pages 5038 -5043, December 2001.
14. L. Lovász. Hit-and-run mixes fast. Math. Programming, 86:443-461, 1999.
15. L. Lovász and M. Simonovits. Random walks in a convex body and an improved volume algorithm. Random Str. and Alg., 4:359-412, 1993.
16. S.P. Meyn and R.L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, New York, 1993.
17. L.R. Ray and R.F. Stengel. A Monte Carlo approach to the analysis of control system robustness. Automatica, 29:229-236, 1993.
18. R.L. Smith. Efficient Monte-Carlo procedures for generating points uniformly distributed over bounded regions. Operations Research, 32:1296-1308, 1984.
19. J.C. Spall. Estimation via Markov Chain Monte Carlo. IEEE Control Syst. Mag., 23:34-45, 2003.
20. R. Tempo, E.W. Bai, and F. Dabbene. Probabilistic robustness analysis: Explicit bounds for the minimum number of samples. Systems and Control Letters, 30:237-242, 1997.
21. M.J. Todd. Semidefinite optimization. Acta Numerica, 10:515-560, 2001.