LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS

DOI10.1142/S0218195901000559MaRDI QIDQ4682162zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmic foundations of roboticscompetitive ratioOn-line searchingstreet polygons

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(5)

• Competitive searching in a generalized street
• Online algorithms for searching and exploration in the plane
• The tourist in the shopping arcade
• Improved Lower Bounds for Shoreline Search
• A new competitive algorithm for agent searching in unknown streets

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)