EBL & DDB for Graphplan (Planning Graph as Dynamic CSP: Exploiting EBL&DDB and other CSP Techniques in Graphplan)

8/10/99


Click here to start


Table of Contents

EBL & DDB for Graphplan (Planning Graph as Dynamic CSP: Exploiting EBL&DDB and other CSP Techniques in Graphplan)

Motivation

Overview

Constructing Planning Graph

PPT Slide

PPT Slide

Backward Search & its Problems

Explaining Failures with Conflict Sets

DDB & Memoization (EBL) with Conflict Sets

Regressing Conflict Sets

Using EBL Memos

Speedup provided by EBL/DDB

Speedups are correlated with memo-length reduction

Subset memoization alone does not help...

Utility issues with Graphplan Memos

Memoization as a very conservative form of no-good learning

Sticky Values as a partial antidote to the conservatism of memos

Utility of FC & DVO

Adding FC/DVO to EBL/DDB

EBL/DDB & Randomized Search

Evaluating the utility of EBL/DDB in Randomized Systematic Search

Exploiting the déjà vu property of Graphplan backward search

PPT Slide

Conclusions

Author: MBE

Email: rao@asu.edu

Home Page: http://rakaposhi.eas.asu.edu

Download presentation source