Pasar al contenido principal

IDENTIFICACION Y CONTROL DE SISTEMAS CON MEDICIONES IRREGULARES Y EN RED BAJO PARADIGMAS MULTI-MODELO

DPI2008-06731-C02-02

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2008
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT JAUME I DE CASTELLO
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 5
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Estimation in multisensor networked systems with scarce measurements and time varying delays

  • Albertos Pérez, Pedro
In this paper, the problem of estimating signals from a dynamic system at regular periods from scarce, delayed and possibly time disordered measurements acquired through a network is addressed. A model based predictor that takes into account the delayed and irregularly gathered measurements from different devices is used. Robustness of the predictor to the time-delays and scarce data availability as well as disturbance and noise attenuation is dealt with via H∞ performance optimization. The result is a time variant estimator gain that depends on the measurement characteristics, but belonging to an offline precalculated finite set, and hence, the online needed computer resources are low. An alternative to reduce the number of gains to be stored has been proposed, based on defining the gain as a function of the sampling parameters. The idea allows reaching a compromise between online computer cost and performance., This work has been granted by the MICINN project number DPI2008-06731-C02-02/DPI.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Solución Explícita al Control Predictivo de Sistemas Lineales Sujetos a Restricciones No Convexas, Explicit Solution to Predictive Control of Linear Systems Subject to Non-convex Constraints

  • Pérez, Emilio
  • Ariño, Carlos
  • Blasco, Xavier|||0000-0002-9737-2833
  • Martínez Iranzo, Miguel Andrés|||0000-0002-1444-0651
[EN] This paper presents an explicit solution to predictive control of linear systems subject to non-convex polyhedral constraints. The constraints are modeled as the union of finite number of polyhedra. The algorithm is based on the computation of the explicit solution of the problems subject to convex constraints defined by those polyhedra. The regions of the partitions obtained this way are intersected such that the new set of regions has as many possible solutions as convex problems are solved. By means of sum-of-squares programming, the non-optimal solutions are removed. Then a union of regions which share the same set of solutions is performed. Furthermore a suboptimal solution which can be used when the original methodology is too expensive is presented. Finally, some results are shown in an example., [ES] Este trabajo propone una solución explícita para el control predictivo de sistemas lineales sujetos a restricciones poliédricas no convexas, modeladas como la unión de un número finito de poliedros. El algoritmo se basa en el cálculo de la solución explícita de los problemas sujetos a las restricciones convexas definidas por dichos poliedros. Las regiones de las particiones así obtenidas se intersectan de forma que el nuevo conjunto de regiones tiene tantas soluciones posibles como problemas convexos se han resuelto. Mediante programación de suma de cuadrados se eliminan aquellas soluciones de cada región que no son óptimas para ningún estado. Posteriormente se realiza la unión de las regiones que compartan el mismo conjunto de soluciones. Tras la descripción de la metodología descrita, se incluye una justificación de ésta. Además, se incluye una posible solución subóptima utilizable cuando la metodología original es demasiado costosa. Por último, se muestran los resultados obtenidos en un ejemplo., Este trabajo ha sido realizado parcialmente gracias al apoyo de los proyectos DPI2008-02133 y DPI2008-06731/DPI Ministerio de Ciencia e Innovación.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Reduciendo distancias entre el control borroso y el control no lineal: luces y sombras, Reducing distance between fuzzy and nonlinear control: lights and shadows

  • Ariño, Carlos V.
  • Sala, Antonio|||0000-0002-5691-8772
[ES] Aunque el control borroso nació como una metodología heurística, las formulaciones en desigualdades matriciales lineales del control borroso se han convertido en la herramienta más utilizada en dicho área desde los años 90. Muchos sistemas no lineales pueden ser modelados como sistemas borrosos (con la metodología de sector no lineal) de modo que el control borroso puede considerarse como una técnica para el control no lineal. Aunque se han obtenido muchos y buenos resultados, quedan algunas fuentes de conservadurismo cuando se comparan con otros enfoques de control no lineal. Este artículo discute dichas cuestiones de conservadurismo (sombras) y plantea algunas ideas (luces) para resolverlas, aunque muchas de las propuestas tienen alto coste computacional., [EN] Even if fuzzy control was born as an heuristic methodology, the linear matrix inequality formulations became the most used tool since the 1990's. Many nonlinear systems can be modelled as fuzzy systems (with the sector-nonlinearity technique) so fuzzy control can be considered a generic non-linear control technique. Even if significant results have been obtained, some sources of conservativeness appear when fuzzy approaches are compared to other non-linear control strategies. This article discusses some of such conservativeness issues (shadows) and outlines some ideas to solve them (lights)., Este trabajo ha sido realizado parcialmente gracias al apoyo del Ministerio de Educación y Ciencia, programa FPU, proyecto DPI2008-06731-c02(-01 y -02), y de la Generalitat Valenciana, proyecto PROMETEO/2008/088.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Explicit predictive control with non-convex polyhedral constraints

  • Pérez Soler, Emilio
  • Ariño Latorre, Carlos Vicente
  • Blasco, Xavier|||0000-0002-9737-2833
  • Martínez Iranzo, Miguel Andrés|||0000-0002-1444-0651
This paper proposes an explicit solution to the model predictive control of linear systems subject to non-convex polyhedral constraints. These constraints are modeled as the union of a finite number of convex polyhedra. The algorithm is based on calculating the explicit solution to a modified problem with linear constraints defined as the convex hull of the original ones and classifying its regions by their relation with the regions of the explicit solution to the original problem. Some of the regions are divided, and a procedure based on sum-of-squares programming is designed to determine which of the possible solutions are in fact optimal. Finally, the online algorithm is shown to be better in terms of computational cost and memory requirements than an algorithm based on obtaining and comparing the solutions of the problem using as constraints the polyhedra whose union forms the non-convex regions, both theoretically and by the results of an example, This work was partially funded by projects DPI2008-02133 and DPI2008-06731-C02-01(and -02)/DPI Ministerio de Ciencia e Innovacion-Spanish Government.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Maximal closed loop admissible set for linear systems with non-convex polyhedral constraints

  • Pérez Soler, Emilio
  • Ariño Latorre, Carlos Vicente
  • Blasco, Xavier|||0000-0002-9737-2833
  • Martínez Iranzo, Miguel Andrés|||0000-0002-1444-0651
[EN] 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., This work was partially funded by projects DPI2008-02133 and DPI2008-06731/DPI Ministerio de Ciencia e Innovación – Spanish Government.