1697

An emotionally biased ant colony algorithm for pathfinding in games

Jose A. Mocholi, Javier Jaen, Alejandro Catala, Elena Navarro
Department of Computer Systems and Computation, Polytechnic University of Valencia, Spain
Expert Systems with Applications, Volume 37, Issue 7, July 2010, Pages 4921-4927

@article{mocholi2010emotionally,

   title={An emotionally biased ant colony algorithm for pathfinding in games},

   author={Mocholi, J.A. and Jaen, J. and Catala, A. and Navarro, E.},

   journal={Expert Systems with Applications},

   volume={37},

   number={7},

   pages={4921–4927},

   issn={0957-4174},

   year={2010},

   publisher={Elsevier}

}

Source Source   

737

views

Pathfinding is one of the tasks, apart from graphics rendering, requiring most CPU resources. Although there are many approaches to effectively solve pathfinding problems, they are becoming less suitable as more and more games have larger game worlds that dynamically change during the game play. These new games have more visually realistic graphics that increase the game characters realism but all these efforts may be useless if game characters perform dumb movements or follow inappropriate paths such as repeatedly walking close to an enemy or a predator while moving from one location to another. To tackle this problem we present in this paper an ant colony algorithm for path finding that takes into account the emotions of the game characters and we show how our approach is used in an augmented-reality educational game. The proposed algorithm is implemented on a GPU processor to demonstrate its scalability with large problem sizes when compared to its corresponding CPU version.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: