2022
DOI: 10.1016/j.amc.2022.127085
|View full text |Cite
|
Sign up to set email alerts
|

Reachable set bounding for linear systems with mixed delays and state constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…The bilinearity makes inequality (17) non-convex. Nevertheless, when 𝛿, 𝛽 s , and 𝛽 m are fixed, matrix inequality (17) becomes an LMI, that is, a convex optimisation.…”
Section: Andmentioning
confidence: 99%
See 2 more Smart Citations
“…The bilinearity makes inequality (17) non-convex. Nevertheless, when 𝛿, 𝛽 s , and 𝛽 m are fixed, matrix inequality (17) becomes an LMI, that is, a convex optimisation.…”
Section: Andmentioning
confidence: 99%
“…We can solve the optimisation problem in Theorem 1 using a commercially available LMI toolbox. In addition, we can establish the smallest upper bound by undertaking the following optimisation: (17).…”
Section: Andmentioning
confidence: 99%
See 1 more Smart Citation