A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Exploring an unknown graphPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Navigating in unfamiliar geometric terrainPublished by Association for Computing Machinery (ACM) ,1991
- Lower bounds for randomized k-server and motion-planning algorithmsPublished by Association for Computing Machinery (ACM) ,1991
- Dynamic path planning in sensor-based terrain acquisitionIEEE Transactions on Robotics and Automation, 1990
- Shortest paths without a mapPublished by Springer Nature ,1989
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977