4.7 Article

Reinforcement learning-based multi-strategy cuckoo search algorithm for 3D UAV path planning

期刊

EXPERT SYSTEMS WITH APPLICATIONS
卷 223, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2023.119910

关键词

Path planning; Constrained optimization problem; Reinforcement learning; Cuckoo search algorithm

向作者/读者索取更多资源

Unmanned aerial vehicles (UAVs) have been widely applied in various fields due to their advantages of low-cost, high maneuverability, and easy operation. However, the path planning problem of UAVs remains challenging, as it directly affects flight safety and efficiency. In this study, we formulate the path planning problem as a constrained optimization problem, considering the costs of path length and threat, as well as collision and turning angle constraints. We propose a reinforcement learning-based multi-strategy cuckoo search algorithm to address the poor searchability and slow convergence speed of current optimization methods.
Unmanned aerial vehicles are applied extensively in various fields due to their advantages of low-cost, high -maneuverability, and easy-operation. However, the path planning problem of unmanned aerial vehicles, which directly determines the flight safety and efficiency, still remains challenging when building and optimizing the path model. To further study the path planning problem, we firstly construct it as a constrained optimization problem. The objective function considers the costs of path length and threat, and the constraints involve the collision and turning angle. Additionally, we employ the theory of B-Spline curve to represent the planned paths to facilitate the optimization of established model. Then, aiming at the poor searchability and slow convergence speed of current optimization methods, we propose a reinforcement learning-based multi-strategy cuckoo search algorithm. Specifically, we establish an innovative reinforcement learning-based multi-strategy mechanism and a reinforced switch parameter based on the theory of reinforcement learning. To verify the effectiveness of the proposed algorithm, extensive experiments are carried out on the CEC'17 benchmark test and different three-dimensional path planning problems. Detailed statistical analysis of the experimental results confirm the supe-riority of our proposed algorithm to the other well-established algorithms.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据