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

利用状态信息改进OPTIC向LP编译过程中的搜索

Improving Search by Utilizing State Information in OPTIC Planners Compilation to LP

University of Haifa(海法大学);King’s College London(伦敦国王学院)

Elad Denenberg, Amanda Coles, Derek Long

摘要:

自动规划器是一种计算机工具,它允许自主智能体通过确定智能体要采取的一组动作来制定策略和决策,这将使系统从给定的初始状态到达期望的目标状态。许多规划器是独立于域的,允许它们在各种域中部署。这就是光学规划师的大家庭。这些规划器执行前向搜索,并在每个状态下多次调用线性规划(LP)求解器,以检查一致性并设置数值变量的界限。这些检查可能在计算上是昂贵的,特别是在现实生活中的应用程序。本文提出了一种方法,用于识别信息的具体状态进行评估,允许制定的方程,以促进更好的求解器的选择和更快的LP解决。该方法的实用性证明在六个领域,并显着提高性能。

英文摘要:

Automated planners are computer tools that allow autonomous agents to make strategies and decisions by determining a set of actions for the agent that to take, which will carry a system from a given initial state to the desired goal state. Many planners are domain-independent, allowing their deployment in a variety of domains. Such is the broad family of OPTIC planners. These planners perform Forward Search and call a Linear Programming (LP) solver multiple times at every state to check for consistency and to set bounds on the numeric variables. These checks can be computationally costly, especially in real-life applications. This paper suggests a method for identifying information about the specific state being evaluated, allowing the formulation of the equations to facilitate better solver selection and faster LP solving. The usefulness of the method is demonstrated in six domains and is shown to enhance performance significantly.

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

↑