Alessandro Alla
YOU?
Author Swipe
View article: Bright and Stable Electrochemiluminescence by Heterobimetallic Ir<sup>III</sup>‐M<sup>I</sup> (M<sup>I</sup> = Cu<sup>I</sup>, Au<sup>I</sup>) Complexes
Bright and Stable Electrochemiluminescence by Heterobimetallic Ir<sup>III</sup>‐M<sup>I</sup> (M<sup>I</sup> = Cu<sup>I</sup>, Au<sup>I</sup>) Complexes Open
Ionic transition metal complexes (iTMCs) often suffer from low photoluminescence quantum yield, especially in the red to near‐infrared spectral region. Rational molecular design strategies unlock recovering the emission features efficientl…
View article: State Dependent Riccati for dynamic boundary control to optimize irrigation in Richards’ equation framework
State Dependent Riccati for dynamic boundary control to optimize irrigation in Richards’ equation framework Open
View article: Efficient Data-Driven Regression for Reduced-Order Modeling of Spatial Pattern Formation
Efficient Data-Driven Regression for Reduced-Order Modeling of Spatial Pattern Formation Open
View article: Stability properties of solutions to convection-reaction equations with nonlinear diffusion
Stability properties of solutions to convection-reaction equations with nonlinear diffusion Open
In this paper we study a convection-reaction-diffusion equation of the form ut = ε(h(u)ux)x − f(u)x + f′(u), t > 0, with a nonlinear diffusion in a bounded interval of the real line. In particular, we first focus our attention on the exist…
View article: State Dependent Riccati for dynamic boundary control to optimize irrigation in Richards' Equation framework
State Dependent Riccati for dynamic boundary control to optimize irrigation in Richards' Equation framework Open
We present an approach for the optimization of irrigation in a Richards' equation framework. We introduce a proper cost functional, aimed at minimizing the amount of water provided by irrigation, at the same time maximizing the root water …
View article: Piecewise DMD for oscillatory and Turing spatio-temporal dynamics
Piecewise DMD for oscillatory and Turing spatio-temporal dynamics Open
Dynamic Mode Decomposition (DMD) is an equation-free method that aims at reconstructing the best linear fit from temporal datasets. In this paper, we show that DMD does not provide accurate approximation for datasets describing oscillatory…
View article: A POD approach to identify and control PDEs online through State Dependent Riccati equations
A POD approach to identify and control PDEs online through State Dependent Riccati equations Open
We address the control of Partial Differential equations (PDEs) with unknown parameters. Our objective is to devise an efficient algorithm capable of both identifying and controlling the unknown system. We assume that the desired PDE is ob…
View article: Online identification and control of PDEs via Reinforcement Learning methods
Online identification and control of PDEs via Reinforcement Learning methods Open
We focus on the control of unknown Partial Differential Equations (PDEs). The system dynamics is unknown, but we assume we are able to observe its evolution for a given control input, as typical in a Reinforcement Learning framework. We pr…
View article: HJB-RBF Based Approach for the Control of PDEs
HJB-RBF Based Approach for the Control of PDEs Open
View article: Control of Fractional Diffusion Problems via Dynamic Programming Equations
Control of Fractional Diffusion Problems via Dynamic Programming Equations Open
View article: Piecewise DMD for oscillatory and Turing spatio-temporal dynamics
Piecewise DMD for oscillatory and Turing spatio-temporal dynamics Open
Dynamic Mode Decomposition (DMD) is an equation-free method that aims at reconstructing the best linear fit from temporal datasets. In this paper, we show that DMD does not provide accurate approximation for datasets describing oscillatory…
View article: Adaptive POD-DEIM correction for Turing pattern approximation in reaction–diffusion PDE systems
Adaptive POD-DEIM correction for Turing pattern approximation in reaction–diffusion PDE systems Open
We investigate a suitable application of Model Order Reduction (MOR) techniques for the numerical approximation of Turing patterns, that are stationary solutions of reaction–diffusion PDE (RD-PDE) systems. We show that solutions of surroga…
View article: A Tree Structure Approach to Reachability Analysis
A Tree Structure Approach to Reachability Analysis Open
Reachability analysis is a powerful tool when it comes to capturing the behaviour, thus verifying the safety, of autonomous systems. However, general-purpose methods, such as Hamilton-Jacobi approaches, suffer from the curse of dimensional…
View article: Control of fractional diffusion problems via dynamic programming equations
Control of fractional diffusion problems via dynamic programming equations Open
We explore the approximation of feedback control of integro-differential equations containing a fractional Laplacian term. To obtain feedback control for the state variable of this nonlocal equation we use the Hamilton--Jacobi--Bellman equ…
View article: Feedback reconstruction techniques for optimal control problems on a tree structure
Feedback reconstruction techniques for optimal control problems on a tree structure Open
The computation of feedback control using Dynamic Programming equation is a difficult task due the curse of dimensionality. The tree structure algorithm is one the methods introduced recently that mitigate this problem. The method computes…
View article: Adaptive POD-DEIM correction for Turing pattern approximation in\n reaction-diffusion PDE systems
Adaptive POD-DEIM correction for Turing pattern approximation in\n reaction-diffusion PDE systems Open
We investigate a suitable application of Model Order Reduction (MOR)\ntechniques for the numerical approximation of Turing patterns, that are\nstationary solutions of reaction-diffusion PDE (RD-PDE) systems. We show that\nsolutions of surr…
View article: Feedback reconstruction techniques for optimal control problems on a tree structure
Feedback reconstruction techniques for optimal control problems on a tree structure Open
The computation of feedback control using Dynamic Programming equation is a difficult task due the curse of dimensionality. The tree structure algorithm is one the methods introduced recently that mitigate this problem. The method computes…
View article: Error Estimates for a Tree Structure Algorithm Solving Finite Horizon Control Problems
Error Estimates for a Tree Structure Algorithm Solving Finite Horizon Control Problems Open
In the dynamic programming approach to optimal control problems a crucial role is played by the value function that is characterized as the unique viscosity solution of a Hamilton-Jacobi-Bellman (HJB) equation. It is well known that this a…
View article: Time Adaptivity in Model Predictive Control
Time Adaptivity in Model Predictive Control Open
View article: HJB-RBF based approach for the control of PDEs
HJB-RBF based approach for the control of PDEs Open
Semi-lagrangian schemes for discretization of the dynamic programming principle are based on a time discretization projected on a state-space grid. The use of a structured grid makes this approach not feasible for high-dimensional problems…
View article: A tree structure algorithm for optimal control problems with state constraints
A tree structure algorithm for optimal control problems with state constraints Open
We present a tree structure algorithm for optimal control problems with state constraints. We prove a convergence result for a discrete time approximation of the value function based on a novel formulation in the case of convex constraints…
View article: A tree structure algorithm for optimal control problems with state constraints
A tree structure algorithm for optimal control problems with state constraints Open
We present a tree structure algorithm for optimal control problems with state constraints. We prove a convergence result for a discrete time approximation of the value function based on a novel formulation of the constrained problem. Then …
View article: Feedback control of parametrized PDEs via model order reduction and dynamic programming principle
Feedback control of parametrized PDEs via model order reduction and dynamic programming principle Open
View article: A HJB-POD approach for the control of nonlinear PDEs on a tree structure
A HJB-POD approach for the control of nonlinear PDEs on a tree structure Open
The Dynamic Programming approach allows to compute a feedback control for nonlinear problems, but suffers from the curse of dimensionality. The computation of the control relies on the resolution of a nonlinear PDE, the Hamilton-Jacobi-Bel…
View article: A HJB-POD approach for the control of nonlinear PDEs on a tree structure
A HJB-POD approach for the control of nonlinear PDEs on a tree structure Open
View article: A localized reduced-order modeling approach for PDEs with bifurcating solutions
A localized reduced-order modeling approach for PDEs with bifurcating solutions Open
View article: Randomized model order reduction
Randomized model order reduction Open
View article: High-order approximation of the finite horizon control problem via a tree structure algorithm
High-order approximation of the finite horizon control problem via a tree structure algorithm Open
Solving optimal control problems via Dynamic Programming is a difficult task that suffers for the”curse of dimensionality”. This limitation has reduced its practical impact in real world applications since the construction of numerical met…
View article: An efficient DP algorithm on a tree-structure for finite horizon optimal control problems
An efficient DP algorithm on a tree-structure for finite horizon optimal control problems Open
The classical dynamic programming (DP) approach to optimal control problems is based on the characterization of the value function as the unique viscosity solution of a Hamilton-Jacobi-Bellman equation. The DP scheme for the numerical appr…
View article: Data-Driven Identification of Parametric Partial Differential Equations
Data-Driven Identification of Parametric Partial Differential Equations Open
In this work we present a data-driven method for the discovery of parametric partial differential equations (PDEs), thus allowing one to disambiguate between the underlying evolution equations and their parametric dependencies. Group spars…