Particle swarm optimization with area extension (AEPSO)

Atyabi, A and Phon-Amnuaisuk, S. (2007) Particle swarm optimization with area extension (AEPSO). In: IEEE Congress on Evolutionary Computation, 2007. CEC 2007. IEEE Xplore, pp. 1970-1976. ISBN 978-1-4244-1339-3

[img] Text
Particle swarm optimization with area extension (AEPSO).pdf
Restricted to Repository staff only

Download (255kB)
Official URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumb...

Abstract

Particle Swarm Optimization (PSO) is one of the evolutionary algorithms which proved to be useful in solving multi-robots tasks. PSO outperforms other evolutionary algorithms, such as GA, in this area. In this paper we introduce a new modified version of PSO called Area Extension PSO (AEPSO). Information about the environment in extended area together with various heuristics improves the performance of each robot and the group. We believe this AEPSO is suitable to solve problems in environments with large area which have more similarity to real world robotic problems. The result of this study shows a magnificent improvement and the potential of AEPSO, especially in dynamic environments.

Item Type: Book Section
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 07 Oct 2011 06:32
Last Modified: 20 Nov 2013 07:59
URI: http://shdl.mmu.edu.my/id/eprint/3178

Actions (login required)

View Item View Item