Efficient optimal search of uniform-cost grids and lattices

2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

Volumn 2, Issue , 2004, Pages 1946-1951

  Kuffner, James J ^a,b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; DYNAMIC PROGRAMMING; GRAPH THEORY; MOTION PLANNING; NAVIGATION; OPTIMIZATION;

EUCLIDEAN-COST GRIDS; GRID LOCATIONS; GRID SEARCH; ROBOT NAVIGATION;

ROBOTICS;

EID: 14044276986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. S. M. LaValle and M. S. Branicky, "On the relationship between classical grid search and probabilistic roadmaps," in Proc. Workshop on the Algorithmic Foundations of Robotics, Dec. 2002.
2. J. Kuffner, "Autonomous agents for real-time animation," Ph.D. dissertation, Stanford University, Stanford, CA, Dec. 1999.
3. J. C. Latombe, Robot Motion Planning. Boston, MA: Kluwer Academic Publishers, 1991.
4. J. H. Reif, "Complexity of the mover's problem and generalizations," in Proc. 20th IEEE Symp. on Foundations of Computer Science (FOCS), 1979, pp. 421-427.
5. J. T. Schwartz and M. Sharir, "On the 'piano movers' problem: II. general techniques for computing topological properties of real algebraic manifolds," Advances in applied Mathematics, vol. 4, pp. 298-351, 1983.
6. J. Canny, The Complexity of Robot Motion Planning. Cambridge, MA: MIT Press, 1988.
7. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
8. P. Hart, N. Nilsson, and B. Rafael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Sys. Sci. and Cyb., vol. 4, pp. 100-107, 1968.
9. R. E. Bellman, Dynamic Programming. Princeton, New Jersey: Princeton University Press, 1957.
10. D. Gelperin, "On the optimality of A*," Artif. Intell., vol. 8, no. 1, pp. 69-76, 1977.
11. M. Henzinger, P. Klein, and S. Rao, "Faster shortest-path algorithms for planar graphs," J. Comput. Syst. Sci, vol. 55, pp. 3-23, 1997.
12. A. Stentz, "Optimal and efficient path planning for unknown and dynamic environments," Int. Journal of Robotics and Automation, vol. 10, no. 3, 1995.
13. J. Mitchell, Handbook of Computational Geometry. Elsevier Science, 1998, ch. Geometric Shortest Paths and Network Optimization.