Computing control invariant sets is easy

Mirko Fiacchini 1 Mazen Alamir 1
1 GIPSA-SYSCO - SYSCO
GIPSA-DA - Département Automatique
Abstract : In this paper we consider the problem of computing control invariant sets for linear controlled systems with constraints on the input and on the states. We focus in particular on the complexity of the computation of the N-step operator, given by the Minkowski addition of sets, that is the basis of many of the iterative procedures for obtaining control invariant sets. Set inclusions conditions for control invariance are presented that involve the N-step sets and are posed in form of linear programming problems. Such conditions are employed in algorithms based on LP problems that allow to overcome the complexity limitation inherent to the set addition and can be applied also to high dimensional systems. The efficiency and scalability of the method are illustrated by computing in less than two seconds an approximation of the maximal control invariant set, based on the 15-step operator, for a system whose state and input dimensions are 20 and 10 respectively.
Type de document :
Pré-publication, Document de travail
2017
Liste complète des métadonnées

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

http://hal.univ-grenoble-alpes.fr/hal-01651736
Contributeur : Mirko Fiacchini <>
Soumis le : mercredi 29 novembre 2017 - 13:03:15
Dernière modification le : lundi 9 avril 2018 - 12:22:31

Fichier

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

Identifiants

  • HAL Id : hal-01651736, version 1
  • ARXIV : 1708.04797

Collections

Citation

Mirko Fiacchini, Mazen Alamir. Computing control invariant sets is easy. 2017. 〈hal-01651736〉

Partager

Métriques

Consultations de la notice

236

Téléchargements de fichiers

104