Navigating in unfamiliar geometric terrain

SIAM Journal on Computing

Volumn 26, Issue 1, 1997, Pages 110-137

  Blum, Avrim ^a,b,c   Raghavan, Prabhakar ^d   Schieber, Baruch ^b  

^a Carnegie Mellon University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Computational geometry; On line algorithms; Robot navigation

Indexed keywords

EID: 0003187777     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539791194931     Document Type: Article

References (32)

1. R. A. BAEZA-YATES, J. C. CULBERSON, AND G. J. E. RAWLINS, Searching in the plane, Inform. and Comput., 106 (1993), pp. 234-252.
2. E. BAR-ELI, P. BERMAN, A. FIAT, AND P. YAN, On-line navigation in a room, J. Algorithms, 17 (1994), pp. 319-341.
3. S. BEN-DAVID, A. BORODIN, R. M. KARP, G. TARDOS, AND A. WIGDERSON, On the power of randomization in on-line algorithms, in Proc. 22nd Annual ACM Symposium on Theory of Computing, ACM, New York, 1990, pp. 379-388.
4. A. BLUM, A. BORODIN, D. FOSTER, H. J. KARLOFF, Y. MANSOUR, P. RAGHAVAN, M. SAKS, AND B. SCHIEBER, Randomized on-line algorithms for graph closures, unpublished manuscript, 1990.
5. M. BLUM AND D. KOZEN, On the power of the compass (or, why mazes are easier to search than graphs), in Proc. 19th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1978, pp. 132-142.
6. A. BORODIN, N. LINIAL, AND M. SAKS, An optimal online algorithm for metrical task systems, in Proc. 19th Annual ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 373-382.
7. S. J. BUCKLEY, Planning compliant motion strategies, Internat. J. Robotics Res., 8 (1989), pp. 28-44.
8. A. K. CHANDRA, P. RAGHAVAN, W. L. RUZZO, R. SMOLENSKY, AND P. TIWARI, The electrical resistance of a graph captures its commute and cover times, in Proc. 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 574-586.
9. L. CHENG AND J. D. MCKENDRICK, Autonomous knowledge based navigation in an unknown two dimensional environment with convex polygonal obstacles, Proc. Internat. Soc. Opt. Engrg., 1095 (1989), pp. 752-759.
10. M. CHROBAK, H. J. KARLOFF, T. PAYNE, AND S. VISHWANATHAN, New results on server problems, in Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1990, pp. 291-300.
11. K. L. CLARKSON, Approximation algorithms for shortest path motion planning, in Proc. 19th ACM Symposium on Theory of Computing, ACM, New York, 1987, pp. 56-65.
12. E. G. COFFMAN AND E. N. GILBERT, Paths through a maze of rectangles, Networks, 22 (1992), pp. 349-367.
13. M. DAILY, J. HARRIS, D. KEIRSEY, D. OLIN, D. PAYTON, K. REISER, J. ROSENBLATT, D. TSENG, AND V. WONG, Autonomous cross-country navigation with the ALV, in Proc. IEEE International Conference on Robotics and Automation, Vol. 2, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 718-726.
14. P. EADES, X. LIN, AND N. C. WORMALD, Performance guarantees for motion planning with temporal uncertainty, Austral. Comput. J., 25 (1993), pp. 21-28.
15. J. HALLAM, P. FORSTER, AND J. HOWE, Map free localization in a partially moving 3-D world: The Edinburgh feature based navigator, in Proc. International Conference on Intelligent Autonomous Systems, Vol. 2, IOS Press, Burke, VA, 1989, pp. 726-736.
16. B. KALYANASUNDARAM AND K. PRUHS, A competitive analysis of algorithms for searching unknown scenes, Comput. Geom., 3 (1993), pp. 139-155.
17. H. J. KARLOFF, Y. RABANI, AND Y. RAVID, Lower bounds for randomized server algorithms, in Proc. 23rd ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 278-288.
18. R. KLEIN, Walking an unknown street with bounded detour, in Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 303-313.
19. V. LUMELSKY, Algorithmic issues of sensor-based robot motion planning, in Proc. 26th IEEE Conference on Decision and Control, IEEE Computer Society Press, Los Alamitos, CA, 1987, pp. 1796-1801.
20. V. LUMELSKY, Algorithmic and complexity issues of robot motion in an uncertain environment, J. Complexity, 3 (1987), pp. 146-182.
21. V. J. LUMELSKY AND A. A. STEPANOV, Dynamic path planning for a mobile automaton with limited information on the environment, IEEE Trans. Automatic Control, AC-31 (1986), pp. 1058-1063.
22. A. MEI AND Y. IGARASHI, An efficient strategy for robot navigation in unknown environment, Inform. Process. Lett., 52 (1994), pp. 51-56.
23. M. S. MANASSE, L. A. MCGEOCH, AND D. D. SLEATOR, Competitive algorithms for on-line problems, J. Algorithms, 11 (1990), pp. 208-230.
24. H. MORAVEC, The Stanford cart and the CMU rover, Proc. IEEE, 71 (1983), pp. 872-874.
25. B. J. OOMEN, S. S. IYENGAR, N. S. V. RAO, AND R. L. KASHYAP, Robot navigation in unknown terrains using learned visibility graphs, part I: The disjoint convex obstacle case, IEEE J. Robotics Automation, 3 (1987), pp. 672-681.
26. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Shortest paths without a map, in Proc. 16th International Colloquium on Automata, Languages, and Programming, Springer-Verlag, Berlin, 1989, pp. 610-620.
27. N. S. V. RAO, Algorithmic framework for learned robot navigation in unknown terrains, IEEE Trans. Comput., 22 (1989), pp. 37-43.
28. N. S. V. RAO, S. S. IYENGAR, AND G. DESAUSSURE, The visit problem: visibility graph based solution, in Proc. IEEE International Conference on Robotics and Automation, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 1650-1655.
29. N. S. V. RAO, S. S. IYENGAR, B. J. OOMEN, AND R. L. KASHYAP, On terrain model acquisition by a point robot amid polyhedral obstacles, IEEE J. Robotics Automation, 4 (1988), pp. 450-455.
30. C. N. SHEN AND G. NAGY, Autonomous navigation to provide long distance surface traverses for Mars rover sample return mission, in Proc. IEEE International Symposium on Intelligent Control, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 362-367.
31. D. D. SLEATOR AND R. E. TARJAN, Amortized efficiency of list update and paging rules, Comm. Assoc. Comput. Mach., 28 (1985), pp. 202-208.
32. C.-K. YAP, Algorithmic motion planning, in Advances in Robotics, J. T. Schwartz and C. K. Yap, eds., Lawrence Erlbaum Associates, Hillsdale, NJ, 1987, pp. 95-144.