Skip to content
Open access

Full-Coverage Path Planning for Heterogeneous UUVs Using a Hybrid Detection Point Layout and a Dual-Chromosome Co-Evolutionary Genetic Algorithm

Aug 2026 · Italian National Conference on Sensors · Vol 26, pp. 5195 · 0 citations · 41 references
Medicine

Abstract

To address the issue of unbalanced path allocation in multi-UUV cooperative operations under inhomogeneous ocean environments during full-coverage search missions, this paper proposes a heterogeneous UUV path planning method that integrates a hybrid waypoint deployment strategy with a dual-chromosome co-evolutionary genetic algorithm. First, heterogeneous UUVs are adaptively assigned to sub-regions according to the search value of the sea area, and a combination of Poisson sampling and Voronoi iterative refinement is adopted to complete the layout of detection points. Subsequently, connectivity-constrained K-means clustering is introduced to decompose the multi-traveling salesman problem (MTSP) into several independent TSP sub-problems. Finally, a dual-chromosome encoding scheme for task sequences and split points is designed, and a penalty matrix is incorporated into the fitness function to account for obstacle avoidance constraints, thereby establishing an integrated genetic-algorithm-based solution framework that incorporates both decomposition and obstacle avoidance. Simulation results demonstrate that the proposed method reduces the number of planned detection points by 12.4%, 12.8%, and 9.3% compared with baseline methods in circular, rectangular, and irregular sea areas, respectively, while the optimal path lengths are shortened by 5.8%, 4.5%, and 5.9%. Moreover, the cooperative mission time with four UUVs is reduced by 73.9%, 72.7%, and 71.2% relative to a single UUV, demonstrating an approximately linear speedup relative to the number of UUVs. Convergence analysis and extended experiments on 15 instances further confirm the algorithm’s solution stability and robustness under varying regional scales, shapes, and obstacle configurations. These results validate that the proposed approach not only reduces the number of deployment points and path cost, but also effectively balances obstacle avoidance and multi-robot load distribution.

Read PDF

Similar papers

Open access Sep 2026

Task assignment and path planning methods for marine unmanned aerial vehicles based on improved intelligent optimisation algorithms

A two-stage framework that explicitly couples task-cluster generation with route-level feasibility verification is developed, providing algorithm-level evidence for coordinated marine-UAV task assignment and route-sequence planning, but do not establish real-world flight readiness or field-deployment performance.

Bo-Wen Tang, Hong-Yu Zhao, Hong-Miao Gao · 0 citations
Open access Sep 2026

Point cloud partition–based three-dimensional coordinated coverage path planning for unmanned aerial vehicles

For coordinated three-dimensional coverage tasks involving multiple unmanned aerial vehicles, a method based on three-dimensional point cloud clustering and partitioning is proposed to balance task workload among unmanned aerial vehicles and reduce redundant coverage. First, a sub-region partitioning strategy that pres...

Zhu Wang, De-Lin Yang, Zi-Qiang Song et al. · 0 citations
Open access 2026

An Adaptive Large Neighborhood Search for the Multiple Traveling Salesman Problem With Backup Coverage

This work proposes an Adaptive Large Neighborhood Search (ALNS) metaheuristic with a hybrid C++/Python architecture, featuring problem-specific destroy and repair operators designed to handle the backup coverage constraint, and introduces novel operators including event-proximity string removal and coverage-aware greed...

Jonathan Cardozo Maciel, Guilherme Dhein, O. B. D. de Araújo · 0 citations
Review Open access Sep 2026

Collaborative Coverage Path Planning for AUV Formations: Dual-Layer PSO-Voronoi Partitioning for Time-Based Load Balancing Combined with BINN

In multi-AUV collaborative underwater coverage operations, the fundamental principle of load balancing is temporally rather than spatially defined. Traditional partition schemes that equalize area or grid counts suffer from a critical fallacy: they assume a linear mapping from geometry to working time, which collapses...

Ning Wang, Xiao-Peng Gao, Yong-Sheng Ke · 0 citations
Open access Sep 2026

Multi-Sortie UAV Inspection Route Planning in Three-Dimensional Container Yards with Static Obstacles Using a Hybrid SA–ALNS–2OPT Algorithm

To address the challenges posed by a large number of spatially distributed inspection points, dense obstacles, and limited UAV endurance in container yard inspection, this study investigates a multi-sortie route planning problem for a single unmanned aerial vehicle (UAV) operating from a fixed docking station. A mathem...

Hai-Yan Wang, Xue-Ni Tian · 0 citations
Open access Aug 2026

Multi-Objective Trajectory Planning Method for Air–Ground Collaborative Logistics UAVs Under Preemptive Scheduling

A hybrid heuristic population initialization strategy combining emergency-order priority and spatial scanning rules is introduced to increase the proportion of high-quality feasible solutions in the initial population, and the synergistic effects of the four improvement mechanisms effectively enhance the multi-objectiv...

Jian Deng, Honghai Zhang, Mingzhuang Hua et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.