An algorithm for domain axiom plan recognition based on extended goal graph (EI CONFERENCE)
文献类型：会议论文
| 作者 | Chen J.
|
| 出版日期 | 2005 |
| 会议名称 | International Conference on Machine Learning and Cybernetics, ICMLC 2005, August 18, 2005 - August 21, 2005 |
| 会议地点 | Guangzhou, China |
| 关键词 | This paper introduces a novel algorithm for domain axiom plan recognition. Using a method of domain axiom inference expansion the algorithm can reconstruct goal graph to extend and improve original algorithm to allow plan recognition with domain axiom. The algorithm based on goal graph needs no plan library so it can't be suffered from the problems in the acquisition and hand-coding of large plan libraries. It also has no problem in searching the plan space of exponential size. 2005 IEEE. |
| 页码 | 260-264 |
| 收录类别 | EI |
| 源URL | [http://ir.ciomp.ac.cn/handle/181722/33201]  |
| 专题 | 长春光学精密机械与物理研究所_中科院长春光机所知识产出_会议论文 |
| 推荐引用方式 GB/T 7714 | Chen J.. An algorithm for domain axiom plan recognition based on extended goal graph (EI CONFERENCE)[C]. 见:International Conference on Machine Learning and Cybernetics, ICMLC 2005, August 18, 2005 - August 21, 2005. Guangzhou, China. |
入库方式： OAI收割
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。