Exploiting the déjà vu property ofGraphplan backward search

--Graphplan’s backward search in successive

levels has a lot of symmetry and redundancy

only a part of this is exploited by EBL memos

--Idea: Store a larger trace of of a search tree

at level k, and REPLAY it at level k+1

--EBL/DDB help make the trace much smaller

[with Zimmerman, AAAI-99]

Previous slide

Next slide

Back to first slide

View graphic version