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 p...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-11-01
|
| Series: | Aerospace |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2226-4310/11/11/923 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846154854224887808 |
|---|---|
| author | Tao Xue Leiming Zhang Yueyao Cao Yunmei Zhao Jianliang Ai Yiqun Dong |
| author_facet | Tao Xue Leiming Zhang Yueyao Cao Yunmei Zhao Jianliang Ai Yiqun Dong |
| author_sort | Tao Xue |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-81805b3f91a2445496be61b82141dd7d |
| institution | Kabale University |
| issn | 2226-4310 |
| language | English |
| publishDate | 2024-11-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Aerospace |
| spelling | doaj-art-81805b3f91a2445496be61b82141dd7d2024-11-26T17:42:57ZengMDPI AGAerospace2226-43102024-11-01111192310.3390/aerospace11110923Valley Path Planning on 3D Terrains Using NSGA-II AlgorithmTao Xue0Leiming Zhang1Yueyao Cao2Yunmei Zhao3Jianliang Ai4Yiqun Dong5Department of Aeronautics and Astronautics, Fudan University, Shanghai 200433, ChinaDepartment of Aeronautics and Astronautics, Fudan University, Shanghai 200433, ChinaDepartment of Aeronautics and Astronautics, Fudan University, Shanghai 200433, ChinaSchool of Aerospace Engineering and Applied Mechanics, Tongji University, Shanghai 200092, ChinaDepartment of Aeronautics and Astronautics, Fudan University, Shanghai 200433, ChinaDepartment of Aeronautics and Astronautics, Fudan University, Shanghai 200433, ChinaValley 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.https://www.mdpi.com/2226-4310/11/11/923valley path planningNon-dominated Sorting Genetic Algorithm II3D terrains |
| spellingShingle | Tao Xue Leiming Zhang Yueyao Cao Yunmei Zhao Jianliang Ai Yiqun Dong Valley Path Planning on 3D Terrains Using NSGA-II Algorithm Aerospace valley path planning Non-dominated Sorting Genetic Algorithm II 3D terrains |
| title | Valley Path Planning on 3D Terrains Using NSGA-II Algorithm |
| title_full | Valley Path Planning on 3D Terrains Using NSGA-II Algorithm |
| title_fullStr | Valley Path Planning on 3D Terrains Using NSGA-II Algorithm |
| title_full_unstemmed | Valley Path Planning on 3D Terrains Using NSGA-II Algorithm |
| title_short | Valley Path Planning on 3D Terrains Using NSGA-II Algorithm |
| title_sort | valley path planning on 3d terrains using nsga ii algorithm |
| topic | valley path planning Non-dominated Sorting Genetic Algorithm II 3D terrains |
| url | https://www.mdpi.com/2226-4310/11/11/923 |
| work_keys_str_mv | AT taoxue valleypathplanningon3dterrainsusingnsgaiialgorithm AT leimingzhang valleypathplanningon3dterrainsusingnsgaiialgorithm AT yueyaocao valleypathplanningon3dterrainsusingnsgaiialgorithm AT yunmeizhao valleypathplanningon3dterrainsusingnsgaiialgorithm AT jianliangai valleypathplanningon3dterrainsusingnsgaiialgorithm AT yiqundong valleypathplanningon3dterrainsusingnsgaiialgorithm |