| 2022 | Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding. | Shuyang Zhang, Jiaoyang Li, Taoan Huang, Sven Koenig, Bistra Dilkina |
| 2022 | Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough (Extended Abstract). | David Zahrdka, Anton Andreychuk, Miroslav Kulich, Konstantin S. Yakovlev |
| 2022 | Effectively Incorporating Weighted Cost-to-go Heuristic in Suboptimal CBS (Extended Abstract). | Rishi Veerapaneni, Tushar Kusnur, Maxim Likhachev |
| 2022 | Which MAPF Model Works Best for Automated Warehousing? | Sumanth Varambally, Jiaoyang Li, Sven Koenig |
| 2022 | Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract). | Devin Wild Thomas, Tianyi Gu, Wheeler Ruml, Solomon Eyal Shimony |
| 2022 | Meeting at the Border of Two Separate Domains. | Alexandru Paul Tabacaru, Dor Atzmon, Ariel Felner |
| 2022 | Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? (Extended Abstract). | Jir Svancara, Philipp Obermeier, Matej Husr, Roman Bartk, Torsten Schaub |
| 2022 | Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract). | Pavel Surynek |
| 2022 | Bounded-Cost Bi-Objective Heuristic Search. | Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernndez Ulloa |
| 2022 | Additive Pattern Databases for Decoupled Search. | Silvan Sievers, Daniel Gnad, lvaro Torralba |
| 2022 | Enhanced Multi-Objective A* Using Balanced Binary Search Trees. | Zhongqiang Ren, Richard Zhan, Sivakumar Rathinam, Maxim Likhachev, Howie Choset |
| 2022 | Light Contraction Hierarchies: Hierarchical Search Without Shortcuts. | Claudius Proissl |
| 2022 | Trajectory Constraint Heuristics for Optimal Probabilistic Planning. | John R. Peterson, Anagha Kulkarni, Emil Keyder, Joseph Kim, Shlomo Zilberstein |
| 2022 | On the Reformulation of Discretised PDDL+ to Numeric Planning (Extended Abstract). | Francesco Percassi, Enrico Scala, Mauro Vallati |
| 2022 | A Discussion on the Scalability of Heuristic Approximators (Extended Abstract). | Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon |
| 2022 | Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning (Extended Abstract). | Stefan O'Toole, Miquel Ramrez, Nir Lipovetzky, Adrian R. Pearce |
| 2022 | The JPS Pathfinding System in 3D. | Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh |
| 2022 | Joint Chance Constrained Probabilistic Simple Temporal Networks via Column Generation (Extended Abstract). | Andrew Murray, Michael Cashmore, Ashwin Arulselvan, Jeremy Frank |
| 2022 | ePA*SE: Edge-Based Parallel A* for Slow Evaluations. | Shohin Mukherjee, Sandip Aine, Maxim Likhachev |
| 2022 | Online Multi-Agent Path Finding: New Results. | Jonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski |
| 2022 | Heuristic Search for SSPs with Lexicographic Preferences over Multiple Costs. | Shuwa Miura, Kyle Hollins Wray, Shlomo Zilberstein |
| 2022 | Beyond Markov Decision Process with Scalar Markovian Rewards. | Shuwa Miura |
| 2022 | Leveraging Experience in Lifelong Multi-Agent Pathfinding. | Nitzan Madar, Kiril Solovey, Oren Salzman |
| 2022 | Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract). | Yaakov Livne, Dor Atzmon, Shawn Skyler, Eli Boyarski, Amir Shapiro, Ariel Felner |
| 2022 | Optimal Search with Neural Networks: Challenges and Approaches. | Tianhua Li, Ruimin Chen, Borislav Mavrin, Nathan R. Sturtevant, Doron Nadav, Ariel Felner |