Performance bounds for planning in unkno
โ
Sven Koenig; Craig Tovey; Yuri Smirnov
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 291 KB
Planning in nondeterministic domains is typically intractable due to the large number of contingencies. Two techniques for speeding up planning in nondeterministic domains are agentcentered search and assumption-based planning. Both techniques interleave planning in deterministic domains with plan e