A hierarchical task network planner for pathfinding in real-time strategy games

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we propose an automatic mechanism of Hierarchical Task Networks (HTNs) creation for solving the problem of real-time path planning in Real-Time Strategy (RTS) Games. HTNs are created using an abstraction of the game map. A real-time heuristic search approach called Learning Real-Time A* (LRTA) is applied to execute the primitive tasks of the HTNs. The main purpose of using a HTN based real-time path planner is to restrict the real-time search to a shorter part of the problem space while keeping it in the direction of the actual goal position. Results show that the hierarchical approach reduces the suboptimality of the LRTA and speeds up the convergence process.

LanguageEnglish
Title of host publicationProceedings of the 3rd International Symposium on AI and Games - A Symposium at the AISB 2010 Convention
Pages1-7
Number of pages7
Publication statusPublished - 2010
Event3rd International Symposium on Artificial Intelligence and Games - A Symposium at the AISB 2010 Convention - Leicester, United Kingdom
Duration: 29 Mar 20101 Apr 2010
Conference number: 3

Conference

Conference3rd International Symposium on Artificial Intelligence and Games - A Symposium at the AISB 2010 Convention
CountryUnited Kingdom
CityLeicester
Period29/03/101/04/10

Fingerprint

Motion planning

Cite this

Naveed, M., Kitchin, D., & Crampton, A. (2010). A hierarchical task network planner for pathfinding in real-time strategy games. In Proceedings of the 3rd International Symposium on AI and Games - A Symposium at the AISB 2010 Convention (pp. 1-7)
Naveed, Munir ; Kitchin, Diane ; Crampton, Andrew. / A hierarchical task network planner for pathfinding in real-time strategy games. Proceedings of the 3rd International Symposium on AI and Games - A Symposium at the AISB 2010 Convention. 2010. pp. 1-7
@inproceedings{ee9d600d93124bcf8e2a35ed952e0070,
title = "A hierarchical task network planner for pathfinding in real-time strategy games",
abstract = "In this paper, we propose an automatic mechanism of Hierarchical Task Networks (HTNs) creation for solving the problem of real-time path planning in Real-Time Strategy (RTS) Games. HTNs are created using an abstraction of the game map. A real-time heuristic search approach called Learning Real-Time A* (LRTA) is applied to execute the primitive tasks of the HTNs. The main purpose of using a HTN based real-time path planner is to restrict the real-time search to a shorter part of the problem space while keeping it in the direction of the actual goal position. Results show that the hierarchical approach reduces the suboptimality of the LRTA and speeds up the convergence process.",
author = "Munir Naveed and Diane Kitchin and Andrew Crampton",
year = "2010",
language = "English",
isbn = "1902956907",
pages = "1--7",
booktitle = "Proceedings of the 3rd International Symposium on AI and Games - A Symposium at the AISB 2010 Convention",

}

Naveed, M, Kitchin, D & Crampton, A 2010, A hierarchical task network planner for pathfinding in real-time strategy games. in Proceedings of the 3rd International Symposium on AI and Games - A Symposium at the AISB 2010 Convention. pp. 1-7, 3rd International Symposium on Artificial Intelligence and Games - A Symposium at the AISB 2010 Convention, Leicester, United Kingdom, 29/03/10.

A hierarchical task network planner for pathfinding in real-time strategy games. / Naveed, Munir; Kitchin, Diane; Crampton, Andrew.

Proceedings of the 3rd International Symposium on AI and Games - A Symposium at the AISB 2010 Convention. 2010. p. 1-7.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A hierarchical task network planner for pathfinding in real-time strategy games

AU - Naveed, Munir

AU - Kitchin, Diane

AU - Crampton, Andrew

PY - 2010

Y1 - 2010

N2 - In this paper, we propose an automatic mechanism of Hierarchical Task Networks (HTNs) creation for solving the problem of real-time path planning in Real-Time Strategy (RTS) Games. HTNs are created using an abstraction of the game map. A real-time heuristic search approach called Learning Real-Time A* (LRTA) is applied to execute the primitive tasks of the HTNs. The main purpose of using a HTN based real-time path planner is to restrict the real-time search to a shorter part of the problem space while keeping it in the direction of the actual goal position. Results show that the hierarchical approach reduces the suboptimality of the LRTA and speeds up the convergence process.

AB - In this paper, we propose an automatic mechanism of Hierarchical Task Networks (HTNs) creation for solving the problem of real-time path planning in Real-Time Strategy (RTS) Games. HTNs are created using an abstraction of the game map. A real-time heuristic search approach called Learning Real-Time A* (LRTA) is applied to execute the primitive tasks of the HTNs. The main purpose of using a HTN based real-time path planner is to restrict the real-time search to a shorter part of the problem space while keeping it in the direction of the actual goal position. Results show that the hierarchical approach reduces the suboptimality of the LRTA and speeds up the convergence process.

UR - http://www.scopus.com/inward/record.url?scp=84863008511&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1902956907

SN - 9781902956909

SP - 1

EP - 7

BT - Proceedings of the 3rd International Symposium on AI and Games - A Symposium at the AISB 2010 Convention

ER -

Naveed M, Kitchin D, Crampton A. A hierarchical task network planner for pathfinding in real-time strategy games. In Proceedings of the 3rd International Symposium on AI and Games - A Symposium at the AISB 2010 Convention. 2010. p. 1-7