Distributed Tree Rearrangements for Reachability and Robust Connectivity

DOI10.1137/090753243zbMath1257.93006OpenAlexW2052435960MaRDI QIDQ4905920

Jorge Cortés, Michael Schuresko

Publication date: 21 February 2013

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9aa61956c7d6903e5d22325ae5e9fca8d1c8576e

zbMATH Keywords

treesmultiagent systemsdistributed algorithmsnetwork reconfigurationgraph connectivity maintenance

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Automated systems (robots, etc.) in control theory (93C85) Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15) Attainable sets, reachability (93B03) Distributed algorithms (68W15) Agent technology and artificial intelligence (68T42)

Related Items (2)

Nonsmooth control barrier function design of continuous constraints for network connectivity maintenance ⋮ Robustness and Invariance of Connectivity Maintenance Control for Multiagent Systems

This page was built for publication: Distributed Tree Rearrangements for Reachability and Robust Connectivity