Coverage Path Planning Strategy for Deep‐Sea Mining Vehicle Cluster Under Spatial Constraints

Abstract The path planning of deep‐sea mining vehicle clusters and the spatial layout of pipeline systems are critical for mining efficiency and safety. Many existing path planning strategies overlook hose entanglement issues, limiting their applicability in complex environments. This paper presents a novel full‐coverage path‐planning method based on an improved Deep Q‐Network (DQN) algorithm. The proposed algorithm optimizes sample selection and incorporates a backtracking mechanism to improve learning efficiency and correct erroneous actions. Moreover, an innovative spatial constraint mechanism is designed to transform the hose entanglement problem into a path optimization problem, thereby proactively avoiding entanglement risks during planning. The experiments show that the algorithm proposed in this paper can achieve a coverage rate of 100% of the target area within 200 steps, with no instances of hose entanglement. Furthermore, the algorithm handles dynamic obstacles and flexibly adjusts vehicle numbers, proving its adaptability and robustness in changing environments. Overall, the paper provides a highly practical and innovative solution for intelligent path planning in deep‐sea mining operations.

Authors

Institutions

Publication Details

Journal
Advanced Theory and Simulations
Published
2025-05-09
DOI
https://doi.org/10.1002/adts.202401001
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Coverage Path Planning Strategy for Deep‐Sea Mining Vehicle Cluster Under Spatial Constraints

Bowen Xing, Zhenchong Liu, Hanzheng Chen, Xiao Wang
Advanced Theory and Simulations
Robotic Path Planning Algorithms
article

Coverage Path Planning Strategy for Deep‐Sea Mining Vehicle Cluster Under Spatial Constraints

Bowen Xing, Zhenchong Liu, Hanzheng Chen, Xiao Wang
article en

Abstract

Abstract The path planning of deep‐sea mining vehicle clusters and the spatial layout of pipeline systems are critical for mining efficiency and safety. Many existing path planning strategies overlook hose entanglement issues, limiting their applicability in complex environments. This paper presents a novel full‐coverage path‐planning method based on an improved Deep Q‐Network (DQN) algorithm. The proposed algorithm optimizes sample selection and incorporates a backtracking mechanism to improve learning efficiency and correct erroneous actions. Moreover, an innovative spatial constraint mechanism is designed to transform the hose entanglement problem into a path optimization problem, thereby proactively avoiding entanglement risks during planning. The experiments show that the algorithm proposed in this paper can achieve a coverage rate of 100% of the target area within 200 steps, with no instances of hose entanglement. Furthermore, the algorithm handles dynamic obstacles and flexibly adjusts vehicle numbers, proving its adaptability and robustness in changing environments. Overall, the paper provides a highly practical and innovative solution for intelligent path planning in deep‐sea mining operations.

Advanced Theory and SimulationsVol. 8(9)
Shanghai Ocean University (CN)
Shanghai Rising-Star Program
Openalex Percentile: Top 92%
Robotic Path Planning Algorithms
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.