Naveed, Munir, Kitchin, Diane E. and Crampton, Andrew (2009) Dynamic real-time hierarchical heuristic search for pathfinding. In: Proceedings of Computing and Engineering Annual Researchers' Conference 2009: CEARC’09. University of Huddersfield, Huddersfield, pp. 153-158. ISBN 9781862180857
26_M_Naveed.pdf - Published Version
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.
Downloads per month over past year
Repository Staff Only: item control page