| 2021 | Contingent Planning for Robust Multi-Agent Path Finding. | Michal Nekvinda, Roman Bartk, Meir Kalech |
| 2021 | Studying Online Multi-Agent Path Finding. | Jonathan Morag, Roni Stern, Ariel Felner, Dor Atzmon, Eli Boyarski |
| 2021 | Customised Shortest Paths Using a Distributed Reverse Oracle. | Arthur Maho, Shizhe Zhao, Hassan Afzaal, Daniel Harabor, Peter J. Stuckey, Mark Wallace |
| 2021 | Avoiding Monochromatic Rectangles Using Shift Patterns. | Zhenjun Liu, Leroy Chew, Marijn J. H. Heule |
| 2021 | Finding the Exact Diameter of a Graph with Partial Breadth-First Searches. | Richard E. Korf |
| 2021 | Pattern Databases for Stochastic Shortest Path Problems. | Thorsten Klner, Jrg Hoffmann |
| 2021 | Experimental Evaluation of Classical Multi Agent Path Finding Algorithms. | Omri Kaduri, Eli Boyarski, Roni Stern |
| 2021 | Speeding Up Heuristic Function Synthesis via Extending the Formula Grammar. | Sergio Poo Hernandez, Vadim Bulitko |
| 2021 | Multi-Target Search in Euclidean Space with Ray Shooting. | Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic |
| 2021 | Distributional Metareasoning for Heuristic Search. | Tianyi Gu |
| 2021 | Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. | Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin |
| 2021 | Exploiting Learned Policies and Learned Heuristics in Bounded-Suboptimal Search. | Matias Greco |
| 2021 | Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. | Ofir Gordon, Yuval Filmus, Oren Salzman |
| 2021 | Learning Pseudo-Backdoors for Mixed Integer Programs. | Aaron M. Ferber, Jialin Song, Bistra Dilkina, Yisong Yue |
| 2021 | The Closed List is an Obstacle Too. | Ariel Felner, Shahaf S. Shperberg, Hadar Buzhish |
| 2021 | Metareasoning for Interleaved Planning and Execution. | Amihay Elboher, Shahaf S. Shperberg, Solomon Eyal Shimony |
| 2021 | A Measure of Quality for IDA* Heuristics. | Robert Clausecker, Florian Schintke |
| 2021 | Adversary Strategy Sampling for Effective Plan Generation. | Luks Chrpa, Pavel Rytr, Rostislav Horck, Jan Cuhel, Anastasiia Livochka, Stefan Edelkamp |
| 2021 | Generalized Conflict-Directed Search for Optimal Ordering Problems. | Jingkai Chen, Yuening Zhang, Cheng Fang, Brian C. Williams |
| 2021 | Avoiding Re-expansions in Suboptimal Best-First Search. | Jingwei Chen, Nathan R. Sturtevant |
| 2021 | ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. | Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2021 | A Planning-based Approach for In-Station Train Dispatching. | Matteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto, Luca Oneto |
| 2021 | DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. | Martin Capek, Pavel Surynek |
| 2021 | Further Improved Heuristics For Conflict-Based Search. | Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2021 | Counting Vertex-Disjoint Shortest Paths in Graphs. | Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, Elizabeth Daly |