Fast replanning for navigation in unknown terrain

IEEE Transactions on Robotics

Volumn 21, Issue 3, 2005, Pages 354-363

  Koenig, Sven ^a   Likhachev, Maxim ^b  

^a University of Southern California ^*  (United States)

^b Carnegie Mellon University   (United States)

Author keywords

A*; D* (Dynamic A*); Navigation in unknown terrain; Planning with the freespace assumption; Replanning; Search; Sensor based path planning

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; MOBILE ROBOTS; NAVIGATION;

REPLANNING; SENSOR BASED PATH PLANNING; UNKNOWN TERRAIN;

MOTION PLANNING;

EID: 20844432827     PISSN: 15523098     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRO.2004.838026     Document Type: Article

References (46)

1. V. Lumelsky and A. Stepanov, "Path planning strategies for point automaton moving amidst unknown obstacles of arbitrary shape," Algorithmica, vol. 2, pp. 403-430, 1987.
2. H. Choset and J. Burdick, "Sensor based planning and nonsmooth analysis," in Proc. Int. Conf. Robot. Autom., 1994, pp. 3034-3041.
3. H. Choset and J. Burdick,, "Sensor-based planning, part I: incremental construction of the generalized Voronoi graph," in Proc. Int. Conf. Robot. Autom., 1995, pp. 1643-1649.
4. A. Stentz, "Optimal and efficient path planning for partially-known environments," in Proc. Int. Conf. Robot. Autom., 1994, pp. 3310-3317.
5. A. Stentz, "The focussed D* algorithm for real-time replanning," in Proc. Int. Joint Conf. Artificial Intell., 1995, pp. 1652-1659.
6. R. Korf, "Real-time heuristic search," Artificial Intell., vol. 42, no. 2-3, pp. 189-211, 1990.
7. J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving. Reading, MA: Addison-Wesley, 1985.
8. S. Koenig et al., "Greedy mapping of terrain," in Proc. Int. Conf. Robot. Autom., 2001, pp. 3594-3599.
9. A. Stentz and M. Hebert, "A complete navigation system for goal acquisition in unknown environments," Autonomous Robots, vol. 2, no. 2, pp. 127-145, 1995.
10. M. Hebert et al., "Experiments with driving modes for urban robots," in Proc. SPIE Mobile Robots, 1999, pp. 140-149.
11. L. Matthies et al., "A portable, autonomous, urban reconnaissance robot," Robotics Auton. Syst,, vol. 40, no. 2, pp. 163-172, 2000.
12. S. Thayer et al., "Distributed robotic mapping of extreme environments," in Proc. SPIE: Mobile Robots XV and Telemanipulator and Telepresence Technologies VII, vol. 4195, 2000, pp. 84-95.
13. B. Brumitt and A. Stentz, "GRAMMPS: a generalized mission planner for multiple mobile robots," in Proc. Int. Conf. Robot. Autom., 1998, pp. 1564-1571.
14. M. Likhachev and S. Koenig, "Incremental replanning for mapping," in Proc. Int. Conf. Intell. Robot. Syst., 2002, pp. 6674572.
15. M. Likhachev and S. Koenig, "Speeding up the parti-game algorithm," in Advances in Neural Information Processing Systems 15, S. Becker, S. Thrun, and K. Obermayer, Eds. Cambridge, MA: MIT Press, 2002.
16. A. Moore and C. Atkeson, "The parti-game algorithm for variable resolution reinforcement learning in multidimensional state-spaces," Machine Learning, vol. 21, no. 3, pp. 199-233, 1995.
17. S. Koenig and M. Likhachev, "Incremental A*," in Advances in Neural Information Processing Systems 14, T. Dietterich, S. Becker, and Z. Ghahramani, Eds. Cambridge, MA: MIT Press, 2002.
18. G. Ramalingam and T. Reps, "An incremental algorithm for a generalization of the shortest-path problem," J. Algorithms, vol. 21, pp. 267-305, 1996.
19. D. Frigioni et al., "Fully dynamic algorithms for maintaining shortest paths trees," J. Algorithms, vol. 34, no. 2, pp. 251-281, 2000.
20. S. Koenig et al., "Lifelong planning A*," Artificial Intell. J., vol. 155, pp. 93-146, 2004.
21. S. Koenig and M. Likhachev, "Improved fast replanning for robot navigation in unknown terrain," Coll. Comput., Georgia Inst. Technol., Atlanta, GA, Tech. Rep. GIT-COGSCI-2002/3, 2001.
22. S. Koenig and M. Likhachev, "Improved fast replanning for robot navigation in unknown terrain," in Proc. Int. Conf. Robot. Autom., 2002, pp. 968-975.
23. A. Stentz, "Map-based strategies for robot navigation in unknown environments," in Proc. AAAI Spring Symp. Planning With Incomplete Information for Robot Problems, 1996, pp. 110-116.
24. J.-C. Latombe, Robot Motion Planning. Norwell, MA: Kluwer, 1991.
25. T. Ersson and X. Hu, "Path planning and navigation of mobile robots in unknown environments," in Proc. Int. Conf. Intell. Robot. Syst., 2001, pp. 858-864.
26. M. Tao et al., "Optimal route re-planning for mobile robots: a massively parallel incremental A* algorithm," in Int. Conf. Robot. Autom., 1997, pp. 2727-2732.
27. G. Ramalingam and T. Reps, "On the computational complexity of dynamic graph problems," Theoretical Compu. Sci., vol. 158, no. 1-2, pp. 233-277, 1996.
28. G. Ausiello et al., "Incremental algorithms for minimal length paths," J. Algorithms, vol. 12, no. 4, pp. 6154538, 1991.
29. S. Even and Y. Shiloach, "An on-line edge deletion problem," J. ACM, vol. 28, no. 1, pp. 1-4, 1981.
30. S. Even and H. Gazit, "Updating distances in dynamic graphs," Meth. Oper. Res., vol. 49, pp. 371-387, 1985.
31. E. Feuerstein and A. Marchetti-Spaccamela, "Dynamic algorithms for shortest paths in planar graphs," Theoretical Comput. Sci., vol. 116, no. 2, pp. 359-371, 1993.
32. P. Franciosa, D. Frigioni, and R. Giaccio, "Semi-dynamic breadth-first search in digraphs," Theoretical Comput. Sci., vol. 250, no. 1-2, pp. 201-217, 2001.
33. D. Frigioni et al., "Fully dynamic output bounded single source shortest path problem," in Proc. Symp. Discrete Algorithms, 1996, pp. 212-221.
34. S. Goto and A. Sangiovanni-Vincentelli, "A new shortest path updating algorithm," Networks, vol. 8, no. 4, pp. 341-372, 1978.
35. G. Italiano, "Finding paths and deleting edges in directed acyclic graphs," Inform. Process. Lett., vol. 28, no. 1, pp. 5-11, 1988.
36. P. Klein and S. Subramanian, "Fully dynamic approximation schemes for shortest path problems in planar graphs," in Proc. Int. Workshop on Algorithms and Data Structures, 1993, pp. 443-451.
37. C. Lin and R. Chang, "On the dynamic shortest path problem," J. Inform. Process., vol. 13, no. 4, pp. 470476, 1990.
38. H. Rohnert, "A dynamization of the all pairs least cost path problem," in Proc. Symp. Theoretical Aspects of Computer Science, 1985, pp. 279-286.
39. P. Spira and A. Pan, "On finding and updating spanning trees and shortest paths," SIAM J. Comput., vol. 4, pp. 375-380, 1975.
40. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni, "Semidynamic algorithms for maintaining single source shortest path trees," Algorithmica, vol. 22, no. 3, pp. 250-274, 1998.
41. V. King, "Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs," in Proc. Symp. Foundations of Computer Science, 1999, pp. 81-89.
42. C. Demeterscu and G. Italiano, "Fully dynamic all pairs shortest paths with real edge weights," in Proc. Symp. Foundations of Computer Science, 2001, pp. 260-268.
43. M. Barbehenn and S. Hutchinson, "Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees," IEEE Trans. Robot. Autom., vol. 11, no. 2, pp. 198-214, Feb. 1995.
44. D. Frigioni, M. Iofredda, U. Nanni, and G. Pasqualone, "Experimental analysis of dynamic algorithms for the single source shortest path problem," ACM J. Experimental Algorithmics, vol. 3, no. 5, 1998.
45. K. Trovato, "Differential A*: an adaptive search method illustrated with robot path planning for moving obstacles and goals, and an uncertain environment," J. Pattern Recognit. Artificial Intell., vol. 4, no. 2, pp. 245-268, 1990.
46. L. Podsedkowski, J. Nowakowski, M. Idzikowski, and I. Vizvary, "A new solution for path planning in partially known or unknown environment for nonholonomic mobile robots," Robot. Autonomous Syst., vol. 34, pp. 145-152, 2001.