Dynamic Distributed PSO joints elites in Multiple Robot Path Planning Systems: Theoretical and practical review of new ideas

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

Abstract

Path planning problem for large number of robots is a quite challenging problem in mobile robotics since their control and coordination becomes unreliable and sometimes unfeasible. Particle Swarm Optimization (PSO) has been demonstrated to be a useful technique in the field of robotic research. This paper discusses an optimal path planning algorithm based on a Dynamic Distributed Particle Swarm Optimization Algorithm (D2PSO). The purpose of this approach is to find collision free optimal paths using two local optima detectors. This would add diversity to the population and hence avoid stagnation problem. The results show that the D2PSO has a better ability to get away from local optimums than the distributed PSO (dPSO). Simulations prove that this methodology is effective for every robot in multi-robot framework to discover its own proper path from the start to the destination position with minimum distance and no collision with obstacles.

Cite

CITATION STYLE

APA

Asma, A., & Sadok, B. (2017). Dynamic Distributed PSO joints elites in Multiple Robot Path Planning Systems: Theoretical and practical review of new ideas. In Procedia Computer Science (Vol. 112, pp. 1082–1091). Elsevier B.V. https://doi.org/10.1016/j.procs.2017.08.128

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