Abstract
We consider problems involving robot motion planning in an initially unknown scene of obstacles. The two specific problems that we examine are mapping the scene and searching the scene for a recognizable target whose location is unknown. We use competitive analysis as a tool for comparing algorithms. In the case of convex obstacles, we show a tight θ(min(k, √kα)) bound on the competitiveness for these problems, where α and k are aspect ratio and number of objects, respectively. This lower bound also holds for randomized algorithms. We derive an almost tight bound on the competitive ratio for the Nearest Neighbor heuristic.
We also propose allowing multiple robots to cooperatively search the scene. For scenes that contain only objects of bounded perimeter and bounded aspect ratio, we show that m robots can achieve a competitive factor of O(√k/m), which is optimal. Thus, the robots can cooperate without interference in searching the scene. For general scenes we show that a competitive factor of O((√kα log m)/m) is achievable, provided m=O(√k/α).
Preview
Unable to display preview. Download preview PDF.
References
Springer-VerlagR. Baeza-Yates, J. Culberson, and G. Rawlins, “Searching with Uncertainty”, to appear in Information and Computation.
A. Blum, P. Raghavan, and B. Schieber, “Navigating in Unfamiliar Geometric Terrain”, STOC, pp. 494–504, 1991.
X. Deng, and C. Papadimitriou, “Exploring an Unknown Graph”, FOCS, pp. 355–361, 1990.
X. Deng, Kameda, and C. Papadimitriou, “How to Learn an Unknown Environment”, FOCS, pp. 298–303, 1991.
B. Kalyanasundaram, and K. Pruhs, “On-line Weighted Matching”, SODA, pp. 234–240, 1991.
B. Kalyanasundaram, and K. Pruhs, “A Competitive Analysis of Algorithms for Searching Unknown Scenes”, submitted for publication.
B. Kalyanasundaram, and K. Pruhs, “On-line Construction of Short Traveling Salesman Tours” submitted for publication.
H. Karloff, Y. Rabani, and Y. Ravid, “Lower Bounds for Randomized k-server and Motion Planning Algorithms”, STOC, 1991.
V. Lumelsky, S. Mukhopadhyay and K. Sun, “Dynamic Path Planning in Sensor-Based Terrain Acquisition”, IEEE Transactions on Robotics and Automation, vol. 6, pp. 462–472, 1990.
C. Papadimitriou, and M. Yannakakis, “Shortest Paths Without a Map”, ICALP, pp. 610–620, 1989.
D. Rosenkrantz, R. Stearns, and P. Lewis, “An Analysis of Several Heuristics for the Traveling Salesman Problem”, SIAM J. of Computing, 6, pp. 563–581, 1977.
J. Schwartz and C. Yap, Algorithmic and Geometric Aspects of Robots, Lawrence Erlbaum, London.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalyanasundaram, B., Pruhs, K. (1992). A competitive analysis of nearest neighbor based algorithms for searching unknown scenes. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_180
Download citation
DOI: https://doi.org/10.1007/3-540-55210-3_180
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55210-9
Online ISBN: 978-3-540-46775-5
eBook Packages: Springer Book Archive