| 2022 | An Online Approach for Multi-Agent Path Finding Under Movement Uncertainty (Extended Abstract). | Elad Levy, Guy Shani, Roni Stern |
| 2022 | A Jeep Crossing a Desert of Unknown Width (Extended Abstract). | Richard E. Korf |
| 2022 | Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract). | Kristna Janovsk, Pavel Surynek |
| 2022 | Urban Traffic Control via Planning with Global State Constraints (Extended Abstract). | Franc Ivankovic, Mauro Vallati, Luks Chrpa, Marco Roveri |
| 2022 | On Bidirectional Heuristic Search in Classical Planning: An Analysis of BAE. | Kilian Hu, David Speck |
| 2022 | IPO-MAXSAT: Combining the In-Parameter-Order Strategy for Covering Array Generation with MaxSAT Solving (Extended Abstract). | Irene Hiess, Ludwig Kampel, Michael Wagner, Dimitris E. Simos |
| 2022 | Neural Network Heuristic Functions: Taking Confidence into Account. | Daniel Heller, Patrick Ferber, Julian Bitterwolf, Matthias Hein, Jrg Hoffmann |
| 2022 | Dual Euclidean Shortest Path Search (Extended Abstract). | Ryan Hechenberger, Peter J. Stuckey, Pierre Le Bodic, Daniel Damir Harabor |
| 2022 | Benchmarks for Pathfinding Search: Iron Harvest. | Daniel Harabor, Ryan Hechenberger, Thomas Jahn |
| 2022 | When to Commit to an Action in Online Planning and Search. | Tianyi Gu, Wheeler Ruml, Shahaf S. Shperberg, Solomon Eyal Shimony, Erez Karpas |
| 2022 | K-Focal Search for Slow Learned Heuristics (Extended Abstract). | Matias Greco, Jorge Toro, Carlos Hernndez Ulloa, Jorge A. Baier |
| 2022 | Avoiding Errors in Learned Heuristics in Bounded-Suboptimal Search. | Matias Greco, Jorge A. Baier |
| 2022 | Focal Discrepancy Search for Learned Heuristics (Extended Abstract). | Matias Greco, Pablo Araneda, Jorge A. Baier |
| 2022 | On the Use of Width-Based Search for Multi Agent Privacy-Preserving Planning (Extended Abstract). | Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina |
| 2022 | A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide Programs. | Chao Gao, Jingwei Chen, Tong Mo, Tanvir Sajed, Shangling Jui, Min Qin, Laiyuan Gong, Wei Lu |
| 2022 | Parallel Beam Search for Combinatorial Optimization (Extended Abstract). | Nikolaus Frohner, Jan Gmys, Nouredine Melab, Gnther R. Raidl, El-Ghazali Talbi |
| 2022 | Lazy Compilation in Classical Planning (Extended Abstract). | Zuzana Flov, Pavel Surynek |
| 2022 | Fast Traffic Assignment by Focusing on Changing Edge Flows (Extended Abstract). | Ali Davoodi, Mark Wallace, Daniel Harabor |
| 2022 | MA3: Model-Accuracy Aware Anytime Planning with Simulation Verification for Navigating Complex Terrains. | Manash Pratim Das, Damon M. Conover, Sungmin Eum, Heesung Kwon, Maxim Likhachev |
| 2022 | Deep RRT. | Xuzhe Dang, Luks Chrpa, Stefan Edelkamp |
| 2022 | Generalized Longest Path Problems. | Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Ariel Felner |
| 2022 | A Conflict Avoidance Table for Continuous Conflict-Based Search (Extended Abstract). | Vianney Copp, Pierre Schaus |
| 2022 | Effective Planning in Resource-Competition Problems by Task Decomposition. | Luks Chrpa, Pavel Rytr, Andrii Nyporko, Rostislav Horck, Stefan Edelkamp |
| 2022 | Local Motif Clustering via (Hyper)Graph Partitioning. | Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz |
| 2022 | Multi-Train Path Finding Revisited. | Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig |