Controlled search over compact state representations, in nondeterministic planning domains and beyond
national conference on artificial intelligence（2006）
摘要
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological backtracking. The second is a recursive method based on assuming that the ...
更多查看译文
关键词
new online method,backtracking search tree,nondeterministic planning domain,controlled search,compact state representation,chronological backtracking,recursive method,weighted sample,markov decision process,binary decision diagram,hybrid system
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要