Bounding the Settling Time of Finite-Time Stable Systems using Sum of Squares
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913893199118336 |
|---|---|
| author | Kisole, Sengiyumva Garg, Kunal Peet, Matthew |
| author_facet | Kisole, Sengiyumva Garg, Kunal Peet, Matthew |
| contents | Finite-time stability (FTS) of a differential equation guarantees that solutions reach a given equilibrium point in finite time, where the time of convergence depends on the initial state of the system. For traditional stability notions such as exponential stability, the convex optimization framework of Sum-of-Squares (SoS) enables computation of polynomial Lyapunov functions to certify stability. However, finite-time stable systems are characterized by non-Lipschitz, non-polynomial vector fields, rendering standard SoS methods inapplicable. To this end, we show that computation of a non-polynomial Lyapunov function certifying finite-time stability can be reformulated as feasibility of a set of polynomial inequalities under a particular transformation. As a result, SoS can be utilized to verify FTS and obtain a bound on the settling time. Numerical examples are used to demonstrate the accuracy of the conditions in both certifying finite-time stability and bounding the settling time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_11255 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bounding the Settling Time of Finite-Time Stable Systems using Sum of Squares Kisole, Sengiyumva Garg, Kunal Peet, Matthew Optimization and Control Systems and Control Finite-time stability (FTS) of a differential equation guarantees that solutions reach a given equilibrium point in finite time, where the time of convergence depends on the initial state of the system. For traditional stability notions such as exponential stability, the convex optimization framework of Sum-of-Squares (SoS) enables computation of polynomial Lyapunov functions to certify stability. However, finite-time stable systems are characterized by non-Lipschitz, non-polynomial vector fields, rendering standard SoS methods inapplicable. To this end, we show that computation of a non-polynomial Lyapunov function certifying finite-time stability can be reformulated as feasibility of a set of polynomial inequalities under a particular transformation. As a result, SoS can be utilized to verify FTS and obtain a bound on the settling time. Numerical examples are used to demonstrate the accuracy of the conditions in both certifying finite-time stability and bounding the settling time. |
| title | Bounding the Settling Time of Finite-Time Stable Systems using Sum of Squares |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2501.11255 |