z-logo
open-access-imgOpen Access
Strategic Team AI Path Plans: Probabilistic Pathfinding
Author(s) -
Tng Cheun Hou John,
Edmond C. Prakash,
Narendra S. Chaudhari
Publication year - 2008
Publication title -
international journal of computer games technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.248
H-Index - 19
eISSN - 1687-7055
pISSN - 1687-7047
DOI - 10.1155/2008/834616
Subject(s) - pathfinding , probabilistic logic , path (computing) , computer science , artificial intelligence , motion planning , operations research , robot , engineering , shortest path problem , theoretical computer science , programming language , graph
This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002), in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006). We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom