Team AI: probabilistic pathfinding

Authors:
Tng Cheun Hou John;Edmond C. Prakash;Narendra S. Chaudhari
Affiliations:
Nanyang Technological University, Singapore;Nanyang Technological University, Singapore;Nanyang Technological University, Singapore
Venue:
Proceedings of the 2006 international conference on Game research and development
Year:
2006

Citing 3
Cited 1

AI for games and animation: a cognitive modeling approach

AI for games and animation: a cognitive modeling approach
AI Game Programming Wisdom, Vol. 2

AI Game Programming Wisdom, Vol. 2
AI for Game Developers

AI for Game Developers

Strategic team AI path plans: probabilistic pathfinding

International Journal of Computer Games Technology - Joint International Conference on Cyber Games and Interactive Entertainment 2006

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows how probabilistic path finding AI can improve the replay value of games. The probabilistic path finding AI is implemented using the A* search algorithm. With some simple modifications to the standard A* algorithm, probabilistic results are produced. This probabilistic result from the search algorithm is useful because it creates different paths for moving objects in the game although the source and target position is the same. A prototype is built to test the probabilistic path finding algorithm.