Strategic Team AI Path Plans: Probabilistic Pathfinding

  • John T
  • Prakash E
  • Chaudhari N
N/ACitations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

John, T. C. H., Prakash, E. C., & Chaudhari, N. S. (2008). Strategic Team AI Path Plans: Probabilistic Pathfinding. International Journal of Computer Games Technology, 2008(1). https://doi.org/10.1155/2008/834616

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free