Optimality and competitiveness of exploring polygons by mobile robots

DOI10.1016/j.ic.2010.09.005zbMath1207.68396OpenAlexW2108990830MaRDI QIDQ617716

Jurek Czyzowicz, Andrzej Pelc, Arnaud Labourel

Publication date: 13 January 2011

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

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

zbMATH Keywords

polygonmobile robotcompetitive algorithmon-line exploration

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Related Items (1)

Communication and location discovery in geometric ring networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimum watchman routes
• Watchman routes under limited visibility
• On the computational geometry of pocket machining
• Approximation algorithms for lawn mowing and milling
• Spanning-tree based coverage of continuous areas by a mobile robot
• Competitive exploration of rectilinear polygons
• The Polygon Exploration Problem
• How to learn an unknown environment. I
• Computing and Combinatorics
• Exploring unknown environments with obstacles

This page was built for publication: Optimality and competitiveness of exploring polygons by mobile robots