Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot
By Chaomin Luo, Simon X. Yang, D. Stacey, J. Jofriet. 2007
366 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/98ce590b9e6ecd60a2ba59aa9d162a08c681f1c8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Cyrill Stachniss
- Wolfram Burgard
- Mark Moors
- Frank E. Schneider
- Sebastian Thrun
- Enric Galceran
- M. Carreras
- Amna Khan
Citations in the corpus
- Coordinated multi-robot exploration (2005, background): “These techniques mainly differ in the way the environment is represented.”
- Optimal Path Planning using RRT* based Approaches: A Survey and Future Directions (2016, methodology): “Grid based algorithms such as Dijkstra [12], wavefront [13] , A* [14], D* [15], and Phi* [16] are resolution-complete and are computationally expensive for high dimensional complex problems.”
- A survey on coverage path planning for robotics (2013, methodology): “[Zelinsky et al., 1993] presented the first gridbased method for coverage path planning.”