Video recording
Session title:
Planning: search
Session chair:
Svem Koenig
Talks
Planning with SAT, Admissible Heuristics and A*Jussi Rintanen
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstractions in Optimal PlanningJoerg Hoffmann, Raz Nissim and Malte Helmert
Large Neighborhood Search and Adaptive Randomized Decompositions for Flexible Jobshop SchedulingDario Pacino and Pascal Van Hentenryck
 
Video
 
Video also available for download here. We recommend VLC for playing