Pasar al contenido principal

Resultados relacionados

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

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

Parameter uncertainty modeling for multiobjective robust control design. Application to a temperature control system in a proton exchange membrane fuel cell

  • Veyna-Robles, Uriel
  • Blasco, Xavier|||0000-0002-9737-2833
  • Herrero Durá, Juan Manuel|||0000-0003-1914-7494
  • Pajares-Ferrando, Alberto|||0000-0002-2036-2709
[EN] Advanced control systems are tuned using dynamic models and optimization techniques. This approach frequently involves satisfying multiple conflicting objectives. Tuning robust controllers requires considering a framework that represents the system uncertainties, and its definition is not a trivial task. When dealing with a nonlinear model with many parameters, a high-quality representation requires a massive sampling of variations. In many cases, this represents an inaccessible computational cost for the optimization process. This work presents a new methodology for parameter uncertainty modeling that is oriented to tuning robust controllers based on multiobjective optimization techniques. The uncertainty modeling formulated represents a feasible computational cost and leads to robust solutions without attributing excessive conservatism. The novelty of this process consists in using the multiobjective space to define a set of scenarios with highly representative properties of the global uncertainty framework that formulate the control problem under a predefined minimization strategy. To demonstrate the effectiveness of this methodology, we present a temperature control design in a micro-CHP system under worst-case minimization. Based on the results, particular interest is given to verifying the appropriate formulation of the uncertainty modeling, which represents a 92.8% reduction of the computational cost involved in solving the robust optimization problem under a global uncertainty framework., This work was supported in part by grant PID2021-124908NB-I00 founded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe"; by grant SP20200109 (PAID-10-20) funded by Universitat Politecnica de Valencia; and by grant PRE2019-087579 funded by MCIN/AEI/10.13039/501100011033 and by "ESF Investing in your future"; and by the Generalitat Valenciana regional government through project CIAICO/2021/064. Funding for open access charge: CRUE-Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Comparison of Archiving Strategies for Characterization of Nearly Optimal Solutions under Multi-Objective Optimization

  • Pajares-Ferrando, Alberto|||0000-0002-2036-2709
  • Blasco, Xavier|||0000-0002-9737-2833
  • Herrero Durá, Juan Manuel|||0000-0003-1914-7494
  • Martínez Iranzo, Miguel Andrés|||0000-0002-1444-0651
[EN] In a multi-objective optimization problem, in addition to optimal solutions, multimodal and/or nearly optimal alternatives can also provide additional useful information for the decision maker. However, obtaining all nearly optimal solutions entails an excessive number of alternatives. Therefore, to consider the nearly optimal solutions, it is convenient to obtain a reduced set, putting the focus on the potentially useful alternatives. These solutions are the alternatives that are close to the optimal solutions in objective space, but which differ significantly in the decision space. To characterize this set, it is essential to simultaneously analyze the decision and objective spaces. One of the crucial points in an evolutionary multi-objective optimization algorithm is the archiving strategy. This is in charge of keeping the solution set, called the archive, updated during the optimization process. The motivation of this work is to analyze the three existing archiving strategies proposed in the literature (ArchiveUpdateP(Q,epsilon)D(xy), Archive_nevMOGA, and targetSelect) that aim to characterize the potentially useful solutions. The archivers are evaluated on two benchmarks and in a real engineering example. The contribution clearly shows the main differences between the three archivers. This analysis is useful for the design of evolutionary algorithms that consider nearly optimal solutions., This work was supported in part by the Ministerio de Ciencia, Innovacion y Universidades (Spain) (grant number RTI2018-096904-B-I00), by the Generalitat Valenciana regional government through project AICO/2019/055 and by the Universitat Politecnica de Valencia (grant number SP20200109).