Uloženo v:
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Preprint |
| Vydáno: |
2026
|
| Témata: | |
| On-line přístup: | https://arxiv.org/abs/2602.04310 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| _version_ | 1866911421364699136 |
|---|---|
| author | Ninite, Léa Banse, Adrien Berger, Guillaume O. Jungers, Raphaël M. |
| author_facet | Ninite, Léa Banse, Adrien Berger, Guillaume O. Jungers, Raphaël M. |
| contents | We study the problem of estimating the value function of discrete-time switched systems under arbitrary switching. Unlike the switched LQR problem, where both inputs and mode sequences are optimized, we consider the case where switching is exogenous. For such systems, the number of possible mode sequences grows exponentially with time, making the exact computation of the value function intractable. This motivates the development of tractable bounds that approximate it. We propose a novel framework, based on path-complete graphs, for constructing computable upper bounds on the value function. In this framework, multiple quadratic functions are combined through a directed graph that encodes dynamic programming inequalities, yielding convex and sound formulations. For example, for switched linear systems with quadratic cost, we derive tractable LMI-based formulations and provide computational complexity bounds. We further establish approximation guarantees for the upper bounds and show asymptotic non-conservativeness using concepts from graph theory. Finally, we extend the approach to controller synthesis for systems with affine control inputs and demonstrate its effectiveness on numerical examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_04310 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A Path-Complete Approach for Optimal Control of Switched Systems Ninite, Léa Banse, Adrien Berger, Guillaume O. Jungers, Raphaël M. Optimization and Control Systems and Control We study the problem of estimating the value function of discrete-time switched systems under arbitrary switching. Unlike the switched LQR problem, where both inputs and mode sequences are optimized, we consider the case where switching is exogenous. For such systems, the number of possible mode sequences grows exponentially with time, making the exact computation of the value function intractable. This motivates the development of tractable bounds that approximate it. We propose a novel framework, based on path-complete graphs, for constructing computable upper bounds on the value function. In this framework, multiple quadratic functions are combined through a directed graph that encodes dynamic programming inequalities, yielding convex and sound formulations. For example, for switched linear systems with quadratic cost, we derive tractable LMI-based formulations and provide computational complexity bounds. We further establish approximation guarantees for the upper bounds and show asymptotic non-conservativeness using concepts from graph theory. Finally, we extend the approach to controller synthesis for systems with affine control inputs and demonstrate its effectiveness on numerical examples. |
| title | A Path-Complete Approach for Optimal Control of Switched Systems |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2602.04310 |