five

A Robust Min-Max Algorithm for Bi-Objective USV Task Assignment Using Interval Time Costs under Wind-Wave-Current Uncertainty

收藏
DataCite Commons2026-03-20 更新2026-05-04 收录
下载链接:
https://data.mendeley.com/datasets/bp33wj674k
下载链接
链接失效反馈
官方服务:
资源简介:
The practical deployment of unmanned surface vehicle (USV) formations is critically hindered by environmental uncertainties, particularly the combined dynamic effects of wind, waves, and currents, which make accurate mission time prediction infeasible. This compels a shift from deterministic to robust optimization for task assignment. However, prevailing research focuses either on deterministic time costs or on dynamic online reallocation, largely overlooking the optimization of the initial task allocation plan under environmental uncertainty. To bridge this gap, we introduce a robust min-max framework for bi-objective task assignment. First, a novel Fast Perfect-Matching Detection (FPMD) algorithm for bipartite graphs is proposed. Building on this, an exact Fast Min-Max (FMM) algorithm is developed to rapidly identify schemes that minimize the maximum time cost. Finally, to explicitly model the impact of wind-wave-current conditions, travel time is represented as an interval matrix, upon which our Bi-Objective FMM (BOFMM) algorithm computes assignment schemes that respectively address the best-case and worst-case scenarios, thereby effectively balancing the expected task time and its variability. Extensive simulations demonstrate that our method significantly outperforms other approaches, delivering superior and guaranteed performance in uncertain marine environments.
提供机构:
Mendeley Data
创建时间:
2026-03-20
5,000+
优质数据集
54 个
任务类型
进入经典数据集
二维码
社区交流群

面向社区/商业的数据集话题

二维码
科研交流群

面向高校/科研机构的开源数据集话题

数据驱动未来

携手共赢发展

商业合作