A parallel compact cuckoo search algorithm for three-dimensional path planning
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-dimensiona...
Saved in:
Published in | Applied soft computing Vol. 94; p. 106443 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
01.09.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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.
•Compact Cuckoo Search Algorithm.•Parallel Cuckoo Search Algorithm.•Algorithm that reduce the computation time and the memory.•Parallel Compact Cuckoo Search Algorithm.•Optimization methods for 3D path planning. |
---|---|
ISSN: | 1568-4946 1872-9681 |
DOI: | 10.1016/j.asoc.2020.106443 |