Symmetry reduction for dynamic programming

Abstract : We present a method of exploiting symmetries of discrete-time optimal control problems to reduce the dimensionality of dynamic programming iterations. The results are derived for systems with continuous state variables, and can be applied to systems with continuous or discrete symmetry groups. We prove that symmetries of the state update equation and stage costs induce corresponding symmetries of the optimal cost function and the optimal policies. We then provide a general framework for computing the optimal cost function based on gridding a space of lower dimension than the original state space. This method does not rely on explicitly transforming the state update equations and can therefore be applied in circumstances where this is difficult. We illustrate these results on two six-dimensional optimal control problems that are computationally difficult to solve by dynamic programming without symmetry reduction.
Type de document :
Article dans une revue
Automatica, Elsevier, 2018
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal-mines-paristech.archives-ouvertes.fr/hal-01982793
Contributeur : Silvere Bonnabel <>
Soumis le : mercredi 16 janvier 2019 - 00:30:49
Dernière modification le : jeudi 7 février 2019 - 16:10:17

Fichier

2017Automatica.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01982793, version 1

Citation

John Maidens, Axel Barrau, Silvère Bonnabel, Murat Arcak. Symmetry reduction for dynamic programming. Automatica, Elsevier, 2018. 〈hal-01982793〉

Partager

Métriques

Consultations de la notice

12

Téléchargements de fichiers

3