Monte Carlo and Las Vegas rendomized algorithms for systems and conrol

European Journal of Control

Volumn 13, Issue 2-3, 2007, Pages 189-203

  Tempo, Roberto ^a   Ishii, Hideaki ^b  

^a POLITECNICO DI TORINO   (Italy)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Las Vegas algorithms; Monte Carlo algorithms; Probabilistic approach; Randomized algorithms; Systems and control

Indexed keywords

MONTE CARLO METHODS;

CONSENSUS PROBLEMS; DISTRIBUTED CONSENSUS; LAS VEGAS; LAS VEGAS ALGORITHMS; LYAPUNOV'S FUNCTIONS; MONTE CARLO ALGORITHMS; PROBABILISTICS APPROACH; RANDOMIZED ALGORITHMS; STABILITY ANALYZE; SYSTEMS AND CONTROL;

LYAPUNOV FUNCTIONS;

EID: 45749103674     PISSN: 09473580     EISSN: None     Source Type: Journal    
DOI: 10.3166/ejc.13.189-203     Document Type: Conference Paper

References (65)

1. Agrawal M, Kayal N, Saxena N. PRIMES is in P. Ann Math 2004; 160: 781-793
2. Alamo T, Tempo R, Ramirez DR, Camacho EF. A new vertex result for robustness problems with interval matrix uncertainty. In Proceedings of the European Control Conference, 2007 (to appear)
3. Alamo T, Tempo R, Ramirez DR, Camacho EF. A sequentially optimal reandomized algorithm for robust LMI feasibility problems. In Proceedings of the European Control Conference, 2007 (to appear)
4. Alpcan T, Basar T, Tempo R. Randomized algorithms for stability and robustness of high-speed communication networks. IEEE Trans Neural Netw 2005; 16: 1229-1241
5. Antsaklis PJ, Baillieul J. Guest Editors. Special issue on the technology of networked control systems. Proceedings of the IEEE, 95(1), 2007
6. Aspnes J. Randomized protocols for asynchronous consensus. Distrib Comput, 2003; 16: 165-175
7. Babai L. Monte-Carlo algorithms in graph isomorphism testing. Technical report, Départment de Mathématique et de Statistique, Univesité de Montréal, 1979
8. Ben-Tal A, Nemirovski A. On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty. SIAM J Optim 2002; 12: 811-833
9. Bentley JL. Engineering a sort function. Softw Pract Exp 1993; 23: 1249-1265
10. Bertsekas DP, Tsitsiklis JN. Parallel and distributed computation: Numerical methods. Prentice-Hall, Englewood Cliffs, NJ, 1989
11. Blondel VD, Hendrickx JM, Olshevsky A, Tsitsiklis JN. Convergence in multiagent coordination, consensus, and flocking. In Proceedings of the 44th IEEE Conference on Decision and Control and European Control Conference, pp. 2996-3000, 2005
12. Blondel VD, Tsitsiklis JN. A survey of computational complexity results in systems and control. Automatica, complexity results in systems and control. Automatica, 2000; 36:1249-1274
13. Boyd S, El Ghaoui L, Ferron E, Balakrishnan V. Linear Matrix Inequalities in System and Control Theory, volume 15 of SIAM Studies in Applied Math. SIAM, Philadelphia, PA, 1994
14. Boyd S, Ghosh A, Prabhakar B, Shah D. Randomized gossip algorithms. IEEE Trans Information Theory, Special issue of IEEE Trans. Information Theory and IEEE/ACM Trans. Networking 2006; 52: 2508-2530
15. Calafiore G, Dabbene F. An iterative localization method for probabilistic feasibility of uncertain LMIs. In Proceedings of the 45th IEEE Conference on Decision and Control, pp. 4157-4162, 2006
16. Calafiore G, Dabbene F, Tempo R. A survey of randomized algorithms for control synthesis and performance verification. Journal of Complexity, to appear, 2007
17. Calafiore G, Polyak BT. Stochastic algorithms for exact and approximate feasibility of robust LMIs. IEEE Trans Autom Control 2001; 46: 1755-1759
18. Calafiore GC, Dabbene F, Tempo R. Randomized algorithms for probabilistic robustness with real and complex structured uncertainty. IEEE Trans Autom Control 2000; 45: 2218-2235
19. Carli R, Fagnani F, Focoso M, Speranzon A, Zampieri S. Symmetries in the coordinated consensus problem. In Antsaklis PJ, Tabuada P (Eds), Networked Embedded Sensing and Control Workshop, volume 331 of Lect Notes Control Info Sci, pp. 25-51, Springer, Berlin, 2005
20. Chernoff H. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann Math Stat 1952; 23: 493-507
21. DeGroot MH. Reading a consensus. J Am Stat Association 1974; 69: 118-121
22. Deng M, Ho Y-C. An ordinal optimization approach to optimal control problems. Automatica 1999; 35: 331-338
23. Fisher MJ, Lynch NA, Paterson MS. Impossibility of distributed consensus with one faulty processor. J ACM 1985; 32: 374-382
24. Fujisaki Y, Dabbene F, Tempo R. Probabilistic design of LPV control systems. Automatica 2003; 39: 1323-1337
25. Hastings W. Monte Carlo sampling methods using Markov chains and their applications. Biometrika 1970; 57: 97-109
26. Hatano Y, Mesbahi M. Agreement over random networks. IEEE Trans Autom Control 2005; 50: 1867-1872
27. Hoare CAR. Quicksort. Computer J 1962; 5: 10-15
28. Horisberger HP, Belanger PR. Regulators for linear time invariant plants with uncertain parameters. IEEE Trans Autom Control 1976; 21: 705-708
29. Ishii H, Basar T, Tempo R. Randomized algorithms for quadratic stability of quantized sampled data systems. Automatica 2004; 40: 839-846
30. Ishii H, Basar T, Tempo R. Randomized algorithms for synthesis of switching rules for multimodal systems. IEEE Trans Autom Control 2005; 50: 754-767
31. Ishii H, Tempo R. Probabilistic sorting and stabilization of swithced systems. Preprint, 2006
32. Jadbabaie A, Lin J, Morse AS. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans Autom Control 2003; 48: 988-1001
33. Kanev S, De Schutter B, Verhaegen M. An ellipsoid algorithm for probabilistic robust controller design. Syst Control Lett 2003; 49: 365-375
34. Karp RM. An introduction to randomized algorithms. Discrete Appl Math 1991; 34: 165-201
35. Kashyap A, Basar T, Srikant R. Quantized consensus. Automatica, 2007; 43(6): to appear
36. Knuth DE. The art of computer programming, 2nd edition, volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, 1998
37. Liberzon D, Tempo R. Common Lyapunov functions and gradient algorithms. IEEE Trans Autom Control 2004; 49: 990-994
38. Lorefice L, Pralio B, Tempo R. Robust and randomized control design of mini-UAVs: the MH1000 platform. In Proceedings of the American Control Conference, 2007 (to appear)
39. Mehta ML. Random matrices. Academic Press, Boston, 1991
40. Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller A, Teller H. Equations of state calculations by fast computing machines. J Chem Phys 1953; 21: 1087-1091
41. Metropolis N, Ulam SM. The Monte Carlo method. J Arm Stat Assoc, 1949; 44: 335-341
42. Mitzenmacher M, Upfal E. Probability and computing: Randomized algorithms and probabilistic analysis, Cambridge University Press, 2005
43. Moreau L. Stability of multiagent systems with time-dependent communication links. IEEE Trans Autom Control 2005; 50: 169-182
44. Motwani R, Raghavan P. Randomized algorithms. Cambridge University Press, 1995
45. Mulmuley K. Computational geometry: An introduction through randomized algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1994
46. Nemirovskii A. Several NP-hard problems arising in robust stability analysis. Math Control Signals Syst 1993; 6: 9-105
47. Niederreiter H. Random number generation and Quasi-Monte Carlo methods. SIAM, Philadelphia, PA, 1992
48. Oishi Y. Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities. Automatica 2007; 43(3): 538-545
49. Olfati-Saber R, Murray R. Consensus problems in networks of agents with switching topology and time-delays. IEEE Trans Autom Control 2004; 49: 1520-1533
50. Palopoli L, Pinello C, Bicchi A, Sangiovanni-Vincentelli A. Maximizing the stability radius of a set of systems under real-time scheduling constraints. IEEE Trans Autom Control 2005; 50: 1790-1795
51. Poljak S, Rohn J. Checking robust nonsingularity is NP-hard. Math Control Signals Syst 1993; 6: 1-9
52. Polyak BT, Tempo R. Probabilistic robust design with linear quadratic regulators. Syst Control Lett 2001; 43: 343-353
53. Rabin MO. Randomized Byzantin generals. IN Proceedings of the Annual Symposium on Foundations of Computer Science, pp. 403-409, 1983
54. Savkin AV. Coordinated collective motion of groups of autonomous robots: Analysis of Vicsek's model. IEEE Trans Autom Control 2004; 49: 981-983
55. Spall JC. Estimation via Markov chain Monte Carlo. IEEE Control Syst Mag 2003; 23(2): 34-45
56. Tempo R, Bai EW, Dabbene F. Probabilistic robustness analysis: Explicit bounds for the minimum number of samples. Syst Control Lett 1997; 30: 237-242
57. Tempo R, Calafiore G, Dabbene F. Randomized algorithms for analysis and control of uncertain systems. Springer, London, 2005
58. Traub JF, Wasilkowski GW, Wozniakowski H. Information-based complexity. Academic Press, New York, 1988
59. Traub JF, Werschulz AG. Complexity and information. Cambridge University Press, 1998
60. Tsitsiklis JN. Problems in decentralized decision making and computation. PhD thesis, Dept. of Electrical Engineering and Computer Science, MIT, 1984. http://web.mit.edu/int/www/Papers/PhD-84-int.pdf
61. Vidyasagar M. Statistical learning theory and randomized algorithms for control. IEEE Control Systems Magazine 1998; 18(6): 69-85
62. Vidyasagar M. Learning and generalization: With applications to neural networks. Springer, New York, 2002
63. Wu CW. Synchronization and convergence of linear dynamics in random directed networks. IEEE Trans Autom Control 2006; 51: 1207-1210
64. Xiao L, Boyd S, Lall S. A scheme for robust distributed sensor fusion based on average consensus. In Proceedings of the Conference on Information Processing in Sensor Networks, pp. 63-70, 2005
65. Zhou K, Doyle JC, Glover K. Robust and optimal control. Prentice-Hall, Upper Saddle River, NJ, 1996