Parametric Transformation of Timed Weighted Marked Graphs:Applications in Optimal Resource Allocation  

作　　者：Zhou He Ziyue Ma Zhiwu Li Alessandro Giua 

机构地区：[1]the College of Mechanical and Electrical Engineering,Shaanxi University of Science and Technology,Xi’an 710021,China [2]Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing,Xi’an University of Technology,Xi’an 710048,China [3]the School of Electro-Mechanical Engineering,Xidian University,Xi’an 710071,China [4]Institute of Systems Engineering,Macao University of Science and Technology,Taipa 999078,Macao,China [5]the Department of Electrical and Electronic Engineering,University of Cagliari,Cagliari 09124,Italy

出　　处：《IEEE/CAA Journal of Automatica Sinica》2021年第1期179-188,共10页自动化学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(61803246,61703321);the China Postdoctoral Science Foundation(2019M663608);Shaanxi Provincial Natural Science Foundation(2019JQ-022,2020JQ-733);the Fundamental Research Funds for the Central Universities(JB190407);the Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing,Xi’an University of Technology(SKL2020CP03)。

摘　　要：Timed weighted marked graphs are a subclass of timed Petri nets that have wide applications in the control and performance analysis of flexible manufacturing systems.Due to the existence of multiplicities(i.e.,weights)on edges,the performance analysis and resource optimization of such graphs represent a challenging problem.In this paper,we develop an approach to transform a timed weighted marked graph whose initial marking is not given,into an equivalent parametric timed marked graph where the edges have unitary weights.In order to explore an optimal resource allocation policy for a system,an analytical method is developed for the resource optimization of timed weighted marked graphs by studying an equivalent net.Finally,we apply the proposed method to a flexible manufacturing system and compare the results with a previous heuristic approach.Simulation analysis shows that the developed approach is superior to the heuristic approach.

关 键 词：Discrete event system resource allocation timed Petri net weighted marked graph 

分 类 号：TP301.1[自动化与计算机技术—计算机系统结构]