Skip to Main content Skip to Navigation
Reports

Using Logarithmic Penalties in the Shooting Algorithm for Optimal Control Problems

Abstract : The paper deals with optimal control problems of ordinary differential equations with bound control constraints. We analyse the logarithmic penalty method for converting the problem into an unconstrained one, the latter being solved by a shooting algorithm. Convergence of the value function and optimal controls is obtained for linear quadratic problems, and more generally when the control variable enters linearly in the state equation and in a quadratic way in the cost function. We display some numerical results on two examples: an aircraft maneuvre, and the stabilization of an oscillating system.
Complete list of metadata

https://hal.inria.fr/inria-00072350
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 8:29:38 PM
Last modification on : Friday, May 25, 2018 - 12:02:04 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:05:02 PM

Identifiers

  • HAL Id : inria-00072350, version 1

Collections

Citation

J. Frederic Bonnans, Thérèse Guilbaud. Using Logarithmic Penalties in the Shooting Algorithm for Optimal Control Problems. [Research Report] RR-4237, INRIA. 2001. ⟨inria-00072350⟩

Share

Metrics

Record views

337

Files downloads

571