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
Searching for Plans with Carefully Designed Probes
Published on Jul 21, 20113348 Views
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefully using a number of
Related categories
Chapter list
Searching for Plans with Carefully Designed Probes00:00
Dual Search architectures00:22
The Planner PROBE00:49
Visualizations of Probes01:33
Coverage02:42
Definition and Computation of Probes (Sketch)03:15
Visualization of Successful Probe04:15
Visualization of Failed Probe05:09
Outline of the rest of the talk06:08
Subgoals and Partial Ordering: Landmark Graph06:36
Subgoal Selection - 107:28
Subgoal Selection - 208:08
Subgoal Selection - 308:14
Subgoal Selection - 408:17
Example of inconsistency 08:28
Action Selection08:49
Reasons for Action in Probes: Causal Commitments09:18
Causal Commitments10:21
Summary11:27
Experiments12:01
Empirical Results12:17
Evaluating Different Techniques used in Probe - 115:16
Evaluating Different Techniques used in Probe - 216:11
Evaluating Different Techniques used in Probe - 316:50
Summary17:16
Future Work18:08
Thank you!18:50