Computational Complexity for State-Feedback Controllers with Partial Observation

Abstract : We study the computational complexity of several decision and optimization control problems arising in partially observed discrete event systems. These problems are related to the state avoidance problem where one must compute a controller which prevents the system from accessing a set of bad states and which is maximal for a defined criterion, based on inclusion of the set of states remaining reachable after the control. We focus our study on memoryless controllers.
Type de document :
Communication dans un congrès
7th International Conference on Control and Automation, ICCA'09, Dec 2009, Christchurch, New Zealand. IEEE, pp.435-441, 2009, 〈10.1109/ICCA.2009.5410356〉
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00420445
Contributeur : Hervé Marchand <>
Soumis le : vendredi 23 avril 2010 - 14:39:55
Dernière modification le : mercredi 11 avril 2018 - 01:55:00
Document(s) archivé(s) le : mardi 14 septembre 2010 - 17:13:11

Fichier

icca2009.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Collections

Citation

Gabriel Kalyon, Tristan Le Gall, Hervé Marchand, Thierry Massart. Computational Complexity for State-Feedback Controllers with Partial Observation. 7th International Conference on Control and Automation, ICCA'09, Dec 2009, Christchurch, New Zealand. IEEE, pp.435-441, 2009, 〈10.1109/ICCA.2009.5410356〉. 〈inria-00420445〉

Partager

Métriques

Consultations de la notice

109

Téléchargements de fichiers

123