\(S\)-regular controlled plants (Q1742188)
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 6858336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(S\)-regular controlled plants |
scientific article; zbMATH DE number 6858336 |
Statements
\(S\)-regular controlled plants (English)
0 references
11 April 2018
0 references
The paper deals with the minimum-time linear control problem with convex constraints on admissible controls. The notion of S-regular linear control problem is introduced. It is shown that S-regularity of the problem guarantees strict convexity of the reachability set at each moment \(t>0\). Uniqueness of the optimal control is thus proven.
0 references
reachability set
0 references
convex optimization
0 references
linear controlled plant
0 references
strict convexity of a convex set
0 references
support function of a set
0 references
0.7975799441337585
0 references
0.7758843302726746
0 references
0.7740755081176758
0 references
