arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.6799cs.AI
收藏

随机域中计划与执行的集成

Integrating Planning and Execution in Stochastic Domains

University of British Columbia(不列颠哥伦比亚大学)

Richard Dearden, Craig Boutilier

摘要:

我们调查规划在时间关键域表示为马尔可夫决策过程,搜索为基础的技术可以是一个非常强大的方法,找到接近最优的计划。为了降低这些领域规划的计算成本,我们在构建计划时执行操作,并通过搜索到固定深度并使用启发式函数来估计状态值来牺牲最优性。虽然本文集中在搜索算法,我们也讨论了构造适合这种方法的启发式函数的方法。我们的研究结果表明,通过交错搜索和执行,可以找到接近最优的政策,而不需要其他方法的计算要求。

英文摘要:

We investigate planning in time-critical domains represented as Markov Decision Processes, showing that search based techniques can be a very powerful method for finding close to optimal plans. To reduce the computational cost of planning in these domains, we execute actions as we construct the plan, and sacrifice optimality by searching to a fixed depth and using a heuristic function to estimate the value of states. Although this paper concentrates on the search algorithm, we also discuss ways of constructing heuristic functions suitable for this approach. Our results show that by interleaving search and execution, close to optimal policies can be found without the computational requirements of other approaches.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