Probabilistic search algorithms for robust stability analysis and their complexity properties

  • Pramod P. Khargonekar
  • Ashok Tikku
Part A Learning And Computational Issues
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 241)


In this paper, we consider several robust control analysis and design problems. As has become well known over the last few years, most of these problems are NP hard. We show that if instead of worst-case guaranteed conclusions, one is willing to draw conclusions with a high degree of confidence, then the computational complexity decreases dramatically.


Robust Control Robust Stability Continuous Random Variable Order Controller Ordinal Optimization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. Balas, J.C. Doyle, K. Glover, A. Packard, and R. Smith, μ-Analysis and Synthesis Toolbox User's Guide, MUSYN Inc., 1994.Google Scholar
  2. [2]
    B. R. Barmish and C.M. Lagoa, “The uniform distribution: a rigorous justification for its use in robustness analysis,” Technical Report ECE-95-12, Dept. of ECE, Univ. of Wisconsin-Madison, 1995.Google Scholar
  3. [3]
    R. Braatz, P. Young, J. Doyle, and M. Morari, “Computational complexity of μ calculation,” Proc. of the Automatic Control Conference, pp: 1682–1683, San Francisco, 1993.Google Scholar
  4. [4]
    M. Deng and Y.-C. Ho, “Sampling-selection method for stochastic optimization problems,” Preprint, Harvard University, 1995.Google Scholar
  5. [5]
    J. C. Doyle, B. A. Francis, and A. R. Tannenbaum, Feedback Control Theory, Macmillan Publishing Company, New York, 1992.Google Scholar
  6. [6]
    M. K. H. Fan, A. L. Tits, and J. C. Doyle, “Robustness in the presence of joint parametric uncertainty and unmodeled dynamics,” Proc. of the American Control Conference, pp. 1195–1200, 1988.Google Scholar
  7. [7]
    W. Feller, An Introduction to Probability Theory and its Applications, Volume 2, Wiley & Sons, New York, 1965.Google Scholar
  8. [8]
    J. Friedman, P. Kabamba, and P. Khargonekar, “Worst-case and average H 2 performance analysis against real constant parametric uncertainty,” Automatica, vol. 31, pp 649–657, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    M. Fu and B. R. Barmish, “Maximal unidirectional perturbation bounds for stability of polynomials and matrices,” Systems & Control Letters, 11 (1988) pp 173–179.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Co., Reading, Mass., 1989.zbMATHGoogle Scholar
  11. [11]
    S. Hall, D. MacMartin, and D. Bernstein, “Covariance averaging in the analysis of uncertain systems,” IEEE Trans. Auto. Contr., vol. 38, pp 1858–1862, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    Y.-C. Ho, “Heuristics, rules of thumb, and the 80/20 proposition,” IEEE Trans. Auto. Contr., vol. 39, pp. 1025–1027, 1994.CrossRefGoogle Scholar
  13. [13]
    W. Hoeffding, “Probability inequalities for sums of bounded random variables,” Amer. Stat. Assoc. J., pp. 13–30, 1963.Google Scholar
  14. [14]
    V. L. Kharitonov, “Asymptotic stability of an equilibrium position of a family of systems of linear differential equations,” Differencial'nye Uravnenija 14 (11) (1978) pp. 2086–2088.zbMATHMathSciNetGoogle Scholar
  15. [15]
    T.W.E. Lau and Y.-C. Ho, “Universal alignment probabilities and subset selection for ordinal optimization,” Preprint, Harvard University, 1996.Google Scholar
  16. [16]
    L. Lovasz and M. Simonovits, “Random walks in a convex body and an improved volume algorithm,” Random Structures and Algorithms, vol. 4, pp. 359–412, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  17. [17]
    MATH WORKS. MATLAB Reference Guide. The MATH WORKS, Inc., 1992.Google Scholar
  18. [18]
    C. Marrison and R. Stengel, “The use of random search and genetic algorithms to optimize stochastic robustness functions,” Proc. of the American Control Conference, pp. 1484–1489, Baltimore, Maryland, 1994.Google Scholar
  19. [19]
    A. Nemirovskii, “Several NP-hard problems arising in robust stability analysis,” Math. of Control, Signals, and Systems, vol. 6, pp 99–105, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  20. [20]
    A. Packard and J.C. Doyle, “The complex structured singular value,” Automatica, vol. 29, pp. 71–110, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  21. [21]
    S. Poljak and J. Rohn, “Checking robust nonsingularity is NP-hard,” Math. of Control, Signals, and Systems, vol. 6, pp 1–9, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  22. [22]
    L. R. Ray and R. F. Stengel, “Stochastic robustness of linear time-invariant control systems,” IEEE Trans. Auto. Contr., vol. 36, pp. 82–87, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  23. [23]
    H. E. Romeijn, Global Optimization by Random Walk Sampling Methods, book nr. 32 of Tinbergen Institue Research Series, Thesis Publishers, Amsterdam, The Netherlands, 1992.Google Scholar
  24. [24]
    R.Y. Rubinstein, Monte Carlo Optimization, Simulation and Sensitivity of Queueing Networks, Wiley and Sons, New York, 1986.zbMATHGoogle Scholar
  25. [25]
    R. Tempo and E. W. Bai, “Robustness analysis with nonlinear parametric uncertainty: A probabilistic approach,” CENS-CNR Report 95/11, Poiltecnico di Torino, Torino, Italy, 1995.Google Scholar
  26. [26]
    P. Young and J. Doyle, “Computation of μ with real and complex uncertainties,” Proc. of 29th Conf. on Decision and Control, pp. 1230–1235, Honolulu, Hawaii, 1990.Google Scholar

Copyright information

© Springer-Verlag London Limited 1999

Authors and Affiliations

  • Pramod P. Khargonekar
    • 1
  • Ashok Tikku
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceUniversity of MichiganAnn Arbor

Personalised recommendations