Browse > Article
http://dx.doi.org/10.7583/JKGS.2011.11.5.023

An Improvement of Finding Neighbors in Flocking Behaviors by Using a Simple Heuristic  

Jiang, Zi Shun (Dept. of Multimedia Engineering, Hansung University)
Lee, Jae-Moon (Dept. of Multimedia Engineering, Hansung University)
Publication Information
Journal of Korea Game Society / v.11, no.5, 2011 , pp. 23-30 More about this Journal
Abstract
Flocking behaviors are frequently used in games and computer graphics for realistic simulation of massive crowds. Since simulation of massive crowds in real time is a computationally intensive task, there were many researches on efficient algorithm. In this paper, we find experimentally the fact that there are unnecessary computations in the previous efficient flocking algorithm, and propose a noble algorithm that overcomes the weakness of the previous algorithm with a simple heuristic. A number of experiments were conducted to evaluate the performance of the proposed algorithm. The experimental results showed that the proposed algorithm outperformed the previous efficient algorithm by about 21% on average.
Keywords
Flocking; k-Nearest Neighbor Agent; Spatial Subdivision Method;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Buckland Mat., Programming Game AI by Example. Wordware Publications, ISBN 1556220782, 2005.
2 G.Paulikas, D.Rubliauskas. Movement of Flocked Subpopulations in Distributed Genetic Programming. Information Technology And Control, Vol. 34, No. 4, 2005, pp 338-344.
3 Ballerini M., N. Cabibbo, R. Candelier, A. Cavagna, E. Cisbani, I. Giardina, V. Lecomte, A. Orlandi, G. Parisi, A. Procaccini, M. Viale, V. Zdravkovic, Interaction ruling animal collective behavior depends on topological rather than metric distance: Evidence from a field study. In Proceedings of the National Academy of Sciences, Vol. 105, No. 4, 2008, pp. 1232-1237.
4 Seongdong Kim, Christoph Hoffmann and Jae Moon Lee, An Experiment in Rule-based Crowd Behavior for Intelligent Games. In Proceedings of Fourth International Conference on Computer Sciences and Convergence Information Technology, 2009, pp. 410-415.
5 Jae Moon Lee, An Efficient Algorithm to Find k-Nearest Neighbors in Flocking Behavior. Information Processing Letters, 110, 2010, pp. 576-579.   DOI   ScienceOn
6 Jian Ma, Wei-guo Song, Jun Zhang, Siu-ming Lo, Guang-xuan Liao, "k-Nearest- Neighbor interaction induced self-organized pedestrian counter flow", Physica A 389, 2010, pp. 2101-2117.   DOI
7 Reynolds, C. W., Flocks, Herds, and Schools: A Distributed Behavioral Model, In Proceedings of SIGGRAPH 87, 21(4), 1987, pp. 25-34.
8 Reynolds, C. W., Interaction with Groups of Autonomous Characters. In Proceedings of the Game Developers Conference, San Francisco, California, 2000, pp. 449-460.
9 Jadbabaie, J. Lin, A.S. Morese, Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48(6), 2003, pp. 988-1001.   DOI   ScienceOn
10 Iain D. Couzin, Jens Krause, Richard James, Graeme D. Ruxton and Nigel R. Franks., Collective Memory and Spatial Sorting in Animal Groups. J. theory Biol., 2002, pp. 1-11.