We consider the problem of controller synthesis under imperfect information in a setting where there is a set of available observable predicates equipped with a cost function. The problem that we address is the computation of a subset of predicates sufficient for control and whose cost is minimal. Our solution avoids a full exploration of all possible subsets of predicates and reuses some information between different iterations. We apply our approach to timed systems. We have developed a tool prototype and analyze the performance of our optimization algorithm on two case studies. © 2012 Springer-Verlag.
CITATION STYLE
Bulychev, P., Cassez, F., David, A., Larsen, K. G., Raskin, J. F., & Reynier, P. A. (2012). Controllers with minimal observation power (application to timed systems). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7561 LNCS, pp. 223–237). https://doi.org/10.1007/978-3-642-33386-6_19
Mendeley helps you to discover research relevant for your work.