A Hierarchical Task Network Planner for Pathfinding in Real-Time Strategy Games
نویسندگان
چکیده
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.
منابع مشابه
Dynamic Real-time Hierarchical Heuristic Search for Pathfinding
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 combin...
متن کاملMonte-Carlo Planning for Pathfinding in Real-Time Strategy Games
In this work, we explore two Monte-Carlo planning approaches: Upper Confidence Tree (UCT) and Rapidlyexploring Random Tree (RRT). These Monte-Carlo planning approaches are applied in a real-time strategy game for solving the path finding problem. The planners are evaluated using a grid-based representation of our game world. The results show that the UCT planner solves the path planning problem...
متن کاملAutomated planning for pathfinding in real-time strategy games
This thesis is focused on the design of a new path planning algorithm to solve path planning problems in dynamic, partially observable and real-time environments such as Real-Time Strategy (RTS) games. The emphasis is put on fast action selection motivating the use of Monte-Carlo planning techniques. Three main contributions are presented in this thesis. The first contribution is a Monte-Carlo ...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملSHPE: HTN Planning for Video Games
This article describes SHPE (Simple Hierarchical Planning Engine), a hierarchical task network planning system designed to generate dynamic behaviours for real-time video games. SHPE is based on a combination of domain compilation and procedural task application/decomposition techniques in order to compute plans in a very short time-frame. The planner has been able to return relevant plans in l...
متن کامل