arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1310.6429cs.AIcs.LO
收藏

作为计划的基于知识的计划:计划存在的简洁性和复杂性

Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence

CNRS(法国国家科学研究中心);Université Paris-Dauphine(巴黎第九大学);Université de Caen Basse-Normandie(卡昂下诺曼底大学);ENSICAEN(卡昂高等电子工程学校)

Jerome Lang, Bruno Zanuttini

摘要:

基于知识的程序(Knowledge-based programs,KBP)是一种高级协议,描述了一个代理应该根据其知识执行的操作过程。在人工智能规划中使用KBP来表达行动策略的做法令人惊讶地被忽视了。考虑到每个KBP对应一个等效的计划,反之亦然,KBP通常比标准计划更简洁,但意味着更多的在线计算时间。在这里,我们使这一论点正式,并证明存在着一个指数的简洁性之间的差距,以知识为基础的程序和标准的计划。然后,我们解决计划存在的复杂性。一些结果平凡地遵循从文献中已知的结果在不完全的知识规划,但许多是未知的。

英文摘要:

Knowledge-based programs (KBPs) are high-level protocols describing the course of action an agent should perform as a function of its knowledge. The use of KBPs for expressing action policies in AI planning has been surprisingly overlooked. Given that to each KBP corresponds an equivalent plan and vice versa, KBPs are typically more succinct than standard plans, but imply more on-line computation time. Here we make this argument formal, and prove that there exists an exponential succinctness gap between knowledge-based programs and standard plans. Then we address the complexity of plan existence. Some results trivially follow from results already known from the literature on planning under incomplete knowledge, but many were unknown so far.

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

↑