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

模型检验集成规划系统中的驯服数和驯服持续时间

Taming Numbers and Durations in the Model Checking Integrated Planning System

S. Edelkamp

摘要:

模型检验集成规划系统(MIPS)是一个基于灵活的面向对象工作台体系结构的时间最小承诺启发式搜索规划器。它的设计清楚地将显式和符号定向探索算法与在线和离线计算的估计和相关的数据结构的集合分开。MIPS在过去两次国际规划比赛中表现出色。在最后一个事件中,描述语言从纯粹的命题规划扩展到包括数值状态变量,行动持续时间和计划质量目标函数。计划不再是行动的顺序,而是有时间戳的时间表。作为竞赛全自动化赛道的参与者,MIPS已被证明是一个通用系统;在每个赛道和每个基准领域,它都能高效地计算出质量卓越的计划。本文介绍并分析了最重要的算法创新,这些创新是解决基准测试问题中新的表达层和实现高水平性能所必需的。这些扩展包括对顺序生成的计划进行关键路线分析,以生成相应的最优并行计划。线性时间算法来计算并行计划绕过已知的NP硬度结果的偏序调度计划的一组行动和强加的优先关系。该算法的效率也使我们能够提高探索指导:对于每个遇到的规划状态,相应的近似顺序计划进行调度。MIPS的一个主要优点是其静态分析阶段,该阶段基于并简化参数化谓词、函数和运算符,推断知识以最小化状态描述长度,并检测域对象对称性。对后一方面进行了详细分析。MIPS已经被开发成一个完整的和最优的状态空间规划器,具有可接受的估计,探索引擎和分支切割。然而,在竞争版本中,必须做出某些性能妥协,包括浮点运算,根据不可接受的估计和参数化优化进行加权启发式搜索探索。

英文摘要:

The Model Checking Integrated Planning System (MIPS) is a temporal least commitment heuristic search planner based on a flexible object-oriented workbench architecture. Its design clearly separates explicit and symbolic directed exploration algorithms from the set of on-line and off-line computed estimates and associated data structures. MIPS has shown distinguished performance in the last two international planning competitions. In the last event the description language was extended from pure propositional planning to include numerical state variables, action durations, and plan quality objective functions. Plans were no longer sequences of actions but time-stamped schedules. As a participant of the fully automated track of the competition, MIPS has proven to be a general system; in each track and every benchmark domain it efficiently computed plans of remarkable quality. This article introduces and analyzes the most important algorithmic novelties that were necessary to tackle the new layers of expressiveness in the benchmark problems and to achieve a high level of performance. The extensions include critical path analysis of sequentially generated plans to generate corresponding optimal parallel plans. The linear time algorithm to compute the parallel plan bypasses known NP hardness results for partial ordering by scheduling plans with respect to the set of actions and the imposed precedence relations. The efficiency of this algorithm also allows us to improve the exploration guidance: for each encountered planning state the corresponding approximate sequential plan is scheduled. One major strength of MIPS is its static analysis phase that grounds and simplifies parameterized predicates, functions and operators, that infers knowledge to minimize the state description length, and that detects domain object symmetries. The latter aspect is analyzed in detail. MIPS has been developed to serve as a complete and optimal state space planner, with admissible estimates, exploration engines and branching cuts. In the competition version, however, certain performance compromises had to be made, including floating point arithmetic, weighted heuristic search exploration according to an inadmissible estimate and parameterized optimization.

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

↑