Parametric transformation of timed weighted marked graphs: applications in optimal resource allocation
Parametric transformation of timed weighted marked graphs: applications in optimal resource allocation
复制标题
时间加权标记图的参数化变换：在最优资源分配中的应用
DOI：
10.1109/jas.2020.1003477
复制
发表时间：
2021-01-01
影响因子：
11.8
通讯作者：
Giua, Alessandro
中科院分区：
文献类型：
--
作者：
He, Zhou;Ma, Ziyue;Giua, Alessandro
时间加权标记图是时间Petri网的一个子类，在柔性制造系统的控制和性能分析中有着广泛的应用。由于边缘上存在多重性（即权重），这类图的性能分析和资源优化是一个具有挑战性的问题。本文提出了一种将初始标记不确定的定时加权标记图转化为边权为酉权的等效参数定时标记图的方法。为了探索系统的最优资源分配策略，通过研究等效网络，提出了一种时间加权标记图资源优化的解析方法。最后，我们将该方法应用于一个柔性制造系统，并与之前的启发式方法进行了比较。仿真分析表明，该方法优于启发式方法。
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.