Direct trajectory optimization by a Chebyshev pseudospectral method

被引:355
作者
Fahroo, F
Ross, IM
机构
[1] USN, Postgrad Sch, Dept Math, Monterey, CA 93943 USA
[2] USN, Postgrad Sch, Dept Aeronaut & Astronaut, Monterey, CA 93943 USA
关键词
D O I
10.2514/2.4862
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
We present a Chebyshev pseudospectral method for directly solving a generic Bolza optimal control problem with state and control constraints. This method employs Nth-degree Lagrange polynomial approximations for the state and control variables with the values of these variables at the Chebyshev-Gauss-Lobatto (CGL) points as the expansion coefficients. This process yields a nonlinear programming problem (NLP) with the state and control values at the CGL points as unknown NLP parameters. Numerical examples demonstrate that this method yields more accurate results than those obtained from the traditional collocation methods.
引用
收藏
页码:160 / 166
页数:7
相关论文
共 25 条
[1]  
[Anonymous], ANN NUMER MATH
[2]   Survey of numerical methods for trajectory optimization [J].
Betts, JT .
JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 1998, 21 (02) :193-207
[3]  
Canuto C., 2012, Spectral Methods: Fundamentals in Single Domains
[4]   Collocation versus differential inclusion in direct optimization [J].
Conway, BA ;
Larson, KM .
JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 1998, 21 (05) :780-785
[5]  
DAVIS PJ, 1977, METHODS NUMERICAL IN, P68
[6]   THE PSEUDOSPECTRAL LEGENDRE METHOD FOR DISCRETIZING OPTIMAL-CONTROL PROBLEMS [J].
ELNAGAR, G ;
KAZEMI, MA ;
RAZZAGHI, M .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1995, 40 (10) :1793-1796
[7]   Pseudospectral chebyshev optimal control of constrained nonlinear dynamical systems [J].
Elnagar, GN .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1998, 11 (02) :195-217
[8]  
Fahroo F, 2000, J ASTRONAUT SCI, V48, P269
[9]  
Fahroo F, 2000, P AMER CONTR CONF, P3860, DOI 10.1109/ACC.2000.876945
[10]   Costate estimation by a Legendre pseudospectral method [J].
Fahroo, F ;
Ross, IM .
JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 2001, 24 (02) :270-277