Theta*: Any-angle path planning on grids

Journal of Artificial Intelligence Research

Volumn 39, Issue , 2010, Pages 533-579

  Daniel, Kenny ^a   Nash, Alex ^a   Koenig, Sven ^a   Felner, Ariel ^b  

^a University of Southern California   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PATH LENGTH; PATH-PLANNING; PATH-PLANNING ALGORITHM; RUNTIMES; SHORT-PATH; SHORTEST PATH; VIDEO GAME; WORST-CASE COMPLEXITY;

ALGORITHMS; LANDFORMS;

GRAPH THEORY;

EID: 78651423594     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2994     Document Type: Article

References (28)

1. Aurenhammer, F. (1991). Voronoi diagrams-a survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3), 345-405.
2. Botea, A., Müller, M., & Schaeffer, J. (2004). Near optimal hierarchical path-finding. Journal of Game Development, 1(1), 1-22.
3. Bresenham, J. (1965). Algorithm for computer control of a digital plotter. IBM Systems Journal, 4(1), 25-30.
4. Bulitko, V., Sturtevant, N., & Kazakevich, M. (2005). Speeding up learning in real-time search via automatic state abstraction. In Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1349-1354.
5. Choset, H., Lynch, K., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L., & Thrun, S. (2005). Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press.
6. Deloura, M. (2000). Game Programming Gems. Charles River Media.
7. Ferguson, D., & Stentz, A. (2006). Using interpolation to improve path planning: The Field D* algorithm. Journal of Field Robotics, 23(2), 79-101.
8. Foley, J., van Dam, A., Feiner, S., & Hughes, J. (1992). Computer Graphics: Principles and Practice. Addison-Wesley.
9. Hart, P., Nilsson, N., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, SCC-4(2), 100-107.
10. Kavraki, L., Svestka, P., Latombe, J., & Overmars, M. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4), 566-580.
11. Koenig, S., & Likhachev, M. (2002). D* Lite. In Proceedings of the AAAI Conference on Artificial Intelligence, pp. 476-483.
12. LaValle, S., & Kuffner, J. (2001). Rapidly-exploring random trees: Progress and prospects. In Donald, B., Lynch, K., & Rus, D. (Eds.), Algorithmic and Computational Robotics: New Directions, pp. 293-308. A K Peters.
13. Lee, D.-T. (1978). Proximity and reachability in the plane. Ph.D. thesis, University of Illinois at Urbana-Champaign.
14. Liu, Y.-H., & Arimoto, S. (1992). Path planning using a tangent graph for mobile robots among polygonal and curved obstacles. International Journal Robotics Research, 11(4), 376-382.
15. Lozano-Pérez, T., & Wesley, M. (1979). An algorithm for planning collision-free paths among polyhedral obstacles. Communication of the ACM, 22, 560-570.
16. Mitchell, J., & Papadimitriou, C. (1991). The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM, 38(1), 18-73.
17. Murphy, R. (2000). Introduction to AI Robotics. MIT Press.
18. Nash, A., Daniel, K., Koenig, S., & Felner, A. (2007). Theta*: Any-angle path planning on grids. In Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1177-1183.
19. Nash, A., Koenig, S., & Likhachev, M. (2009). Incremental Phi*: Incremental any-angle path planning on grids. In Proceedings of the International Joint Conference on Aritificial Intelligence, pp. 1824-1830.
20. Patel, A. (2000). Amit's Game Programming Information. available online at http://theory.stanford.edu/∼amitp/GameProgramming/MapRepresentations. html.
21. Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
22. Pohl, I. (1973). The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving. In Proceedings of the International Joint Conference on Artificial Intelligence, pp. 12-17.
23. Rabin, S. (2002). AI Game Programming Wisdom. Charles River Media.
24. Rabin, S. (2004). AI Game Programming Wisdom 2. Charles River Media.
25. Thorpe, C. (1984). Path relaxation: Path planning for a mobile robot. In Proceedings of the AAAI Conference on Artificial Intelligence, pp. 318-321.
26. Tozour, P. (2004). Search space representations. In Rabin, S. (Ed.), AI Game Programming Wisdom 2, pp. 85-102. Charles River Media.
27. Yahja, A., Stentz, A., Singh, S., & Brumitt, B. (1998). Framed-quadtree path planning for mobile robots operating in sparse environments. In Proceedings of the International Conference on Robotics and Automation, pp. 650-655.
28. Yap, P. (2002). Grid-based path-finding. In Proceedings of the Canadian Conference on Artificial Intelligence, pp. 44-55.