PDF(5101 KB)
考虑飞行能耗的无人机三维路径规划:基于改进的椭圆切线图方法
张雅静, 吕伟, 杨晓婷, 杨婷, 王沐林, 李迪, 雷鹏
清华大学学报(自然科学版) ›› 2026, Vol. 66 ›› Issue (2) : 257-267.
PDF(5101 KB)
PDF(5101 KB)
考虑飞行能耗的无人机三维路径规划:基于改进的椭圆切线图方法
Three-dimensional path planning for UAVs considering flight energy consumption: An approach based on improved elliptic tangent maps
针对无人机路径规划中能量消耗优化不足的问题, 提出一种基于椭圆切线图并考虑飞行能耗的三维路径规划方法。采用椭圆柱体模型对障碍物建模, 在保证安全距离的同时降低计算冗余; 通过双向搜索策略和节点筛选机制对椭圆切线图法进行改进以生成二维基准路径点; 耦合二维基准路径点与能量消耗模型实现三维路径规划。构建3种测试场景, 将所提方法分别与A*、快速探测随机树(RRT)、粒子群优化(PSO)和向量场直方图(VFH)算法进行对比分析。实验结果表明:所提方法的平均路径长度减少了4.1%~18.7%, 转向次数降低了68.8%~82.8%, 能量消耗缩减了34.0%~59.1%; 不同安全距离(2、4、6 m)设置下的对比模拟实验结果表明, 适当增加安全距离可在不影响路径最优性的前提下提升飞行安全性。该文所提方法有效解决了传统方法在路径长度、路径平滑性与能量消耗间的权衡难题, 为提升无人机续航能力提供了兼具理论创新性与工程实用性的解决方案。
Objective: Aiming to address the problem of insufficient optimization of energy consumption in unmanned aerial vehicle (UAV) path planning, a three-dimensional (3D) path planning method based on a tangent map and considering energy consumption is proposed. Methods: First, to ensure safe UAV flight, an ellipsoidal obstacle modeling approach is introduced. This approach represents irregular obstacles using a safety envelope, ensuring a minimum safe distance between the UAV and obstacles. Unlike conventional envelope-based methods, the proposed approach eliminates path redundancy, thereby lowering computational complexity and enhancing planning efficiency and flight safety. Second, the traditional elliptic tangent graph method is improved by incorporating a bidirectional search strategy and a node screening mechanism. These enhancements generate optimized two-dimensional (2D) reference path points, notably reducing the number of turning points along the path and shortening the overall path length. Finally, the proposed method integrates the 2D reference path points with an energy consumption model to enable 3D path planning. The 3D reference path points are derived from their 2D counterparts. When the start and end points of the UAV lie at the same altitude, a dimensionality reduction strategy is applied to convert the 3D planning problem into a 2D planar one, which is then solved using the elliptic tangent graph method. In cases involving height differences between the start and end points, an energy evaluation model is used to compare the energy costs of two strategies (horizontal flyover and vertical climb). The path point with the lowest energy consumption is selected, and cubic B-spline curves are applied to smooth the path. Aiming to evaluate the performance of the proposed method, three test scenarios with varying obstacle densities and layouts are designed. Comparative experiments are conducted against four benchmark algorithms: A*, rapidly-exploring random trees (RRT), particle swarm optimization (PSO), and the vector field histogram (VFH). Results: Results demonstrate that, in 2D environments, the improved elliptic tangent graph method consistently generates the shortest paths with the fewest turns, regardless of obstacle distribution. Its performance advantage becomes increasingly evident as environmental complexity rises. In complex 3D environments, the method not only delivers shorter and smoother flight paths but also substantially reduces the overall energy consumption of UAV operations. Specifically, compared with the A*, RRT, PSO, and VFH algorithms, the proposed method achieves average reductions in path length of 8.7%, 18.7%, 13.4%, and 4.1%, respectively; reductions in the number of turns of 68.8%, 82.1%, 82.8%, and 75.0%; and reductions in energy consumption of 51.6%, 34.0%, 59.1%, and 55.3%. Additionally, comparative experiments conducted with varying safety distances (2, 4, and 6 m) reveal that appropriately increasing the safety distance can improve flight safety without compromising path optimality. However, excessively large safety distances may lead to inefficient use of free space and reduced planning efficiency. Conclusions: These improvements effectively overcome the traditional tradeoffs between path length, motion smoothness, and energy efficiency, offering a solution that combines theoretical innovation with engineering practicality to enhance UAV mission endurance and operational safety.
无人机(UAV) / 三维路径规划 / 切线图 / 能量消耗 / 避障
unmanned aerial vehicle (UAV) / three-dimensional path planning / tangent map / energy consumption / obstacle avoidance
| 1 |
|
| 2 |
|
| 3 |
|
| 4 |
|
| 5 |
CAO Z Y, LI D J, ZHANG B. Dynamic trajectory planning for UAV cluster by weighted Voronoi diagram with particle swarm optimization[C]// Proceedings of 2022 International Conference on Autonomous Unmanned Systems (ICAUS 2022). Singapore: Springer, 2023: 3479-3490.
|
| 6 |
姚千, 杨洁. 改进A*算法在三维空间中无人机的航迹规划[J]. 传感器与微系统, 2025, 44(3): 143- 147.
|
| 7 |
唐宇洋, 郑恩辉, 邱潇. 基于优化双向A*与人工势场法的无人机三维航迹规划[J]. 空军工程大学学报, 2024, 25(5): 69- 75.
|
| 8 |
|
| 9 |
|
| 10 |
|
| 11 |
|
| 12 |
姚信宇, 王燮, 王程. 基于改进Goal-bias RRT的无人机三维路径规划研究[J]. 飞行力学, 2025, 43(2): 69- 75.
|
| 13 |
|
| 14 |
|
| 15 |
DING K Y, CHEN M, YONG K N. Self-adjusting angular resolution-based obstacle avoidance for inspection unmanned aerial vehicles in nuclear power stations[C]// 2022 41st Chinese Control Conference (CCC). Hefei: IEEE, 2022: 3730-3735.
|
| 16 |
LI W K, CHENG L, HU J. Research on stealthy UAV path planning based on improved genetic algorithm[C]// 2022 International Conference on Artificial Intelligence and Computer Information Technology (AICIT). Yichang: IEEE, 2022: 1-6.
|
| 17 |
LIU H, ZHANG N, LI Q. UAV path planning based on an improved ant colony algorithm[C]// 2021 4th International Conference on Intelligent Autonomous Systems (ICoIAS). Wuhan: IEEE, 2021: 357-360.
|
| 18 |
|
| 19 |
张佳庆, 孙韬, 蒋弘瑞, 等. 基于林火风险的高压输电线路无人机巡检路径规划[J]. 清华大学学报(自然科学版), 2024, 64(5): 911- 921.
|
| 20 |
|
| 21 |
YANG K, SUKKARIEH S. Real-time continuous curvature path planning of UAVS in cluttered environments[C]// 2008 5th International Symposium on Mechatronics and Its Applications. Amman: IEEE, 2008: 1-6.
|
| 22 |
|
| 23 |
|
| 24 |
|
| 25 |
|
| 26 |
|
| 27 |
赵嶷飞, 郑雨欣. 城市物流无人机飞行任务剖面构建与优化[J]. 飞行力学, 2021, 39(3): 54-59, 67.
|
| 28 |
|
/
| 〈 |
|
〉 |