Competitive on-line coverage of grid environments by a mobile robot
From MaRDI portal
Publication:1869751
DOI10.1016/S0925-7721(02)00110-4zbMath1092.68107MaRDI QIDQ1869751
Publication date: 28 April 2003
Published in: Computational Geometry (Search for Journal in Brave)
competitive covering; mobile robot covering; on-line spanning tree construction; sensor based covering
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68T40: Artificial intelligence for robotics
Related Items
Potential field hierarchical reinforcement learning approach for target search by multi-AUV in 3-D underwater environments, On-line exploration of rectangular cellular environments with a rectangular hole, Worst-case optimal exploration of terrains with obstacles, Multi-robot area patrol under frequency constraints, A local strategy for cleaning expanding cellular domains by simple robots, 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, The simple grid polygon exploration problem, Rendezvous in planar environments with obstacles and unknown initial distance, Fast collaborative graph exploration, An Improved Strategy for Exploring a Grid Polygon, COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS
Cites Work
- 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
- Unnamed Item
- Unnamed Item
