On rendezvous control with randomly switching communication graphs

DOI10.3934/NHM.2007.2.627MaRDI QIDQ932960zbMATH OpenOpenAlexFDO

Authors Luca Schenato, Sandro Zampieri

Publication date 21 July 2008

Published in Networks and Heterogeneous Media (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/nhm.2007.2.627

zbMATH Keywords

agreementconsensusnetworked control systemoptimal controlrandomized communicationrendezvous control

Mathematics Subject Classification ID

Randomized algorithms (68W20) Stochastic network models in operations research (90B15) Communication networks in operations research (90B18) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• Finite-time rendezvous control of multi-agent networks with preserving topology connectivity
• Distributed Estimation and Control of Algebraic Connectivity Over Random Graphs
• A unifying convex analysis and switching system approach to consensus with undirected communication graphs
• Rendezvous problem of multiple linear uncertain systems under state-dependent dynamic networks
• Balanced containment control and cooperative timing of a multiagent system over random communication graphs
• The Rendezvous Problem With Discontinuous Control Policies
• Distributed control of LPV systems over arbitrary graphs with communication latency
• On deterministic rendezvous at a node of agents with arbitrary velocities
• Target containment control of multi-agent systems with random switching interconnection topologies

Cited in

(2)

• Quantized coordination algorithms for rendezvous and deployment
• Transitional Behavior of q-Composite Random Key Graphs With Applications to Networked Control

This page was built for publication: On rendezvous control with randomly switching communication graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932960)