1966
DOI: 10.1016/0041-5553(66)90004-8
|View full text |Cite
|
Sign up to set email alerts
|

A numerical method for solving optimal control problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

1971
1971
2017
2017

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 1 publication
0
9
0
Order By: Relevance
“…Equations (10) and (11) indicate that with the application of the optimization methods of [16,19], we can solve the maximization problem of equation (7) by successive increase in the values of the functional Q of equation (6), based on solutions of model (2) and costate equation (11). Therefore, the boundary conditions on costate variable at the right side of the trajectory are given as: …”
Section: Df Z T T S P T B S P T F L T T Dt S V T P T S V T P Tmentioning
confidence: 99%
See 3 more Smart Citations
“…Equations (10) and (11) indicate that with the application of the optimization methods of [16,19], we can solve the maximization problem of equation (7) by successive increase in the values of the functional Q of equation (6), based on solutions of model (2) and costate equation (11). Therefore, the boundary conditions on costate variable at the right side of the trajectory are given as: …”
Section: Df Z T T S P T B S P T F L T T Dt S V T P T S V T P Tmentioning
confidence: 99%
“…Then, it can be said that once the trajectories model (2) passes hypersurface (13), the costate variable vector-valued function (9) satisfies the jump conditions [19] …”
Section: Df Z T T S P T B S P T F L T T Dt S V T P T S V T P Tmentioning
confidence: 99%
See 2 more Smart Citations
“…So that a numerical resolution turns out to be crucial in order to get some enlightening results. We formulate and apply an efficient and intuitive algorithm by combining the Forward-Backward Sweep algorithm [18][19][20][21] and a 4th order Runge-Kutta routine (see e.g., [22]). We performed several simulations and we always got a unique solution to the necessary conditions.…”
Section: Numerical Simulationsmentioning
confidence: 99%