Viability, viscosity, and storage functions in model-predictive control with terminal constraints

DOI10.1016/j.automatica.2021.109748zbMath1478.93165OpenAlexW3166140922MaRDI QIDQ2665391

Torbjørn Cunis, Ilya V. Kolmanovsky

Publication date: 19 November 2021

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2021.109748

zbMATH Keywords

invariancereachabilityboundary value problempolynomial methodspredictive controlterminal controlcontrol system analysisstability of numerical methods

Mathematics Subject Classification ID

Lyapunov and storage functions (93D30) Discrete-time control/observation systems (93C55) Attainable sets, reachability (93B03) Model predictive control (93B45)

Uses Software

• SeDuMi
• MPT
• SOSOPT
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Stability and performance verification of optimization-based controllers
• Reachability computation for polynomial dynamical systems
• Local stability analysis using simulations and sum-of-squares programming
• Controllers for reachability specifications for hybrid systems
• Semidefinite programming relaxations for semialgebraic problems
• On reachability and minimum cost optimal control
• Nonlinear model predictive control. Theory and algorithms
• Contraction-based nonlinear model predictive control formulation without stability-related terminal constraints
• Reachability Analysis of Nonlinear Systems Using Matrix Measures
• The Bellman equation for minimizing the maximum cost
• The Linear Programming Approach to Approximate Dynamic Programming
• User’s guide to viscosity solutions of second order partial differential equations
• Reachability Analysis Using Polygonal Projections
• Conflict resolution for air traffic management: a study in multiagent hybrid systems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Worst case analysis of nonlinear systems
• Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations
• Backward Reachability for Polynomial Systems on a Finite Horizon
• Approximate dynamic programming via iterated Bellman inequalities
• Nonlinear Control Synthesis by Convex Optimization
• Hamilton–Jacobi Formulation for Reach–Avoid Differential Games
• The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes
• Quantitative local L₂‐gain and Reachability analysis for nonlinear systems
• Viability theory
• Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
• The analysis of optimization based controllers

This page was built for publication: Viability, viscosity, and storage functions in model-predictive control with terminal constraints