Referenced Items are not available for this document.
Particle swarm optimization (PSO) is similar to genetic algorithm (GA) but employs different strategies and computational effort. Strategic defense military games require a high degree of coordination among the characters and thus are suitable to test the performance of algorithms. In this paper, we design a scenario of tower defense game and compare the performance of PSO and GA in terms of the damage value (fitness) and the convergence speed. The comparative analysis shows the similar optimum cannon placement is obtained using PSO and GA with similar effectiveness. In addition, the results of execution time (>80 seconds) indicate that the single implement of PSO or GA is unsatisfied for real time strategy (RTS) games.
Published in:
Natural Computation, 2009. ICNC '09. Fifth International Conference on
(Volume:5
)
Date of Conference: 14-16 Aug. 2009
- Page(s):
- 387 - 392
- Print ISBN:
- 978-0-7695-3736-8
- INSPEC Accession Number:
- 11046699
- Conference Location :
- Tianjin
- Digital Object Identifier :
- 10.1109/ICNC.2009.552
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
