1998
DOI: 10.1016/s0098-1354(98)00053-2
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic optimization of hybrib systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
34
0

Year Published

2000
2000
2022
2022

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 42 publications
(34 citation statements)
references
References 4 publications
0
34
0
Order By: Relevance
“…Such optimization problems incorporate the system dynamic description into the constraint set [Galán and Barton, 1998;Hiskens, 2004]. As Galán and Barton [1998] and Piccoli [1998] have shown, even though hybrid system dynamics are non-smooth, the cost function is smooth away from grazing points.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Such optimization problems incorporate the system dynamic description into the constraint set [Galán and Barton, 1998;Hiskens, 2004]. As Galán and Barton [1998] and Piccoli [1998] have shown, even though hybrid system dynamics are non-smooth, the cost function is smooth away from grazing points.…”
Section: Introductionmentioning
confidence: 99%
“…Such optimization problems incorporate the system dynamic description into the constraint set [Galán and Barton, 1998;Hiskens, 2004]. As Galán and Barton [1998] and Piccoli [1998] have shown, even though hybrid system dynamics are non-smooth, the cost function is smooth away from grazing points. This statement is expressed using different terminology though, with Piccoli [1998] requiring that all flows have the same history, and Galán and Barton [1998] requiring the existence of trajectory sensitivities (discussed later).…”
Section: Introductionmentioning
confidence: 99%
“…However those complications largely disappear under the assumption that the order of events does not change as θ and t f vary, i.e., no grazing situations occur. This assumption is common throughout the literature, though it is expressed in various ways: transversal crossings of triggering hypersurfaces are assumed in [18], existence of trajectory sensitivities is assumed in [19], and [20] assumes all flows have the same history. All statements are equivalent.…”
Section: Dynamic Embedded Optimizationmentioning
confidence: 99%
“…Furthermore, [19] shows that if J is a smooth function of its arguments, then it is continuously differentiable with respect to θ and t f . The minimization can therefore be solved using gradient-based methods.…”
Section: Dynamic Embedded Optimizationmentioning
confidence: 99%
See 1 more Smart Citation