| 2022 | A Conflict Avoidance Table for Continuous Conflict-Based Search (Extended Abstract). Vianney Coppé, Pierre Schaus |
| 2022 | A Discussion on the Scalability of Heuristic Approximators (Extended Abstract). Sumedh Pendurkar, Taoan Huang, Sven Koenig, Guni Sharon |
| 2022 | A Jeep Crossing a Desert of Unknown Width (Extended Abstract). Richard E. Korf |
| 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 | Additive Pattern Databases for Decoupled Search. Silvan Sievers, Daniel Gnad, Álvaro Torralba |
| 2022 | An Online Approach for Multi-Agent Path Finding Under Movement Uncertainty (Extended Abstract). Elad Levy, Guy Shani, Roni Stern |
| 2022 | Anytime Approximate Bi-Objective Search. Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig |
| 2022 | Avoiding Errors in Learned Heuristics in Bounded-Suboptimal Search. Matias Greco, Jorge A. Baier |
| 2022 | Benchmarks for Pathfinding Search: Iron Harvest. Daniel Harabor, Ryan Hechenberger, Thomas Jahn |
| 2022 | Beyond Markov Decision Process with Scalar Markovian Rewards. Shuwa Miura |
| 2022 | Bounded-Cost Bi-Objective Heuristic Search. Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa |
| 2022 | Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract). Kristýna Janovská, Pavel Surynek |
| 2022 | Deep RRT. Xuzhe Dang, Lukás Chrpa, Stefan Edelkamp |
| 2022 | Dual Euclidean Shortest Path Search (Extended Abstract). Ryan Hechenberger, Peter J. Stuckey, Pierre Le Bodic, Daniel Damir Harabor |
| 2022 | Effective Planning in Resource-Competition Problems by Task Decomposition. Lukás Chrpa, Pavel Rytír, Andrii Nyporko, Rostislav Horcík, Stefan Edelkamp |
| 2022 | Effectively Incorporating Weighted Cost-to-go Heuristic in Suboptimal CBS (Extended Abstract). Rishi Veerapaneni, Tushar Kusnur, Maxim Likhachev |
| 2022 | Enhanced Multi-Objective A* Using Balanced Binary Search Trees. Zhongqiang Ren, Richard Zhan, Sivakumar Rathinam, Maxim Likhachev, Howie Choset |
| 2022 | Fast Traffic Assignment by Focusing on Changing Edge Flows (Extended Abstract). Ali Davoodi, Mark Wallace, Daniel Harabor |
| 2022 | Focal Discrepancy Search for Learned Heuristics (Extended Abstract). Matias Greco, Pablo Araneda, Jorge A. Baier |
| 2022 | Generalized Longest Path Problems. Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Ariel Felner |
| 2022 | Heuristic Search for SSPs with Lexicographic Preferences over Multiple Costs. Shuwa Miura, Kyle Hollins Wray, Shlomo Zilberstein |
| 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 | Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract). Nikhil Chandak, Kenny Chour, Sivakumar Rathinam, R. Ravi |
| 2022 | Iterative-Deepening Uniform-Cost Heuristic Search. Zhaoxing Bu, Richard E. Korf |
| 2022 | Joint Chance Constrained Probabilistic Simple Temporal Networks via Column Generation (Extended Abstract). Andrew Murray, Michael Cashmore, Ashwin Arulselvan, Jeremy Frank |
| 2022 | K-Focal Search for Slow Learned Heuristics (Extended Abstract). Matias Greco, Jorge Toro, Carlos Hernández Ulloa, Jorge A. Baier |
| 2022 | Lazy Compilation in Classical Planning (Extended Abstract). Zuzana Fílová, Pavel Surynek |
| 2022 | Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding. Shuyang Zhang, Jiaoyang Li, Taoan Huang, Sven Koenig, Bistra Dilkina |
| 2022 | Leveraging Experience in Lifelong Multi-Agent Pathfinding. Nitzan Madar, Kiril Solovey, Oren Salzman |
| 2022 | Light Contraction Hierarchies: Hierarchical Search Without Shortcuts. Claudius Proissl |
| 2022 | Local Motif Clustering via (Hyper)Graph Partitioning. Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz |
| 2022 | Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough (Extended Abstract). David Zahrádka, Anton Andreychuk, Miroslav Kulich, Konstantin S. Yakovlev |
| 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 | Meeting at the Border of Two Separate Domains. Alexandru Paul Tabacaru, Dor Atzmon, Ariel Felner |
| 2022 | Multi-Train Path Finding Revisited. Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig |
| 2022 | Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? (Extended Abstract). Jirí Svancara, Philipp Obermeier, Matej Husár, Roman Barták, Torsten Schaub |
| 2022 | Mutex Propagation in Multi-Agent Path Finding for Large Agents. Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig |
| 2022 | Neural Network Heuristic Functions: Taking Confidence into Account. Daniel Heller, Patrick Ferber, Julian Bitterwolf, Matthias Hein, Jörg Hoffmann |
| 2022 | On Bidirectional Heuristic Search in Classical Planning: An Analysis of BAE. Kilian Hu, David Speck |
| 2022 | On Merging Agents in Multi-Agent Pathfinding Algorithms. Eli Boyarski, Shao-Hung Chan, Dor Atzmon, Ariel Felner, Sven Koenig |
| 2022 | On Producing Shortest Cost-Optimal Plans. Michael Katz, Gabriele Röger, Malte Helmert |
| 2022 | On the Reformulation of Discretised PDDL+ to Numeric Planning (Extended Abstract). Francesco Percassi, Enrico Scala, Mauro Vallati |
| 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 | Online Multi-Agent Path Finding: New Results. Jonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski |
| 2022 | Optimal Search with Neural Networks: Challenges and Approaches. Tianhua Li, Ruimin Chen, Borislav Mavrin, Nathan R. Sturtevant, Doron Nadav, Ariel Felner |
| 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 | Parallel Beam Search for Combinatorial Optimization (Extended Abstract). Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi |
| 2022 | Portability and Explainability of Synthesized Formula-based Heuristics. Vadim Bulitko, Shuwei Wang, Justin Stevens, Levi H. S. Lelis |
| 2022 | Proceedings of the Fifteenth International Symposium on Combinatorial Search, SOCS 2022, Vienna, Austria, July 21-23, 2022 Lukás Chrpa, Alessandro Saetti |
| 2022 | Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning (Extended Abstract). Stefan O'Toole, Miquel Ramírez, Nir Lipovetzky, Adrian R. Pearce |
| 2022 | Scaling-Up Generalized Planning as Heuristic Search with Landmarks. Javier Segovia-Aguas, Sergio Jiménez Celorrio, Laura Sebastiá, Anders Jonsson |
| 2022 | Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract). Devin Wild Thomas, Tianyi Gu, Wheeler Ruml, Solomon Eyal Shimony |
| 2022 | Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract). Pavel Surynek |
| 2022 | Subset Approximation of Pareto Regions with Bi-Objective A* (Extended Abstract). Jorge A. Baier, Nicolás Rivera, Carlos Hernández Ulloa |
| 2022 | The JPS Pathfinding System in 3D. Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh |
| 2022 | Trajectory Constraint Heuristics for Optimal Probabilistic Planning. John R. Peterson, Anagha Kulkarni, Emil Keyder, Joseph Kim, Shlomo Zilberstein |
| 2022 | Urban Traffic Control via Planning with Global State Constraints (Extended Abstract). Franc Ivankovic, Mauro Vallati, Lukás Chrpa, Marco Roveri |
| 2022 | Weight Constrained Path Finding with Bidirectional A. Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby |
| 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 | Which MAPF Model Works Best for Automated Warehousing? Sumanth Varambally, Jiaoyang Li, Sven Koenig |
| 2022 | ePA*SE: Edge-Based Parallel A* for Slow Evaluations. Shohin Mukherjee, Sandip Aine, Maxim Likhachev |