Bounded Rational Unmanned Aerial Vehicle Coordination For Adversarial Target Tracking

2020 AMERICAN CONTROL CONFERENCE (ACC)(2020)

引用 10|浏览5
暂无评分
摘要
This paper addresses the problem of tracking an actively evading target by employing a team of coordinating unmanned aerial vehicles while also learning the level of intelligence for appropriate countermeasures. Initially, under infinite cognitive resources, we formulate a game between the evader and the pursuing team, with an evader being the maximizing player and the pursuing team being the minimizing one. We derive optimal pursuing and evading policies while taking into account the physical constraints imposed by Dubins vehicles. Subsequently, we relax the infinite rationality assumption, via the use of level-k thinking. Such rationality policies are computed by using a reinforcement learning-based architecture and are proven to converge to the Nash policies as the thinking levels increase. Finally, simulation results verify the efficacy of the approach.
更多
查看译文
关键词
maximizing player,pursuing team,optimal pursuing,evading policies,Dubins vehicles,infinite rationality assumption,level-k thinking,rationality policies,reinforcement learning-based architecture,adversarial target tracking,unmanned aerial vehicles,infinite cognitive resources,bounded rational unmanned aerial vehicle coordination,pursuing policies,Nash policies
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要