| 2021 | Scaling Up Search with Partial Initial States in Optimization Crosswords. | Adi Botea, Vadim Bulitko |
| 2021 | On the Benefits of Randomly Adjusting Anytime Weighted A. | Abhinav Bhatia, Justin Svegliato, Shlomo Zilberstein |
| 2021 | From Classical to Colored Multi-Agent Path Finding. | Roman Bartk, Marika Ivanov, Jir Svancara |
| 2021 | Conflict-Free Multi-Agent Meeting. | Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner |
| 2021 | Exploiting Learned Policies in Focal Search. | Pablo Araneda, Matias Greco, Jorge A. Baier |
| 2021 | Improving Continuous-time Conflict Based Search. | Anton Andreychuk, Konstantin S. Yakovlev, Eli Boyarski, Roni Stern |
| 2021 | Bi-Objective Search with Bi-directional A* (Extended Abstract). | Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby |
| 2021 | A New Boolean Encoding for MAPF and its Performance with ASP and MaxSAT Solvers. | Roberto Javier Asn Ach, Rodrigo Lpez, Sebastin Hagedorn, Jorge A. Baier |
| 2021 | Fast Bounded Suboptimal Probabilistic Planning with Clear Preferences on Missing Information. | Ishani Chatterjee, Tushar Kusnur, Maxim Likhachev |
| 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 | Extended Abstract: A Competitive Analysis of Online Multi-Agent Path Finding. | Hang Ma |
| 2020 | Applying Monte-Carlo Tree Search in HTN Planning. | Julia Wichlacz, Daniel Hller, lvaro Torralba, Jrg Hoffmann |
| 2020 | On Modelling Multi-Agent Path Finding as a Classical Planning Problem. | Jindrich Vodrzka, Roman Bartk, Jir Svancara |
| 2020 | A Simple and Fast Bi-Objective Search Algorithm. | Carlos Hernndez Ulloa, William Yeoh, Jorge A. Baier, Luis Suazo, Han Zhang, Sven Koenig |
| 2020 | A Guide to Budgeted Tree Search. | Nathan R. Sturtevant, Malte Helmert |
| 2020 | On the Differences and Similarities of fMM and GBFHS. | Shahaf S. Shperberg, Ariel Felner |
| 2020 | Solving the Watchman Route Problem on a Grid with Heuristic Search. | Shawn Seiref, Tamir Jaffey, Margarita Lopatin, Ariel Felner |
| 2020 | Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem. | Raad Salman, Fredrik Ekstedt, Peter Damaschke |
| 2020 | An Atom-Centric Perspective on Stubborn Sets. | Gabriele Rger, Malte Helmert, Jendrik Seipp, Silvan Sievers |
| 2020 | Too Good to Throw Away: A Powerful Reuse Strategy for Reiter's Hitting Set Tree. | Patrick Rodler |
| 2020 | Cooperative Path Planning for Heterogeneous Agents. | Keisuke Otaki, Satoshi Koide, Ayano Okoso, Tomoki Nishi |
| 2020 | Surrogate Assisted Optimisation for Travelling Thief Problems. | Majid Namazi, Conrad Sanderson, M. A. Hakim Newton, Abdul Sattar |
| 2020 | Heuristic AND/OR Search for Solving Influence Diagram. | Junkyu Lee, Radu Marinescu, Rina Dechter |
| 2020 | Toward a String-Pulling Approach to Path Smoothing on Grid Graphs. | Jihee Han, Tansel Uras, Sven Koenig |
| 2020 | Embedding Directed Graphs in Potential Fields Using FastMap-D. | Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar |