论文标题
部分可观测时空混沌系统的无模型预测
Answer Set Planning: A Survey
论文作者
论文摘要
答案集计划是指使用答案集编程（ASP）来计算计划，即计划问题的解决方案，将给定的世界状态转化为另一个状态。高效且可扩展的答案集求解器的开发为基于ASP的计划系统的开发提供了重大的推动。本文调查了在答案设定计划领域的最后两个半几十年中从其基础到在挑战性的计划域中的使用中取得的进展。该调查探讨了答案集计划的优势和缺点。它还讨论了答案集计划的典型应用，并为将来的研究提出了一系列挑战。
Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, i.e., solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research.
