Determining Optimal Control Sequences for Reconfiguration in Petri Nets Using Cost Trees
Ziyue Ma, Jiafeng Zhang · 2020
In this paper we study the optimal reconfiguration problem in Petri nets, i.e., to determine a firing sequence that drives a plant net from a source marking to a set of target markings with the minimal cost. We first propose a primitive breadth-first searching (BFS) algorithm that searches the basis marking space using minimal explanations and ILPs. Then we propose an improved BFS algorithm using a particular type of basis partitions that circumvents the need of solving ILPs. An optimal control sequence can be obtained using the cost tree constructed by the improved BFS algorithm.