Player-Traced Empirical Cost-Surfaces for A* Pathfinding

This paper discusses the use of empirical cost-surfaces derived from substantial amounts of player-traced movements in an online vehicular combat game, for the purposes of improving A* pathfinding by AI vehicles. The fundamental concept is that we derive navigational meshes from human-player movements, with each node weighted by frequency of use. Our goals include the improvement of path travel times, aesthetic improvements, and the reduction of damage sustained while travelling across the map. The results presented include quantifiable timings and observational characteristics. Quantifiable improvements include both algorithmic efficiency and travel time efficiency, while observations include the improved ability to avoid risky terrain features as well as other subtle human-like behaviours. A best-performing non-linear cost function for the A* algorithm, based on player data, is suggested. Continued and future work on the AI in the game is discussed.

[1]  Ruck Thawonmas,et al.  Comparison of User Trajectories Based on Coordinate Data and State Transitions , 2009, 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing.

[2]  Ron Coleman Long Memory of Pathfinding Aesthetics , 2009, Int. J. Comput. Games Technol..

[3]  Edmond C. Prakash,et al.  Strategic Team AI Path Plans: Probabilistic Pathfinding , 2008, Int. J. Comput. Games Technol..

[4]  Sam Redfern Evolving Racetrack Knowledge in a Racing Game. , 2010 .

[5]  D. Hunter Hale,et al.  Embedding Information into Game Worlds to Improve Interactive Intelligence , 2011 .

[6]  Lawrence B. Holder,et al.  Graph-Based Analysis of Human Transfer Learning Using a Game Testbed , 2007, IEEE Transactions on Knowledge and Data Engineering.

[7]  Ruck Thawonmas,et al.  Analysis of User Trajectories Based on Data Distribution and State Transition: a Case Study with a Massively Multiplayer Online Game Angel Love Online , 2009, GAMEON.

[8]  Chuen-Tsai Sun,et al.  Building a player strategy model by analyzing replays of real-time strategy games , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[9]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[10]  M. Zeldin Heuristics! , 2010 .

[11]  Ron Coleman Operationally Aesthetic Pathfinding , 2007, IC-AI.

[12]  D. Hunter Hale,et al.  Using Intelligent Agents to Build Navigation Meshes , 2010, FLAIRS Conference.