arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.03358eess.SYcs.ROcs.SY
收藏

一种用于无人机送货的无碰撞路径规划算法

A Collision-Free Path Planning Algorithm for Unmanned Aerial Vehicle Delivery

Nanyang Technological University(南洋理工大学)

Ziji Shi, Wee Keong Ng

AI总结:

本文提出一种基于A*算法的无碰撞路径规划方法,通过引入考虑等待时间的启发函数,解决动态环境中无人机送货的碰撞问题,并通过仿真验证了算法的有效性。

摘要:

路径规划对于无人机的自主性至关重要,特别是在调度无人机送货时。然而,无人机的操作环境通常是不确定和动态的。没有适当的规划,多个无人机拥堵时可能发生碰撞。此外,当局可能设置临时禁飞区,使空域无法使用。因此,需要适当的预出发规划以避免这些地方。本文将该问题转化为约束满足问题,以在动态图中找到无碰撞的最短路径。我们提出了一种基于A*算法的无碰撞路径规划算法。主要创新点是发明了一个同时考虑等待时间的启发函数。我们后来证明,添加等待惩罚后,所提出算法是最优的,因为启发函数是可接受的。该算法的实现使用了新加坡的空域结构进行无人机送货仿真。我们的仿真展示了良好的运行时间性能。使用所提出的算法,碰撞自由路线的百分比随着单位面积请求数量的增加而减少,并在边界值处显著下降。我们的实证分析可以辅助禁飞区政策和无人机送货基础设施的决策。

英文摘要:

Path planning is important for the autonomy of Unmanned Aerial Vehicle (UAV), especially for scheduling UAV delivery. However, the operating environment of UAVs is usually uncertain and dynamic. Without proper planning, collisions may happen where multiple UAVs are congested. Besides, there may also be temporary no-fly zone setup by authorities that makes airspace unusable. Thus, proper pre-departure planning that avoids such places is needed. In this paper, we formulate this problem into a Constraint Satisfaction Problem to find a collision-free shortest path on a dynamic graph. We propose a collision-free path planning algorithm that is based on A* algorithm. The main novelty is that we invent a heuristic function that also considers waiting time. We later show that, with added waiting penalty, the proposed algorithm is optimal because the heuristic is admissible. Implementation of this algorithm simulates UAV delivery using Singapore's airspace structure. Our simulation exhibits desirable runtime performance. Using the proposed algorithm, the percentage of collision-free routes decreases as number of requests per unit area increases, and this percentage drops significantly at boundary value. Our empirical analysis could aid the decision-making of no-fly zone policy and infrastructure of UAV delivery.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