Computational Complexity for State-Feedback Controllers with Partial Observation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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.
Fichier principal
Vignette du fichier
icca2009.pdf (729.89 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

inria-00420445 , version 1 (23-04-2010)

Identifiers

Cite

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. pp.435-441, ⟨10.1109/ICCA.2009.5410356⟩. ⟨inria-00420445⟩
33 View
108 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More