Solving the Goddard problem with thrust and dynamic pressure constraints using saturation functions - Mines Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Solving the Goddard problem with thrust and dynamic pressure constraints using saturation functions

Résumé

This paper addresses the well-known Goddard problem in the formulation of Seywald and Cliff with the objective to maximize the altitude of a vertically ascending rocket sub ject to dynamic pressure and thrust constraints. The Goddard problem is used to propose a new method to systematically incorporate the constraints into the system dynamics by means of saturation functions. This procedure results in an unconstrained and penalized optimal control problem which strictly satisfies the constraints. The approach requires no knowledge of the switching structure of the optimal solution and avoids the explicit consideration of singular arcs. A collocation method is used to solve the BVPs derived from the optimality conditions and demonstrates the applicability of the method to constrained optimal control problems.
Fichier non déposé

Dates et versions

hal-00473201 , version 1 (14-04-2010)

Identifiants

  • HAL Id : hal-00473201 , version 1

Citer

Knut Graichen, Nicolas Petit. Solving the Goddard problem with thrust and dynamic pressure constraints using saturation functions. 17th World Congress of The International Federation of Automatic Control, Nov 2008, Seoul, South Korea. pp.14301-14306. ⟨hal-00473201⟩
203 Consultations
0 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More