| 2021 | A Hierarchical Approach to Multi-Agent Path Finding. Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig |
| 2021 | A Measure of Quality for IDA* Heuristics. Robert Clausecker, Florian Schintke |
| 2021 | A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers. Roberto Javier Asín Achá, Rodrigo López, Sebastián Hagedorn, Jorge A. Baier |
| 2021 | A Planning-based Approach for In-Station Train Dispatching. Matteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto, Luca Oneto |
| 2021 | Adversary Strategy Sampling for Effective Plan Generation. Lukás Chrpa, Pavel Rytír, Rostislav Horcík, Jan Cuhel, Anastasiia Livochka, Stefan Edelkamp |
| 2021 | Avoiding Monochromatic Rectangles Using Shift Patterns. Zhenjun Liu, Leroy Chew, Marijn J. H. Heule |
| 2021 | Avoiding Re-expansions in Suboptimal Best-First Search. Jingwei Chen, Nathan R. Sturtevant |
| 2021 | Bi-Objective Search with Bi-directional A* (Extended Abstract). Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby |
| 2021 | Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT. Pavel Surynek |
| 2021 | Conflict-Free Multi-Agent Meeting. Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner |
| 2021 | Contingent Planning for Robust Multi-Agent Path Finding. Michal Nekvinda, Roman Barták, Meir Kalech |
| 2021 | Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin |
| 2021 | Counting Vertex-Disjoint Shortest Paths in Graphs. Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, Elizabeth Daly |
| 2021 | Customised Shortest Paths Using a Distributed Reverse Oracle. Arthur Mahéo, Shizhe Zhao, Hassan Afzaal, Daniel Harabor, Peter J. Stuckey, Mark Wallace |
| 2021 | DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. Martin Capek, Pavel Surynek |
| 2021 | Distributional Metareasoning for Heuristic Search. Tianyi Gu |
| 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 | Experimental Evaluation of Classical Multi Agent Path Finding Algorithms. Omri Kaduri, Eli Boyarski, Roni Stern |
| 2021 | Explainable Problem in clingo-dl Programs. Van Nguyen, Tran Cao Son, William Yeoh |
| 2021 | Exploiting Learned Policies and Learned Heuristics in Bounded-Suboptimal Search. Matias Greco |
| 2021 | Exploiting Learned Policies in Focal Search. Pablo Araneda, Matias Greco, Jorge A. Baier |
| 2021 | Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding. Hang Ma |
| 2021 | Fast Bounded Suboptimal Probabilistic Planning with Clear Preferences on Missing Information. Ishani Chatterjee, Tushar Kusnur, Maxim Likhachev |
| 2021 | Finding the Exact Diameter of a Graph with Partial Breadth-First Searches. Richard E. Korf |
| 2021 | From Classical to Colored Multi-Agent Path Finding. Roman Barták, Marika Ivanová, Jirí Svancara |
| 2021 | Further Improved Heuristics For Conflict-Based Search. Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2021 | Generalized Conflict-Directed Search for Optimal Ordering Problems. Jingkai Chen, Yuening Zhang, Cheng Fang, Brian C. Williams |
| 2021 | How to Speed-Up the Automated Configuration of Optimization Algorithms. Marcelo de Souza |
| 2021 | Improving Continuous-time Conflict Based Search. Anton Andreychuk, Konstantin S. Yakovlev, Eli Boyarski, Roni Stern |
| 2021 | Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory. Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant |
| 2021 | Landmark Heuristics for Lifted Planning - Extended Abstract. Julia Wichlacz, Daniel Höller, Jörg Hoffmann |
| 2021 | Learning Pseudo-Backdoors for Mixed Integer Programs. Aaron M. Ferber, Jialin Song, Bistra Dilkina, Yisong Yue |
| 2021 | Learning-Based Synthesis of Social Laws in STRIPS. Ronen Nir, Alexander Shleyfman, Erez Karpas |
| 2021 | Linear-Space Best-First Diagnosis Search. Patrick Rodler |
| 2021 | Meta-level Techniques for Planning, Search, and Scheduling. Shahaf S. Shperberg |
| 2021 | Metareasoning for Interleaved Planning and Execution. Amihay Elboher, Shahaf S. Shperberg, Solomon Eyal Shimony |
| 2021 | Multi-Agent Pickup and Delivery with Task Deadlines. Xiaohu Wu, Yihao Liu, Xueyan Tang, Wentong Cai, Funing Bai, Gilbert Khonstantine, Guopeng Zhao |
| 2021 | Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation. David Vainshtein, Oren Salzman |
| 2021 | Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. Pavel Surynek |
| 2021 | Multi-Target Search in Euclidean Space with Ray Shooting. Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic |
| 2021 | On the Benefits of Randomly Adjusting Anytime Weighted A. Abhinav Bhatia, Justin Svegliato, Shlomo Zilberstein |
| 2021 | Pattern Databases for Stochastic Shortest Path Problems. Thorsten Klößner, Jörg Hoffmann |
| 2021 | Proceedings of the Fourteenth International Symposium on Combinatorial Search, SOCS 2021, Virtual Conference [Jinan, China], July 26-30, 2021 Hang Ma, Ivan Serina |
| 2021 | Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. Ofir Gordon, Yuval Filmus, Oren Salzman |
| 2021 | SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems. Joel Oren, Chana Ross, Maksym Lefarov, Felix Richter, Ayal Taitler, Zohar Feldman, Dotan Di Castro, Christian Daniel |
| 2021 | Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig |
| 2021 | Scaling Up Search with Partial Initial States in Optimization Crosswords. Adi Botea, Vadim Bulitko |
| 2021 | Solving Sokoban with Forward-Backward Reinforcement Learning. Yaron Shoham, Gal Elidan |
| 2021 | Speeding Up Heuristic Function Synthesis via Extending the Formula Grammar. Sergio Poo Hernandez, Vadim Bulitko |
| 2021 | Studying Online Multi-Agent Path Finding. Jonathan Morag, Roni Stern, Ariel Felner, Dor Atzmon, Eli Boyarski |
| 2021 | Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search. Tamir Yaffe, Shawn Skyler, Ariel Felner |
| 2021 | Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories. Pavel Surynek |
| 2021 | The Closed List is an Obstacle Too. Ariel Felner, Shahaf S. Shperberg, Hadar Buzhish |
| 2021 | Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning. Tomás Rybecký, Miroslav Kulich, Anton Andreychuk, Konstantin S. Yakovlev |