摘要
为实现航空发动机维修差错的控制,采用基于优先约束关系的装配子网对发动机部件装配序列建模.在给定的装配评价准则下,将装配序列规划问题转化为最优变迁激发序列问题.引入离散时间的Pontryagin最小值原理(DTPMP),将极小化哈密顿函数这一全局优化的必要条件作为求解零部件装配序列的启发信息.为避免潜在死锁,给出了最优变迁激发序列算法.最后对最优装配序列规划算法的分析显示,该算法有多项式时间的复杂度.
To eliminate maintenance error during aero-engine assembly, assembly sub-Petri nets is used to modeling aero-engine parts assembly sequence （PAS） based on assembly precedence relationship. By the given assembly evaluation criterion, assembly sequence planning can be transformed into optimal transition firing sequence （OFS）. Discrete-time Pontryagin＇s minimum principle （DTPMP） is introduced to find OFS and DTPMP states that an OFS must minimize the Hamiltonian function which can be treat as the heuristic information to find the PAS. In addition, to avoid latent deadlock, the OFS algorithm is proposed. After complexity analysis, the OFS algorithm based on DTPMP is proved to be polynomial complexity.
出处
《控制与决策》
EI
CSCD
北大核心
2008年第11期1221-1225,1230,共6页
Control and Decision
基金
国家自然科学基金项目(60572174)
南京航空航天大学创新基金项目(Y0809-072)
关键词
发动机装配序列规划
离散时间最优控制
装配Petri网
最优装配序列
Aero-engine assembly sequence planning
Discrete-time Pontryagin＇s minimum principle
Assembly Petri nets
Optimal assembly sequence
