首页> 外文会议>IEEE International Conference on Communication Technology >An Improved Sparse Hierarchical Lazy Theta* Algorithm for UAV Real-Time Path Planning in Unknown Three-Dimensional Environment
【24h】

An Improved Sparse Hierarchical Lazy Theta* Algorithm for UAV Real-Time Path Planning in Unknown Three-Dimensional Environment

机译:一个改进的稀疏分层懒惰θ*算法在未知的三维环境中的UAV实时路径规划

获取原文

摘要

Real-time path planning in the complex and unknown three-dimensional environments is a very challenging topic for the unmanned aerial vehicle (UAV) systems. In this paper, we propose an improved sparse hierarchical lazy theta* (SHLT*) algorithm to plan a near-optimal path in real-time and efficiently in unknown 3D space. In the proposed SHLT* algorithm, the sparse hierarchical framework is adopted to divide the whole 3D space into different levels, wherein the kinematic constraints of UAV are utilized to filter the unsatisfactory successor nodes, thus ensure the feasibility of the generated path. On this basis, an adaptive lazy theta* algorithm is proposed to find the shortest path in each level, wherein the dynamic heuristic factors are applied in different levels so as to accelerate the path generation and improve the accuracy of the obtained path. Besides, path smoothing procedures are also designed to enhance the smoothness of the generated path. Simulation results demonstrate that the proposed SHLT* algorithm can plan a near-optimal path and significantly outperforms the reference algorithm on the performance in terms of path length and path smoothness.
机译:复杂和未知的三维环境中的实时路径规划是无人驾驶飞行器(UAV)系统的非常具有挑战性的话题。在本文中,我们提出了一种改进的稀疏等级懒惰θ*(shlt *)算法,用于在未知的3D空间中实时和有效地规划近最佳路径。在所提出的SHLT *算法中,采用稀疏分层框架将整个3D空间划分为不同的级别,其中利用UAV的运动学约束来过滤不令人满意的后继节点,从而确保所生成的路径的可行性。在此基础上,提出了一种自适应惰性滴答*算法来找到每个级别的最短路径,其中动态启发式因子在不同的水平中应用,以加速路径生成并提高所获得的路径的准确性。此外,路径平滑程序还设计用于增强所产生的路径的平滑度。仿真结果表明,所提出的SHLT *算法可以规划近最优路径,并在路径长度和路径平滑方面显着优于参考算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号