Distributed Tree Rearrangements for Reachability and Robust Connectivity

DOI10.1007/978-3-642-00602-9_37MaRDI QIDQ3624598zbMATH OpenOpenAlexFDO

Authors Michael Schuresko, J. Cortés

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Recommendations

• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Distributed motion constraints for algebraic connectivity of robotic networks
• Keeping Mobile Robot Swarms Connected
• A Distributed Biconnectivity Check
• Maintaining limited-range connectivity among second-order agents

Cites work

• Decentralized estimation and control of graph connectivity for mobile sensor networks
• Distributed Computing: A Locality-Sensitive Approach
• Distributed coverage of nonconvex environments
• Distributed motion constraints for algebraic connectivity of robotic networks
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Maintaining limited-range connectivity among second-order agents
• On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity
• Spatially-distributed coverage optimization and control with limited-range interactions
• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case

Cited in

(10)

• SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS
• scientific article; zbMATH DE number 4216785 (Why is no real title available?)
• A Distributed Biconnectivity Check
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• scientific article; zbMATH DE number 3990855 (Why is no real title available?)
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Motions of a connected subgraph representing a swarm of robots inside a graph of work stations
• Notes on the Distributed Computation of Merge Trees on CW-Complexes
• Distributed Relationship Schemes for Trees
• Toward fault-tolerant multi-robot networks

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

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