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

DOI10.1016/S0925-7721(02)00110-4zbMATH Open1092.68107MaRDI QIDQ1869751FDOQ1869751

Authors: Yoav Gabriely, Elon Rimon 

Publication date: 28 April 2003

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

Recommendations

• Spanning-tree based coverage of continuous areas by a mobile robot
• Coverage for robotics -- a survey of recent results
• The simple grid polygon exploration problem
• Models and algorithms for online exploration and search.
• Computing and Combinatorics

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)

Cites Work

• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Hamilton Paths in Grid Graphs
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Algorithms for the on-line travelling salesman
• Watchman routes under limited visibility
• Spanning-tree based coverage of continuous areas by a mobile robot
• Approximation algorithms for lawn mowing and milling
• Title not available (Why is that?)
• Modelling and planning for sensor based intelligent robot systems
• Constructing competitive tours from local information
• Title not available (Why is that?)

Cited In (13)

• Rendezvous in planar environments with obstacles and unknown initial distance
• The giving tree: Constructing trees for efficient offline and online multi-robot coverage
• An improved strategy for exploring a grid polygon
• The simple grid polygon exploration problem
• A local strategy for cleaning expanding cellular domains by simple robots
• Classifying the multi robot path finding problem into a quadratic competitive complexity class
• Multi-robot area patrol under frequency constraints
• On-line exploration of rectangular cellular environments with a rectangular hole
• A robot coverage algorithm under rectangular decomposition environments
• Competitive complexity of mobile robot on-line motion planning problems
• Fast collaborative graph exploration
• Potential field hierarchical reinforcement learning approach for target search by multi-AUV in 3-D underwater environments
• Worst-case optimal exploration of terrains with obstacles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869751)