DFU.Vol6.12191.21.pdf
- Filesize: 366 kB
- 11 pages
Document
Pathfinding in Games
Authors
-
Part of:
Volume:
Artificial and Computational Intelligence in Games (DFU - Vol. 6)
Series: Dagstuhl Follow-Ups (DFU) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2013-11-18
Cite AsGet BibTex
Adi Botea, Bruno Bouzy, Michael Buro, Christian Bauckhage, and Dana Nau. Pathfinding in Games. In Artificial and Computational Intelligence in Games. Dagstuhl Follow-Ups, Volume 6, pp. 21-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/DFU.Vol6.12191.21
https://doi.org/10.4230/DFU.Vol6.12191.21
Abstract
Commercial games can be an excellent testbed to artificial intelligence (AI) research, being a middle ground between synthetic, highly abstracted academic benchmarks, and more intricate problems from real life. Among the many AI techniques and problems relevant to games, such as learning, planning, and natural language processing, pathfinding stands out as one of the most common applications of AI research to games. In this document we survey recent work in pathfinding in games. Then we identify some challenges and potential directions for future work. This chapter summarizes the discussions held in the pathfinding workgroup.
Keywords
- path finding
- search
- games
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads