计算机集成制造系统 ›› 2015, Vol. 21 ›› Issue (第12期): 3349-3335.DOI: 10.13196/j.cims.2015.12.028

• 产品创新开发技术 • 上一篇    

基于编辑距离的大规模流程工厂模型局部检索算法

温蕊1,唐卫清1,2,苏智勇3   

  1. 1.南京理工大学计算机科学与工程学院
    2.中国科学院计算技术研究所
    3.南京理工大学自动化学院
  • 出版日期:2015-12-31 发布日期:2015-12-31
  • 基金资助:
    国家自然科学基金资助项目(61300160)。

Partial retrieval algorithm based on edit distance for large scale process plant models

  • Online:2015-12-31 Published:2015-12-31
  • Supported by:
    Project supported by the National Natural Science Foundation,China(No.61300160).

摘要: 为提高流程工厂的设计效率,针对流程工厂的领域特性,提出一种基于编辑距离的流程工厂模型局部检索算法。算法将图相似性的相关思想与流程工厂模型结合,首先将待检索模型和历史流程工厂模型转化为属性图结构;然后设定阈值,并计算待检索模型与历史流程工厂模型对应的属性图之间的最小编辑距离:若计算结果大于阈值,则认为当前模型不包含待检索模型;否则返回检索到的局部模型。该算法将流程工厂模型的局部检索问题简化为属性图的子图查询问题,实现了流程工厂模型的局部检索。通过实验证明了算法的有效性和可行性。

关键词: 工程模型, 流程工厂, 局部检索, 图相似性, 编辑距离

Abstract: To improve the design efficiency of process plant,a partial retrieval algorithm based on edit distance was proposed,which attempted to incorporate Process Plant Models (PPMs) with graph similarity aiming at the domain characteristics of process plant.All PPMs and model to be retrieved were transformed into attribute-graph structures.The threshold was set,and the minimum edit distances between attribute-graph of each PPM and model to be retrieved was computed.Each distance was compared with a predefined threshold to determine whether the model existed in the current PPMs or not.Experimental results demonstrated the effectiveness and feasibility of the proposed algorithm.

Key words: engineering model, process plant, partial retrieval, graph similarity, edit distance

中图分类号: