Improving collaborative pathfinding using map abstraction

Proceedings of the 2nd Artificial Intelligence and Interactive Digital Entertainment Conference, AIIDE 2006

Volumn , Issue , 2006, Pages 80-85

  Sturtevant, Nathan ^a   Buro, Michael ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PATH-FINDING ALGORITHMS; PATHFINDING; SPATIAL ABSTRACTIONS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; HUMAN COMPUTER INTERACTION;

DISTRIBUTED COMPUTER SYSTEMS;

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

References (7)

1. Bulitko, V.; Sturtevant, N.; and Kazakevich, M. 2005. Speeding up learning in real-time search via automatic state abstraction. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 1349-1354.
2. Erdmann, M., and Lozano-Perez, T. 1987. On multiple moving objects. Algorithmica 2:477-521.
3. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. on Systems Science and Cybern. 4:100-107.
4. Holte, R. C.; Mkadmi, T.; Zimmer, R. M.; and MacDonald, A. J. 1996. Speeding up problem solving by abstraction: A graph oriented approach. Artificial Intelligence 85(1- 2):321-361.
5. Hopcroft, J.; Schwartz, J.; and Sharir, M. 1984. On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the warehousemans problem. International Journal of Robotics Research 3(4):76- 88.
6. Silver, D. 2005. Collaborative pathfinding. In Proceedings of AIIDE, 23-28.
7. Sturtevant, N., and Buro, M. 2005. Partial pathfinding using map abstraction and refinement. In Proceedings of AAAI, 47-52.