Unmanned surface vessel cluster cooperative replenishment task scheduling strategy via GA-CFG algorithm
The current trend in unmanned surface vessel (USV) is towards diversified and heterogeneous cluster development. This paper studies the resupply strategy for USV when the number of vessels to be resupplied greatly exceeds the number of supply ships. A cooperative algorithm combining genetic algorithms with an improved alliance formation game is proposed. Firstly, a cost function is designed based on the mobility of USV and the duration of berthing for resupply, considering the Euclidean distance with the supply platform. Genetic algorithms are used to generate an initial optimized scheduling plan according to the resupply task requirements. Secondly, an improved alliance formation rule is designed to adjust the members within the alliances formed by the genetic algorithm, achieving a Nash stable state for each alliance. Simulation experiments show the feasibility and superiority of the proposed strategy, providing a reasonable and efficient resupply scheduling plan for the resupply allocation process in heterogeneous vessel clusters.
Authors
- Le Qi (ORCID: https://orcid.org/0000-0003-4832-2271)
- Chao Gao (ORCID: https://orcid.org/0000-0002-0167-0685)
- Jing Zhang (ORCID: https://orcid.org/0000-0003-0063-2000)
- Yong Ma (ORCID: https://orcid.org/0000-0003-0418-9210)
- Zizhuo Wang (ORCID: https://orcid.org/0000-0003-0828-7280)
Institutions
- Wuhan University of Technology (CN)
- Wuhan Ship Development & Design Institute (CN)
Publication Details
- Journal
- IET conference proceedings.
- Published
- 2025-03-01
- DOI
- https://doi.org/10.1049/icp.2025.0551
- Primary Topic
- Satellite Communication Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00