摘要
针对Petri网控制问题中不可控子网的状态空间指数级增长导致的计算复杂性难题,提出了控制目标(线性约束)等价的网结构压缩算法:(1)将不可控子网部分区域压缩为单个库所;(2)并将原网上的线性约束等价转换为新网的新线性约束.反复迭代该算法,可以有效地压缩原不可控子网,从而指数级地减小不可控子网的状态空间,有效地降低监控问题的计算复杂性,甚至当不可控子网为状态机时,该方法能够彻底解决上述计算复杂性难题,获得高效最优的Petri网监控器,并用一个物料运输系统演示了该方法.
The computational complexity for the Petri nets control problem is very high due to the exponential growth of the state space for the uncontrollable subnets. To overcome this complexity problem, an algorithm is proposed to equivalently transform the original control problem into a much simpler one. This algorithm includes two parts. One is to compress an area of the uncontrollable subnet into a single place. The other is to equivalently transform the original linear constraint into a new one on the compressed net. Since an uncontrollable subnet can be effectively compressed by iterating this algorithm, and the state space from any marking can be exponentially reduced as the net size decreases, this algorithm can effectively reduce the computational complexity of the control problem. Especially when the uncontrollable subnet is a state machine, this method can be used to design an efficient and optimal supervisor. A material transportation system illustrates this method.
出处
《系统工程理论与实践》
EI
CSSCI
CSCD
北大核心
2014年第4期1052-1058,共7页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(61203040)
福建省高等学校新世纪优秀人才支持计划(11FJRC01)
福建省高校杰出青年科研人才培育计划(JA10004)
福建省教育厅科技计划项目(JA11002)
关键词
PETRI网
网结构压缩
监控器
线性约束
Petri nets
net structure compression
supervisor
linear constraint
