Log In Sign Up

CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces

by   Keisuke Okumura, et al.

Multi-agent path planning (MAPP) in continuous spaces is a challenging problem with significant practical importance. One promising approach is to first construct graphs approximating the spaces, called roadmaps, and then apply multi-agent pathfinding (MAPF) algorithms to derive a set of conflict-free paths. While conventional studies have utilized roadmap construction methods developed for single-agent planning, it remains largely unexplored how we can construct roadmaps that work effectively for multiple agents. To this end, we propose a novel concept of roadmaps called cooperative timed roadmaps (CTRMs). CTRMs enable each agent to focus on its important locations around potential solution paths in a way that considers the behavior of other agents to avoid inter-agent collisions (i.e., "cooperative"), while being augmented in the time direction to make it easy to derive a "timed" solution path. To construct CTRMs, we developed a machine-learning approach that learns a generative model from a collection of relevant problem instances and plausible solutions and then uses the learned model to sample the vertices of CTRMs for new, previously unseen problem instances. Our empirical evaluation revealed that the use of CTRMs significantly reduced the planning effort with acceptable overheads while maintaining a success rate and solution quality comparable to conventional roadmap construction approaches.


page 1

page 2

page 3

page 4


Path Planning Games

Path planning is a fundamental and extensively explored problem in robot...

Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance

We introduce the Cooperative Multi-Agent Path Finding (Co-MAPF) problem,...

Cooperative Multi-Agent Planning: A Survey

Cooperative multi-agent planning (MAP) is a relatively recent research f...

Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality

Conflict-Based Search is one of the most popular methods for multi-agent...

Proximal operators for multi-agent path planning

We address the problem of planning collision-free paths for multiple age...

Cooperative Pathfinding based on high-scalability Multi-agent RRT*

Problems that claim several agents to find no-conflicts paths from their...

Iterative Refinement for Real-Time Multi-Robot Path Planning

We study the iterative refinement of path planning for multiple robots, ...

Code Repositories


CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces (AAMAS-22)

view repo