Skip to main navigation Skip to search Skip to main content

A modified particle swarm optimization algorithm for distributed search and collective cleanup

Research output: Contribution to conferencePaperpeer-review

Abstract

Distributed coordination is critical for a multi-robot system in collective cleanup task under a dynamic environment. In traditional methods, robots easily drop into premature convergence. In this paper, we propose a swarm-intelligence based algorithm to reduce the expectation time for searching targets and removing. We modify the traditional PSO algorithm with a random factor to tackle premature convergence problem, and it can achieve a significant improvement in multi-robot system. The proposed method has been implemented on self-developed simulator for searching task. The simulation results demonstrate the feasibility, robustness, and scalability of our proposed method than previous methods.

Original languageEnglish (US)
Pages137-142
Number of pages6
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 International Joint Conference on Awareness Science and Technology, iCAST 2013 and 6th International Conference on Ubi-Media Computing, UMEDIA 2013 - Aizuwakamatsu, Japan
Duration: Nov 2 2013Nov 4 2013

Conference

Conference2013 International Joint Conference on Awareness Science and Technology, iCAST 2013 and 6th International Conference on Ubi-Media Computing, UMEDIA 2013
Country/TerritoryJapan
CityAizuwakamatsu
Period11/2/1311/4/13

Fingerprint

Dive into the research topics of 'A modified particle swarm optimization algorithm for distributed search and collective cleanup'. Together they form a unique fingerprint.

Cite this