DocumentCode
1708640
Title
DMOC approach to solve Goddard rocket problem in comparison with RPM
Author
Jiawei Zhang ; Weizhong Zhang ; Jiayuan Shan
Author_Institution
Key Lab. of Dynamic & Control of Flight Vehicle, Beijing Inst. of Technol., Beijing, China
fYear
2013
Firstpage
2185
Lastpage
2189
Abstract
A new approach -DMOC (Discrete Mechanics and Optimal Control) is presented to solve the classic Goddard rocket problem, in comparison with RPM (Radau Pseudospectral Method). DMOC approach firstly discretizes the Lagrange-d´Alembert principle for the rocket system, the resulting forced discrete Euler-Lagrange equations then serve as constraints for the optimization of a given cost functional. Therefore the optimal control problem is converted into a nonlinear programming (NLP) problem. While RPM transcribes the optimal control problem to a NLP problem by parameterizing the state and control using global polynomials and collocating the differential-algebraic equations using nodes obtained from a Gaussian quadrature. Finally, DMOC approach and RPM both successfully solve the Goddard rocket problem, which is a terminal free, singular optimal control problem with path constrain; the results proved that DMOC approach and RPM each have its strong points.
Keywords
aerospace control; nonlinear programming; optimal control; rockets; DMOC approach; Gaussian quadrature; Goddard rocket problem; Lagrange-d´Alembert principle; NLP problem; RPM; Radau pseudospectral method; control parameterization; cost functional optimization; discrete mechanics and optimal control; forced discrete Euler-Lagrange equations; nonlinear programming problem; path constraint; singular optimal control problem; state parameterization; Approximation methods; Equations; Force; Optimal control; Optimization; Programming; Rockets; DMOC; Goddard rocket problem; Optimal control; RPM;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference (CCC), 2013 32nd Chinese
Conference_Location
Xi´an
Type
conf
Filename
6639790
Link To Document