On Optimal Supervisor Design for Discrete-Event Systems Modeled With Petri Nets via Constraint Simplification
Yufeng Chen, Yuting Li, Zhiwu Li, Naiqi Wu
Abstract
With integer linear programming problems (ILPPs) being formulated and solved, the existing approaches design optimal Petri-net supervisors via nonpure net structures, including self-loops and data inhibitor arcs. Nonpure net structures are powerful for control of Petri-net-modeled discrete-event systems. However, in the existing work, the formulated ILPPs contain a large number of constraints, which is computationally inefficient. In this article, we propose approaches that formulate ILPPs with fewer constraints such that the computational efficiency is significantly improved. To do so, in formulating ILPPs for optimal Petri-net controllers by using self-loops and data inhibitor arcs, we remove the reachability conditions for legal markings. By doing so, an obtained solution may result in some legal markings unreachable. To solve this problem, a novel technique is developed to design an optimal controller by modifying the initial marking and structure of the obtained supervisor. It is shown that, by the reduced ILPPs, one can find the same feasible solutions as that obtained by the existing work. Finally, the proposed approaches are demonstrated by examples.