Location of Repository

Dynamic real-time hierarchical heuristic search for pathfinding.

By Munir Naveed, Diane E. Kitchin and Andrew Crampton

Abstract

Movement of Units in Real-Time Strategy (RTS) Games is a non-trivial and challenging task mainly due to three factors which are constraints on CPU and memory usage, dynamicity of the game world, and concurrency. In this paper, we are focusing on finding a novel solution for solving the pathfinding problem in RTS Games for the units which are controlled by the computer. The novel solution combines two AI Planning approaches: Hierarchical Task Network (HTN) and Real-Time Heuristic Search (RHS). In the proposed solution, HTNs are used as a dynamic abstraction of the game map while RHS works as planning engine with interleaving of plan making and action executions. The article provides algorithmic details of the model while the empirical details of the model are obtained by using a real-time strategy game engine called ORTS (Open Real-time Strategy). The implementation of the model and its evaluation methods are in progress however the results of the automatic HTN creation are obtained for a small scale game map

Topics: T1
Publisher: University of Huddersfield
Year: 2009
OAI identifier: oai:eprints.hud.ac.uk:6885

Suggested articles

Preview

Citations

  1. (2004). Automated Theory: Planning and Practice. doi
  2. (2008). Dynamic Control in Real-Time Heuristic Search.
  3. (2007). Graph Abstraction in Real-time Heuristic Search. doi
  4. (2006). Learning in real time search. doi
  5. (2004). Near Optimal Hierarchical Path-Finding.
  6. (2005). On the Development of a Free RTS Game Engine.
  7. (2005). Partial Pathfinding Using Map Abstraction and Refinement.
  8. (1990). Real-time heuristic search. doi
  9. (1996). Smart Moves: Intelligent Pathfinding. Game Developer Magazine.
  10. (2006). Three States and a Plan: The A.I. of F.E.A.R.
  11. (1993). Time-Saving tips for problem solving with incomplete information.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.