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

Differential dynamic programming methods for solving bang-bang control problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0
1

Year Published

1969
1969
2017
2017

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 49 publications
(17 citation statements)
references
References 13 publications
0
16
0
1
Order By: Relevance
“…The singular arc is given by us = xi = xz = 0 (5. The predicted behavior at the junction is useful knowledge for numerical computational schemes, e. g. , Jacobson [9] was able to successfully compute bang-bang solutions for this problem with T sufficiently small so that the singular arc did not occur. However, for large T the nonanalytic junction came into play After computing about ten switches, the method became unstable [10].…”
Section: A(t) Is A(tx(t)x(t)) (42) P(t) a B(tx(t)%(t)) (43)mentioning
confidence: 99%
“…The singular arc is given by us = xi = xz = 0 (5. The predicted behavior at the junction is useful knowledge for numerical computational schemes, e. g. , Jacobson [9] was able to successfully compute bang-bang solutions for this problem with T sufficiently small so that the singular arc did not occur. However, for large T the nonanalytic junction came into play After computing about ten switches, the method became unstable [10].…”
Section: A(t) Is A(tx(t)x(t)) (42) P(t) a B(tx(t)%(t)) (43)mentioning
confidence: 99%
“…However, their approach required a kinematic plan to be given and only optimized the timing of the motion. Several authors have developed risk-sensitive optimal control methods [10,36] for nonlinear stochastic systems with known models [6] or datadriven control-learning approaches [35,4,15].…”
Section: Related Workmentioning
confidence: 99%
“…The underlying idea is that a rough initial approximation is determined from sufficient conditions via global optimization and then iteratively refined using local optimality conditions, i.e., stationarity (U = R m ), or the maximum principle (U ⊂ R m ). Let us find the conditions under which minimization (7) of the Bellman equation [6] ∂S(t,…”
Section: Formulation Of the Degenerate Design Problemmentioning
confidence: 99%