论文标题

降低多代理路径计划中的碰撞风险:向空中交通管理申请

Reducing Collision Risk in Multi-Agent Path Planning: Application to Air traffic Management

论文作者

Li, Sarah H. Q., Mittal, Avi, Garoche, Pierre-Loïc, Açıkmeşe, Behçet

论文摘要

为了最大程度地减少随机过渡动态的多代理路径计划问题的碰撞风险,我们以多线性拥塞成本制定了马尔可夫决策过程拥塞游戏。游戏中的玩家完成了单个任务,同时最大程度地减少了自己的碰撞风险。我们表明,NASH平衡集与非凸优化问题的一阶KKT点一致。我们的游戏应用于法国的历史飞行计划,以降低商用飞机之间的碰撞风险。

To minimize collision risks in the multi-agent path planning problem with stochastic transition dynamics, we formulate a Markov decision process congestion game with a multi-linear congestion cost. Players within the game complete individual tasks while minimizing their own collision risks. We show that the set of Nash equilibria coincides with the first-order KKT points of a non-convex optimization problem. Our game is applied to a historical flight plan over France to reduce collision risks between commercial aircraft.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源