Asynchronous particle swarm optimization for swarm robotics

Nor Azlina, Ab. Aziz and Zuwairie, Ibrahim (2012) Asynchronous particle swarm optimization for swarm robotics. Procedia Engineering, 41. pp. 951-957. ISSN 1877-7058. (Published)

Asynchronous particle swarm optimization for swarm robotics.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (385kB) | Preview


In the original particle swarm optimization algorithm, particles’ update is done synchronously. The whole swarm fitness is evaluated first before particle update process is conducted. Whereas in asynchronous update a particle is able to update its velocity and position after its fitness is evaluated. This caused the particle's search to be conducted with imperfect information. However, asynchronous update is useful in field such as swarm robotics search problem, where the robots can move continuously based on the available information without waiting for the whole swarm. Hence this paper looks into the differences between synchronous and asynchronous PSO and its application in swarm robotics search.

Item Type: Article
Uncontrolled Keywords: Asynchronous; Particle swarm optimization; Swarm robotics; Synchronous
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Faculty/Division: Faculty of Electrical & Electronic Engineering
Depositing User: Mrs. Neng Sury Sulaiman
Date Deposited: 09 Dec 2019 04:45
Last Modified: 09 Dec 2019 04:45
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item