A competitive analysis of algorithms for searching unknown scenes

DOI10.1016/0925-7721(93)90032-2zbMath0776.68057OpenAlexW2002652389MaRDI QIDQ685600

Bala Kalyanasundaram, Kirk R. Pruhs

Publication date: 24 October 1993

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(93)90032-2

zbMATH Keywords

mappinglower boundssearchingnearest neighbor neuristicrobot motion planning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Related Items (7)

Worst-case optimal exploration of terrains with obstacles ⋮ A competitive analysis of nearest neighbor based algorithms for searching unknown scenes ⋮ LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS ⋮ Competitive Searching for a Line on a Line Arrangement. ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ How to find a point on a line within a fixed distance ⋮ Optimal robot localization in trees

Cites Work

• Searching in the plane
• Optimum watchman routes
• Constructing competitive tours from local information
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
• Unnamed Item

This page was built for publication: A competitive analysis of algorithms for searching unknown scenes