Directed Search for Generalized Plans Using Classical Planners

Published on 2011-07-213454 Views

Siddharth Srivastava

We consider the problem of finding provably correct generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification, a

ICAPS 2011 - Freiburg

Related categories

Planning and Scheduling

Presentation

Directed Search for Generalized Plans Using Classical Planners00:00

What is Generalized Planning?00:05

Existing Approaches01:21

Framework02:35

States02:43

Action Application04:46

Generalized Plans: Definition05:36

Recall: Generalized Planning Problem06:23

Generalized Plan Synthesis07:15

Our Approach07:20

Hybrid Search: Idea - 108:04

Hybrid Search: Idea - 209:39

Hybrid Search: Idea - 310:45

Hybrid Search: Idea - 410:52

Hybrid Search: Idea - 511:52

Generalized Plan Synthesis: Hybrid Approach12:54

Components of Hybrid Search: Instance Generation13:16

Instance Generation14:38

Formal Guarantees15:08

Results - 115:32

Results: Instance Generation15:35

Results - 216:12

Conclusions17:38