Pasar al contenido principal

APRENDIZAJE, CONTROL OPTIMO Y PLANIFICACION BAJO INCERTIDUMBRE EN APLICACIONES INDUSTRIALES

PID2020-116585GB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2020
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

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

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

A generalized sequential subpredictor for input delayed systems under time-varying delay mismatches

  • González Sorribes, Antonio|||0000-0003-2690-0472
[EN] For input delayed systems, the sequential subpredictor (SSP) control scheme has the advantage that arbitrarily large delays can be tolerated in the control loop by introducing more and more subpredictors. However, an exact delay compensation is not possible in the presence of time-varying delay mismatches, and larger delays cannot therefore be obtained by increasing the number of subpredictors. To alleviate this limitation and enhance robustness against time-varying delay uncertainties, a generalized sequential subpredictor (SSP) control scheme is proposed by introducing new observer parameters that can be designed via Linear Matrix Inequalities (LMI) and Cone-Complementarity Linearization (CCL) algorithm. Finally, the effectiveness of the proposed method is illustrated by a simulation example.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Elementary Clothoid-Based Three-Dimensional Curve for Unmanned Aerial Vehicles

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

Cautious Bayesian Optimization: A Line Tracker Case Study

  • Girbés-Juan, Vicent
  • Moll, Joaquín
  • Sala, Antonio|||0000-0002-5691-8772
  • Leopoldo Armesto|||0000-0003-0979-4428
[EN] In this paper, a procedure for experimental optimization under safety constraints, to be denoted as constraint-aware Bayesian Optimization, is presented. The basic ingredients are a performance objective function and a constraint function; both of them will be modeled as Gaussian processes. We incorporate a prior model (transfer learning) used for the mean of the Gaussian processes, a semi-parametric Kernel, and acquisition function optimization under chance-constrained requirements. In this way, experimental fine-tuning of a performance objective under experiment-model mismatch can be safely carried out. The methodology is illustrated in a case study on a line-follower application in a CoppeliaSim environment., This research was funded by MCIN/AEI/10.13039/501100011033, Agencia Estatal de Investigación (Spanish government), grant numbers PID2020-116585GB-I00 and PID2020-118071GB-I00.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Optimización Bayesiana no miope POMDP para procesos con restricciones de operación y presupuesto finito, POMPD non-myopic Bayesian optimisation for processes with operation constraints and a finite budget

  • Pitarch, José Luis|||0000-0001-5356-6321
  • Leopoldo Armesto|||0000-0003-0979-4428
  • Sala, Antonio|||0000-0002-5691-8772
[EN] Improving decision making from the observed results after experimentation is a usual task in many applications, from the research laboratory scale to industrial production systems. However, conducting experiments often takes a non-negligible cost. Consequently, excessive exploration is harmful. Bayesian optimization is a widely used technique in this context, deciding next experiment based on a statistical model. However, this technique does not explicitly account for the actual cost of the experiment, nor whether a limited budget (economic, number of experiments, time, etc.) exists. The problem of decision making under uncertainty and finite sample budget can be cast as a Partially Observable Markov Decision Process (POMDP). This work addresses the experimental optimization problem with operation constraints by a POMDP approach, where the possible actions to make are given by well-known Bayesian optimization heuristics, or any other defined by the user. The strategy consists in building a scenario tree from the (uncertain) knowledge about the system/process, learnt from prior experiments. Such a knowledge is modelled by Gaussian processes, which are updated with each new available observation. The evaluation on the best action to make is realized via dynamic programming. The developed algorithm has been evaluated by comparison with other options in the literature in a synthetic test bench, and to optimize a chemical batch production process., [ES] Mejorar la toma de decisiones a partir de los resultados observados tras la experimentación es una tarea habitual en muchas aplicaciones, tanto a nivel de investigación en laboratorio como en procesos de producción industriales. Sin embargo, realizar experimentos suele acarrear un coste no despreciable, por lo que una excesiva exploración es perjudicial. La optimización bayesiana es una técnica muy utilizada en este contexto, decidiendo la siguiente experimentación en base a un modelo estadístico.No obstante, está técnica no tiene en cuenta explícitamente el coste real de realizar un experimento, ni si existe un presupuesto (o número de experimentos, tiempo, etc.) máximo. El problema de toma de decisiones bajo  incertidumbre y presupuesto finito puede plantear como un Proceso de Decisión de Márkov Parcialmente  observable (POMDP, por sus siglas en inglés). Este trabajo aborda el problema de optimización experimental sujeta a restricciones de operación con un enfoque POMDP, donde las posibles decisiones vienen proporcionadas por heurísticas de la optimización bayesiana, o de otra índole definida por el usuario. La estrategia consiste en construir un árbol de posibles escenarios partir del conocimiento (incierto) acerca del proceso/sistema aprendido a partir de experimentos previos. Dicho conocimiento se modela mediante procesos Gaussianos, que se actualizan con cada nueva observación. La evaluación sobre la mejor decisión a tomar se realiza mediante programación dinámica. El algoritmo desarrollado ha sido evaluado mediante comparación con otras opciones de la literatura en un banco de pruebas sintético, y para optimizar un proceso químico de producción por lotes., Esta investigación se ha desarrollado en el marco del proyecto LOCPU (PID2020-116585GB-I00) financiado por MCIN/AEI/10.13039/501100011033.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Similarity-based decomposition algorithm for two-stage stochastic scheduling

  • Montes, Daniel A.
  • de Prada, César
  • Pitarch, José Luis|||0000-0001-5356-6321
