Spanning-tree based coverage of continuous areas by a mobile robot

By Y. Gabriely, E. Rimon. Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2001

505 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition, Mechanical Engineering

View Paper: https://www.semanticscholar.org/paper/f5d058007eb7a174fa6d96dacbebb4e627be873f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Steven M. LaValle
2. R. Mohd-Mokhtar
3. João Pedra Hespanha
4. Gal A. Kaminka
5. Francesco Bullo
6. Wesley H. Huang
7. Yehuda Elmaliach
8. Noam Agmon

In Computer Vision and Pattern Recognition

1. Steven M. LaValle
2. S.X. Yang
3. R. Mohd-Mokhtar
4. Chaomin Luo
5. João Pedra Hespanha
6. Gal A. Kaminka
7. Francesco Bullo
8. Wesley H. Huang

In Mechanical Engineering

1. R. Mohd-Mokhtar
2. Steven M. LaValle
3. Gal A. Kaminka
4. Francesco Bullo
5. Wesley H. Huang
6. Yehuda Elmaliach
7. Noam Agmon
8. Chee Sheng Tan

Citations in the corpus

• A neural network approach to complete coverage path planning (2004, background): “Recently, Gabriely and Rimon [13] proposed a spanning tree covering approach”
• Control of Multiple UAVs for Persistent Surveillance: Algorithm and Flight Test Results (2012, background): “Spanning tree coverage (STC) [19], [20] algorithms claim optimality for single robot coverage problems, but have no such guarantees for multiple robots.”
• Optimal line-sweep-based decompositions for coverage algorithms (2001, result): “More recent results include: Gabriely and Rimon [ 5 ], who formulated a coverage algorithm based on traveling about the perimeter of a minimum spanning tree that fills the coverage region; Butler et al. [1], who created a distributed algorithm for multiple robots to cover an unknown rectilinear envi”
• Planning algorithms (2006, methodology): “Versions of the method that do not require an initial map are also given in [374, 375]; this involves reasoning about information spaces, which are covered in Chapter 11.”
• A Comprehensive Review of Coverage Path Planning in Robotics Using Classical and Heuristic Algorithms (2021, methodology): “either by cell decomposition-based method or grid-based method [68], [69].”
• On Discrete-Time Pursuit-Evasion Games With Sensing Limitations (2008, result): “This is analogous to the spanning-tree based coverage presented in [17].”
• Multi-robot area patrol under frequency constraints (2007, methodology): “Our approach, on the other hand, provides an optimal solution in the same sense, and moreover -provides uniform optimal solution for grid based graphs (under Gabrieli and Rimon's initial assumptions in [9]).”