You Can Always Compute Maximally Permissive Controllers Under Partial Observation When They Exist.

Stéphane Riedweg 1 Sophie Pinchinat 2
2 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : The maximal permissivity property of controllers is an optimal criterion that is often taken for granted as the result of synthesis algorithms: the algorithms are designed for frameworks where the existence and the uniqueness of a maximal permissive controller is demonstrated apart, as it fulfills sufficient hypotheses ; these algorithms precisely compute this object. Still, maximally permissive solutions might exist in circumstances which do not fall into such identified frameworks, but there is no way to ensure that the algorithms deliver an optimal solution. In this paper, we propose a general synthesis procedure which always computes a maximal permissive controller when it exists.
Type de document :
Communication dans un congrès
Proc. 2005 American Control Conference., Jun 2005, Portland, Oregon, United States. 4, pp.2287-2292, 2005
Liste complète des métadonnées

https://hal.inria.fr/inria-00556003
Contributeur : Sophie Pinchinat <>
Soumis le : vendredi 14 janvier 2011 - 17:46:55
Dernière modification le : mercredi 16 mai 2018 - 11:23:05

Identifiants

  • HAL Id : inria-00556003, version 1

Citation

Stéphane Riedweg, Sophie Pinchinat. You Can Always Compute Maximally Permissive Controllers Under Partial Observation When They Exist.. Proc. 2005 American Control Conference., Jun 2005, Portland, Oregon, United States. 4, pp.2287-2292, 2005. 〈inria-00556003〉

Partager

Métriques

Consultations de la notice

274