Abstract
Real-time heuristic search algorithms are useful when the amount of time or memory resources are limited or a rapid response time is required. An example of such a problem is pathfinding in video games where numerous units may be simultaneously required to react promptly to player’s commands. Classic real-time heuristic search algorithms cannot be deployed due to their obvious state-revisitation (“scrubbing”). Recent algorithms have improved performance by using a database of pre-computed subgoals. However, a common issue is that the pre-computation time can be large, and there is no guarantee that the pre-computed data adequately covers the search space. In this work, we present a new approach that guarantees coverage by abstracting the search space using the same algorithm that performs the real-time search. It reduces the pre-computation time via the use of dynamic programming. The new approach has a fast move time and eliminates learning and “scrubbing”. Experimental results on maps of millions of cells show significantly faster execution times compared to previous algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Björnsson, Y., Bulitko, V., Sturtevant, N.: TBA*: Time-bounded A*. In: IJCAI, pp. 431–436 (2009)
Bulitko, V., Björnsson, Y.: kNN LRTA*: Simple subgoaling for real-time search. In: AIIDE, pp. 2–7 (2009)
Bulitko, V., Luštrek, M., Schaeffer, J., Björnsson, Y., Sigmundarson, S.: Dynamic control in real-time heuristic search. JAIR 32, 419–452 (2008)
Floyd, R.W.: Algorithm 97: Shortest path. Communications of the ACM 6(5), 345 (1962)
Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. on Sys. Sci. and Cybernetics 4(2), 100–107 (1968)
Korf, R.: Depth-first iterative deepening: An optimal admissible tree search. AI 27(3), 97–109 (1985)
Korf, R.: Real-time heuristic search. AIJ 42(2-3), 189–211 (1990)
Shimbo, M., Ishida, T.: Controlling the learning process of real-time heuristic search. AI 146(1), 1–41 (2003)
Sturtevant, N.: Memory-efficient abstractions for pathfinding. In: AIIDE, pp. 31–36 (2007)
Sturtevant, N., Buro, M.: Partial pathfinding using map abstraction and refinement. In: AAAI, pp. 1392–1397 (2005)
Sturtevant, N.R., Felner, A., Barrer, M., Schaeffer, J., Burch, N.: Memory-based heuristics for explicit state spaces. In: IJCAI, pp. 609–614 (2009)
Warshall, S.: A theorem on boolean matrices. J. ACM 1(9), 11–12 (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lawrence, R., Bulitko, V. (2010). Taking Learning Out of Real-Time Heuristic Search for Video-Game Pathfinding. In: Li, J. (eds) AI 2010: Advances in Artificial Intelligence. AI 2010. Lecture Notes in Computer Science(), vol 6464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17432-2_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-17432-2_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17431-5
Online ISBN: 978-3-642-17432-2
eBook Packages: Computer ScienceComputer Science (R0)