A Recursive Approach to Multi-robot Exploration of Trees-Reference-Cited by-同舟云学术

A Recursive Approach to Multi-robot Exploration of Trees

Published:2014 Issue: Volume: Page:343-354
ISSN:0302-9743
Container-title:Structural Information and Communication Complexity
language:
Short-container-title:

Author:

Ortolf Christian,Schindelhauer Christian

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-09620-9_26

Reference18 articles.

1. Albers, S., Henzinger, M.R.: Exploring Unknown Environments. SIAM Journal on Computing 29(4), 1164 (2000)

2. Albers, S., Kursawe, K., Schuierer, S.: Exploring unknown environments with obstacles. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1999, pp. 842–843. Society for Industrial and Applied Mathematics, Philadelphia (1999)

3. Bender, M.A.: The power of team exploration: Two robots can learn unlabeled directed graphs. In: Proceedings of the Thirty Fifth Annual Symposium on Foundations of Computer Science, pp. 75–85 (1994)

4. Bender, M.A., Fernández, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: Exploring and mapping directed graphs. Information and Computation 176(1), 1–21 (2002)

5. Brass, P., Cabrera-Mora, F., Gasparri, A., Xiao, J.: Multirobot tree and graph exploration. IEEE Transactions on Robotics 27(4), 707–717 (2011)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

2. Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots;2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2023-05

3. An improved lower bound for competitive graph exploration;Theoretical Computer Science;2021-05

4. A general lower bound for collaborative tree exploration;Theoretical Computer Science;2020-04

5. Dispersion of Mobile Robots: The Power of Randomness;Lecture Notes in Computer Science;2019