An adaptive particle swarm optimization algorithm for distributed search and collective cleanup in complex environment

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

This article is free to access.

Abstract

Distributed coordination is critical for a multirobot 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. It performs well even in a obstacle environment. 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 compared to previous methods. © 2013 Yi Cai et al.

Cite

CITATION STYLE

APA

Cai, Y., Chen, Z., Li, J., Li, Q., & Min, H. (2013). An adaptive particle swarm optimization algorithm for distributed search and collective cleanup in complex environment. International Journal of Distributed Sensor Networks, 2013. https://doi.org/10.1155/2013/560579

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