.png){kind=icon}
Return
A parallel compact cuckoo search algorithm for three-dimensional path planning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2020.106443.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The three-dimensional (3D) path planning of unmanned robots focuses on avoiding collisions with obstacles and finding an optimized path to the target location in a complex three-dimensional environment. An improved cuckoo search algorithm based on compact and parallel techniques for three-dimensional path planning problems is proposed. This paper implements the compact cuckoo search algorithm, and then, a new parallel communication strategy is proposed. The compact scheme can effectively save the memory of the unmanned robot. The parallel scheme can increase the accuracy and achieve faster convergence. The proposed algorithm is tested on several selected functions and three-dimensional path planning. Results compared with other methods show that the proposed algorithm can provide more competitive results and achieve more efficient execution. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
3D path planning
Cuckoo search algorithm
Parallel communication strategy
Compact strategy
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
A novel oriented cuckoo search algorithm to improve DV-Hop performance for cyber-physical systems
PREAI
ShareSave
View more