Competitive on-line coverage of grid environments by a mobile robot

DOI10.1016/S0925-7721(02)00110-4zbMath1092.68107MaRDI QIDQ1869751

Yoav Gabriely, Elon Rimon

Publication date: 28 April 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

competitive coveringmobile robot coveringon-line spanning tree constructionsensor based covering

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Related Items (12)

Worst-case optimal exploration of terrains with obstacles ⋮ A local strategy for cleaning expanding cellular domains by simple robots ⋮ On-line exploration of rectangular cellular environments with a rectangular hole ⋮ Potential field hierarchical reinforcement learning approach for target search by multi-AUV in 3-D underwater environments ⋮ COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS ⋮ Multi-robot area patrol under frequency constraints ⋮ The simple grid polygon exploration problem ⋮ The giving tree: Constructing trees for efficient offline and online multi-robot coverage ⋮ Classifying the multi robot path finding problem into a quadratic competitive complexity class ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ An Improved Strategy for Exploring a Grid Polygon ⋮ Fast collaborative graph exploration

Cites Work

• Unnamed Item
• Unnamed Item
• Watchman routes under limited visibility
• Approximation algorithms for lawn mowing and milling
• Spanning-tree based coverage of continuous areas by a mobile robot
• Modelling and Planning for Sensor Based Intelligent Robot Systems
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Constructing competitive tours from local information
• Hamilton Paths in Grid Graphs
• Algorithms for the on-line travelling salesman

This page was built for publication: Competitive on-line coverage of grid environments by a mobile robot