Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis

  • Published:
Mathematics of Control, Signals and Systems Aims and scope Submit manuscript

Abstract

In this paper we study aprobabilistic approach which is an alternative to the classical worst-case algorithms for robustness analysis and design of uncertain control systems. That is, we aim to estimate the probability that a control system with uncertain parametersq restricted to a boxQ attains a given level of performance γ. Since this probability depends on the underlying distribution, we address the following question: What is a “reasonable” distribution so that the estimated probability makes sense? To answer this question, we define two worstcase criteria and prove that the uniform distribution is optimal in both cases. In the second part of the paper we turn our attention to a subsequent problem. That is, we estimate the sizes of both the so-called “good” and “bad” sets via sampling. Roughly speaking, the good set contains the parametersqQ with a performance level better than or equal to γ while the bad set is the set of parametersqQ with a performance level worse than γ. We give bounds on the minimum sample size to attain a good estimate of these sets in a certain probabilistic sense.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  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, vol. 10, pp. 203–222, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. V. Blondel and J. N. Tsitsiklis, NP-Hardness of Some Linear Control Design Problems,SIAM Journal of Control and Optimization, vol. 35, pp. 2118–2127, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. P. Braatz, P. M. Young, J. C. Doyle, and M. Morari, Computational Complexity of μ Calculation,IEEE Transactions on Automatic Control, vol. AC-39, pp. 1000–1002, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. Chernoff, A Measure of Asymptotic Efficiency for Test of Hypothesis Based on the Sum of Observations,Annals of Mathematical Statitics, vol. 23, pp. 493–507, 1952.

    MathSciNet  Google Scholar 

  5. J. Doyle, Analysis of Feedback Systems with Structured Uncertainty,IEE Proceedings, part D, vol. 129, pp. 242–250, 1982.

    MathSciNet  Google Scholar 

  6. P. P. Khargonekar and A. Tikku, Randomized Algorithms for Robust Control Analysis Have Polynomial Time Complexity,Proceedings of the Conference on Decision and Control, Kobe, Japan, 1996.

  7. V. L. Kharitonov, Asymptotic Stability of an Equilibrium Position of a Family of Systems of Linear Differential Equations,Differencial’nye Uravnenija, vol. 14, pp. 2086–2088, 1978.

    MATH  MathSciNet  Google Scholar 

  8. A. Nemirovskii, Several NP-Hard Problems Arising in Robust Stability Analysis.Mathematics of Control, Signals, and Systems, vol. 6, pp. 99–105, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  9. E. Parzen,Modern Probability Theory and Its Applications, Wiley, New York, 1992.

    Google Scholar 

  10. S. Poljak and J. Rohn, Checking Robust Nonsingularity is NP-Hard,Mathematics of Control, Signals, and Systems, vol. 6, pp. 1–9, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  11. L. R. Ray and R. F. Stengel, A Monte Carlo Approach to the Analysis of Control System Robustness,Automatica, vol. 29, pp. 229–236, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. G. Safonov, Stability Margins of Diagonally Perturbed Multivariable Systems,IEE Proceedings, part D, vol. 129, pp. 251–256, 1982.

    MathSciNet  Google Scholar 

  13. R. F. Stengel and L. R. Ray, Stochastic Robustness of Linear Time-Invariant Control Systems,IEEE Transactions on Automatic Control, vol. 36, pp. 82–87, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  14. R. Tempo, E.-W. Bai, and F. Dabbene, Probabilistic Robustness Analysis: Explicit Bounds for the Minimum Number of Samples,Systems and Control Letters, vol. 30, pp. 237–242, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. Vidyasagar,A Theory of Learning and Generalization with Applications to Neural Networks and Control Systems, Springer-Verlag, Berlin, 1996.

    Google Scholar 

  16. M. Vidyasagar, Statistical Learning Theory: An Introduction and Applications to Randomized Algorithms,Proceedings of the European Control Conference, Brussels, 1997.

  17. A. A. Zhigljavsky, Theory of Global Random Search, Kluwer Academic, Boston, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Er-Wei Bai.

Additional information

This work was supported in part by funds of NSF of USA, CENS-CNR of Italy, and the Australian Research Council

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bai, EW., Tempo, R. & Fu, M. Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis. Math. Control Signal Systems 11, 183–196 (1998). https://doi.org/10.1007/BF02741890

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02741890

Key words

Navigation