Case indexing using pso and ann in real time strategy games

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes a case indexing method using particle swarm optimization (PSO) and artificial neural network (ANN) in a defense-style real time strategy (RTS) game. PSO is employed to optimize the placement of cannons to defend the enemy attack. The execution time of PSO (> 100 seconds) is unsatisfied for RTS game. The result of PSO is used as a case indexing of past experience to train ANN. After the training (approximately 30 seconds), ANN can obtain the best cannon placement within 0.05 second. Experimental results demonstrated that this case indexing method using PSO and ANN efficiently speeded up the whole process to satisfy the requirement in RTS game. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Huo, P., Shiu, S. C. K., Wang, H., & Niu, B. (2009). Case indexing using pso and ann in real time strategy games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5909 LNCS, pp. 106–115). https://doi.org/10.1007/978-3-642-11164-8_18

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