Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00420445
Contributor : Hervé Marchand <>
Submitted on : Friday, April 23, 2010 - 2:39:55 PM
Last modification on : Thursday, June 4, 2020 - 10:24:03 AM
Long-term archiving on: : Tuesday, September 14, 2010 - 5:13:11 PM

File

icca2009.pdf
Publisher files allowed on an open archive

Identifiers

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

Share

Metrics

Record views

162

Files downloads

362