Skip to main content

Randomized Methods for Control of Uncertain Systems

Encyclopedia of Systems and Control

Abstract

In this article, we study the tools and methodologies for the analysis and design of control systems in the presence of random uncertainty. For analysis, the methods are largely based on the Monte Carlo simulation approach, while for design new randomized algorithms have been developed. These methods have been successfully employed in various application areas, which include systems biology; aerospace control; control of hard disk drives; high-speed networks; quantized, embedded, and electric circuits; structural design; and automotive and driver assistance.

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

Access this chapter

Institutional subscriptions

Bibliography

  • Alamo T, Tempo R, Camacho E (2009) A randomized strategy for probabilistic solutions of uncertain feasibility and optimization problems. IEEE Trans Autom Control 54:2545–2559

    Article  MathSciNet  Google Scholar 

  • Alamo T, Tempo R, Luque A, Ramirez D (2013) The sample complexity of randomized methods for analysis and design of uncertain systems. arXiv:13040678 (accepted for publication)

    Google Scholar 

  • Bullo F, Carli R, Frasca P (2012) Gossip coverage control for robotic networks: dynamical systems on the space of partitions. SIAM J Control Optim 50(1):419–447

    Article  MATH  MathSciNet  Google Scholar 

  • Calafiore G, Campi M (2006) The scenario approach to robust control design. IEEE Trans Autom Control 51(1):742–753

    Article  MathSciNet  Google Scholar 

  • Calafiore G, Dabbene F, Tempo R (2011) Research on probabilistic methods for control system design. Automatica 47:1279–1293

    Article  MATH  MathSciNet  Google Scholar 

  • Chamanbaz M, Dabbene F, Tempo R, Venkataramanan V, Wang Q (2013) Sequential randomized algorithms for convex optimization in the presence of uncertainty. arXiv: 1304.2222

    Google Scholar 

  • Chernoff H (1952) A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann Math Stat 23:493–507

    Article  MATH  MathSciNet  Google Scholar 

  • Fagnani F, Zampieri S (2008) Randomized consensus algorithms over large scale networks. IEEE J Sel Areas Commun 26(4):634–649

    Article  Google Scholar 

  • Frasca P, Ravazzi C, Tempo R, Ishii H (2013) Gossips and prejudices: ergodic randomized dynamics in social networks. In: Proceedings of the 4th IFAC workshop on distributed estimation and control in networked systems, Koblenz

    Google Scholar 

  • Ishii H, Tempo R (2010) Distributed randomized algorithms for the PageRank computation. IEEE Trans Autom Control 55:1987–2002

    Article  MathSciNet  Google Scholar 

  • Knuth D (1998) The art of computer programming. Sorting and searching, vol 3. Addison-Wesley, Reading

    Google Scholar 

  • Mitzenmacher M, Upfal E (2005) Probability and computing: randomized algorithms and probabilistic analysis. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Tempo R, Ishii H (2007) Monte Carlo and Las Vegas randomized algorithms for systems and control: an introduction. Eur J Control 13:189–203

    Article  MATH  Google Scholar 

  • Tempo R, Bai EW, Dabbene F (1997) Probabilistic robustness analysis: explicit bounds for the minimum number of samples. Syst Control Lett 30:237–242

    Article  MATH  MathSciNet  Google Scholar 

  • Tempo R, Calafiore G, Dabbene F (2013) Randomized algorithms for analysis and control of uncertain systems, with applications. Communications and control engineering series, 2nd edn. Springer, London

    Google Scholar 

  • Tremba A, Calafiore G, Dabbene F, Gryazina E, Polyak B, Shcherbakov P, Tempo R (2008) RACT: randomized algorithms control toolbox for MATLAB. In: Proceedings 17th IFAC world congress, Seoul, pp 390–395

    Google Scholar 

  • Uryasev SP (ed) (2000) Probabilistic constrained optimization: methodology and applications. Kluwer Academic, New York

    Google Scholar 

  • Valiant L (1984) A theory of the learnable. Commun ACM 27(11):1134–1142

    Article  MATH  Google Scholar 

  • Vapnik V (1998) Statistical learning theory. Wiley, New York

    MATH  Google Scholar 

  • Vidyasagar M (2001) Randomized algorithms for robust controller synthesis using statistical learning theory. Automatica 37:1515–1528

    Article  MATH  MathSciNet  Google Scholar 

  • Vidyasagar M (2002) Learning and generalization: with applications to neural networks, 2nd edn. Springer, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabrizio Dabbene .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag London

About this entry

Cite this entry

Dabbene, F., Tempo, R. (2014). Randomized Methods for Control of Uncertain Systems. In: Baillieul, J., Samad, T. (eds) Encyclopedia of Systems and Control. Springer, London. https://doi.org/10.1007/978-1-4471-5102-9_133-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-5102-9_133-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, London

  • Online ISBN: 978-1-4471-5102-9

  • eBook Packages: Springer Reference EngineeringReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Chapter history

  1. Latest

    Randomized Methods for Control of Uncertain Systems
    Published:
    29 January 2020

    DOI: https://doi.org/10.1007/978-1-4471-5102-9_133-3

  2. Randomized Methods for Control of Uncertain Systems
    Published:
    10 October 2014

    DOI: https://doi.org/10.1007/978-1-4471-5102-9_133-2

  3. Original

    Randomized Methods for Control
    Published:
    07 February 2014

    DOI: https://doi.org/10.1007/978-1-4471-5102-9_133-1