软目标可以被编译掉
Soft Goals Can Be Compiled Away
摘要:
软目标用一个简单的偏好模型扩展了经典的计划模型。最好的计划不是成本最低的计划,而是效用最大的计划,其中计划的效用是实现的软目标的效用之和减去计划成本。寻找高效用的计划似乎涉及两个相关的问题:选择一个子集的软目标来实现,并找到一个低成本的计划来实现它们。新的搜索算法和算法已经被开发用于具有软目标的规划,并且在国际规划竞赛(IPC)中引入了一个新的赛道来测试它们的性能。然而,在本说明中,我们表明这些扩展是不需要的:软目标并没有增加行动成本规划的基本模型的表达能力,因为它们可以很容易地被编译掉。我们将此编译的问题的净效益跟踪最近的IPC,并表明,最佳和满意的成本为基础的规划者做得更好的编译问题比最佳和满意的净效益规划者的原始问题,明确的软目标。此外,我们表明,处罚,或消极的偏好表达的条件,以避免,也可以编译使用类似的想法。
英文摘要:
Soft goals extend the classical model of planning with a simple model of preferences. The best plans are then not the ones with least cost but the ones with maximum utility, where the utility of a plan is the sum of the utilities of the soft goals achieved minus the plan cost. Finding plans with high utility appears to involve two linked problems: choosing a subset of soft goals to achieve and finding a low-cost plan to achieve them. New search algorithms and heuristics have been developed for planning with soft goals, and a new track has been introduced in the International Planning Competition (IPC) to test their performance. In this note, we show however that these extensions are not needed: soft goals do not increase the expressive power of the basic model of planning with action costs, as they can easily be compiled away. We apply this compilation to the problems of the net-benefit track of the most recent IPC, and show that optimal and satisficing cost-based planners do better on the compiled problems than optimal and satisficing net-benefit planners on the original problems with explicit soft goals. Furthermore, we show that penalties, or negative preferences expressing conditions to avoid, can also be compiled away using a similar idea.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。