2022 International Conference on Robotics and Automation (ICRA) 2022
DOI: 10.1109/icra46639.2022.9811730
|View full text |Cite
|
Sign up to set email alerts
|

Computing Funnels Using Numerical Optimization Based Falsifiers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 29 publications
0
2
0
Order By: Relevance
“…The studies in funnel synthesis can be separated into two categories depending on whether they aim to maximize [3], [4], [5] or minimize the size of the funnel [2], [6], [7]. The funnel computation inherently aims to maximize the size of the funnel to have a larger controlled invariant set in the state space.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The studies in funnel synthesis can be separated into two categories depending on whether they aim to maximize [3], [4], [5] or minimize the size of the funnel [2], [6], [7]. The funnel computation inherently aims to maximize the size of the funnel to have a larger controlled invariant set in the state space.…”
Section: Introductionmentioning
confidence: 99%
“…When employing the Lyapunov condition, the resulting optimization problem has a differential inequality of the Lyapunov function in continuous-time for a finite-time interval. Since it is intractable to satisfy the inequality for all time in the given interval, many approaches focus on checking the differential inequality at a finite number of node points [2], [4], [5]. When a quadratic Lyapunov function with a timevarying positive definite (PD) matrix is employed, the resulting differential inequality ends up with a differential linear matrix inequality (DLMI).…”
Section: Introductionmentioning
confidence: 99%