2001
DOI: 10.2514/2.4733
|View full text |Cite
|
Sign up to set email alerts
|

New Computational Framework for Trajectory Optimization of Higher-Order Dynamic Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
13
0

Year Published

2005
2005
2016
2016

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 28 publications
(15 citation statements)
references
References 4 publications
2
13
0
Order By: Relevance
“…The various aspects of flatness based optimal planning have been pursued by Agrawal and coworkers (Sira-Ramírez and Agrawal, 2004;Fossas et al, 2000;Ferreira and Agrawal, 1999). Dynamic optimization based on first-order and higher-order representations of a system have been compared showing substantial savings in computation (Veeraklaew and Agrawal, 2001). Preliminary results of flatness based planning of groups of autonomous vehicles were reported (Hao et al, 2003;Pledgie et al, 2002;Ferreira et al, 2000).…”
Section: Introductionmentioning
confidence: 94%
“…The various aspects of flatness based optimal planning have been pursued by Agrawal and coworkers (Sira-Ramírez and Agrawal, 2004;Fossas et al, 2000;Ferreira and Agrawal, 1999). Dynamic optimization based on first-order and higher-order representations of a system have been compared showing substantial savings in computation (Veeraklaew and Agrawal, 2001). Preliminary results of flatness based planning of groups of autonomous vehicles were reported (Hao et al, 2003;Pledgie et al, 2002;Ferreira et al, 2000).…”
Section: Introductionmentioning
confidence: 94%
“…As defined in ref. [13], the function space, where the extremum is sought, is 2 (0, ), x . However, such a transform gives rise to additional (velocity) variables, as well as additional (kinematical) constraints in the form x =v x [12] .…”
Section: Continuous Bolza Problemmentioning
confidence: 99%
“…The proposed approach is facilitated by two new ideas from the theory of nonlinear optimal control and the dynamic optimization, namely, the unified computational framework [12] and the extended optimality principle [13,14] . Under a set of closure conditions, it is proved that the KKT multipliers satisfy the same conditions as those obtained by collocating the costate equations of the second order, similar to the case of the costate equations of the first order [8] .…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations