Position Paper: From Multi-Agent Pathfinding to Pipe Routing

by   Gleb Belov, et al.

The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free paths for a number of agents, from a set of start locations to a set of goal positions in a known 2D environment. MAPF has been studied in theoretical computer science, robotics, and artificial intelligence over several decades, due to its importance for robot navigation. It is currently experiencing significant scientific progress due to its relevance in automated warehousing (such as those operated by Amazon) and in other contemporary application areas. In this paper, we demonstrate that many recently developed MAPF algorithms apply more broadly than currently believed in the MAPF research community. In particular, we describe the 3D Pipe Routing (PR) problem, which aims at placing collision-free pipes from given start locations to given goal locations in a known 3D environment. The MAPF and PR problems are similar: a solution to a MAPF instance is a set of blocked cells in x-y-t space, while a solution to the corresponding PR instance is a set of blocked cells in x-y-z space. We show how to use this similarity to apply several recently developed MAPF algorithms to the PR problem, and discuss their performance on abstract PR instances. We also discuss further research necessary to tackle real-world pipe-routing instances of interest to industry today. This opens up a new direction of industrial relevance for the MAPF research community.


Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios

Multi-agent path finding (MAPF) is well-studied in artificial intelligen...

Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments

Multi-agent path finding (MAPF) is a well-studied problem in artificial ...

Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation

Multi-agent pathfinding (MAPF) is concerned with planning collision-free...

Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities

Multi-agent path finding (MAPF) attracts considerable attention in artif...

Loosely Synchronized Search for Multi-agent Path Finding with Asynchronous Actions

Multi-agent path finding (MAPF) determines an ensemble of collision-free...

Leveraging Experience in Lifelong Multi-Agent Pathfinding

In Lifelong Multi-Agent Path Finding (L-MAPF) a team of agents performs ...

Vehicle Routing and Scheduling for Regular Mobile Healthcare Services

We propose our solution to a particular practical problem in the domain ...

Please sign up or login with your details

Forgot password? Click here to reset