en-de
en-es
en-fr
en-pt
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
A Complete Algorithm for Generating Landmarks
Published on Jul 21, 20112968 Views
A collection of landmarks is complete if the cost of a minimum-cost hitting set equals h+ and there is a minimum-cost hitting set that is an optimal relaxed plan. We present an algorithm for generatin
Related categories
Chapter list
A Complete Algorithm for Generating Landmarks00:00
Introduction00:07
Our contribution00:42
Relaxed Planning - 101:23
Relaxed Planning - 201:28
Example - 102:23
Optimal Relaxed Cost02:51
Landmarks - 103:17
Landmarks - 203:21
Example - 203:37
Exploiting Landmarks: Hitting Sets04:33
Landmarks and Hitting Sets05:19
Obtaining Landmarks: Justi cation Graphs05:49
Example - 306:27
Example - 406:42
Example - 507:06
Example - 607:15
Example - 707:23
Example - 807:24
Power of Justi cation Graph Cuts - 107:25
Power of Justi cation Graph Cuts - 207:48
Principled Generation of Landmarks - 108:12
Principled Generation of Landmarks - 208:21
Principled Generation of Landmarks - 308:46
Principled Generation of Landmarks - 409:35
Principled Generation of Landmarks - 510:06
Principled Generation of Landmarks - 610:33
Algorithm A10:42
Landmarks - 311:20
Landmarks - 411:24
Landmarks - 512:00
Landmarks - 612:28
Landmarks - 712:41
Landmarks - 812:43
Landmarks - 912:45
Algorithm C1 - 113:09
Algorithm C1 - 214:12
Thanks!15:29