Performance bounds for planning in unknown terrain

Artificial Intelligence

Volumn 147, Issue 1-2, 2003, Pages 253-279

  Koenig, Sven ^a   Tovey, Craig ^a   Smirnov, Yuri ^b  

^a Georgia Institute of Technology   (United States)

^b Akonite   (United States)

Author keywords

Agent centered search; Assumption based planning; Dynamic A* (D*); Graph algorithms; Greedy mapping; Mobile robotics; On line graph search; Planning with incomplete information; Robot navigation; Worst case analysis

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; INTELLIGENT AGENTS; MAPPING; MOBILE ROBOTS; PLANNING;

ROBOT NAVIGATION;

ARTIFICIAL INTELLIGENCE;

EID: 0037503155     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(03)00062-6     Document Type: Article

References (64)

1. Nourbakhsh I. Interleaving Planning and Execution for Autonomous Robots. 1997;Kluwer Academic, Dordrecht.
2. Koenig S. Agent-centered search. Artificial Intelligence Magazine. 22:(4):2001;109-131.
3. Ishida T. Moving target search with intelligence. Proceedings of AAAI-92, San Jose, CA. 1992;525-532.
4. Russell S., Wefald E. Do the Right Thing - Studies in Limited Rationality. 1991;MIT Press, Cambridge, MA.
5. Koenig S., Simmons R. Xavier: A robot navigation architecture based on partially observable Markov decision process models. Kortenkamp D., Bonasso R., Murphy R. Artificial Intelligence Based Mobile Robotics: Case Studies of Successful Robot Systems. 1998;91-122 MIT Press, Cambridge, MA.
6. Alami R., Fleury S., Herrb M., Ingrand F., Robert F. Multi-robot cooperation in the MARTHA project. IEEE Robot. Automat. Magazine. 5:(1):1998;36-47.
7. Muscettola N., Nayak P., Pell B., Williams B. Remote agent: To boldly go where no AI system has gone before. Artificial Intelligence. 103:(1-2):1998;5-47.
8. Thrun S., Bennewitz M., Burgard W., Cremers A., Dellaert F., Fox D., Haehnel D., Rosenberg C., Roy N., Schulte J., Schulz D. MINERVA: A second generation mobile tour-guide robot. Proceedings of the International Conference on Robotics and Automation, Detroit, MI. 1999;1999-2005.
9. Lumelsky V. Algorithmic and complexity issues of robot motion in an uncertain environment. J. Complexity. 3:1987;146-182.
10. Thrun S. Probabilistic algorithms in robotics. Artificial Intelligence Magazine. 21:(4):2000;93-109.
11. Koenig S., Tovey C., Halliburton W. Greedy mapping of terrain. Proceedings of the International Conference on Robotics and Automation, Seoul, Korea. 2001;3594-3599.
12. Stentz A. Optimal and efficient path planning for partially-known environments. Proceedings of the International Conference on Robotics and Automation, San Diego, CA. 1994;3310-3317.
13. Stentz A. The focussed D* algorithm for real-time replanning. Proceedings of IJCAI-95, Montreal, Quebec. 1995;1652-1659.
14. Stentz A. Optimal and efficient path planning for unknown and dynamic environments. Internat. J. Robotics and Automation. 10:(3):1995;89-100.
15. Cormen T., Leiserson C., Rivest R. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
16. Stentz A. Best information planning for unknown, uncertain, and changing domains. Koenig S., Blum A., Ishida T., Korf R. Proceedings of the AAAI Workshop on On-Line Search, Providence, RI. 1997;110-113. available as AAAI Technical Report WS-97-10.
17. H. Choset, Sensor-based motion planning: The hierarchical generalized Voronoi graph, Ph.D. Thesis, California Institute of Technology, Pasadena, CA, 1996.
18. Leonard J., Durrant-Whyte H., Cox I. Dynamic map building for an autonomous mobile robot. Internat. J. Robot. Res. 11:(4):1992;286-298.
19. Dudek G., Jenkin M., Milios E., Wilkes D. Robotic exploration as graph construction. IEEE Trans. Robotics and Automation. 7:(6):1991;859-865.
20. Kuipers B., Byun Y. A robust, qualitative method for robot spatial learning. Proceedings of AAAI-88, St. Paul, MN. 1988;774-779.
21. de Almeida R., Melin C. Exploration of unknown environments by a mobile robot. Intelligent Autonomous Systems. 2:1989;715-725.
22. Choo C., Smith J., Nasrabadi N. An efficient terrain acquisition algorithm for a mobile robot. Proceedings of the International Conference on Robotics and Automation, Sacramento, CA. 1991;306-311.
23. Dudek G., Freedman P., Hadjres S. Using local information in a non-local way for mapping graph-like worlds. Proceedings of IJCAI-93, Chambéry, France. 1993;1639-1647.
24. Oriolo G., Ulivi G., Vendittelli M. Real-time map building and navigation for autonomous robots in unknown environments. IEEE Trans. Systems Man Cybernet. 28:(3):1998;316-333.
25. Rao N. Algorithmic framework for learned robot navigation in unknown terrains. IEEE Computer. 22:(6):1989;37-43.
26. Albers S., Henzinger M. Exploring unknown environments. SIAM J. Comput. 29:(4):2000;1164-1188.
27. Deng X., Papadimitriou C. Exploring an unknown graph. Proceedings of the Symposium on Foundations of Computer Science. 1990;355-361.
28. Kwek S. On a simple depth-first search strategy for exploring unknown graphs. Proceedings of the Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science. 1272:1997;345-353 Springer, Berlin.
29. Rao N. Robot navigation in unknown generalized polygonal terrains using vision sensors. IEEE Trans. Systems Man Cybernet. 25:(6):1995;947-962.
30. Prasad L., Iyengar S. A note on the combinatorial structure of the visibility graph in simple polygons. Theoret. Comput. Sci. 140:(2):1995;249-263.
31. Awerbuch B., Betke M., Rivest R., Singh M. Piecemeal graph exploration by a mobile robot. Inform. and Comput. 152:(2):1999;155-172.
32. Panaite P., Pelc A. Exploring unknown undirected graphs. J. Algorithms. 33:(2):1999;281-295.
33. Papadimitriou C., Yannakakis M. Shortest paths without a map. Theoret. Comput. Sci. 84:(1):1991;127-150.
34. N. Rao, S. Hareti, W. Shi, S. Iyengar, Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms, Technical Report ORNL/TM-12410, Oak Ridge National Laboratory, Oak Ridge, TN, 1993.
35. Choset H., Burdick J. Sensor based planning and nonsmooth analysis. Proceedings of the International Conference on Robotics and Automation, San Diego, CA. 1994;3034-3041.
36. Thrun S., Bücken A., Burgard W., Fox D., Fröhlinghaus T., Hennig D., Hofmann T., Krell M., Schmidt T. Map learning and high-speed navigation in RHINO. Kortenkamp D., Bonasso R., Murphy R. Artificial Intelligence Based Mobile Robotics: Case Studies of Successful Robot Systems. 1998;21-52 MIT Press, Cambridge, MA.
37. Likhachev M., Koenig S. Incremental replanning for mapping. Proceedings of the International Conference on Intelligent Robots and Systems, Lausanne, Switzerland. 2002;667-672.
38. Romero L., Morales E., Sucar E. An exploration and navigation approach for indoor mobile robots considering sensor's perceptual limitations. Proceedings of the International Conference on Robotics and Automation, Seoul, Korea. 2001;3092-3097.
39. Zelinsky A. A mobile robot exploration algorithm. IEEE Trans. Robotics and Automation. 8:(6):1992;707-717.
40. Foux G., Heymann M., Bruckstein A. Two-dimensional robot navigation among unknown stationary polygonal obstacles. IEEE Trans. Robotics and Automation. 9:(1):1993;96-102.
41. Nourbakhsh I., Genesereth M. Assumptive planning and execution: A simple, working robot architecture. Autonomous Robots. 3:(1):1996;49-67.
42. Koenig S., Likhachev M. D* lite. Proceedings of AAAI-2002, Edmonton, AB. 2002;476-483.
43. Pearl J. Heuristics: Intelligent Search Strategies for Computer Problem Solving. 1985;Addison-Wesley, Reading, MA.
44. Stentz A., Hebert M. A complete navigation system for goal acquisition in unknown environments. Autonomous Robots. 2:(2):1995;127-145.
45. Hebert M., MacLachlan R., Chang P. Experiments with driving modes for urban robots. Proceedings of the SPIE Mobile Robots. 1999;140-149.
46. Matthies L., Xiong Y., Hogg R., Zhu D., Rankin A., Kennedy B., Hebert M., Maclachlan R., Won C., Frost T., Sukhatme G., McHenry M., Goldberg S. A portable, autonomous, urban reconnaissance robot. Robotics and Autonomous Systems. 40:(2-3):2002;163-172.
47. Thayer S., Digney B., Diaz M., Stentz A., Nabbe B., Hebert M. Distributed Robotic Mapping of Extreme Environments. Proceedings of the SPIE: Mobile Robots XV and Telemanipulator and Telepresence Technologies VII. 4195:2000.
48. Brumitt B., Stentz A. GRAMMPS: A generalized mission planner for multiple mobile robots. Proceedings of the International Conference on Robotics and Automation, Leuven, Belgium. 1998;1564-1571.
49. Koenig S. Exploring unknown environments with real-time search or reinforcement learning. Advances in Neural Information Processing Systems 12. 11:1999;1003-1009.
50. Koenig S., Smirnov Y. Graph learning with a nearest neighbor approach. Proceedings of the Conference on Computational Learning Theory. 1996;19-28.
51. Wagner I., Lindenbaum M., Bruckstein A. Distributed covering by ant-robots using evaporating traces. IEEE Trans. Robotics and Automation. 15:(5):1999;918-933.
52. Carlsson S., Jonsson H. Computing a shortest watchman path in a simple polygon in polynomial time. Akl S., Dehne F., Sack J., Santoro N. Proceedings of the Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science. 955:1995;122-134 Springer, Berlin.
53. Chin W., Ntafos S. Shortest watchman routes in simple polygons. Discrete Comput. Geom. 6:1991;9-31.
54. Tan X., Hirata T. Constructing shortest watchman routes by divide-and-conquer. Ng K., Raghavan P., Balasubramanian N., Chin F. Proceedings of the International Symposium on Algorithms and Computation. Lecture Notes in Computer Science. 762:1993;68-77 Springer, Berlin.
55. Ntafos S. Watchman routes under limited visibility. Proceedings of the Canadian Conference on Computational Geometry. 1990;89-92.
56. Deng X., Kameda T., Papadimitriou C. How to learn an unknown environment I: The rectilinear case. J. ACM. 45:(2):1998;215-245.
57. Hoffman F., Icking C., Klein R., Kriegel K. A competitive strategy for learning a polygon. Proceedings of the Symposium on Discrete Algorithms. 1997;166-174.
58. Lumelsky V., Stepanov A. Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica. 2:1987;403-430.
59. Reif J. Complexity of the mover's problem and generalizations. Proceedings of the Symposium on Foundations of Computer Science. 1979;421-427.
60. Blum A., Raghavan P., Schieber B. Navigating in unfamiliar geometric terrain. SIAM J. Comput. 26:(1):1997;110-137.
61. Icking C., Klein R., Langetepe E. An optimal competitive strategy for walking in streets. Meinel C., Tison S. Proceedings of the Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science. 1563:1999;110-120 Springer, Berlin.
62. Lumelsky V., Stepanov A. Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica. 2:1987;403-430.
63. Koenig S., Simmons R. Real-time search in non-deterministic domains. Proceedings of IJCAI-95, Montreal, Quebec. 1995;1660-1667.
64. Koenig S., Smirnov Y. Sensor planning with the freespace assumption. Proceedings of the International Conference on Robotics and Automation, Albuquerque, NM. 1997;3540-3545.