Distributed Tree Rearrangements for Reachability and Robust Connectivity
From MaRDI portal
Publication:3624598
DOI10.1007/978-3-642-00602-9_37zbMath1237.68230OpenAlexW1599564594MaRDI QIDQ3624598
Jorge Cortés, Michael Schuresko
Publication date: 30 April 2009
Published in: Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00602-9_37
Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)
Related Items (1)
Cites Work
- Distributed motion constraints for algebraic connectivity of robotic networks
- Decentralized estimation and control of graph connectivity for mobile sensor networks
- Distributed coverage of nonconvex environments
- Spatially-distributed coverage optimization and control with limited-range interactions
- The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
- Distributed Tree Rearrangements for Reachability and Robust Connectivity
- Distributed Computing: A Locality-Sensitive Approach
- Maintaining Limited-Range Connectivity Among Second-Order Agents
- On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity
This page was built for publication: Distributed Tree Rearrangements for Reachability and Robust Connectivity