[EN] This paper presents a novel decomposition method for two-stage stochastic mixed-integer optimization problems. The algorithm builds upon the idea of similarity between finite sample sets to measure how similar the first-stage decisions are among the uncertainty realization scenarios. Using such a Similarity Index, the non-anticipative constraints are removed from the problem formulation so that the original problem becomes block-separable on a scenario basis. Then, a term for maximizing the Similarity Index is included in all the sub-problems objective functions. Such sub-problems are solved iteratively in parallel so that their solutions are used to update the weighting parameter for maximizing the Similarity Index. The algorithm obtains a feasible solution when full similarity among scenario first stages is reached, that is, when the incumbent solution is non-anticipative. The proposal is tested in four instances of different sizes of an industrial-like scheduling problem. Comparison results show that the Similarity Index Decomposition provides significant speed-ups compared with the monolithic problem formulation, and provides simpler tuning and improved convergence over the Progressive Hedging Algorithm., This research is funded by the Spanish MCIN/AEI through research projects a-CIDiT (PID2021-123654OB-C31, PID2021-123654OB-C32) and LOCPU (PID2020-116585GB-I00) . The first author has received financial support from the 2020 call of the pre-doctoral contracts of the University of Valladolid, Spain, co-financed by Banco Santander.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The Similarity Index to Decompose Two-Stage Stochastic Scheduling Problems

  • Montes, Daniel
  • de Prada, César
  • Pitarch, José Luis|||0000-0001-5356-6321
[EN] Two-stage stochastic scheduling problems often involve a large number of continuous and discrete variables, so fnding solutions in short time periods is challenging and computationally expensive. However, for online or closed-loop scheduling implementations, optimal or near-optimal solutions are required in real-time. We propose a decomposition method based on the so-called Similarity Index (SI). An iterative procedure is set up so that each sub-problem (corresponding to a scenario) is solved independently, aiming to optimize the original cost function while maximizing the similarity of the frst-stage variables among the scenarios solutions. The SI is incorporated into each subproblem cost function, multiplied by a penalty parameter that is updated in each iteration until reaching complete similarity in the frst-stage variables among all subproblems. The method is applied to schedule production and maintenance tasks in an evaporation network. The tests show that signifcant benefts are expected in terms of computational demands as the number of scenarios increases., These results are funded by the Spanish MICINN with FEDER funds, as part of the In CO4 In (PGC2018-099312B-C31) and LOCPU(PID2020-116585GB-I00) research projects. The first author has received financial support from the 2020 call of the pre-doctoral contracts of the University of Valladolid, co-financed by Banco Santander.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Asynchronous Sensor Fusion of GPS, IMU and CAN-Based Odometry for Heavy-Duty Vehicles

  • Girbes-Juan, Vicent
  • Hernandez-Ferrandiz, Daniel
  • Leopoldo Armesto|||0000-0003-0979-4428
  • Dols Ruiz, Juan Francisco|||0000-0003-1815-1360
  • Sala, Antonio|||0000-0002-5691-8772
