| 2020 | A Guide to Budgeted Tree Search. Nathan R. Sturtevant, Malte Helmert |
| 2020 | A Simple and Fast Bi-Objective Search Algorithm. Carlos Hernández Ulloa, William Yeoh, Jorge A. Baier, Luis Suazo, Han Zhang, Sven Koenig |
| 2020 | An Atom-Centric Perspective on Stubborn Sets. Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers |
| 2020 | Applying Monte-Carlo Tree Search in HTN Planning. Julia Wichlacz, Daniel Höller, Álvaro Torralba, Jörg Hoffmann |
| 2020 | Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem. Raad Salman, Fredrik Ekstedt, Peter Damaschke |
| 2020 | Computing Plan-Length Bounds Using Lengths of Longest Paths. Mohammad Abdulaziz, Dominik Berger |
| 2020 | Cooperative Path Planning for Heterogeneous Agents. Keisuke Otaki, Satoshi Koide, Ayano Okoso, Tomoki Nishi |
| 2020 | Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP. Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar |
| 2020 | Embedding Directed Graphs in Potential Fields Using FastMap-D. Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar |
| 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 | Generalizing Multi-Agent Path Finding for Heterogeneous Agents. Dor Atzmon, Yonathan Zax, Einat Kivity, Lidor Avitan, Jonathan Morag, Ariel Felner |
| 2020 | Heuristic AND/OR Search for Solving Influence Diagram. Junkyu Lee, Radu Marinescu, Rina Dechter |
| 2020 | Moving Agents in Formation in Congested Environments. Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig |
| 2020 | Multi-Directional Search. Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig |
| 2020 | Multi-Resolution A. Wei Du, Fahad Islam, Maxim Likhachev |
| 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 | On Modelling Multi-Agent Path Finding as a Classical Planning Problem. Jindrich Vodrázka, Roman Barták, Jirí Svancara |
| 2020 | On the Differences and Similarities of fMM and GBFHS. Shahaf S. Shperberg, Ariel Felner |
| 2020 | Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions. Lukás Chrpa, Pavel Rytír, Rostislav Horcík |
| 2020 | Proceedings of the Thirteenth International Symposium on Combinatorial Search, SOCS 2020, Online Conference [Vienna, Austria], 26-28 May 2020 Daniel Harabor, Mauro Vallati |
| 2020 | Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search. Behrouz Babaki, Gilles Pesant, Claude-Guy Quimper |
| 2020 | Solving the Watchman Route Problem on a Grid with Heuristic Search. Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner |
| 2020 | Surrogate Assisted Optimisation for Travelling Thief Problems. Majid Namazi, Conrad Sanderson, M. A. Hakim Newton, Abdul Sattar |
| 2020 | Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set Tree. Patrick Rodler |
| 2020 | Toward a String-Pulling Approach to Path Smoothing on Grid Graphs. Jihee Han, Tansel Uras, Sven Koenig |
| 2020 | Transition to eBuses with Minimal Timetable Disruptions. Alejandro Arbelaez, Laura Climent |
| 2020 | Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces. Florian Geißer, David Speck, Thomas Keller |