Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds

18 April 2021

Papers citing "Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds"

4 / 4 papers shown

Title
A Scalable Post-Processing Pipeline for Large-Scale Free-Space Multi-Agent Path Planning with PiBT Arjo Chakravarty Michael X. Grey M. Muthugala M. R. Elara 15 0 0 20 Jun 2025
On the Completeness of Conflict-Based Search: Temporally-Relative Duplicate Pruning Thayne T. Walker Nathan R Sturtevant 27 0 0 16 Aug 2024
Coordinated Multi-Agent Pathfinding for Drones and Trucks over Road Networks Shushman Choudhury Kiril Solovey Mykel Kochenderfer Marco Pavone 98 14 0 17 Oct 2021
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance Nir Greshler Ofir Gordon Oren Salzman N. Shimkin 83 16 0 23 May 2021