25th ACM International Conference on Hybrid Systems: Computation and Control 2022
DOI: 10.1145/3501710.3519539
|View full text |Cite
|
Sign up to set email alerts
|

Necessary and Sufficient Conditions for Template-Dependent Ordering of Path-Complete Lyapunov Methods

Abstract: In the context of discrete-time switched systems, we study the comparison of stability certificates based on path-complete Lyapunov methods. A characterization of this general ordering has been provided recently, but we show here that this characterization is too strong when a particular template is considered, as it is the case in practice. In the present work we provide a characterization for templates that are closed under pointwise minimum/maximum, which covers several templates that are often used in prac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…As reference benchmarks, we consider two switched linear systems in dimension 2 and 8 respectively, which are challenging as they are known to lead to poor approximation with classical techniques (see (Debauche, Della Rossa, and Jungers 2023, Section 5) and (Ahmadi et al 2014, Example 5.2)). The first one serves as proof of concept, while the second example shows that in higher dimensions, neural Lyapunov functions are competitive with SOS-based techniques both in terms of precision and (as suggested earlier in Figure 1) in computation time.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…As reference benchmarks, we consider two switched linear systems in dimension 2 and 8 respectively, which are challenging as they are known to lead to poor approximation with classical techniques (see (Debauche, Della Rossa, and Jungers 2023, Section 5) and (Ahmadi et al 2014, Example 5.2)). The first one serves as proof of concept, while the second example shows that in higher dimensions, neural Lyapunov functions are competitive with SOS-based techniques both in terms of precision and (as suggested earlier in Figure 1) in computation time.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…As reference benchmarks, we consider two switched linear systems in dimension 2 and 8 respectively, which are challenging as they are known to lead to poor approximation with classical techniques (see [15,Section 5] and [2,Example 5.2]). The first one serves as proof of concept, while the second example shows that in higher dimensions, neural Lyapunov functions are competitive with SOS-based techniques both in terms of precision and (as suggested earlier in Figure 1) in computation time.…”
Section: Numerical Resultsmentioning
confidence: 99%