• Electronics Optics & Control
  • Vol. 29, Issue 12, 106 (2022)
SHI Wanqing1, HUANG Hongliu2, and JIANG Linli2
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • show less
    DOI: 10.3969/j.issn.1671-637x.2022.12.019 Cite this Article
    SHI Wanqing, HUANG Hongliu, JIANG Linli. Multi-robot Path Planning for Collaborative Full-Coverage Search in Complex Environments[J]. Electronics Optics & Control, 2022, 29(12): 106 Copy Citation Text show less

    Abstract

    In order to improve the coverage efficiency and adaptability of multi-robot collaboration search in complex environments,a multi-robot path planning strategy for collaborative full-coverage search is proposed.Firstly,the Cooperative Coevolving Particle Swarm Optimization (CCPSO2)is used for sensor deployment in the target area.Secondly,the improved K-means method is used to cluster sensor deployment points,so as to achieve effective task area division.Finally,the deployed sensor location is taken as the waypoint to solve the Traveling Salesman Problem (TSP),and the enclosed path of each robot is obtained,so as to realize collaborative full-coverage search.The experimental results show that the proposed method can obtain a more evenly-distributed coverage path for each robot while ensuring good obstacle avoidance and minimizing the coverage period,which realizes effective collaborative full-coverage search of multiple robots,and can effectively adapt to the external complex environments with good robustness.
    SHI Wanqing, HUANG Hongliu, JIANG Linli. Multi-robot Path Planning for Collaborative Full-Coverage Search in Complex Environments[J]. Electronics Optics & Control, 2022, 29(12): 106
    Download Citation