Good Papers

Enhancing PIBT via Multi-Action Operations

Enhanced PIBT incorporates multi-action operations to handle rotation actions efficiently, preserving speed while achieving state-of-the-art online LMAPF-T performance with graph guidance and large neighborhood search.

Egor Yukhnevich, Anton Andreychuk

Published Mar 14, 20261 citationPaper ↗

68%
OverallHighly rated
?
OverallHighly ratedVote to see the score
Readers
–

Only vote on papers you've read. Sign in to vote.

AI panel5/20reviewers recommend it
lenient 2/5
medium 3/10
strict 0/5
AI panel?Vote to see what the 20 AI reviewers said

Abstract

PIBT is a rule-based Multi-Agent Path Finding (MAPF) solver, widely used as a low-level planner or action sampler in many state-of-the-art approaches. Its primary advantage lies in its exceptional speed, enabling action selection for thousands of agents within milliseconds by considering only the immediate next timestep. However, this short-horizon design leads to poor performance in scenarios where agents have orientation and must perform time-consuming rotation actions. In this work, we present an enhanced version of PIBT that addresses this limitation by incorporating multi-action operations. We detail the modifications introduced to improve PIBT's performance while preserving its hallmark efficiency. Furthermore, we demonstrate how our method, when combined with graph guidance technique and large neighborhood search optimization, achieves state-of-the-art performance in the online LMAPF-T setting.