1976
DOI: 10.1137/0314047
|View full text |Cite
|
Sign up to set email alerts
|

Relaxed Controls and the Convergence of Optimal Control Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

1980
1980
2020
2020

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…To consider a maximum entropy variant of the optimal control problem, we now generalize the notion of controls by taking the relaxed control approach. This approach was first introduced by Young [59,60], and then widely applied to calculus of variations [36,53], deterministic optimal control [1,54,55] and stochastic optimal control [6,20,25]. Consider a function µ : [0, T ] → P(U ).…”
Section: Problem Setupmentioning
confidence: 99%
“…To consider a maximum entropy variant of the optimal control problem, we now generalize the notion of controls by taking the relaxed control approach. This approach was first introduced by Young [59,60], and then widely applied to calculus of variations [36,53], deterministic optimal control [1,54,55] and stochastic optimal control [6,20,25]. Consider a function µ : [0, T ] → P(U ).…”
Section: Problem Setupmentioning
confidence: 99%
“…However, the existence of Lagrange Multipliers is also important in order to prove the convergence of computational procedures (cf. Wierzbicki/Hatko [49], Wierzbicki/Kurcyusz [50], who use shifted penalty methods in order to compute solutions of problems with function space end condition, and Williamson/Polak [51]). Remark 3.13.…”
Section: Thenmentioning
confidence: 99%
“…Yet, even though hybrid models allow us to mathematically describe complex systems, efficient and flexible numerical methods to analyze and control those systems are hard to develop due to inherent phenomena such as Zeno executions [5]. In this paper we present a formulation for the class of hybrid systems whose trajectories are continuous (i.e., hybrid systems without reset maps) based on the theory of relaxed controls [6], [7], [8], and we show that our formulation allows us to numerically solve hybrid optimal control problems.…”
Section: Introductionmentioning
confidence: 99%