Enhancing PIBT via Multi-Action Operations
By: Egor Yukhnevich, Anton Andreychuk
Potential Business Impact:
Helps robots move faster and avoid bumping.
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.
Similar Papers
Anytime Single-Step MAPF Planning with Anytime PIBT
Artificial Intelligence
Improves robot pathfinding, finding better routes over time.
Lightweight and Effective Preference Construction in PIBT for Large-Scale Multi-Agent Pathfinding
Multiagent Systems
Helps many robots move without bumping into each other.
Bridging Probabilistic Inference and Behavior Trees: An Interactive Framework for Adaptive Multi-Robot Cooperation
Robotics
Robots work together better, even when lost.