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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Unmanned surface vessel cluster cooperative replenishment task scheduling strategy via GA-CFG algorithm

Le Qi, Chao Gao, Jing Zhang, Yong Ma et al.
IET conference proceedings.
Satellite Communication Systems
article

Unmanned surface vessel cluster cooperative replenishment task scheduling strategy via GA-CFG algorithm

Le Qi, Chao Gao, Jing Zhang, Yong Ma, Zizhuo Wang
article en

Abstract

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.

IET conference proceedings.Vol. 2024(35)
Wuhan University of Technology (CN), Wuhan Ship Development & Design Institute (CN)
Openalex Percentile: Top 93%
Satellite Communication Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Unmanned surface vessel cluster cooperative replenishment task scheduling strategy via GA-CFG algorithm — Le Qi, Chao Gao, et al. · IET conference proceedings. (2025) | TGRS Research Map | TGRS