Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

When does relaxation reduce the minimum cost of an optimal control problem?

Abstract : Relaxation is a regularization procedure used in optimal control, involving the replacement of velocity sets by their convex hulls, to ensure the existence of a minimizer. It can be an important step in the construction of sub-optimal controls for the original, unrelaxed, optimal control problem (which may not have a minimizer), based on obtaining a minimizer for the relaxed problem and approximating it. In some cases the infimum cost of the unrelaxed problem is strictly greater than the infimum cost over relaxed state trajectories; there is a need to identify such situations because then the above procedure fails. Following on from earlier work by Warga, we explore the relation between, on the one hand, non-coincidence of the minimum cost of the optimal control and its relaxation and, on the other, abnormality of necessary conditions (in the sense that they take a degenerate form in which the cost multiplier set to zero).
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01067548
Contributor : Estelle Bouzat Connect in order to contact the contributor
Submitted on : Tuesday, September 23, 2014 - 4:00:47 PM
Last modification on : Tuesday, January 18, 2022 - 2:26:05 PM

Identifiers

Collections

Citation

Michele Palladino, Richard Vinter. When does relaxation reduce the minimum cost of an optimal control problem?. 52nd IEEE Control and Decision Conference (CDC), 2013, Florence, Italy. pp.526-531, ⟨10.1109/CDC.2013.6759935⟩. ⟨hal-01067548⟩

Share

Metrics

Record views

58