A Hybrid of Modified PSO and Local Search on a Multi-Robot Search System. (8th July 2015)

• Record Type: Journal Article
• Authors: Rastgoo, Mohammad Naim; Nakisa, Bahareh; Ahmad Nazri, Mohd Zakree
• Is Part Of: International journal of advanced robotic systems. Volume 12:Number 7(2015)
• Publication Date: 2015-07-08
• Subjects: Particle swarm optimization (PSO) -- multi-robot search system -- premature convergence problem -- exploration and exploitation; Robotics -- Periodicals; Robotics; Periodicals; 629.892
• DOI: 10.5772/60624
• Languages: English
• ISSNs: 1729-8806

Abstract

Particle swarm optimization (PSO), a new population-based algorithm, has recently been used on multi-robot systems. Although this algorithm is applied to solve many optimization problems as well as multi-robot systems, it has some drawbacks when it is applied on multi-robot search systems to find a target in a search space containing big static obstacles. One of these defects is premature convergence. This means that one of the properties of basic PSO is that when particles are spread in a search space, as time increases they tend to converge in a small area. This shortcoming is also evident on a multi-robot search system, particularly when there are big static obstacles in the search space that prevent the robots from finding the target easily; therefore, as time increases, based on this property they converge to a small area that may not contain the target and become entrapped in that area. Another shortcoming is that basic PSO cannot guarantee the global convergence of the algorithm. In other words, initially particles explore different areas, but in some cases they are not good at exploiting promising areas, which will increase the search time. This study proposes a method based on the particle swarm optimization (PSO) technique on a multi-robot system to find a target in a search space containing big static obstacles. This method is not only able to overcome the premature convergence problem but also establishes an efficient balance between exploration and exploitation and guarantees global convergence, reducing the search time by combining with a local search method, such as A-star. To validate the effectiveness and usefulness of algorithms, a simulation environment has been developed for conducting simulation-based experiments in different scenarios and for reporting experimental results. These experimental results have demonstrated that the proposed method is able to overcome the premature convergence problem and guarantee global convergence.