168 research outputs found

    Un Sistema Adattivo di Reservoir Computing per Grafi Applicato in Tossicologia

    Get PDF
    In questa tesi è stato introdotto un sistema di apprendimento automatico per grafi basato su un nuovo modello che combina Reservoir Computing, Self-Organizing Maps e regolarizzazione via Elastic Net. Il sistema, in grado di fornire elementi per un'analisi qualitativa della risposta, è stato sperimentato in problemi di tossicologia computazionale

    Environment load of EFTE cushions and future ways for their self-sufficient performances

    Full text link
    p. 754-766Monticelli, C.; Campioli, A.; Zanelli, A. (2009). Environment load of EFTE cushions and future ways for their self-sufficient performances. Editorial Universitat Politècnica de València. http://hdl.handle.net/10251/673

    Zero-Order Optimization for Gaussian Process-based Model Predictive Control

    Full text link
    By enabling constraint-aware online model adaptation, model predictive control using Gaussian process (GP) regression has exhibited impressive performance in real-world applications and received considerable attention in the learning-based control community. Yet, solving the resulting optimal control problem in real-time generally remains a major challenge, due to i) the increased number of augmented states in the optimization problem, as well as ii) computationally expensive evaluations of the posterior mean and covariance and their respective derivatives. To tackle these challenges, we employ i) a tailored Jacobian approximation in a sequential quadratic programming (SQP) approach, and combine it with ii) a parallelizable GP inference and automatic differentiation framework. Reducing the numerical complexity with respect to the state dimension nxn_x for each SQP iteration from O(nx6)\mathcal{O}(n_x^6) to O(nx3)\mathcal{O}(n_x^3), and accelerating GP evaluations on a graphical processing unit, the proposed algorithm computes suboptimal, yet feasible solutions at drastically reduced computation times and exhibits favorable local convergence properties. Numerical experiments verify the scaling properties and investigate the runtime distribution across different parts of the algorithm.Comment: accepted for European Journal of Control (EJC), ECC 2023 Special Issu

    Inexact GMRES Policy Iteration for Large-Scale Markov Decision Processes

    Full text link
    Policy iteration enjoys a local quadratic rate of contraction, but its iterations are computationally expensive for Markov decision processes (MDPs) with a large number of states. In light of the connection between policy iteration and the semismooth Newton method and taking inspiration from the inexact variants of the latter, we propose \textit{inexact policy iteration}, a new class of methods for large-scale finite MDPs with local contraction guarantees. We then design an instance based on the deployment of GMRES for the approximate policy evaluation step, which we call inexact GMRES policy iteration. Finally, we demonstrate the superior practical performance of inexact GMRES policy iteration on an MDP with 10000 states, where it achieves a ×5.8\times 5.8 and ×2.2\times 2.2 speedup with respect to policy iteration and optimistic policy iteration, respectively

    Asynchronous Computation of Tube-based Model Predictive Control

    Full text link
    Tube-based model predictive control (MPC) methods bound deviations from a nominal trajectory due to uncertainties in order to ensure constraint satisfaction. While techniques that compute the tubes online reduce conservativeness and increase performance, they suffer from high and potentially prohibitive computational complexity. This paper presents an asynchronous computation mechanism for system level tube-MPC (SLTMPC), a recently proposed tube-based MPC method which optimizes over both the nominal trajectory and the tubes. Computations are split into a primary and a secondary process, computing the nominal trajectory and the tubes, respectively. This enables running the primary process at a high frequency and moving the computationally complex tube computations to the secondary process. We show that the secondary process can continuously update the tubes, while retaining recursive feasibility and robust stability of the primary process.Comment: Submitted to IFAC WC 202
    corecore