Astrodynamics Conference 1986
DOI: 10.2514/6.1986-2000
|View full text |Cite
|
Sign up to set email alerts
|

Direct trajectory optimization using nonlinear programming and collocation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
160
0
2

Year Published

2002
2002
2013
2013

Publication Types

Select...
6
2
2

Relationship

0
10

Authors

Journals

citations
Cited by 123 publications
(162 citation statements)
references
References 9 publications
0
160
0
2
Order By: Relevance
“…In direct methods, the nonlinear optimization simultaneously searches over parameterizations of u(t) and x(t); here no simulation is required and instead the dynamics are imposed as a set of optimization constraints, typically evaluated at a selection of collocation points [9]. Mixtures of shooting and direct methods are also possible, and fall under the umbrella of multiple shooting.…”
Section: Introductionmentioning
confidence: 99%
“…In direct methods, the nonlinear optimization simultaneously searches over parameterizations of u(t) and x(t); here no simulation is required and instead the dynamics are imposed as a set of optimization constraints, typically evaluated at a selection of collocation points [9]. Mixtures of shooting and direct methods are also possible, and fall under the umbrella of multiple shooting.…”
Section: Introductionmentioning
confidence: 99%
“…Pytlak solved a state constrained optimal control problem using a gradient algorithm and applied it for some problems (see [8], [9]). Hargraves and Paris [10] reintroduced the direct transcription approach, by discretising the dynamic equations using a collocation method. A cubic polynomial is used to approximate the state variables and linear interpolation for the control variables.…”
Section: Methodsmentioning
confidence: 99%
“…Often, the cost functions used exhibits the Bellman optimality principle that allows for a dynamic programming solution. However, work on optimal control has also considered more general trajectory optimization problems [25] that define cost functions over the trajectories of a continuous system subject to constraints. A standard approach to trajectory optimization reformulates the problem as a non-linear optimization, and uses numerical optimization techniques [8], [9].…”
Section: ) Direct Multiple Shootingmentioning
confidence: 99%