Efficient triangulation-based pathfinding

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 942-947

  Demyen, Douglas ^a   Buro, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MAPS; REAL TIME SYSTEMS; TRIANGULATION;

DELAUNAY TRIANGULATIONS; GRID-BASED MAPS; PATHFINDING;

ARTIFICIAL INTELLIGENCE;

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

References (6)

1. Botea, A.; Müller, M.; and Schaeffer, J. 2004. Near optimal hierarchical path-finding. J. of Game Develop. 1(1):7-28.
2. Hershberger, J., and Snoeyink, J. 1994. Computing minimum length paths of a given homotopy class. Computational Geometry Theory and Application 4:63-98.
3. Holte, R.; Perez, M.; Zimmer, R.; and MacDonald, A. 1996. Hierarchical A*: Searching abstraction hierarchies efficiently. In AAAI/IAAI Vol. 1, 530-535.
4. Kallmann, M.; Bieri, H.; and Thalmann, D. 2003. Fully dynamic constrained delaunay triangulations. In Geometric Modelling for Scientific Visualization. Springer-Verlag. 241-257.
5. Kallmann, M. 2005. Path planning in triangulations. In Proceedings of the IJCAI Workshop on Reasoning, Representation, and Learning in Computer Games, 49-54.
6. Sturtevant, N., and Buro, M. 2005. Partial pathfinding using map abstraction and refinement. AAA71392-1397.