Multi-robot path planning using an improved self-adaptive particle swarm optimization. (28th September 2020)

• Record Type: Journal Article
• Authors: Tang, Biwei; Xiang, Kui; Pang, Muye; Zhanxia, Zhu
• Is Part Of: International journal of advanced robotic systems. Volume 17:Number 5(2020:Sep./Oct.)
• Publication Date: 2020-09-28
• Subjects: Multi-robot path planning -- evolutionary game theory -- coevolutionary strategy -- convergence analysis of PSO -- improvement of PSO; Robotics -- Periodicals; Robotics; Periodicals; 629.892
• DOI: 10.1177/1729881420936154
• Languages: English
• ISSNs: 1729-8806

Abstract

Path planning is of great significance in motion planning and cooperative navigation of multiple robots. Nevertheless, because of its high complexity and nondeterministic polynomial time hard nature, efficiently tackling with the issue of multi-robot path planning remains greatly challenging. To this end, enhancing a coevolution mechanism and an improved particle swarm optimization (PSO) algorithm, this article presents a coevolution-based particle swarm optimization method to cope with the multi-robot path planning issue. Attempting to well adjust the global and local search abilities and address the stagnation issue of particle swarm optimization, the proposed particle swarm optimization enhances a widely used standard particle swarm optimization algorithm with the evolutionary game theory, in which a novel self-adaptive strategy is proposed to update the three main control parameters of particles. Since the convergence of particle swarm optimization significantly influences its optimization efficiency, the convergence of the proposed particle swarm optimization is analytically investigated and a parameter selection rule, sufficiently guaranteeing the convergence of this particle swarm optimization, is provided in this article. The performance of the proposed planning method is verified through different scenarios both in single-robot and in multi-robot path planning problems. The numerical simulation results reveal that, compared to its contenders, the proposed method is highly promising with respect to the path optimality. Also, the computation time of the proposed method is comparable with those of its peers.