Extensions to the theory of optimal control of discrete event systems (Q3139829)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 434965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extensions to the theory of optimal control of discrete event systems |
scientific article; zbMATH DE number 434965 |
Statements
15 March 1995
0 references
edge vertex
0 references
acyclic graph
0 references
computational complexity
0 references
optimal control
0 references
discrete event system
0 references
0.96563923
0 references
0.9444013
0 references
0.9378723
0 references
0.9365488
0 references
0.9324368
0 references
0.9298407
0 references
0.9285578
0 references
0.9281177
0 references
Extensions to the theory of optimal control of discrete event systems (English)
0 references
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].
0 references