A Collaborative Search Method for USV Swarms Using the B-CNP Algorithm for Water Area Coverage
Gardado en:
| Publicado en: | Journal of Marine Science and Engineering vol. 13, no. 4 (2025), p. 672 |
|---|---|
| Autor Principal: | |
| Outros autores: | |
| Publicado: |
MDPI AG
|
| Materias: | |
| Acceso en liña: | Citation/Abstract Full Text + Graphics Full Text - PDF |
| Etiquetas: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|
| Resumo: | This paper addresses the challenge of conducting cover searches for unmanned surface vessels operating in unknown waters. To tackle this problem, we propose a cover algorithm that combines job partitioning with a joint network protocol. The algorithm starts by dividing the map area based on an exploration-based approach, followed by task area calculation and assignment using the Boustrophedon technique. Subsequently, a distributed joint network protocol is utilized to dynamically allocate search tasks among the members of the USV (unmanned surface vessel) group, maximizing the overall search efficiency. Three basic strategies are designed for collaboration between USVs (namely, obstacle recognition, distributed communication, and regional transfer), facilitating the real-time allocation of water coverage tasks among unmanned vessels until the entire body of water is completely covered. Simulation experiments demonstrate the effectiveness of the proposed algorithm. Compared to several non-cooperative area coverage algorithms, our algorithm reduces calculation task usage time and total travel distance for the cluster. Furthermore, the proposed algorithm performs well in dynamic environments, efficiently handling coverage search tasks. Notably, the B-CNP (Boustrophedon-contract network protocol) algorithm proposed in this paper achieves an approximate 3.22% reduction in path length compared to the BA* (Boustrophedon-A*) algorithm. |
|---|---|
| ISSN: | 2077-1312 |
| DOI: | 10.3390/jmse13040672 |
| Fonte: | Engineering Database |