arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.10563cs.AIcs.NIeess.SP
收藏

基于连通性约束的飞行器导航双Q学习方法

A Double Q-Learning Approach for Navigation of Aerial Vehicles with Connectivity Constraint

University of Toronto(多伦多大学)

Behzad Khamidehi, Elvino S. Sousa

摘要:

研究了飞行器在一对给定的起始点和终点之间飞行的轨迹优化问题。目标是最小化飞行器的行进时间,确保满足飞行器的安全操作所需的通信连接性约束。我们考虑两种不同的标准,导致两种不同的情况下的飞行器的连接约束。在第一种情况下,我们假设飞行器在地面基站(GBS)覆盖范围之外的最大连续持续时间被限制到给定阈值。然而,在第二种情况下,我们假设飞行器不被GBS覆盖的总时间段是有限的。基于这两个约束,我们制定了两个轨迹优化问题。为了解决这些非凸问题,我们使用基于双Q学习方法的方法,双Q学习方法是一种无模型强化学习技术,与现有算法不同,它不需要对环境有完美的了解。此外,与众所周知的Q-学习技术相比,我们的双Q-学习算法不受过估计问题的影响。仿真结果表明,虽然我们的算法不需要先验信息的环境,它的工作很好,表现出接近最优的性能。

英文摘要:

This paper studies the trajectory optimization problem for an aerial vehicle with the mission of flying between a pair of given initial and final locations. The objective is to minimize the travel time of the aerial vehicle ensuring that the communication connectivity constraint required for the safe operation of the aerial vehicle is satisfied. We consider two different criteria for the connectivity constraint of the aerial vehicle which leads to two different scenarios. In the first scenario, we assume that the maximum continuous time duration that the aerial vehicle is out of the coverage of the ground base stations (GBSs) is limited to a given threshold. In the second scenario, however, we assume that the total time periods that the aerial vehicle is not covered by the GBSs is restricted. Based on these two constraints, we formulate two trajectory optimization problems. To solve these non-convex problems, we use an approach based on the double Q-learning method which is a model-free reinforcement learning technique and unlike the existing algorithms does not need perfect knowledge of the environment. Moreover, in contrast to the well-known Q-learning technique, our double Q-learning algorithm does not suffer from the over-estimation issue. Simulation results show that although our algorithm does not require prior information of the environment, it works well and shows near optimal performance.

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

↑