Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution
Abstract: The Multi-Agent Path Finding (MAPF) problem involves planning collision-free paths for multiple agents in a shared environment. The majority of MAPF solvers rely on the assumption that an agent can arrive at a specific location at a specific timestep. However, real-world execution uncertainties can cause agents to deviate from this assumption, leading to collisions and deadlocks. Prior research solves this problem by having agents follow a Temporal Plan Graph (TPG), enforcing a consistent passing order at every location as defined in the MAPF plan. However, we show that TPGs are overly strict because, in some circumstances, satisfying the passing order requires agents to wait unnecessarily, leading to longer execution time. To overcome this issue, we introduce a new graphical representation called a Bidirectional Temporal Plan Graph (BTPG), which allows switching passing orders during execution to avoid unnecessary waiting time. We design two anytime algorithms for constructing a BTPG: BTPG-na\"ive and BTPG-optimized. Experimental results show that following BTPGs consistently outperforms following TPGs, reducing unnecessary waits by 8-20%.
- Robust Multi-Agent Path Finding. In Proceedings of the International Symposium on Combinatorial Search, volume 9, 2–9.
- A Feedback Scheme to Reorder a Multi-Agent Execution Schedule by Persistently Optimizing a Switchable Action Dependency Graph. In ICAPS workshop on Distributed and Multi-Agent Planning.
- Deadlock-Free Online Plan Repair in Multi-Robot Coordination with Disturbances. In Proceedings of the International FLAIRS Conference, volume 34.
- On Multiple Moving Objects. In Proceedings of the IEEE International Conference on Robotics and Automation, volume 3, 1419–1424.
- Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 29, 155–162.
- Multi-Agent Path Finding with Kinematic Constraints. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 26, 477–485.
- Trajectory Planning for Quadrotor Swarms. IEEE Transactions on Robotics, 34(4): 856–869.
- Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 31, 477–485.
- Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search. Artificial Intelligence, 301: 103574.
- EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, 12353–12362.
- Searching with Consistent Prioritization for Multi-Agent Path Finding. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 33, 7643–7650.
- Multi-Agent Path Finding with Delay Probabilities. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 31, 3605–3612.
- Offline Time-Independent Multiagent Path Planning. IEEE Transactions on Robotics, 39(4): 2720–2737.
- Priority Inheritance with Backtracking for Iterative Multi-Agent Path Finding. In Proceedings of the International Joint Conference on Artificial Intelligence, 535–542.
- A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination [Extended Abstract]. In Proceedings of the International Symposium on Combinatorial Search, volume 16, 175–176.
- A Loosely-Coupled Approach for Multi-Robot Coordination, Motion Planning and Control. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 28, 485–493.
- Multi-Agent Pathfinding with Simultaneous Execution of Single-Agent Primitives. In Proceedings of the International Symposium on Combinatorial Search, volume 3, 88–96.
- Conflict-Based Search for Optimal Multi-Agent Pathfinding. Artificial Intelligence, 219: 40–66.
- Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. In Proceedings of the International Symposium on Combinatorial Search, volume 10, 151–158.
- Which MAPF Model Works Best for Automated Warehousing? In Proceedings of the International Symposium on Combinatorial Search, volume 15, 190–198.
- Minimizing Coordination in Multi-Agent Path Finding with Dynamic Execution. In Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, volume 18, 61–69.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.