144 citations · 182 across the 9 of their papers we have counts for
11 papers
Iterative Refinement for Real-Time Multi-Robot Path Planning
Keisuke Okumura, Yasumasa Tamura, Xavier Defago
We study the iterative refinement of path planning for multiple robots, known as multi-agent pathfinding (MAPF). Given a graph, agents, their initial locations, and destinations, a…
Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space
Xavier Défago, Adam Heriban, Sébastien Tixeuil +1
The paper details the first successful attempt at using model-checking techniques to verify the correctness of distributed algorithms for robots evolving in a \emph{continuous} env…
winPIBT: Extended Prioritized Algorithm for Iterative Multi-agent Path Finding
Keisuke Okumura, Yasumasa Tamura, Xavier Défago
The problem of Multi-agent Path Finding (MAPF) consists in providing agents with efficient paths while preventing collisions. Numerous solvers have been developed so far since MAPF…
Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding
Keisuke Okumura, Manao Machida, Xavier Défago +1
In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph must reach their own respective destinations without inter-agent collisions. In practical MAPF app…
Optimal Rendezvous -Algorithms for Asynchronous Mobile Robots with External-Lights
Takashi Okumura, Koichi Wada, Xavier Défago
We study the Rendezvous problem for 2 autonomous mobile robots in asynchronous settings with persistent memory called light. It is well known that Rendezvous is impossible in a bas…
Optimally Gathering Two Robots
Adam Heriban, Xavier Défago, Sébastien Tixeuil
We present an algorithm that ensures in finite time the gathering of two robots in the non-rigid ASYNC model. To circumvent established impossibility results, we assume robots are…