arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.04578cs.RO
收藏

一种基于通信感知的无人机远程监视路径规划方法

An Efficient Approach to Communication-aware Path Planning for Long-range Surveillance Missions undertaken by UAVs

Hrishikesh Sharma, Tom Sebastian

摘要:

在使用无人机进行远程监视任务时,必须进行车辆的路径规划,因为这些是无人驾驶车辆。路径规划,无论是离线还是在线,都需要将路径设置为3D欧几里得空间中的一系列位置,其坐标恰好是纬度,经度和高度。对于非城市地形中长线性基础设施的远程监视的特定应用,连续3D-ESP问题实际上需要两个重要的标量成本。第一个标量成本是沿着计划路径行驶的距离。由于无人机是电池供电的,因此需要在任何代价下,任务的固定起始位置和目标位置之间的路径长度都应最小。另一个标量成本是在远程监视任务期间通过安装在无人机腹部的摄像头传输获取的视频的成本。由于监控目标的长度是长的线性基础设施,因此生成的视频量非常高,并且通常不能完整地存储在船上。如果沿原始路径的某些段的连接性较差,为了提高视频传输速率,信号的传输功率保持较高,这反过来又消耗更多的电池能量。因此,需要一种同时也改善了所谓的通信成本的路径。这两个成本权衡,因此需要帕累托优化这个三维双目标欧氏最短路径问题。在这份报告中,我们研究了单目标离线路径规划问题,基于距离成本,而提出的通信成本作为一个上限约束。最后给出了双目标路径规划的解决方案。

英文摘要:

While using drones for remote surveillance missions, it is mandatory to do path planning of the vehicle since these are pilot-less vehicles. Path planning, whether offline or online, entails setting up the path as a sequence of locations in the 3D Euclidean space, whose coordinates happen to be latitude, longitude and altitude. For the specific application of remote surveillance of long linear infrastructures in non-urban terrain, the continuous 3D-ESP problem practically entails two important scalar costs. The first scalar cost is the distance traveled along the planned path. Since drones are battery operated, hence it is needed that the path length between fixed start and goal locations of a mission should be minimal at all costs. The other scalar cost is the cost of transmitting the acquired video during the mission of remote surveillance, via a camera mounted in the drone's belly. Because of the length of surveillance target which is long linear infrastructure, the amount of video generated is very high and cannot be generally stored in its entirety, on board. If the connectivity is poor along certain segments of a naive path, to boost video transmission rate, the transmission power of the signal is kept high, which in turn dissipates more battery energy. Hence a path is desired that simultaneously also betters what is known as communication cost. These two costs trade-off, and hence Pareto optimization is needed for this 3D bi-objective Euclidean shortest path problem. In this report, we study the mono-objective offline path planning problem, based on the distance cost, while posing the communication cost as an upper-bounded constraint. The bi-objective path planning solution is sketched out towards the end.

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

↑