Planning over MAPF Agent Dependencies via Multi-Dependency PIBT
Zixiang Jiang, Yulun Zhang, Rishi Veerapaneni, Jiaoyang Li

TL;DR
This paper introduces Multi-Dependency PIBT (MD-PIBT), a flexible MAPF planning framework inspired by PIBT that handles large numbers of agents and various kinodynamic constraints more effectively.
Contribution
The paper presents MD-PIBT, a novel MAPF planning approach based on agent dependencies, generalizing PIBT and EPIBT, and capable of handling thousands of agents with diverse motion constraints.
Findings
MD-PIBT successfully plans for up to 10,000 agents.
It outperforms existing methods in large-agent MAPF scenarios.
Effective across various kinodynamic constraints.
Abstract
Modern Multi-Agent Path Finding (MAPF) algorithms must plan for hundreds to thousands of agents in congested environments within a second, requiring highly efficient algorithms. Priority Inheritance with Backtracking (PIBT) is a popular algorithm capable of effectively planning in such situations. However, PIBT is constrained by its rule-based planning procedure and lacks generality because it restricts its search to paths that conflict with at most one other agent. This limitation also applies to Enhanced PIBT (EPIBT), a recent extension of PIBT. In this paper, we describe a new perspective on solving MAPF by planning over agent dependencies. Taking inspiration from PIBT's priority inheritance logic, we define the concept of agent dependencies and propose Multi-Dependency PIBT (MD-PIBT) that searches over agent dependencies. MD-PIBT is a general framework where specific…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · AI-based Problem Solving and Planning · Constraint Satisfaction and Optimization
