DMOC approach to solve Goddard rocket problem in comparison with RPM

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 32nd Chinese Control Conference, CCC 2013
PublisherIEEE Computer Society
Pages2185-2189
Number of pages5
ISBN (Print)9789881563835
Publication statusPublished - 18 Oct 2013
Event32nd Chinese Control Conference, CCC 2013 - Xi'an, China
Duration: 26 Jul 201328 Jul 2013

Publication series

NameChinese Control Conference, CCC
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference32nd Chinese Control Conference, CCC 2013
Country/TerritoryChina
CityXi'an
Period26/07/1328/07/13

Keywords

  • DMOC
  • Goddard rocket problem
  • Optimal control
  • RPM

Fingerprint

Dive into the research topics of 'DMOC approach to solve Goddard rocket problem in comparison with RPM'. Together they form a unique fingerprint.

Cite this