2009
DOI: 10.1109/tac.2009.2031574
|View full text |Cite
|
Sign up to set email alerts
|

On the Value Functions of the Discrete-Time Switched LQR Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
60
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 90 publications
(60 citation statements)
references
References 13 publications
0
60
0
Order By: Relevance
“…Thus, in order to make some comparisons, Figure 1 shows the state space trajectories for the switching law given by (30) and the optimal one. The later is obtained by NL programming in a suitable formulation taking into account singular arcs [24].…”
Section: Example 1 : a Regular Casementioning
confidence: 99%
See 1 more Smart Citation
“…Thus, in order to make some comparisons, Figure 1 shows the state space trajectories for the switching law given by (30) and the optimal one. The later is obtained by NL programming in a suitable formulation taking into account singular arcs [24].…”
Section: Example 1 : a Regular Casementioning
confidence: 99%
“…Several approaches have been used to tackle this problem, one can cite for example [18,26,29,30] for dynamic programming approaches, [1,2,27] for variational approaches, or [6,8,12] for Lyapunov based approaches. This problem is not easy, even numerically [24,27] and the design of a stabilizing feedback law based on the optimization of a criterion is a challenging task.…”
Section: Introductionmentioning
confidence: 99%
“…Kozyakin [24,25] provides a counter example to the famous finiteness conjecture that includes an interesting and deep analysis of the "most unstable" switching law. Another related direction is the study of optimal control problems for DT linear switched systems using dynamic programming [52].…”
Section: 2010 Draftmentioning
confidence: 99%
“…In the last decade, many contributions have addressed the design of stabilizing switching laws for switched systems both in continuous and discrete time (see for examples [1], [2], [3], [4] for dynamic programming approaches, [5], [6], [7] for variational approaches, and [8], [9], [10] for Lyapunov based approaches). This problem cannot be considered trivial even numerically [11], [7] and the goal to design closed loop control, based on the optimization of a criteria, is a challenging task.…”
Section: Introductionmentioning
confidence: 99%
“…Up to now, the exact solution of a switched LQ problem is not available. Only approximations of the state feedback switching law have been proposed in the literature using the dynamic programming [1], [2], [3], [4]. The practical obstacle to the application of these methods relies on the difficulties to compute numerically a good approximation of the solution not only for small dimensional problems.…”
Section: Introductionmentioning
confidence: 99%