Maximal closed loop admissible set for linear systems with non-convex polyhedral constraints
Impacto
![Google Scholar](/xmlui/themes/Mirage2/images/uji/logo_google.png)
![Microsoft Academico](/xmlui/themes/Mirage2/images/uji/logo_microsoft.png)
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7034
comunitat-uji-handle3:10234/8619
comunitat-uji-handle4:
INVESTIGACIONEste recurso está restringido
http://dx.doi.org/10.1016/j.jprocont.2011.01.008 |
Metadatos
Título
Maximal closed loop admissible set for linear systems with non-convex polyhedral constraintsAutoría
Fecha de publicación
2011Editor
ElsevierISSN
0959-1524Cita bibliográfica
Journal of Process Control (Apr. 2011) vol. 21, no. 4, p. 529-537Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
http://www.sciencedirect.com/science/article/pii/S0959152411000114Palabras clave / Materias
Resumen
This paper deals with the computation of the maximal closed-loop admissible set for linear systems with non-convex polyhedral constraints. These constraints are modeled as the union of a finite number of convex ... [+]
This paper deals with the computation of the maximal closed-loop admissible set for linear systems with non-convex polyhedral constraints. These constraints are modeled as the union of a finite number of convex polyhedra. An efficient algorithm for the computation of this set, based on removing subsets of the maximal closed-loop invariant set for the convex hull of the original constraints, is proposed and compared with the existing generic algorithm. Next, stability conditions for a general predictive control scheme are applied to the particular problem proposed. Finally, two examples showing the performance of the maximal admissible set algorithm are given. [-]
Derechos de acceso
© 2011 Elsevier Inc. All rights reserved
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
Aparece en las colecciones
- ESID_Articles [477]