Detailed Schedule

SATURDAY

Session 1: Search in Road Networks and Navigation Meshes (CHAIR: Sabine Storandt)

09:15 - 09:35 Daniel Harabor and Peter J. Stuckey. Forward Search in Contraction Hierarchies (long)

09:35 - 09:55 Shizhe Zhao, David Taniar and Daniel Harabor. Fast k-Nearest Neighbor On A Navigation Mesh (long)

09:55 - 10:00 Tenindra Abeywickrama, Muhammad Aamir Cheema and David Taniar. k-Nearest Neighbors on Road Networks: Euclidean Heuristic Revisited (extended abstract)

Session 2: Online Selection and Refinement (CHAIR: Malte Helmert)

10:30 - 10:50 Hans Degroote, Bernd Bischl, Lars Kotthoff and Patrick De Causmaecker. A Regression-Based Methodology for Online Algorithm Selection (long)

10:50 - 11:10 Rebecca Eifler and Maximilian Fickert. Online Refinement of Cartesian Abstraction Heuristics (long)

11:10 - 11:25 Maximilian Fickert. Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning (short)

Session 3: Planning & Search (CHAIR: Lukas Chrpa)

11:30 - 11:50 Silvan Sievers. Merge-and-Shrink Heuristics for Classical Planning: Efficient Implementation and Partial Abstractions (long)

11:50 - 12:05 Tim Schulte. Stubborn Set Pruning for Privacy Preserving Planning (short)

Session 4: Hardness & Tractability (CHAIR: Pavel Surynek)

14:00 - 14:20 Benjamín Kramm, Nicolás Rivera, Carlos Hernández Ulloa and Jorge Baier. A Suboptimality Bound for $2^k$ Grid Path Planning (long)

14:20 - 14:40 Christer Bäckström, Peter Jonsson and Sebastian Ordyniak. A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs (long)

14:40 - 14:55 Adi Botea, Akihiro Kishimoto and Radu Marinescu. On the Complexity of Quantum Circuit Compilation (short)

Session 5: Benchmarks (CHAIR: Martin Müller)

15:00 - 15:15 Tomas Balyo and Lukas Chrpa. Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks (short)

15:15 - 15:30 Daniel Brewer and Nathan Sturtevant. Benchmarks for Pathfinding in 3D Voxel Space (short)

SUNDAY

Session 6: Search Algorithms and Frameworks (CHAIR: Vadim Bulitko)

09:35 - 09:55 Hong Xu, Cheng Cheng, Sven Koenig and T. K. Satish Kumar. Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems (long)

09:55 - 10:00 Meir Goldenberg. The Heuristic Search Framework (extended abstract)

Session 7: Multi-Agent Path Finding (CHAIR: Ferdinando Fioretto)

10:30 - 10:50 Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Bartak and Neng-Fa Zhou. Robust Multi-Agent Path Finding (long)

10:50 - 11:10 Pavel Surynek, Ariel Felner and Roni Stern. Sub-optimal SAT-based Approach to Multi-agent Path-finding Problem (long)

11:10 - 11:25 Liron Cohen, Glenn Wagner, David Chan, Howie Choset, Nathan Sturtevant, T. K. Satish Kumar and Sven Koenig. Rapid Randomized Restarts for Multi-Agent Path Finding (short)

Session 8: Search Applications (CHAIR: Sven Koenig)

11:30 - 11:50 Patrick Rodler and Manuel Herold. StaticHS: A Variant of Reiter's Hitting Set Tree for Efficient Sequential Diagnosis (long)

11:50 - 12:05 Ilia Leybovich, Rami Puzis, Roni Stern and Maor Reuben. Focused SANA: Speeding Up Network Alignment (short)

Session 9: A* and Path Planning (CHAIR: Daniel Harabor)

13:50 - 14:10 Mike Barley, Patricia Riddle, Carlos Linares López, Sean Dobson and Ira Pohl. GBFHS: A Generalized Breadth-First Heuristic Search Algorithm (long)

14:10 - 14:30 Tansel Uras and Sven Koenig. Fast, Near-Optimal Path-Planning on State Lattices Using Subgoal Graphs (long)

14:35 - 14:55 Eshed Shaham, Ariel Felner, Nathan Sturtevant and Jeffrey S. Rosenschein. Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics (long)

14:55 - 15:10 Ariel Felner. Position Paper: Using Early Goal Test in A* (short)

15:10 - 15:30 Dor Atzmon, Roni Stern and Abdallah Saffidine. Bounded Suboptimal Game Tree Search (long)

Session 10: Real-Time Heuristic Search (CHAIR: Vadim Bulitko)

16:00 - 16:15 Shane Kochvi and Wheeler Ruml. Does Fast Beat Thorough? Comparing RTAA* and LSS-LRTA* (short)

16:15 - 16:30 Franco Muñoz, Miguel Fadic, Carlos Hernández Ulloa and Jorge Baier. A Neural Network for Decision Making in Real-Time Heuristic Search (short)