| 2023 | Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+ [Extended Abstract]. | Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern, Shiwali Mohan |
| 2023 | On the Notion of Fixability of PDDL+ Plans [Extended Abstract]. | Francesco Percassi, Enrico Scala, Mauro Vallati |
| 2023 | A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination [Extended Abstract]. | Adittyo Paul, Ying Feng, Jiaoyang Li |
| 2023 | Structural Bias in Heuristic Search (Student Abstract). | Alison Paredes |
| 2023 | A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements. | Conny Olz, Pascal Bercher |
| 2023 | Towards an Effective Framework Combining Planning and Scheduling [Extended Abstract]. | Andrii Nyporko, Luks Chrpa |
| 2023 | Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants. | Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh |
| 2023 | Pipe-Routing and Pathfinding in 3D (Student Abstract). | Thomas K. Nobes |
| 2023 | GePA*SE: Generalized Edge-Based Parallel A* for Slow Evaluations. | Shohin Mukherjee, Maxim Likhachev |
| 2023 | Adapting to Planning Failures in Lifelong Multi-Agent Path Finding. | Jonathan Morag, Roni Stern, Ariel Felner |
| 2023 | Novelty and Lifted Helpful Actions in Generalized Planning. | Chao Lei, Nir Lipovetzky, Krista A. Ehinger |
| 2023 | Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract]. | Marc-Emmanuel Coupvent des Graviers, Kevin Osanlou, Christophe Guettier, Tristan Cazenave |
| 2023 | Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids. | Tzvika Geft |
| 2023 | Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract). | David L. Fairbairn |
| 2023 | SAT Feature Analysis for Machine Learning Classification Tasks. | Marco Dalla, Benjamin Provan-Bessell, Andrea Visentin, Barry O'Sullivan |
| 2023 | Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. | Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig |
| 2023 | Core Expansion in Optimization Crosswords. | Adi Botea, Vadim Bulitko |
| 2023 | Using Machine Learning Classifiers in SAT Branching [Extended Abstract]. | Ruth Helen Bergin, Marco Dalla, Andrea Visentin, Barry O'Sullivan, Gregory M. Provan |
| 2023 | Domain-Independent Dynamic Programming (Student Abstract). | Ryo Kuroiwa |
| 2023 | K∗ and Partial Order Reduction for Top-Quality Planning. | Michael Katz, Junkyu Lee |
| 2023 | A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract). | Eyal Weiss |
| 2023 | On K* Search for Top-K Planning. | Junkyu Lee, Michael Katz, Shirin Sohrabi |
| 2023 | Generating SAS+ Planning Tasks of Specified Causal Structure. | Michael Katz, Junkyu Lee, Shirin Sohrabi |
| 2022 | Anytime Approximate Bi-Objective Search. | Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernndez Ulloa, Sven Koenig |
| 2022 | Mutex Propagation in Multi-Agent Path Finding for Large Agents. | Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig |