publication venue for
- Enhanced Multi-Objective A* Using Balanced Binary Search Trees. 15:162-170. 2022
- Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract). 15:258-260. 2022
- A Discussion on the Scalability of Heuristic Approximators (Extended Abstract). 15:311-313. 2022
- Exponential Deepening A* for Real-Time Agent-Centered Search. 5:209-210. 2021
- ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. 6:223-225. 2021
- Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges 2017
- Extended Abstract: An Improved Priority Function for Bidirectional Heuristic Search 2016
- Partial Domain Search Tree for Constraint-Satisfaction Problems 2015
- Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem 2014
- Online Detection of Dead States in Real-Time Agent-Centered Search 2013
- Conflict-Based Search for Optimal Multi-Agent Path Finding 2012
- Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding 2012
- Partial-Expansion A* with Selective Node Generation 2012
- Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding 2011