[EN] In heavy-duty vehicles, multiple signals are available to estimate the vehicle's kinematics, such as Inertial Measurement Unit (IMU), Global Positioning System (GPS) and linear and angular speed readings from wheel tachometers on the internal Controller Area Network (CAN). These signals have different noise variance, bandwidth and sampling rate (being the latter, possibly, irregular). In this paper we present a non-linear sensor fusion algorithm allowing asynchronous sampling and non-causal smoothing. It is applied to achieve accuracy improvements when incorporating odometry measurements from CAN bus to standard GPS+IMU kinematic estimation, as well as the robustness against missing data. Our results show that this asynchronous multi-sensor (GPS+IMU+CAN-based odometry) fusion is advantageous in low-speed manoeuvres, improving accuracy and robustness to missing data, thanks to non-causal filtering. The proposed algorithm is based on Extended Kalman Filter and Smoother, with exponential discretization of continuous-time stochastic differential equations, in order to process measurements at arbitrary time instants; it can provide data to subsequent processing steps at arbitrary time instants, not necessarily coincident with the original measurement ones. Given the extra information available in the smoothing case, its estimation performance is less sensitive to the noise-variance parameter setting, compared to causal filtering. Working Matlab code is provided at the end of this work., This research was supported in part by the Agencia Espanola de Investigacion (European Union) under Grants PID2020-116585GB-I00 and PID2020-118071GB-I00, and in part by the Generalitat Valenciana under Grant GV/2021/074. The review of this article was coordinated by Dr. Sohel Anwar. (Corresponding author: Vicent Girbes-Juan.)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Adaptive Polyhedral Meshing for Approximate Dynamic Programming in Control

  • Sala, Antonio|||0000-0002-5691-8772
  • Leopoldo Armesto|||0000-0003-0979-4428
