Online exploration outside a convex obstacle

DOI10.1016/J.TCS.2022.06.037MaRDI QIDQ2166745zbMATH OpenOpenAlexFDO

Authors Shai Gul, Eitan Tiktinsky, Slava Shamshanov, Reuven Cohen

Publication date 25 August 2022

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

Full work available at URL https://arxiv.org/abs/1807.02773

zbMATH Keywords

convexityonline algorithmsspiral search

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Polygon exploration with time-discrete vision
• An improved on-line strategy for exploring unknown polygons
• Improved exploration of unknown polygons
• The polygon exploration problem
• scientific article; zbMATH DE number 426139

Cites work

• scientific article; zbMATH DE number 177562 (Why is no real title available?)
• scientific article; zbMATH DE number 1003229 (Why is no real title available?)
• scientific article; zbMATH DE number 1182933 (Why is no real title available?)
• scientific article; zbMATH DE number 3299324 (Why is no real title available?)
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Minimum-link watchman tours
• On the complexity of locating linear facilities in the plane
• Online exploration of polygons with holes
• Optimal Exploration of Terrains with Obstacles
• Search games
• The polygon exploration problem
• Watchman routes under limited visibility

Cited in

(3)

• Optimal Exploration of Terrains with Obstacles
• Off-line exploration of rectangular cellular environments with a rectangular obstacle
• On-line exploration of an unbounded region with one obstacle

This page was built for publication: Online exploration outside a convex obstacle

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