Research map / Multi-agent systems and games / Human-AI and goal-conditioned
BTPG-max: Achieving Local Maximal Bidirectional Pairs for Bidirectional Temporal Plan Graphs
Yifan Su, Rishi Veerapaneni, Jiaoyang Li
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace BTPG-o cycle rules with BTPG-max reachable-deadlock-cycle detection | BTPG with grouping · six MAPF maps | bi-pairs found: 1,041 -> 4,110 (den520); 69 -> 395 (random) | Improved |
| replace BTPG-o with BTPG-max (with grouping) | BTPG · six MAPF maps | mean improvement: 9.1% -> 8.9% (den520); 14.5% -> 32.7% (random) | Mixed |
| add edge grouping to BTPG-o and BTPG-max (ablation) | BTPG-o and BTPG-max · six MAPF maps | bi-pairs found and mean improvement | Improved |
| BTPG-max without grouping vs BTPG-o without grouping | BTPG · six MAPF maps | bi-pairs found and mean improvement | Improved |
| use BTPG-max instead of BTPG-o under 10-minute cutoff | BTPG construction · Paris 1 256, 150 agents | anytime bi-pairs found | Improved |
| more bi-pairs found by BTPG-max on large maps with timeout | BTPG-max w/ grouping · den520, warehouse | used bi-pairs and mean improvement: 68 -> 62 used (den520) | No clear effect |
| add subsequent while-loop iterations for local maximality (ablation) | BTPG-max · Paris 1 256, 150 agents | bi-pairs found | No clear effect |
Closest papers by meaning
- Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution (AAAI 2024 · similarity 0.95)
- Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions (AAAI 2025 · similarity 0.88)
- Learn to Follow: Decentralized Lifelong Multi-Agent Pathfinding via Planning and Learning (AAAI 2024 · similarity 0.88)
- Speedup Techniques for Switchable Temporal Plan Graph Optimization (AAAI 2025 · similarity 0.88)
- Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (AAAI 2024 · similarity 0.88)
- Windowed MAPF with Completeness Guarantees (AAAI 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
