A high-effective swarm intelligence-based multi-robot cooperation method for target searching in unknown hazardous environments

• Published in: Expert systems with applications Vol. 262; p. 125609
• Main Authors: Lin, Xiankun, Gao, Feng, Bian, Wenhui
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.03.2025
• Subjects: Multi-robot cooperation; Swarm-based algorithm; Target detection; Unknown hazardous environments; Multi-robot cooperation; Unknown hazardous environments; Swarm-based algorithm; Target detection
• ISSN: 0957-4174
• DOI: 10.1016/j.eswa.2024.125609

To solve target searching problems for multi-robot cooperation with inaccurate target distance perception in unknown hazardous environments, a hybrid adaptive robotic particle swarm optimizer (RPSO) and grey wolf optimizer (GWO) based algorithm with continuous virtual target guidance is proposed for high effective path planning in the searching. In the initial searching stages, both the wolf behavior-generated position and the gbest position and the pbesti positions from RPSO are employed to guide the motions of robots. With the information provided by these initial robot movement paths, a geometric model is established to generate potential targets. The K-means cluster algorithm is introduced to estimate a virtual target position online from potential targets, with new robot-presenting route information to update the history path information. Then the virtual position is employed as one of the direction components to help the robots approach the actual target. In addition, to avoid mobile robots falling into local convergence, a heuristic moving direction determination scheme is utilized to make robots circumvent obstacles in swarm motions, as well as a mutual repulsion algorithm to keep them in a scattering state. Simulation experiments on different types of unknown environments with varied robot numbers and adaptability testing for a dynamic target are carried out to verify the feasibility of the proposed target searching method with comparisons to the other three famous target searching algorithms. It is verified from the results that the presented method can not only contribute a 100% success rate in all runs of searching for a stochastic dynamic target under a limited maximal velocity, but also produce both the shortest path length and minimum iterations in terms of statistical metrics over the comparative methods.