Optimization Techniques
DOI: 10.1007/bfb0006520
|View full text |Cite
|
Sign up to set email alerts
|

The development of an efficient optimal control package

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
48
0
1

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 81 publications
(49 citation statements)
references
References 10 publications
0
48
0
1
Order By: Relevance
“…This gives rise to the so called "sequential" approach to optimal control problems, where in each optimization iteration the two steps, system simulation and optimization, are performed sequentially, one after the other. This approach emerged early in the nonlinear optimal control literature [50]. In contrast to the sequential approach, the so called "simultaneous" approach addresses the full nonlinear program as stated above in (2a)-(2f) directly by a Newton type optimization algorithm, i.e., optimization and simulation are performed simultaneously.…”
Section: Sequential Vs Simultaneous Optimal Controlmentioning
confidence: 99%
“…This gives rise to the so called "sequential" approach to optimal control problems, where in each optimization iteration the two steps, system simulation and optimization, are performed sequentially, one after the other. This approach emerged early in the nonlinear optimal control literature [50]. In contrast to the sequential approach, the so called "simultaneous" approach addresses the full nonlinear program as stated above in (2a)-(2f) directly by a Newton type optimization algorithm, i.e., optimization and simulation are performed simultaneously.…”
Section: Sequential Vs Simultaneous Optimal Controlmentioning
confidence: 99%
“…The feasible path approach (Sargent and Sullivan, 1977;Morison, 1984;Jang et al, 1987;Mutjaba and Machietto, 1988) consists of converting the path constraint h into a terminal inequality constraint. The optimal control problem may then be posed as a conventional NLP optimisation problem, where function evaluation implicitly integrates the system f, g to evaluate L, M and the terminal path constraints N. The reformulation is typically of the form:…”
Section: Dynamic Optimisationmentioning
confidence: 99%
“…Furthermore, few options exist (Sargent & Sullivan (1977)), even in this case, for imposing constraints on continuous profiles and for handling discontinuities and/or singular profiles.…”
Section: List Of Figuresmentioning
confidence: 99%