G. Kalyon, T. Le Gall, H. Marchand, T. Massart. Computational Complexity for State-Feedback Controllers with Partial Observation. In 7th International Conference on Control and Automation, ICCA'09, Pages 435-441, Christchurch, New Zealand, December 2009.
Download paper:
Doi page
Download paper:
Adobe portable document (pdf) 
Copyright notice:
This material is presented to ensure timely dissemination of scholarly and
technical work. Copyright and all rights therein are retained by authors or
by other copyright holders. All persons copying this information are expected
to adhere to the terms and constraints invoked by each author's
copyright. These works may not be reposted without the explicit permission of
the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic
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
Hervé Marchand http://www.irisa.fr/prive/hmarchan
@InProceedings{icca,
Author = {Kalyon, G. and Le Gall, T. and Marchand, H. and Massart, T.},
Title = {Computational Complexity for State-Feedback Controllers with Partial Observation},
BookTitle = {7th International Conference on Control and Automation, ICCA'09},
Pages = {435--441},
Address = {Christchurch, New Zealand},
Month = {December},
Year = {2009}
}
Get EndNote Reference (.ref)
|
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |