2020
DOI: 10.1002/oca.2639
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing the performance of the feedback controller for state‐based switching bilinear systems

Abstract: Summary This article is concerned with the design and performance optimization of feedback controllers for state‐based switching bilinear systems (SBLSs), where subsystems take the form of bilinear systems in different state space polyhedra. First, by further dividing the subregions into smaller regions and designing region‐dependent feedback controllers in the resulting regions, the SBLSs can be transformed into corresponding switching linear systems (SLSs). Then, for these SLSs, by imposing contractility con… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 26 publications
(25 reference statements)
0
3
0
Order By: Relevance
“…Here, K * is the optimal solution for the problem (12) with Equations ( 5) and ( 6), F[K * , t] is the solution to the differential Equation ( 5) when K = K * . Furthermore, K (n) * is the minimizer of the problem (14) with Equations ( 15) and ( 16) dividing T into n segments, F n (K (n) * ) is the numerical solution of Equation ( 15) when K = K (n) * . To prove this theorem, the following lemma is proved firstly.…”
Section: Assumption 1 the Objective Function J(k F[k T]mentioning
confidence: 99%
See 1 more Smart Citation
“…Here, K * is the optimal solution for the problem (12) with Equations ( 5) and ( 6), F[K * , t] is the solution to the differential Equation ( 5) when K = K * . Furthermore, K (n) * is the minimizer of the problem (14) with Equations ( 15) and ( 16) dividing T into n segments, F n (K (n) * ) is the numerical solution of Equation ( 15) when K = K (n) * . To prove this theorem, the following lemma is proved firstly.…”
Section: Assumption 1 the Objective Function J(k F[k T]mentioning
confidence: 99%
“…For the stabilization of time‐delay systems, the early method is to transform the analysis of a related Riccati equation and give the controller design method by solving the Riccati equation. In Reference 14, according to Lyapunov theory, the designs of state feedback controllers for iterative algorithms based on linear matrix inequalities (LMIs) have been extensively studied. For the stabilization of time‐delay systems, based on the Riccati equation, a feedback low‐gain controller is proposed by solving a minimization problem 15 .…”
Section: Introductionmentioning
confidence: 99%
“…The ML‐MISG algorithm can combine the filtering technique and the hierarchical identification methods 61‐66 to study the identification problem of other linear and nonlinear systems 67‐70 …”
Section: The Maximum Likelihood Multi‐innovation Stochastic Gradient ...mentioning
confidence: 99%