| 本文已被：浏览 4334次 下载 6146次 |
码上扫一扫！ |
|
|
| 一种基于规划知识图的规划识别算法 |
|
姜云飞1, 马宁2
|
|
1.中山大学,软件研究所,广东,广州,510275;2.吉林大学,计算机科学系,吉林,长春,130023
|
|
| 摘要: |
| 提出了一种新的规划表示方法及规划知识图的概念.与目前规划识别领域广泛使用的Kautz方法相比,新的规划表示方法更加简便与直观.由于在规划知识图中增加了支持程度的概念,使得规划的识别可以随着收集到的新证据而合理地加以改变.所提出的基于规划知识图的规划识别算法把规划的识别问题转化为图搜索问题,因而其效率更高,但其识别结果与Kautz方法是一致的. |
| 关键词: 规划识别 事件 时序约束 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金资助项目(69873047,60173039);广东省自然科学基金资助项目(980260) |
|
| A Plan Recognition Algorithm Based on Plan Knowledge Graph |
|
JIANG Yun-fei,MA Ning
|
| Abstract: |
| A new plan formalism method and a plan knowledge graph concept. Compared with Kautz s formalism used widely in plan recognition, this method is simpler and more direct. Because a concept of supporting degree is introduced into plan knowledge graph, the recognized plans are changed reasonably as new evidences collected. A plan recognition algorithm based on knowledge graph presented in this paper can change the plan recognition problem into the graph searching one. This method not only prompts efficiency but also gives the same result as Kautz's. |
| Key words: plan recognition event temporal constraint |
