Searching and on-line recognition of star-shaped polygons.

DOI10.1016/S0890-5401(03)00081-6zbMath1069.68105OpenAlexW1983335618MaRDI QIDQ1427863

Alejandro López-Ortiz, Sven Schuierer

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00081-6

zbMATH Keywords

Competitive ratioMotion planningAlgorithmic foundations of roboticsOn-line searchingStar-shaped polygons

Mathematics Subject Classification ID

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

Related Items

Online algorithms for searching and exploration in the plane ⋮ Parallel searching on \(m\) rays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight analysis of a self-approaching strategy for the online kernel-search problem
• Searching in the plane
• Search games
• Walking an unknown street with bounded detour
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Navigating in Unfamiliar Geometric Terrain
• Generalized streets revisited
• An Optimal Competitive Strategy for Walking in Streets
• Position-independent near optimal searching and on-line recognition in star polygons