2008 47th IEEE Conference on Decision and Control 2008
DOI: 10.1109/cdc.2008.4738842
|View full text |Cite
|
Sign up to set email alerts
|

Robust optimality of linear saturated control in uncertain linear network flows

Abstract: Abstract-We propose a novel approach that, given a linear saturated feedback control policy, asks for the objective function that makes robust optimal such a policy. The approach is specialized to a linear network flow system with unknown but bounded demand and politopic bounds on controlled flows. All results are derived via the Hamilton-Jacobi-Isaacs and viscosity theory.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2009
2009
2009
2009

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…The way to prove the equality between V andṼ used in [3] is to consider respectively the Hamilton-JacobiBellman and the Hamilton-Jacobi-Isaacs equations that they must respectively solve in the viscosity sense (see Crandall et al [14] and Bardi and Capuzzo Dolcetta [4]). Such equations are respectively, neglecting for the moment possible boundary conditions, V (ζ) + H(ζ, ∇V (ζ)) = 0, (0.11)…”
Section: ż(T) = Sat(−kz(t)) − Dw(t) Z(0) = ζmentioning
confidence: 99%
See 4 more Smart Citations
“…The way to prove the equality between V andṼ used in [3] is to consider respectively the Hamilton-JacobiBellman and the Hamilton-Jacobi-Isaacs equations that they must respectively solve in the viscosity sense (see Crandall et al [14] and Bardi and Capuzzo Dolcetta [4]). Such equations are respectively, neglecting for the moment possible boundary conditions, V (ζ) + H(ζ, ∇V (ζ)) = 0, (0.11)…”
Section: ż(T) = Sat(−kz(t)) − Dw(t) Z(0) = ζmentioning
confidence: 99%
“…V (ζ) +H(ζ, ∇Ṽ (ζ)) = 0, (0.12) where ∇ is the gradient, and the Hamiltonians H andH are defined, for all ζ ∈ R n , p ∈ R n , as In [3] we actually exhibit a function φ solving both (0.11)-(0.12), and, using uniqueness results for (0.11)-(0.12) we conclude φ = V =Ṽ . However, apart from a simpler one-dimensional case, it seems suitable to split the problem into two different problems: one outside the target T , giving it a "minimum-time" feature, and one inside the target, giving it a linear-quadratic feature.…”
Section: ż(T) = Sat(−kz(t)) − Dw(t) Z(0) = ζmentioning
confidence: 99%
See 3 more Smart Citations