144 citations · 183 across the 8 of their papers we have counts for
8 papers
Roadside-assisted Cooperative Planning using Future Path Sharing for Autonomous Driving
Mai Hirata, Manabu Tsukada, Keisuke Okumura +3
Cooperative intelligent transportation systems (ITS) are used by autonomous vehicles to communicate with surrounding autonomous vehicles and roadside units (RSU). Current C-ITS app…
Offline Time-Independent Multi-Agent Path Planning
Keisuke Okumura, François Bonnet, Yasumasa Tamura +1
This paper studies a novel planning problem for multiple agents that cannot share holding resources, named OTIMAPP (Offline Time-Independent Multi-Agent Path Planning). Given a gra…
Active Modular Environment for Robot Navigation
Shota Kameyama, Keisuke Okumura, Yasumasa Tamura +1
This paper presents a novel robot-environment interaction in navigation tasks such that robots have neither a representation of their working space nor planning function, instead,…
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…
Quixo Is Solved
Satoshi Tanaka, François Bonnet, Sébastien Tixeuil +1
Quixo is a two-player game played on a 55 grid where the players try to align five identical symbols. Specifics of the game require the usage of novel techniques. Using a c…
Time-Independent Planning for Multiple Moving Agents
Keisuke Okumura, Yasumasa Tamura, Xavier Défago
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 ex…
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…