Recent Changes - Search:


Home Page
MAPF Info
MAPF News
Mailing List
Meetings
Publications
Researchers
Benchmarks
Software
Apps
Tutorials
Class Projects

[Internal]

Publication

K. Okumura, Y. Tamura and X. Defago. Time-Independent Planning for Multiple Moving Agents. In AAAI Conference on Artificial Intelligence (AAAI), pages 11299-11307, 2021.


Abstract: Typical Multi-agent Path Finding (MAPF) solvers assume that agents move synchronously, thus neglecting the reality gap in timing assumptions, e.g., delays caused by an imperfect execution of asynchronous moves. So far, two policies enforce a robust execution of MAPF plans taken as input: either by forcing agents to synchronize or by executing plans while preserving temporal dependencies. This paper proposes an alternative approach, called time-independent planning, which is both online and distributed. We represent reality as a transition system that changes configurations according to atomic actions of agents, and use it to generate a time-independent schedule. Empirical results in a simulated environment with stochastic delays of agents' moves support the validity of our proposal.


Download the paper in pdf.

Edit - History - Print - Recent Changes - Search
Page last modified on February 22, 2025, at 08:01 AM