Overview

• Connections between Planning Graph and CSP

• Review and critique of inefficiencies of backward search on planning graph

• EBL and DDB for improving memoization in Graphplan

  • The idea
  • Empirical evaluation
    • up to 1000X speedup!
    • Effectiveness on random-restart search
    • Utility of memos

• Augmenting with FC, DVO & Sticky values

• Conclusions and Further directions

Previous slide

Next slide

Back to first slide

View graphic version