AIAA/AAS Astrodynamics Specialist Conference and Exhibit 2006
DOI: 10.2514/6.2006-6033
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Implicit Integration Methods for Solving Aerospace Trajectory Optimization Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2006
2006
2013
2013

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(18 citation statements)
references
References 9 publications
0
18
0
Order By: Relevance
“…Adding more nodes will only capture negligibly-higherfrequency components and will not result in any significant improvement in accuracy. This notion has been validated by Riehl et al [46] on several problems in aerospace trajectory optimization. Furthermore, as described by Ross et al [47], it is possible to capture even the high-frequency terms by anti-aliasing the solution through an application of Bellman's principle.…”
Section: A Spectral Coefficient Testmentioning
confidence: 68%
“…Adding more nodes will only capture negligibly-higherfrequency components and will not result in any significant improvement in accuracy. This notion has been validated by Riehl et al [46] on several problems in aerospace trajectory optimization. Furthermore, as described by Ross et al [47], it is possible to capture even the high-frequency terms by anti-aliasing the solution through an application of Bellman's principle.…”
Section: A Spectral Coefficient Testmentioning
confidence: 68%
“…The most obvious method is that of algebraic integration which however is not possible for most realistic trajectory optimization problems. In Riehl et al 19 a overview of possible implicit integration methods are given (including Pseudo-Spectral integration). The methods transform the problem of numerical integration by replacing the ODEs with a set of defect constraints.…”
Section: Example Temporal Decorrelation: Integration Blow-upmentioning
confidence: 99%
“…The constructed NLP problem is typically solved by available solver based on gradient methods 16 and genetic algorithms. Direct transcription methods has been successfully applied in many fields such as spacecraft trajectory optimization, 17,18 aircraft trajectory optimization 19,20 etc. As stated, in most cases the applied methods cannot provide guarantees on finding the global optimal solution (region of convergence may be very small) and moreover can have severe problems of finding any valid trajectories given the (in)equality constraints imposed on the problem.…”
mentioning
confidence: 99%
“…This limitation can be overcome by using the so-called "multiple shooting" algorithm in which the time is divided into segments and both control and state variables are discretized at these segment end points, or cardinal nodes [55], while only the control variables are discretized within each segment. This way the errors due to gradient approximations remain within the segments and the algorithm achieves better overall accuracy, although at the expense of a larger NLP.…”
Section: Some Theoretical Considerations and Limitations Of The Algormentioning
confidence: 99%