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

DOI10.1145/3583668.3594568MaRDI QIDQ6202217zbMATH OpenOpenAlexFDO

Authors Laurent Massoulié, Laurent Viennot

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

adversarial gamecollaborative explorationdepthgraphstrees

Mathematics Subject Classification ID

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

Cites work

• A general lower bound for collaborative tree exploration
• A recursive approach to multi-robot exploration of trees
• Collective tree exploration
• Fast collaborative graph exploration
• Online graph exploration algorithms for cycles and trees by multiple searchers
• Smart Robot Teams Exploring Sparse Trees
• Why Robots Need Maps

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

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