摘要
Petri网可用于分解装配序列规划中的关系表达与推理,对于零部件数量大的航空发动机,通过求解Petri网可达集搜索目标分解装配序列的方法是NP难度的。基于装配Petri网与分解Petri网互逆的观点,分别采用启发式搜索算法和优先级调度算法求解搜索最小可分解和最大可装配变迁集,然后构造最简Petri子网达到降低搜索难度的目的,并将分解装配序列规划算法用于发动机零部件跟踪控制过程中,达到降低和防止维修差错的目的。
Petri-Nets have been shown to be useful in disassembly or assembly process planning,but reachability tree method to generate disassemble sequence is NP-complete and impractical for large products. Based on the notion that assembly Petri net（APN） is reversed disassembly Petri net（DPN）,a Petri net reduction method for DPN is proposed to simplify DPP in this research. Minimal disassembly transitions and maximal assembly transitions set can be figured out through heuristic algorithm and preemptive scheduling algorithm respectively. A sub-Petri net called simplest disassembly sub-Petri net（SDSPN） is generated to reduce complexity of DPP. Further more,assembly process planning is introduced into aircraft maintenance and Petri nets are used to control and trace the assembly of aircraft to reduce and avoid aviation servicing errors.
出处
《中国民航学院学报》
2006年第5期21-25,共5页
Journal of Civil Aviation University of China
基金
国家自然科学基金项目(60373102)
关键词
分解序列规划
PETRI网
网简化
航空维修差错
disassembly process planning
Petri nets
Petri nets reduction
aviation servicing error
