计划中的时序偏好表示和非单调推理  

Temporal reference representation and nonmonotonic deduction in planning

作　　者：王炎娟[1] 郝智勇[1] 姚莉[1] 

机构地区：[1]国防科技大学信息系统工程重点实验室,湖南长沙410073

出　　处：《国防科技大学学报》2014年第4期177-183,共7页Journal of National University of Defense Technology

基　　金：国家自然科学基金资助项目(71371184)

摘　　要：针对行动序列计划中的时序偏好问题开展研究,重点关注时序偏好集合内部存在不一致性时完成行动计划的方法。论文的难点和创新点体现在两个方面。针对时序偏好的表示问题,建立了一种二元描述结构,能够实现对时序约束和时序偏好的归一化描述。使用计算辩论技术建立推理框架,用以排除约束/偏好集合中的冲突关系,获得具有最大一致性的约束/偏好子集。在此基础上建立了一种新的计划生成策略,通过映射的方法得到行动序列片段,组合这些片段后形成完整的行动序列计划。通过实例验证了方法的可行性。A research on the temporal preference in course-of-action planning is presented, focusing on the scheme to implement planning with inconsistent temporal preference. The difficulties and innovations lie in two aspects. Firstly, considering the representation issue, a unified binary format is established for temporal preference and temporal constraints. Secondly, argumentation is utilized to develop a deduction framework in order to sort out the conflicts inside the constraint/preference set, achieving a subset of constraints/preferences with maximum consistence. A plan generation strategy was then proposed to acquire segments of plan via mapping, and to combine the segments into a complete plan. A case study was clone in detail to show the effectiveness of the scheme.

关 键 词：计算辩论 偏好 时序逻辑 行动序列 计划生成 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]