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

12/08/2022
by   Sarah H. Q. Li, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/23/2022

Congestion-aware path coordination game with Markov decision process dynamics

Inspired by the path coordination problem arising from robo-taxis, wareh...
research
08/03/2020

A Combination of Theta*, ORCA and Push and Rotate for Multi-agent Navigation

We study the problem of multi-agent navigation in static environments wh...
research
01/26/2023

Periodic Multi-Agent Path Planning

Multi-agent path planning (MAPP) is the problem of planning collision-fr...
research
04/01/2022

Multi-Agent Path Planning with Asymmetric Interactions In Tight Spaces

By starting with the assumption that motion is fundamentally a decision ...
research
02/23/2022

Dense Multi-Agent Navigation Using Voronoi Cells and Congestion Metric-based Replanning

We present a decentralized path-planning algorithm for navigating multip...
research
07/02/2020

Multi-agent Planning for thermalling gliders using multi level graph-search

This paper solves a path planning problem for a group of gliders. The gl...
research
07/10/2018

SimArch: A Multi-agent System For Human Path Simulation In Architecture Design

Human moving path is an important feature in architecture design. By stu...

Please sign up or login with your details

Forgot password? Click here to reset