Valley Path Planning on 3D Terrains Using NSGA-II Algorithm

Valley path planning on 3D terrains holds significant importance in navigating and understanding complex landscapes. This specialized form of path planning focuses on finding optimal routes that adhere to the natural contours of valleys within three-dimensional terrains. The significance of valley path planning lies in its ability to address specific challenges presented by valleys, such as varying depths, steep slopes, and potential obstacles. By following the natural flow of valleys, path planning can enhance the efficiency of navigation and minimize the risk of encountering difficult terrain or hazards. In recent years, an increasing number of researchers have focused on the study of valley path planning on 3D terrains. This study presents a valley path planning method utilizing the NSGA-II (Non-dominated Sorting Genetic Algorithm II) approach. To ensure that the paths generated by the algorithm closely follow the valley lines, the algorithm establishes an optimization function that includes three optimization criteria: mean altitude, flight route length, and mean offset. To test the performance of this algorithm, we conducted experiments based on workspaces based on three datasets full of 3D terrains and compared it with three baseline algorithms. The evaluation indicates that the suggested algorithm successfully designs routes that closely follow the valley contours.

Authors

Institutions

Publication Details

Journal
Aerospace
Published
2024-11-08
DOI
https://doi.org/10.3390/aerospace11110923
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

Valley Path Planning on 3D Terrains Using NSGA-II Algorithm

Leiming Zhang, Yueyao Cao, Yiqun Dong, Yunmei Zhao et al.
Aerospace
Robotic Path Planning Algorithms
article

Valley Path Planning on 3D Terrains Using NSGA-II Algorithm

Leiming Zhang, Yueyao Cao, Yiqun Dong, Yunmei Zhao, Jianliang Ai, Tao Xue
article en

Abstract

Valley path planning on 3D terrains holds significant importance in navigating and understanding complex landscapes. This specialized form of path planning focuses on finding optimal routes that adhere to the natural contours of valleys within three-dimensional terrains. The significance of valley path planning lies in its ability to address specific challenges presented by valleys, such as varying depths, steep slopes, and potential obstacles. By following the natural flow of valleys, path planning can enhance the efficiency of navigation and minimize the risk of encountering difficult terrain or hazards. In recent years, an increasing number of researchers have focused on the study of valley path planning on 3D terrains. This study presents a valley path planning method utilizing the NSGA-II (Non-dominated Sorting Genetic Algorithm II) approach. To ensure that the paths generated by the algorithm closely follow the valley lines, the algorithm establishes an optimization function that includes three optimization criteria: mean altitude, flight route length, and mean offset. To test the performance of this algorithm, we conducted experiments based on workspaces based on three datasets full of 3D terrains and compared it with three baseline algorithms. The evaluation indicates that the suggested algorithm successfully designs routes that closely follow the valley contours.

AerospaceVol. 11(11)
Tongji University (CN), Fudan University (CN)
Fundamental Research Funds for the Central Universities
Sustainable cities and communities
Openalex Percentile: Top 80%
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.