Skip to content
conftrace_

conflict-based search

19 papers

CBS

Papers

db-ECBS: Interaction-Aware Multirobot Kinodynamic Motion Planning (Abstract Reprint) AAAI 2026 Dynamic Agent Grouping ECBS: Scaling Windowed Multi-Agent Path Finding with Completeness Guarantees AAAI 2026 Multi-Agent Corridor Reasoning for Multi-Agent Path Finding AAAI 2026 Streaming Multi-agent Pathfinding IJCAI 2025 Windowed MAPF with Completeness Guarantees AAAI 2025 MGCBS: An Optimal and Efficient Algorithm for Solving Multi-Goal Multi-Agent Path Finding Problem IJCAI 2024 Effective Integration of Weighted Cost-to-Go and Conflict Heuristic within Suboptimal CBS AAAI 2023 Conflict-Based Steiner Search for Multi-Agent Combinatorial Path Finding RSS 2022 f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search AAAI 2021 Improving Continuous-time Conflict Based Search AAAI 2021 Learning to Resolve Conflicts for Multi-Agent Path Finding with Conflict-Based Search AAAI 2021 Symmetry Breaking for k-Robust Multi-Agent Path Finding AAAI 2021 Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search AAAI 2020 Iterative-Deepening Conflict-Based Search IJCAI 2020 Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search IJCAI 2019 Multi-Agent Path Finding for Large Agents AAAI 2019 Multi-Agent Pathfinding with Continuous Time IJCAI 2019 Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding AAAI 2019 Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories IJCAI 2019