LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS

DOI10.1142/S0218195901000559zbMATH Open1074.68556OpenAlexW2121154134MaRDI QIDQ4682162FDOQ4682162

Authors: Sven Schuierer, Alejandro Lopez-Ortiz 

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195901000559

Recommendations

• Competitive searching in a generalized street
• Lower bounds in on-line geometric searching metric searching
• Lower bounds in on-line geometric searching
• scientific article; zbMATH DE number 2185606
• Going home through an unknown street

zbMATH Keywords

competitive ratiostreet polygonsOn-line searchingalgorithmic foundations of robotics

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Artificial intelligence for robotics (68T40)

Cites Work

• Searching in the plane
• Navigating in Unfamiliar Geometric Terrain
• Shortest paths without a map
• Walking an unknown street with bounded detour
• A competitive analysis of algorithms for searching unknown scenes
• How to find a point on a line within a fixed distance
• Competitive searching in a generalized street
• Yet more on the linear search problem
• AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT

Cited In (3)

• A new competitive algorithm for agent searching in unknown streets
• Online algorithms for searching and exploration in the plane
• The tourist in the shopping arcade

This page was built for publication: LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS

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