Worst-case optimal exploration of terrains with obstacles

DOI10.1016/j.ic.2013.02.001zbMath1358.68291OpenAlexW2044973122MaRDI QIDQ384930

Jurek Czyzowicz, Andrzej Pelc, Arnaud Labourel, David Ilcinkas

Publication date: 29 November 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2013.02.001

zbMATH Keywords

polygonmobile robotobstacleexploration

Mathematics Subject Classification ID

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

Related Items (6)

The beachcombers' problem: walking and searching with mobile robots ⋮ On-line exploration of rectangular cellular environments with a rectangular hole ⋮ Beachcombing on strips and islands ⋮ Advice complexity of treasure hunt in geometric terrains ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Fast collaborative graph exploration

Cites Work

• Unnamed Item
• A competitive analysis of algorithms for searching unknown scenes
• Shortest paths without a map
• Watchman routes under limited visibility
• Competitive on-line coverage of grid environments by a mobile robot
• Spanning-tree based coverage of continuous areas by a mobile robot
• The Polygon Exploration Problem
• An Improved Strategy for Exploring a Grid Polygon
• How to learn an unknown environment. I
• The isoperimetric inequality
• Online Navigation in a Room
• Navigating in Unfamiliar Geometric Terrain
• Exploring unknown environments with obstacles

This page was built for publication: Worst-case optimal exploration of terrains with obstacles