A hybrid of modified PSO and local search on a multi-robot search system

Mohammad Naim Rastgoo, Bahareh Nakisa, Mohd Zakree Ahmad Nazri

Research output: Contribution to journalArticle

11 Citations (Scopus)

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.

Original languageEnglish
JournalInternational Journal of Advanced Robotic Systems
Volume12
DOIs
Publication statusPublished - 8 Jul 2015

Fingerprint

Particle swarm optimization (PSO)
Robots
Stars
Local search (optimization)
Defects
Experiments

Keywords

  • Exploration and exploitation
  • Multi-robot search system
  • Particle swarm optimization (PSO)
  • Premature convergence problem

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Computer Science Applications

Cite this

A hybrid of modified PSO and local search on a multi-robot search system. / Rastgoo, Mohammad Naim; Nakisa, Bahareh; Ahmad Nazri, Mohd Zakree.

In: International Journal of Advanced Robotic Systems, Vol. 12, 08.07.2015.

Research output: Contribution to journalArticle

@article{0a1f8123d33741d186eb9ce1f4319b94,
title = "A hybrid of modified PSO and local search on a multi-robot search system",
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.",
keywords = "Exploration and exploitation, Multi-robot search system, Particle swarm optimization (PSO), Premature convergence problem",
author = "Rastgoo, {Mohammad Naim} and Bahareh Nakisa and {Ahmad Nazri}, {Mohd Zakree}",
year = "2015",
month = "7",
day = "8",
doi = "10.5772/60624",
language = "English",
volume = "12",
journal = "International Journal of Advanced Robotic Systems",
issn = "1729-8806",
publisher = "Vienna University of Technology",

}

TY - JOUR

T1 - A hybrid of modified PSO and local search on a multi-robot search system

AU - Rastgoo, Mohammad Naim

AU - Nakisa, Bahareh

AU - Ahmad Nazri, Mohd Zakree

PY - 2015/7/8

Y1 - 2015/7/8

N2 - 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.

AB - 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.

KW - Exploration and exploitation

KW - Multi-robot search system

KW - Particle swarm optimization (PSO)

KW - Premature convergence problem

UR - http://www.scopus.com/inward/record.url?scp=84938632451&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938632451&partnerID=8YFLogxK

U2 - 10.5772/60624

DO - 10.5772/60624

M3 - Article

VL - 12

JO - International Journal of Advanced Robotic Systems

JF - International Journal of Advanced Robotic Systems

SN - 1729-8806

ER -