Swarm Intelligence (SI) is one of the research fields that has continuously attracted researcher attention in these last two decades. The flexibility and a well-known decentralized collective behavior of its algorithm make SI a suitable candidate to be implemented in the swarm robotics domain for real-world optimization problems such as target search tasks. Since the introduction of Particle Swarm Optimization (PSO) as a representation of the SI algorithm, it has been widely accepted and utilized especially in local and global search strategies. Because of its simplicity, effectiveness, and low computational cost, PSO has retained popularity notably in the swarm robotics domain, and many improvements have been proposed. Target search problems are one of the areas that have been continuously solved by PSO. This article set out to analyze and give the inside view of the existing literature on PSO strategies towards target search problems. Based on the procedure of PRISMA Statement review method, a systematic review identified 51 related research studies. After further analysis of these total 51 selected articles and consideration on the PSO components, target search components, and research field components, resulting in nine main elements related to the discussed topic. The elements are PSO variant, application field, PSO inertial weight function, PSO efficiency improvement, PSO termination criteria, target available, target mobility status, experiment framework, and environment complexity. Several recommendations, opinions, and perfectives on the discussed topic are presented. Finally, recommendations for future research in this domain are represented to support future developments.
* Title and MeSH Headings from MEDLINE®/PubMed®, a database of the U.S. National Library of Medicine.