LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS
From MaRDI portal
Publication:4682162
DOI10.1142/S0218195901000559zbMath1074.68556MaRDI QIDQ4682162
Sven Schuierer, Alejandro López-Ortiz
Publication date: 10 June 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
68P10: Searching and sorting
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68T37: Reasoning under uncertainty in the context of artificial intelligence
68T40: Artificial intelligence for robotics
Cites Work
- A competitive analysis of algorithms for searching unknown scenes
- Searching in the plane
- Shortest paths without a map
- Walking an unknown street with bounded detour
- 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
- Navigating in Unfamiliar Geometric Terrain