期刊文献+

面向冲突检测的资源规划图谱构建方法

Construction Method of Resource Planning Graph for Conflict Detection
下载PDF
导出
摘要 为解决陆军合成作战中战场要素多、变化快、关联复杂造成的冲突检测信息集成与提取困难问题,基于知识图谱与可视化思想,提出一种面向冲突检测的资源规划图谱构建方法。针对作战行动特点与冲突检测需求构建资源规划图谱框架,通过提取与对齐实体、关系、属性生成数据层,并对数据层节点进行层次规约构建概念层;引入ChordLink模型优化图谱整体稀疏、局部密集结构的可视化表达;最后通过实例分析说明方法可行高效。 In order to solve the problem of difficult integration and extraction of conflict detection information,which is caused by many battlefield elements,rapid changes and complex associations in Army synthetic combat.The resource planning graph construction method for conflict detection is proposed based on knowledge graph and visualization ideas.Firstly,the resource planning graph construction framework is built according to the characteristics of combat operations and conflict detection requirements.The data layer is generated by extracting and aligning entities,relationships and attributes,and the conceptual layer is constructed by hierarchical specification of the nodes of the data layer.Then,the ChordLink model is introduced to optimize the visual expression of the overall sparse and local dense structure of the graph.Finally,the method is feasible and efficient through example analysis.
作者 张宇玲 杜伟伟 张静雅 范鑫 杨刚 ZHANG Yuling;DU Weiwei;ZHANG Jingya;FAN Xin;YANG Gang(North Automatic Control Technology Institute,Taiyuan 030006,China;School of Mechatronics,Beijing Institute of Technology,Beijing 100081,China;Shanxi Provinice Key Laboratory of Intelligent Information Control Technology,Taiyuan 030006,China)
出处 《火力与指挥控制》 CSCD 北大核心 2023年第3期146-151,共6页 Fire Control & Command Control
关键词 合成作战 资源规划 知识图谱 可视化 synthetic combat resource planning knowledge graph visualization
  • 相关文献

参考文献6

二级参考文献48

  • 1林颖,史晓东,郭锋.一种基于概率上下文无关文法的汉语句法分析[J].中文信息学报,2006,20(2):1-7. 被引量:11
  • 2刘怀军,车万翔,刘挺.中文语义角色标注的特征工程[J].中文信息学报,2007,21(1):79-84. 被引量:39
  • 3Dechter R,Meiri I,Pearl J.Temporal Constraint Networks[J].Artificial Intelligence,1991,49(1-3):61-95.
  • 4Cesta A,Oddi A.Gaining Efficiency and Flexibility in the Simple Temporal Problem[C]//Proc.of the 3rd Workshop on Temporal Representation and Reasoning.[S.1.]:ACM Press,1996.
  • 5Planken L,Weerdt M.P3C:A New Algorithm for the Simple Temporal Problem[EB/OL].(2008-06-27).http://apstwo.st.ewi.tudelft.nl/-planken/icaps08-p3c.pdf.
  • 6Shu I,Effinger R,Williams B.Enabling Fast Flexible Planning Through Incremental Temporal Reasoning with Conflict Extraction[C]//proc.of the 15th International Conference on Automated Planning and Scheduling.Monterey,USA:[s.n],2005.
  • 7Dasdan A.Provably Efficient Algorithms for Resolving Temporal and Spatial Difference Constraint Violations[J].ACM Trans.on Design Automation of Electronic Systems,2009,14(1):1-24.
  • 8Cherkassky B V,Georgiadis L,Goldberg A,et al.Shortest-path Feasibility Algorithms:An Experimental Evaluation[J].ACM Journal of Experimental Algorithmics,2009,14(2):118-132.
  • 9Khelfailab M,Benhamou B.A Local Fusion Method of Temporal Information[M].[S.1.]:Spnnger-Verlag,2005:477-488.
  • 10中国互联网络信息中心.第35次中国互联网络发展状况统计报告[R/OL].http://www.cnnic.cn/hlwfzyj/hlwxzbg/201502/P020150203551802054676.pdf,2015-03-22.

共引文献64

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部