A complete-coverage path-planning algorithm based on local path cost

Complete coverage path planning (CCPP) is a core enabling technology for autonomous operation and navigation of mobile robots and unmanned surface vehicles (USVs). However, in large-scale and complex environments, due to the lack of directional guidance in population evolution, existing heuristic path planners often suffer from slow convergence, premature trapping in local optima, and excessive turning maneuvers along the planned tour. To mitigate the blindness of conventional mutation operators, this paper proposes a complete-coverage path-planning algorithm based on local path cost (CCPP-LPC). First, a local path cost evaluation model is constructed to adaptively quantify the possible impact that each node may have on the overall path length, thereby identifying nodes with high optimization potential. Second, an adaptive dual-guided perturbation node selection strategy is designed, which derives both optimization-oriented and diversity-oriented probability distributions from local costs, guiding the population to preferentially refine high-cost segments while preserving gene diversity. To assess the performance of CCPP-LPC, comprehensive comparisons against six state-of-the-art heuristic algorithms on four simulated grid maps of varying scales and complexity are conducted, as well as four simulation maps from real environment. Experimental results show that CCPP-LPC not only improves computational efficiency, but also achieves the best performance across key metrics, including path length, and repeated coverage ratio. These outcomes highlight CCPP-LPC as a practically valuable approach for complete-coverage optimization under multi-constrained, complex environments.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-11-21
DOI
https://doi.org/10.1038/s41598-026-71501-6
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A complete-coverage path-planning algorithm based on local path cost

Z Dai, Jianing Tang, Yuhang Zhu, Chenjia Li et al.
2 links
Scientific Reports
Robotic Path Planning Algorithms
article

A complete-coverage path-planning algorithm based on local path cost

Z Dai, Jianing Tang, Yuhang Zhu, Chenjia Li, Xia Wang
article en

Abstract

Complete coverage path planning (CCPP) is a core enabling technology for autonomous operation and navigation of mobile robots and unmanned surface vehicles (USVs). However, in large-scale and complex environments, due to the lack of directional guidance in population evolution, existing heuristic path planners often suffer from slow convergence, premature trapping in local optima, and excessive turning maneuvers along the planned tour. To mitigate the blindness of conventional mutation operators, this paper proposes a complete-coverage path-planning algorithm based on local path cost (CCPP-LPC). First, a local path cost evaluation model is constructed to adaptively quantify the possible impact that each node may have on the overall path length, thereby identifying nodes with high optimization potential. Second, an adaptive dual-guided perturbation node selection strategy is designed, which derives both optimization-oriented and diversity-oriented probability distributions from local costs, guiding the population to preferentially refine high-cost segments while preserving gene diversity. To assess the performance of CCPP-LPC, comprehensive comparisons against six state-of-the-art heuristic algorithms on four simulated grid maps of varying scales and complexity are conducted, as well as four simulation maps from real environment. Experimental results show that CCPP-LPC not only improves computational efficiency, but also achieves the best performance across key metrics, including path length, and repeated coverage ratio. These outcomes highlight CCPP-LPC as a practically valuable approach for complete-coverage optimization under multi-constrained, complex environments.

Scientific Reports
China Telecom (China) (CN)
Industry, innovation and infrastructure
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.

Laika access coming soon