Unmanned Aerial Vehicles (UAVs) have attracted considerable research interest recently. Especially when it comes to the realm of Internet of Things, the UAVs with Internet connectivity are one of the main demands. Furthermore, the energy constraint i.e. battery limit is a bottle-neck of the UAVs that can limit their applications. We try to address and solve the energy problem. Therefore, a path planning method for a cellular-connected UAV is proposed that will enable the UAV to plan its path in an area much larger than its battery range by getting recharged in certain positions equipped with power stations (PSs). In addition to the energy constraint, there are also no-fly zones; for example, due to Air to Air (A2A) and Air to Ground (A2G) interference or for lack of necessary connectivity that impose extra constraints in the trajectory optimization of the UAV. No-fly zones determine the infeasible areas that should be avoided. We have used a reinforcement learning (RL) hierarchically to extend typical short-range path planners to consider battery recharge and solve the problem of UAVs in long missions. The problem is simulated for the UAV that flies over a large area, and Q-learning algorithm could enable the UAV to find the optimal path and recharge policy.
翻译:最近,无人驾驶航空飞行器(无人驾驶飞行器)引起了相当大的研究兴趣,特别是在物联网领域,具有互联网连接的无人驾驶飞行器是主要需求之一。此外,能源限制,即电池限制是无人驾驶飞行器的瓶颈,可以限制其应用。我们试图解决和解决能源问题。因此,提议了蜂窝连接的无人驾驶飞行器的路径规划方法,使无人驾驶飞行器能够在一个比其电池范围大得多的地区规划其路径。除了能源限制外,还存在禁飞区;例如,由于空气对空气(A2A)和空气对地面(A2G)的干扰,或缺乏必要的连通性,对无人驾驶飞行器的轨迹优化造成额外的限制。禁飞区决定了应当避免的不可行区域。我们用强化学习(RL)的等级来扩大典型的短程规划器,以考虑电池补给问题,解决长期飞行任务中的无人驾驶飞行器问题。问题在于空气航空对空气(A2A)和地面(A2G)的干扰,从而能够将AAAV的高度演算成一个能够使AV系统得到最佳的飞行。