An Improved On-line Strategy for Exploring Unknown Polygons

DOI10.1007/978-3-319-26626-8_13zbMath1473.68204OpenAlexW2293670549MaRDI QIDQ3467843

Qi Wei, Xue-Hou Tan

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_13

Mathematics Subject Classification ID

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

Related Items (3)

Improved exploration of unknown polygons ⋮ Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems ⋮ The simple grid polygon exploration problem

Cites Work

• Optimum watchman routes
• Approximation algorithms for the watchman route and zookeeper's problems.
• The Polygon Exploration Problem
• Touring a sequence of polygons
• How to learn an unknown environment. I
• AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
• CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"

This page was built for publication: An Improved On-line Strategy for Exploring Unknown Polygons