| 2020 | Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces. | Florian Geier, David Speck, Thomas Keller |
| 2020 | Multi-Resolution A. | Wei Du, Fahad Islam, Maxim Likhachev |
| 2020 | Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions. | Luks Chrpa, Pavel Rytr, Rostislav Horck |
| 2020 | F-Cardinal Conflicts in Conflict-Based Search. | Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner |
| 2020 | From Multi-Agent Pathfinding to 3D Pipe Routing. | Gleb Belov, Wenbo Du, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei |
| 2020 | Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search. | Behrouz Babaki, Gilles Pesant, Claude-Guy Quimper |
| 2020 | Generalizing Multi-Agent Path Finding for Heterogeneous Agents. | Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag, Ariel Felner |
| 2020 | Multi-Directional Search. | Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig |
| 2020 | Transition to eBuses with Minimal Timetable Disruptions. | Alejandro Arbelaez, Laura Climent |
| 2020 | Computing Plan-Length Bounds Using Lengths of Longest Paths. | Mohammad Abdulaziz, Dominik Berger |
| 2020 | Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP. | Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar |
| 2020 | New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. | Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig |
| 2020 | Moving Agents in Formation in Congested Environments. | Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig |
| 2019 | Measuring the Vulnerability of a Multi-Agent Pathfinding Solution. | Rotem Yoeli, Roni Stern, Dor Atzmon |
| 2019 | Learning to Generate Industrial SAT Instances. | Haoze Wu, Raghuram Ramanujan |
| 2019 | Unbounded Sub-Optimal Conflict-Based Search in Complex Domains. | Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner |
| 2019 | Repairing Compressed Path Databases on Maps with Dynamic Changes. | Marco Verzeletti, Adi Botea, Marina Zanella |
| 2019 | A Learning-Based Framework for Memory-Bounded Heuristic Search: First Results. | Carlos Hernndez Ulloa, Jorge A. Baier, William Yeoh, Vadim Bulitko, Sven Koenig |
| 2019 | Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. | Pavel Surynek |
| 2019 | Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). | Pavel Surynek |
| 2019 | Algorithms for Average Regret Minimization. | Sabine Storandt, Stefan Funke |
| 2019 | Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. | Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Bartk, Eli Boyarski |
| 2019 | Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract. | Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant, Solomon Eyal Shimony, Avi Hayoun |
| 2019 | Improving Bidirectional Heuristic Search by Bounds Propagation. | Shahaf S. Shperberg, Ariel Felner, Solomon Eyal Shimony, Nathan R. Sturtevant, Avi Hayoun |
| 2019 | Guiding Search with Generalized Policies for Probabilistic Planning. | William Shen, Felipe W. Trevizan, Sam Toyer, Sylvie Thibaux, Lexing Xie |