Distributed randomized algorithms for probabilistic performance analysis

DOI10.1016/j.sysconle.2008.10.010zbMath1159.93365OpenAlexW1967011034MaRDI QIDQ1016599

Giuseppe Carlo Calafiore

Publication date: 6 May 2009

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2008.10.010

zbMATH Keywords

randomized algorithmsdistributed estimationprobabilistic robustnessconsensus and agreement problems

Mathematics Subject Classification ID

Sampled-data control/observation systems (93C57) Stochastic stability in control theory (93E15)

Related Items

On the probability of correct selection in ordinal comparison over dynamic networks, Research on probabilistic methods for control system design, An efficient reliability method for probabilistic H-infinity robust control of uncertain linear dynamic systems, An efficient methodology for robust control of dynamic systems with interval matrix uncertainties

Uses Software

• RACT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
• A survey of randomized algorithms for control synthesis and performance verification
• Communication constraints in the average consensus problem
• Fast linear iterations for distributed averaging
• Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
• Matrix Analysis
• Consensus and Cooperation in Networked Multi-Agent Systems
• Notes on the Scenario Design Approach
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Stability of multiagent systems with time-dependent communication links
• Probability Inequalities for Sums of Bounded Random Variables