On the computational geometry of pocket machining
On the computational geometry of pocket machining
How to learn an unknown environment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Watchman routes under limited visibility
Computational Geometry: Theory and Applications
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Approximation algorithms for lawn mowing and milling
Computational Geometry: Theory and Applications
Competitive Algorithms for the On-line Traveling Salesman
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Constructing Competitive Tours From Local Information
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
An approximation scheme for planar graph TSP
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The Pemex-B autonomous demining robot: perception and navigation strategies
IROS '95 Proceedings of the International Conference on Intelligent Robots and Systems-Volume 1 - Volume 1
The giving tree: constructing trees for efficient offline and online multi-robot coverage
Annals of Mathematics and Artificial Intelligence
Classifying the multi robot path finding problem into a quadratic competitive complexity class
Annals of Mathematics and Artificial Intelligence
3-D terrain covering and map building algorithm for an AUV
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Multi-robot area patrol under frequency constraints
Annals of Mathematics and Artificial Intelligence
Multi-robot exploration and terrain coverage in an unknown environment
Robotics and Autonomous Systems
Exploring simple grid polygons
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimal exploration of terrains with obstacles
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
An improved strategy for exploring a grid polygon
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Fast collaborative graph exploration
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
International Journal of Robotics Research
Hi-index | 0.00 |
We describe in this paper two on-line algorithms for covering planar areas by a square-shaped tool attached to a mobile robot. Let D be the tool size. The algorithms, called Spanning Tree Covering (STC) algorithms, incrementally subdivide the planar area into a grid of D-size cells, while following a spanning tree of a grid graph whose nodes are 2D-size cells. The two STC algorithms cover general planar grids. The first, Spiral-STC, employs uniform weights on the grid-graph edges and generates spiral-like covering patterns. The second, Scan-STC , assigns lower weights to edges aligned with a particular direction and generates scan-like covering patterns along this direction. Both algorithms cover any planar grid using a path whose length is at most (n + m)D, where n is the total number of D-size cells and m ≤ n is the number of boundary cells, defined as cells that share at least one point with the grid boundary. We also demonstrate that any on-line coverage algorithm generates a covering path whose length is at least (2 - ε)lopt in worst case, where lopt is the length of the optimal off-line covering path. Since (n + m)D ≤ 2lopt, the bound is tight and the STC algorithms are worst-case optimal. Moreover, in practical environments m || n, and the STC algorithms generate close-to-optimal covering paths in such environments.