2007 46th IEEE Conference on Decision and Control 2007
DOI: 10.1109/cdc.2007.4434076
|View full text |Cite
|
Sign up to set email alerts
|

Multiresolution-based direct trajectory optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
27
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(27 citation statements)
references
References 17 publications
0
27
0
Order By: Relevance
“…For simplicity, we henceforth denote x j;k xt j;k and u j;k ut j;k . We convert the optimal control problem (1-5) into an NLP problem using Runge-Kutta (RK) discretizations [14,15]. To this end, let a nonuniform grid of the form…”
Section: Nlp Problem Formulation On Dyadic Gridsmentioning
confidence: 99%
See 3 more Smart Citations
“…For simplicity, we henceforth denote x j;k xt j;k and u j;k ut j;k . We convert the optimal control problem (1-5) into an NLP problem using Runge-Kutta (RK) discretizations [14,15]. To this end, let a nonuniform grid of the form…”
Section: Nlp Problem Formulation On Dyadic Gridsmentioning
confidence: 99%
“…The cost functional is discretized by introducing a new state and then using a RK discretization, as mentioned previously. Then the subsequent NLP problem [14,15] is to find the variables X, U,Ũ, and f that minimize (11) subject to the following constraints:…”
Section: Nlp Problem Formulation On Dyadic Gridsmentioning
confidence: 99%
See 2 more Smart Citations
“…The so-called "pseudospectral" methods use orthogonal polynomials to choose the collocation points and are very efficient, exhibiting superlinear convergence when the solution is smooth. Numerical optimal control software packages that implement direct methods for the solution of OCPs include SOCS [11], RIOTS [70], DIDO [62], PSOPT [7], GPOPS [60], MTOA [42] and DENMRA [84] among many others. A recent survey of numerical optimal control techniques for trajectory optimization can be found in [9].…”
Section: Optimal Trajectory Generationmentioning
confidence: 99%