• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Automated Planning and Scheduling(ICAPS 2006); 2006; >Planning for PDDL3- An OCSP Based Approach
【24h】

Planning for PDDL3- An OCSP Based Approach

机译：规划PDDL3-基于OCSP的方法

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan trajectory constraints are conditions that need to be satisfied at various stages of the plan. Soft goals are goals, which need not necessarily be achieved but are desirable. An extension of Constraint Satisfaction Problem, called Optimal Constraint Satisfaction Problem (OCSP) has allowance for defining soft constraints and objective functions. Each soft constraint is associated with a penalty, which will be levied if the constraint is violated. The OCSP solver arrives at a solution that minimizes the total penalty (Objective function) and satisfies all hard constraints. In this paper, an OCSP encoding for the classical planning problems with plan trajectory constraints, soft and hard goals is proposed. Modal operators associated with hard goals and hard plan trajectory constraints are handled by preprocessing and imposing new constraints over the existing GP-CSP encoding. A new encoding for each of the modal operators associated with the soft goals and soft plan trajectory constraints is proposed. Also, a way of encoding conditional goal preference constraints into OCSP is discussed. Based on this research, we intend to submit a planner for the coming planning competition-IPC2006.
机译：AI Planning的最新研究专注于提高生成计划的质量。 PDDL3结合了对目标和计划轨迹的硬性约束和软性约束。计划轨迹约束是在计划的各个阶段都需要满足的条件。软目标是目标，不一定必须实现，而是可取的。约束满足问题的扩展称为最优约束满足问题（OCSP），可以定义软约束和目标函数。每个软约束都与惩罚相关联，如果违反该约束，则将征收罚款。 OCSP求解器提供了一种解决方案，该解决方案使总损失（目标函数）最小化并满足所有硬约束。本文提出了一种针对带有规划轨迹约束，软硬目标的经典规划问题的OCSP编码。与硬目标和硬计划轨迹约束相关联的模态运算符通过预处理并在现有GP-CSP编码上施加新约束来进行处理。针对与软目标和软计划轨迹约束相关联的每个模态运算符，提出了一种新的编码。此外，讨论了一种将条件目标偏好约束编码为OCSP的方法。基于这项研究，我们打算为即将到来的IPC2006规划竞赛提交规划师。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号