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

基于OBDD的非确定域同步Agent通用规划

OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains

Carnegie Mellon University(卡内基梅隆大学)

R. M. Jensen, M. M. Veloso

摘要:

最近,模型检验表示和搜索技术被证明是有效地适用于规划,特别是非确定性规划。这种规划方法使用有序二元决策图(OBDD)将规划域编码为非确定性有限自动机,然后应用来自模型检验的快速算法来搜索解。OBDD可以有效地扩展,并可以为复杂的规划域提供通用计划。我们特别感兴趣的是解决在非确定性,多代理域中出现的复杂性。在这篇文章中,我们提出了UMOP,一个新的通用OBDD为基础的规划框架,不确定性,多代理域。我们引入了一个新的规划域描述语言,NADL,指定非确定性,多代理域。该语言提供了可控代理和不可控环境代理的明确定义。我们描述了NADL的语法和语义,并展示了如何建立一个有效的基于OBDD的表示的NADL描述。UMOP规划系统使用NADL和不同的基于OBDD的通用规划算法。它包括以前开发的强和强循环规划算法。此外,我们介绍了我们的新的乐观规划算法,放松最优性保证,并产生合理的通用计划,在某些领域,没有强或强循环的解决方案存在。我们提出的实证结果,应用UMOP域范围从确定性和单代理,没有环境行动的非确定性和多代理复杂的环境行动。UMOP被证明是一个丰富而有效的规划系统。

英文摘要:

Recently model checking representation and search techniques were shown to be efficiently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (OBDDs) to encode a planning domain as a non-deterministic finite automaton and then apply fast algorithms from model checking to search for a solution. OBDDs can effectively scale and can provide universal plans for complex planning domains. We are particularly interested in addressing the complexities arising in non-deterministic, multi-agent domains. In this article, we present UMOP, a new universal OBDD-based planning framework for non-deterministic, multi-agent domains. We introduce a new planning domain description language, NADL, to specify non-deterministic, multi-agent domains. The language contributes the explicit definition of controllable agents and uncontrollable environment agents. We describe the syntax and semantics of NADL and show how to build an efficient OBDD-based representation of an NADL description. The UMOP planning system uses NADL and different OBDD-based universal planning algorithms. It includes the previously developed strong and strong cyclic planning algorithms. In addition, we introduce our new optimistic planning algorithm that relaxes optimality guarantees and generates plausible universal plans in some domains where no strong nor strong cyclic solution exists. We present empirical results applying UMOP to domains ranging from deterministic and single-agent with no environment actions to non-deterministic and multi-agent with complex environment actions. UMOP is shown to be a rich and efficient planning system.

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

↑