基于Petri网启发式搜索的装配序列规划  

Petri Net based Heuristic Search for Assembly Sequence Planning

作　　者：李凤英[1,2] 古天龙[2] 

机构地区：[1]西安电子科技大学电子工程学院,西安710071 [2]桂林电子科技大学计算机学院,桂林541004

出　　处：《系统仿真学报》2008年第S2期152-155,共4页Journal of System Simulation

基　　金：国家自然科学基金(60563005,60243002);广西自然科学基金重点项目(0832006Z)

摘　　要：Petri网是表示优先级约束和计算装配序列的有效工具。将Petri网和启发式搜索相结合,给出了一种新的装配序列规划方法。该方法用Petri网模型表示可行装配序列,通过生成和搜索Petri网的局部可达图找到一个最优或接近最优的装配序列,该装配序列通过Petri网的迁移引发序列来表示。结合实例验证了该方法的正确性和有效性。Petri nets have been proposed as a suitable tool for expressing precedence constraints and computing assembly sequences.Petri net model combined with heuristic search provides a new assembly sequences planning method.Assembly Petri net can be built from a lower level enumeration of precedence constraints or from an intermediate AND/OR graph representation.Then an optimal or near optimal feasible planning in terms of the firing sequence of the transitions of the Petri net model can be found through generating and searching a partial reachability graph.The experimental results have showed the effectiveness of the planning method.

关 键 词：赋时PETRI网 装配序列规划 启发式搜索 

分 类 号：TH166[机械工程—机械制造及自动化]