Improved exploration of unknown polygons

DOI10.1016/j.tcs.2022.04.043OpenAlexW4225278822MaRDI QIDQ2672604

Xue-Hou Tan, Qi Wei

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.043

zbMATH Keywords

on-line algorithmscomputational geometrycompetitive strategywatchman route problemangle hullpolygon exploration problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimum watchman routes
• Approximation algorithms for the watchman route and zookeeper's problems.
• Fast computation of shortest watchman routes in simple polygons
• Competitive exploration of rectilinear polygons
• A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
• The Polygon Exploration Problem
• Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems
• An Improved On-line Strategy for Exploring Unknown Polygons
• 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: Improved exploration of unknown polygons