Constrained quadratic state feedback control of discrete-time Markovian jump linear systems (Q1301376): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127097602, #quickstatements; #temporary_batch_1723642047871
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Oswaldo L. V. Costa / rank
Normal rank
 
Property / author
 
Property / author: El-Kébir Boukas / rank
Normal rank
 
Property / author
 
Property / author: Oswaldo L. V. Costa / rank
 
Normal rank
Property / author
 
Property / author: El-Kébir Boukas / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127097602 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:31, 14 August 2024

scientific article
Language Label Description Also known as
English
Constrained quadratic state feedback control of discrete-time Markovian jump linear systems
scientific article

    Statements

    Constrained quadratic state feedback control of discrete-time Markovian jump linear systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2000
    0 references
    The authors consider the quadratic optimal control problem of discrete-time Markovian jump linear systems (MJLS). Different from the related literature [cf. \textit{O. L. V. Costa}, \textit{J. B. R. do Val} and \textit{J. C. Geromel}, Int. J. Control 66, 557-579 (1997); \textit{M. V. Kothare}, \textit{V. Balakrishnan} and \textit{M. Morari}, Automatica 32, No. 10, 1361-1379 (1996; Zbl 0897.93023)], the problem here is under constraints on the norm of the state and control variables as well as with some uncertainties on the transition probability matrix and initial state (belonging to appropriate convex sets). It is shown that the problem can be stated in terms of a linear matrix inequalities (LMI) optimization problem, and then, via using convex programming, approximation for the optimal solution of the problem can be well obtained. Numerical examples show the effectiveness of the proposed method.
    0 references
    0 references
    quadratic optimal control
    0 references
    discrete-time Markovian jump linear systems
    0 references
    constraints
    0 references
    linear matrix inequalities
    0 references
    convex programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references