[EN] This work proposes a new criterion for adaptive meshing in polyhedral partitions which interpolate a value function in Approximate Dynamic Programming (ADP) in optimal control problems. The criterion adds new points to a simplicial mesh, based on: a user-defined initial condition probability density function which determines `influential¿ regions of the state space, uncertainty (variance) propagation, and temporal-difference error. A collection of lemmas justifies the algorithmic proposal. Comparative analysis with other options in literature highlights the advantages of our proposal. The developed methods are applied to simulation examples and an experimental robotic setup., Authors are grateful to the financial support of grant PID2020116585GB-I00 funded by MCIN/AEI/10.13039/501100011033, Agencia Estatal de Investigacion (Spanish government).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Método de error de Bellman con ponderación de volumen para mallado adaptativo en programación dinámica aproximada, Volume-weighted Bellman error method for adaptive meshing in approximate dynamic programming

  • Leopoldo Armesto|||0000-0003-0979-4428
  • Sala, Antonio|||0000-0002-5691-8772
[EN] Optimal control and reinforcement learning have an associate “value function” which must be suitably approximated. Value function approximation problems usually have different precision requirements in different regions of the state space. An uniform gridding wastes resources in regions in which the value function is smooth, and, on the other hand, has not enough resolution in zones with abrupt changes. The present work proposes an adaptive meshing methodology in order to adapt to these changing requirements without incrementing too much the number of parameters of the approximator. The proposal is based on simplicial meshes and Bellman error, with a criteria to add and remove points from the mesh: modifications to proposals in earlier literature including the volume of the affected simplices are proposed, alongside with methods to manipulate the mesh triangulation., [ES] El control óptimo y aprendizaje por refuerzo lleva asociada una "función de valor'' que debe ser adecuadamente aproximada. Estos problemas de aproximar funciones de valor tienen, usualmente, diferentes requerimientos de precisión en diferentes regiones del espacio de estados. Un mallado uniforme tiene problemas porque desperdicia recursos en regiones en las que la función de valor es suave, mientras que no tiene la suficiente resolución en zonas con grandes cambios en dicha función.  El presente trabajo propone una metodología de programación dinámica aproximada con mallado adaptativo, para poder adaptarse a dichos requerimientos cambiantes sin incrementar en exceso el número de parámetros del aproximador. La propuesta se basa en mallados simpliciales y en el error en la ecuación de Bellman con un criterios para añadir y quitar puntos del mallado: se modificarán propuestas de la literatura incluyendo el volumen de los símplices afectados en los criterios, y se detallarán las manipulaciones de la triangulación necesarias., Este artículo ha sido financiado por la Agencia Española de Investigación mediante el proyecto del Plan Nacional PID2020-116585GB-I00.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Nonmyopic Bayesian process optimization with a finite budget

  • Pitarch, José Luis|||0000-0001-5356-6321
  • Leopoldo Armesto|||0000-0003-0979-4428
  • Sala, Antonio|||0000-0002-5691-8772
[EN] Optimization under uncertainty is inherent to many PSE applications ranging from process design to RTO. Reaching process true optima often involves learning from experimentation, but actual experiments involve a cost (economic, resources, time) and a budget limit usually exists. Finding the best trade-off on cumulative process performance and experimental cost over a finite budget is a Partially Observable Markov Decision Process (POMDP), known to be computationally intractable. This paper follows the nonmyopic Bayesian optimization (BO) approximation to POMDPs developed by the machine-learning community, that naturally enables the use of hybrid plant surrogate models formed by fundamental laws and Gaussian processes (GP). Although nonmyopic BO using GPs may look more tractable, evaluating multi-step decision trees to find the best first-stage candidate action to apply is still expensive with evolutionary or NLP optimizers. Hence, we propose modelling the value function of the first-stage decision also with a GP, whose data will correspond to virtual evaluations of second-stage decision trees build upon myopic rollouts. Thus, the nonmyopic initial decision can be efficiently optimized via BO and the virtually learned value function. Effectiveness of the approach is demonstrated in a wide benchmark with synthetically generated functions as well as to optimize small batch production with a chemical reactor., This work is part of Grants PID2023-146747NB-C21 (SIECMA) and PID2020-116585GB-I00 (LOCPU) funded by MICIU/AEI/10.13039/501100011033 and by ERDF/EU.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Control synthesis of nonholonomic mobile robots under time-varying delays and input saturation: experimental validation.

  • González Sorribes, Antonio|||0000-0003-2690-0472
  • Carbonell-Lázaro, Rafael|||0000-0002-2573-5041
  • Cuenca, Ángel|||0000-0003-4466-2666
  • Salt Llobregat, Julián José|||0000-0002-9640-2658
[EN] This paper presents a new control synthesis methodology for nonholonomic mobile robots subjected to time-varying delays and input saturation constraints. The proposed control method is based on smooth static nonlinear functions, leading to a simpler structure than other available control strategies for this class of systems. In addition, the convergence to a certain target position with guaranteed exponential decay rate can be proved for any orientation error. To this end, a nonlinear Lyapunov-Krasovskii functional has specifically been designed to deal with the inherent discontinuity of the kinematics model as well as the presence of time-varying delays. Thus, the control design can efficiently be addressed by means of Linear Matrix Inequalities (LMIs). Finally, the effectiveness of the proposed control design algorithm is validated through simulation and experimentally using a two-wheeled mobile robot., This work was supported in part by MCIN/AEI/10.13039/501100011033 under Grant PID2020-116585GB-I00 and Grant PRE2019-088467, in part by ESF Investing in Your Future, and in part by Vicerrectorado de Investigación de la Universitat Politècnica de València under Grant PAID-11-23.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Improved results on stability analysis of time-varying delay systems via delay partitioning method and Finsler&apos, s lemma

  • González Sorribes, Antonio|||0000-0003-2690-0472
[EN] This paper proposes novel conditions based on linear matrix inequalities (LMI) for stability analysis of arbitrarily-fast time-varying delays systems. The time-varying delay interval is divided into smaller pieces in order to obtain an equivalent switched model with multiple time-varying delays of smaller interval, which differently from other existing approaches, the maximum switching frequency is not required for stability analysis. Thus, by the use of augmented Lyapunov-Krasovskii functionals and the Finsler¿s lemma, together with some relationships among state variables intentionally defined, the inherent conservatism can be progressively reduced by refining more and more the delay partition. The superiority of the proposed method is illustrated through two benchmark examples, This work was supported by grant GV/2021/082 funded by Generalitat Valenciana, grant PID2020-116585GB-I00 funded by MCIN/AEI/10.13039/501100011033, and grant PGC2018-098719-B-I00 funded by MCIU/AEI/FEDER, UE.10.13039/501100011033, and grant PGC2018-098719-B-I00 funded by MCIU/AEI/FEDER, UE.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Convergence speed of dynamic consensus with delay compensation

  • Aragues, Rosario
  • López-Nicolás, Gonzalo
  • Sagüés, Carlos
  • González Sorribes, Antonio|||0000-0003-2690-0472
[EN] A well-known drawback in distributed average consensus of multi-agent systems is that the exchanged information is usually delayed due to the time elapsed during the data transmission process. Using classical dynamic average consensus, delays may lead to poor performance or even instability. In this paper, we propose a novel dynamic consensus method that counteracts the negative effects of delays by means of delay compensation techniques. The interest of our dynamic consensus method with delay compensation is that it converges under mild conditions on graph connectivity and bounded reference signals, no matter how large the delays are, as long as delays are fixed and known. We also provide a formal characterization of the convergence speed of our method. Additionally, our results apply to fixed directed strongly connected, and undirected topologies., Supported via group Gobierno de Aragón, Spain T45_23R and projects PID2021-124137OB-I00, PID2020-116585GB-I00 and TED2021- 130224B-I00 funded by MCIN/AEI/10.13039/501100011033, by ERDF A way of making Europe and by the European Union NextGenerationEU/PRTR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Decentralized Multi-Agent Formation Control with Pole-Region Placement via Cone-Complementarity Linearization

  • González Sorribes, Antonio|||0000-0003-2690-0472
  • Sala, Antonio|||0000-0002-5691-8772
  • Leopoldo Armesto|||0000-0003-0979-4428
[EN] An output-feedback decentralised formation control strategy is pursued under pole-region constraints, assuming that the agents have access to relative position measurements with respect to a set of neighbors in a graph describing the sensing topology. No communication between the agents is assumed; however, a shared one-way communication channel with a pilot is needed for steering tasks. Each agent has a separate copy of the same controller. A virtual structure approach is presented for the formation steering as a whole; actual formation control is established via cone-complementarity linearization algorithms for the appropriate matrix inequalities. In contrast to other research where only stable consensus is pursued, the proposed method allows us to specify settling-time, damping and bandwidth limitations via pole regions. In addition, a full methodology for the decoupled handling of steering and formation control is provided. Simulation results in the example section illustrate the approach, The first author is grateful for the financial support via the grant GVA/2021/082 from Generalitat Valenciana. Part of the authors' research activity in related topics is funded via the grant PID2020-116585GB-I00 through MCIN/AEI/10.13039/501100011033 and by the European Union.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Generalization of reference filtering control strategy for 2D/3D visual feedback control of industrial robot manipulators

  • Solanes, J. Ernesto|||0000-0001-5011-4872
  • Muñoz-Benavent, Pau|||0000-0003-4681-183X
  • Leopoldo Armesto|||0000-0003-0979-4428
  • Gracia Calandin, Luis Ignacio|||0000-0001-9258-9286
  • Tornero Montserrat, Josep|||0000-0003-1571-0251
[EN] This paper develops the application of the Dual Rate Dual Sampling Reference Filtering Control Strategy to 2D and 3D visual feedback control. This strategy allows to overcome the problem of sensor latency and to address the problem of control task failure due to visual features leaving the camera field of view. In particular, a Dual Rate Kalman Filter is used to generate inter-sample estimations of the visual features to deal with the problem of vision sensor latency, whereas a Dual Rate Extended Kalman Filter Smoother is used to generate more convenient visual features trajectories in the image plane. Both 2D and 3D visual feedback control approaches are widely analyzed throughout the paper, as well as the overall system performance using different visual feedback controllers, providing a set of results that highlight the improvements in terms of solution reachability, robustness, and time domain response. The proposed control strategy has been validated on an industrial system with hard real-time limitations, consisting of a 6 DOF industrial manipulator, a 5 MP camera, and a PLC as controller., This work was supported in part by the Spanish Government under the projects PID2020-117421RB-C21 and PID2020116585GB-I00, and in part by the Generalitat Valenciana under the project GV/2021/181.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Extending the SI Decomposition to Continuous-Time Two-Stage Scheduling Problems

  • Montes, Daniel
  • de Prada, César
  • Pitarch, José Luis|||0000-0001-5356-6321
[EN] Scheduling often involves making decisions in presence of uncertainty, which governs the pricing of raw materials, energy, resource availability, demands, etc. A common approach to incorporate uncertainty in the decision-making process is using two-stage stochastic formulations. Unfortunately, the mathematical complexity of the resulting problems grows exponentially with the number of uncertainty scenarios, which is further complicated by the presence of binary variables The authors have recently proposed a method using the so-called Similarity Index for discrete-time two-stage scheduling problems that enable scenario-based decomposition. This paper extends this method for scheduling problems formulated on a continuous-time basis. The fundamental idea is to use the Similarity Index to meet non-anticipation in the binary variables and Progressive Hedging on the continuous ones. The proposal is tested on a literature case study that consists of a multiproduct plant with a single processing unit. The combined SI-PH decomposition managed to solve the problem much faster than its monolithic counterpart., These results are funded by the Spanish MCIN/AEI as part of the a-CIDiT (PID2021-123654OB-C31, PID2021-123654OB-C32) and LOCPU (PID2020-116585GB-I00) research projects. The first author has received financial support from the 2020 call for pre-doctoral contracts of the University of Valladolid and Banco Santander.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Two-Stage Stochastic Scheduling of a Multiproduct Pipeline System using Similarity Index Decomposition

  • Montes, Daniel A.
  • de Prada, César
  • Pitarch, José Luis|||0000-0001-5356-6321
[EN] Multiproduct pipelines are crucial for delivering substantial quantities of refined oil products from major supply centers to clients within a nearby geographical area. Despite the significant infrastructure investment, the associated transportation costs are markedly lower than those incurred with traditional delivery trucks. However, the scheduling of these systems presents a formidable challenge, requiring meticulous planning of pumping runs well in advance to meet the anticipated demands of clients. In this work, we enhance an existing literature model of a multiproduct pipeline system by introducing uncertainty in the customer demand. The problem is then addressed via a two-stage stochastic formulation. The typical drawback with stochastic formulations is the high computational burden required. To address this challenge, we adapt the so-called Similarity Index decomposition, resulting in a 28-fold improvement in CPU time while achieving equivalent solutions compared to solving the full-space problem., These results are funded by the Spanish MCIN/AEI/10.13039 /501100011033/, as part of the a-CIDiT (PID2021- 123654OB-C31) and LOCPU (PID2020-116585GB-I00) research projects. The first author has received financial support from the 2020 call of pre-doctoral contracts of the University of Valladolid and Banco Santander.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Evaluating the use of meteorological predictions in directly pumped irrigational operations using photovoltaic energy

  • Carricondo-Antón, Juan Manuel|||0000-0002-4901-0352
  • Jiménez Bello, Miguel Angel|||0000-0003-1057-3331
  • Manzano Juarez, Juan|||0000-0002-2047-7821
  • Sala, Antonio|||0000-0002-5691-8772
  • Royuela, Alvaro
[EN] The modernization process in irrigation has generated a higher energy demand. Due to this problem, the ongoing increase in energy tariffs, and the reduction in manufacturing costs of photovoltaic (PV)panels, there has been an increased use of renewable energies, such as PV energy, to power the pumping equipment involved in pressurized irrigation. On direct pumping, the available solar power can be lower than that required by the pumping units. This fact can result in stoppages that can produce unwanted transient effects or even the emptying of the network. To avoid these phenomena and reduce the use of conventional energy, a methodology is proposed in this work, whereby meteorological predictions, corrected with a Kalman filter, are used to calculate the available PV power,irrigation needs, and maintaining soil moisture above desirable levels for the crop by minimizing deep percolation. This methodology is then compared to the traditional scheduling method that uses historical data and replaces the crop¿s evapotranspiration that occurs in a given time period.The methodology was applied to a real case study during an irrigation campaign, which was simulated using a weekly operative period. It was found that the use of meteorological predictions allowed PV energy consumption estimates to be improved from 68.7% to 79.3%, while the use of available photovoltaic energy in the case study increased from 11.64% to 13.37%., Sala is grateful to the support of grant PID2020-116585GB-I00 from Agencia Espanola de Investigacion (Spanish government and European Union). This study has been partially supported by the ADAPTAMED project (RTI2018-101483-B-I00), funded by the Ministerio de Ciencia e Innovacion of Spain and with EU FEDER funds.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Modelado para optimización dinámica de una planta de esterilización de alimentos, Modelling for dynamic optimization of a food sterilization plant

  • Novoa, Miguel
  • Pitarch, José Luis
  • Antelo, L. T.
  • Vilas Fernández, Carlos
6 pages, 6 figures, 1 table.-- III CEA symposium of the Groups: Control Engineering – Modelling, Simulation and Optimization. 10-12 April, 2024, Vigo, Spain, [EN] In this work, we propose a new mathematical model for the description of the sterilization process of packaged food in steam retorts. The main advantage of such a model with respect to those existing in the literature is that it has been developed to be used in the framework of nolinear model predictive control (NMPC), which requires solving on-line dynamic optimization problems (periods shorter than 5 seconds). In addition, the proposed model describes a number of physical phenomena that had not been taken into account in previous models. In particular, it considers the possibility that: (i) air enters through the purge; (ii) gases exit through the drain; (iii) liquid water and steam in the autoclave are not in equilibrium. The main contribution is the use of the Fischer-Burmeister equation to model the discrete state changes derived from (iii) in an efficient way, [ES] En este trabajo proponemos un nuevo modelo matemático para la descripción del proceso de esterilización de alimentos envasados en autoclaves de vapor. La principal ventaja de dicho modelo con respecto a los existentes en la literatura es que ha sido desarrollado para ser usado en el marco del control predictivo no lineal basado en modelos (NMPC, por sus siglas en inglés), lo que requiere resolver problemas de optimización dinámica en línea (periodos inferiores a 5 segundos). Además, el modelo propuesto describe una serie de fenómenos físicos que no se habían tenido en cuenta en modelos anteriores. En particular, se considera la posibilidad de que: (i) el agua y el vapor en el autoclave no estén en equilibrio; (ii) haya entrada de aire por la purga; (iii) haya salida de gases por el drenaje. La principal contribución es la utilización de la ecuación de Fischer-Burmeister para modelar los cambios de estado discretos derivados de (i) de forma eficiente, Esta investigación forma parte de los proyectos LOCPU (PID2020-116585GB-I00) y a-CIDiT (PID2021-123654OBC32) financiados por MCIN/AEI/10.13039/501100011033, No
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Desarrollo y calibración de un modelo matemático para control predictivo del proceso de esterilización térmica de alimentos sólidos, Development and calibration of a mathematical model for the predictive control of the solid food esterilization process

  • Novoa, Miguel
  • Pitarch, J. L.
  • Antelo, L. T.
  • Vilas Fernández, Carlos
6 pages, 2 tables, 3 figures.-- XLV Jornadas de Automática,Málaga, 4-6 de septiembre de 2024.-- Poster, [EN] Sterilization of packaged foods is one of the most widely used processes to increase the shelf life of products in the food industry. However, it is an energy- and time-consuming process that, if not carried out properly, can result in unsafe or low-quality products. Mathematical modeling and process optimization are useful tools to avoid these problems. In this work, we propose a new mathematical model for the description of the sterilization process in steam retorts. Regarding the existing models in the literature, our alternative has two clear advantages. On the one hand, it is capable of describing the following physical phenomena: (i) discrete changes in the states derived from steam-water non-equilibrium conditions using the Fischer-Burmeister equation; (ii) air entry through the purge; and (iii) gas exit through the drain. On the other hand, the simulation of the model is efficient so that it can be used in the framework of model-based nonlinear predictive control, which requires solving on-line dynamic optimization problems with periods of less than 5 seconds. In addition, we estimate the model unknown parameters from experimental data, [ES] La esterilización de alimentos envasados es uno de los procesos más utilizados para incrementar la vida útil de productos de la industria alimentaria. Sin embargo, es un proceso que consume energía y tiempo y que, si no se lleva a cabo de forma adecuada, puede resultar en productos inseguros o de baja calidad. El modelado matemático y la optimización de procesos son herramientas útiles para evitar estos problemas. En este trabajo proponemos un nuevo modelo matemático para la descripción del proceso de esterilización de alimentos envasados en autoclaves de vapor. Respecto a los modelos existentes en la literatura nuestra alternativa presenta dos claras ventajas. Por una parte, es capaz de describir los siguientes fenómenos físicos: (i) cambios de estado discretos derivados de condiciones de no equilibrio entre agua y vapor mediante la ecuación de Fischer-Burmeister; (ii) entrada de aire por la purga; y (iii) salida de gases (vapor y aire) por el drenaje. Por otra parte, la simulación del modelo es eficiente lo que permite que pueda ser usado en un esquema de control predictivo no lineal basado en modelos, lo que requiere resolver problemas de optimización dinámica en línea, con periodos inferiores a 5 segundos. Además, estimamos los parámetros desconocidos del modelo a partir de datos experimentales, Esta investigación forma parte de los proyectos LOCPU (PID2020-116585GB-I00) y a-CIDiT (PID2021-123654OB-C32) financiados por MCIN/AEI/10.13039/501100011033, Peer reviewed