Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next

DOI10.1145/3583668.3594568OpenAlexW4380875799MaRDI QIDQ6202217

Laurent Massoulié, Laurent Viennot, Unnamed Author

Publication date: 26 March 2024

Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3583668.3594568

zbMATH Keywords

graphsdepthtreesadversarial gamecollaborative exploration

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Online graph exploration algorithms for cycles and trees by multiple searchers
• Collective tree exploration
• Fast Collaborative Graph Exploration
• Why Robots Need Maps
• A Recursive Approach to Multi-robot Exploration of Trees
• Smart Robot Teams Exploring Sparse Trees
• A general lower bound for collaborative tree exploration

This page was built for publication: Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next