基于完全目标图的对抗性规划识别方法

Ji-Li Yin, Y. Liu, Jinyan Wang, W. Gu, Yin-Ping Zhang
{"title":"基于完全目标图的对抗性规划识别方法","authors":"Ji-Li Yin, Y. Liu, Jinyan Wang, W. Gu, Yin-Ping Zhang","doi":"10.1109/CIS.2007.91","DOIUrl":null,"url":null,"abstract":"Based on classical plan graph and goal graph, complete goal graph (CGG) is constructed against the characteristics of adversarial domain. The complete goal graph makes the action relate with its goal directly, which is more efficient to recognize adversarial goals. The conception of complete degree of goals will be put forward to distinguish adversarial high level goals. Then, a deep research is done on adversarial plan recognition algorithm based on CGG, which not only can predict adversarial next step action, but also can recognize adversarial goals in different levels with complete degrees. The research is of great significance for the plan recognition problem of uncontrollable and nondeterministic domain such as contest robot, information security, business strategy, game role design and etc.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Recognition Approach for Adversarial Planning Based on Complete Goal Graph\",\"authors\":\"Ji-Li Yin, Y. Liu, Jinyan Wang, W. Gu, Yin-Ping Zhang\",\"doi\":\"10.1109/CIS.2007.91\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on classical plan graph and goal graph, complete goal graph (CGG) is constructed against the characteristics of adversarial domain. The complete goal graph makes the action relate with its goal directly, which is more efficient to recognize adversarial goals. The conception of complete degree of goals will be put forward to distinguish adversarial high level goals. Then, a deep research is done on adversarial plan recognition algorithm based on CGG, which not only can predict adversarial next step action, but also can recognize adversarial goals in different levels with complete degrees. The research is of great significance for the plan recognition problem of uncontrollable and nondeterministic domain such as contest robot, information security, business strategy, game role design and etc.\",\"PeriodicalId\":127238,\"journal\":{\"name\":\"2007 International Conference on Computational Intelligence and Security (CIS 2007)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computational Intelligence and Security (CIS 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2007.91\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2007.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在经典平面图和目标图的基础上,针对对抗域的特点构造了完全目标图。完整的目标图使行动与其目标直接相关,从而更有效地识别对抗性目标。提出目标完备度的概念来区分对抗性高水平目标。然后,对基于CGG的对抗计划识别算法进行了深入研究,该算法不仅可以预测对手下一步行动,而且可以识别不同级别的完整度对抗目标。该研究对竞赛机器人、信息安全、商业策略、游戏角色设计等不可控和不确定领域的计划识别问题具有重要意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Recognition Approach for Adversarial Planning Based on Complete Goal Graph
Based on classical plan graph and goal graph, complete goal graph (CGG) is constructed against the characteristics of adversarial domain. The complete goal graph makes the action relate with its goal directly, which is more efficient to recognize adversarial goals. The conception of complete degree of goals will be put forward to distinguish adversarial high level goals. Then, a deep research is done on adversarial plan recognition algorithm based on CGG, which not only can predict adversarial next step action, but also can recognize adversarial goals in different levels with complete degrees. The research is of great significance for the plan recognition problem of uncontrollable and nondeterministic domain such as contest robot, information security, business strategy, game role design and etc.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信