Extensions to the theory of optimal control of discrete event systems

From MaRDI portal





The optimal control problem discussed in this paper is the following: A discrete event system is modeled as a finite vertex directed graph with initial vertex and terminal vertex. Control action represents the removal of edges from the graph representing the uncontrolled discrete event system. It seems to be a framework which absorbed all the problems considered in the existing theory. It is possible now, to relax the restrictive assumption that the graph must be acyclic. Unfortunately, the computational complexity in the generalization goes up from \(O(n^ 2\log n)\) to \(O(n^ 3\log n)\). The only restrictive assumption that remains on the structure is the condition that there be a unique terminal vertex. Algorithms are formulated. The authors cannot guarantee solutions in polynomial time in the relaxed case. For the entire collection see [Zbl 0772.00019].











This page was built for publication: Extensions to the theory of optimal control of discrete event systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139829)