Where do we go now? Anytime algorithms for path planning

Document type: Conference Papers
Peer reviewed: Yes
Author(s): Rehman Butt, Stefan J. Johansson
Title: Where do we go now? Anytime algorithms for path planning
Conference name: 4th International Conference on the Foundations of Digital Games, ICFDG
Year: 2009
Pagination: 248-255
ISBN: 978-160558437-9
City: Orlando
URI/DOI: 10.1145/1536513.1536558
Organization: Blekinge Institute of Technology
Department: School of Computing (Sektionen för datavetenskap och kommunikation)
School of Computing S-371 79 Karlskrona
+46 455 38 50 00
Language: English
Abstract: Commercial computer games has become one of the largest industries in the area of entertainment. Real Time Strategy (Rts) based games is one of the most important among different types of computer games and is also considered to be a good research platform within Artificial Intelligence (Ai). There exists a number of algorithms that can deal with the Ai related problems of this domain, e.g. the ones of getting as cheap or fast as possible from one point to another (i.e. path planning). However most of the algorithms used in academia are better suited for problems that do not need to be solved within tight time frames. Anytime algorithms (Aa) are algorithms that can be stopped at any point in time and yet come up with a preliminary solution. We believe that by making algorithms anytime, we can optimize their behaviors to better suit the Rts domain. This study will introduce a tool for evaluating path planning algorithms and compare the performances of A*, Recursive Best First Search (Rbfs), Potential Fields (Pf) and their anytime versions for the path planning problem.