Main Technical Track
| A TIL-Relaxed Heuristic for Planning with Time Windows | |
| Tony Allard, Charles Gretton, Patrik Haslum |
| Algorithms and Conditional Lower Bounds for Planning Problems | |
| Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger, Alexander Svozil |
| A Proof System for Unsolvable Planning Tasks | |
| Salomé Eriksson, Gabriele Röger, Malte Helmert |
| MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method | |
| Gaojian Fan, Robert Holte, Martin Mueller |
| The Provable Virtue of Laziness in Motion Planning | |
| Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa |
| A Generic Method to Guide HTN Progression Search with Classical Heuristics | |
| Daniel Höller, Pascal Bercher, Gregor Behnke, Susanne Biundo |
| New Perspectives on Flexibility in Simple Temporal Planning | |
| Amy Huang, Liam Lloyd, Mohamed Omar, James C. Boerkoel |
| Compiling Probabilistic Model Checking into Probabilistic Planning | |
| Michaela Klauck, Marcel Steinmetz, Jörg Hoffmann, Holger Hermanns |
| Two-Oracle Optimal Path Planning on Grid Maps | |
| Matteo Salvetti, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti |
| Simulated Penetration Testing as Contingent Planning | |
| Dorin Shmaryahu, Guy Shani, Joerg Hoffmann, Marcel Steinmetz |
| On Stubborn Sets and Planning with Resources | |
| Anna Wilhelm, Marcel Steinmetz, Jörg Hoffmann |
Operations Research Track
| The Integrated Last-Mile Transportation Problem (ILMTP) | |
| Arvind U. Raghunathan, David Bergman, John Hooker, Thiago Serra, Shingo Kobori |
Planning and Learning Track
| An Approximate Bayesian Reinforcement Learning Approach Using Robust Control Policy and Tree Search | |
| Toru Hishinuma, Kei Senda |
Robotics Track
| Monte-Carlo Planning for Agile Legged Locomotion | |
| Patrick Clary, Pedro Morais, Alan Fern, Jonathan Hurst |