Convex Computation of the Region of Attraction of Polynomial Control Systems
From MaRDI portal
Abstract: We address the long-standing problem of computing the region of attraction (ROA) of a target set (e.g., a neighborhood of an equilibrium point) of a controlled nonlinear system with polynomial dynamics and semialgebraic state and input constraints. We show that the ROA can be computed by solving an infinite-dimensional convex linear programming (LP) problem over the space of measures. In turn, this problem can be solved approximately via a classical converging hierarchy of convex finite-dimensional linear matrix inequalities (LMIs). Our approach is genuinely primal in the sense that convexity of the problem of computing the ROA is an outcome of optimizing directly over system trajectories. The dual infinite-dimensional LP on nonnegative continuous functions (approximated by polynomial sum-of-squares) allows us to generate a hierarchy of semialgebraic outer approximations of the ROA at the price of solving a sequence of LMI problems with asymptotically vanishing conservatism. This sharply contrasts with the existing literature which follows an exclusively dual Lyapunov approach yielding either nonconvex bilinear matrix inequalities or conservative LMI conditions. The approach is simple and readily applicable as the outer approximations are the outcome of a single semidefinite program with no additional data required besides the problem description.
Cited in
(80)- Maximizing regions of attraction via backstepping and CLFs with singularities
- Estimations of the domains of attraction for classes of nonlinear continuous polynomial systems
- Global optimization in Hilbert space
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system
- Parabolic set simulation for reachability analysis of linear time-invariant systems with integral quadratic constraint
- Inner-approximating domains of attraction for discrete-time switched systems via multi-step multiple Lyapunov-like functions
- Computation of invariant sets via immersion for discrete-time nonlinear systems
- Heat transport bounds for a truncated model of Rayleigh-Bénard convection via polynomial optimization
- Convergence of Lasserre's hierarchy: the general case
- Brockett's first example: an FAS approach treatment
- Stabilization via fully actuated system approach: a case study
- Reachable set estimation and safety verification of nonlinear systems via iterative sums of squares programming
- A moment approach for entropy solutions to nonlinear hyperbolic PDEs
- Sum-of-squares methods for controlled invariant sets with applications to model-predictive control
- Reachability analysis using dissipation inequalities for uncertain nonlinear systems
- On maximal robust positively invariant sets in constrained nonlinear systems
- Distributionally robust polynomial chance-constraints under mixture ambiguity sets
- Estimating the region of attraction based on a polynomial Lyapunov function
- Robust domain of attraction estimation for a tumor growth model
- \(\mathcal{H}_\infty\) filter design for nonlinear polynomial systems
- Region of attraction analysis with integral quadratic constraints
- Lyapunov based estimation of the basin of attraction of Poincaré maps with applications to limit cycle walking
- A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems
- Region of attraction estimation using invariant sets and rational Lyapunov functions
- A sums-of-squares extension of policy iterations
- Robust estimations of the region of attraction using invariant sets
- Controller design and value function approximation for nonlinear dynamical systems
- Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints
- Converging outer approximations to global attractors using semidefinite programming
- A model-free sampling method for basins of attraction using hybrid active learning (HAL)
- The multidimensional truncated moment problem: Gaussian mixture reconstruction from derivatives of moments
- Stokes, Gibbs, and volume computation of semi-algebraic sets
- Exploiting sparsity for semi-algebraic set volume computation
- Guaranteed estimates of the domain of attraction for a class of hybrid systems
- Semi-definite relaxations for optimal control problems with oscillation and concentration effects
- Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions
- Linear conic optimization for inverse optimal control
- Bracketing backward reach sets of a dynamical system
- Estimating the region of attraction on a complex dynamical network
- Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
- Finding extremal periodic orbits with polynomial optimization, with application to a nine-mode model of shear flow
- Bounding extreme events in nonlinear dynamics using convex optimization
- Passivity and passivity indices of nonlinear systems under operational limitations using approximations
- Control analysis and design via randomised coordinate polynomial minimisation
- Convergence rates of moment-sum-of-squares hierarchies for optimal control problems
- Computing controlled invariant sets from data using convex optimization
- Bounding extrema over global attractors using polynomial optimisation
- Computing the Hausdorff boundary measure of semialgebraic sets
- Safe nonlinear control design for input constrained polynomial systems using sum-of-squares programming
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
- Characterizing bad semidefinite programs: normal forms and short proofs
- Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization
- Synthesizing robust domains of attraction for state-constrained perturbed polynomial systems
- Convex computation of maximal Lyapunov exponents
- Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization
- Performance enhancements for a generic conic interior point algorithm
- Data-driven optimal control via linear transfer operators: a convex approach
- Inner-estimating domains of attraction for discrete-time non-polynomial systems with piecewise difference inclusions
- A novel strategy of extending the domain of attraction of affine nonlinear systems
- Tighter bounds on transient moments of stochastic chemical systems
- A study of the double pendulum using polynomial optimization
- Practical stability analysis of sliding-mode control with explicit computation of sampling time
- Estimating the minimal domains of attraction of uncertain discrete-time switched systems under state-dependent switching
- Towards optimal spatio-temporal decomposition of control-related sum-of-squares programs
- Peak estimation of rational systems using convex optimization
- Converse barrier certificates for finite-time safety verification of continuous-time perturbed deterministic systems
- Stochastic ergodic control in hybrid systems: a framework for safe autonomy in adversarial environments
- Peak estimation of hybrid systems with convex optimization
- An invariant preserving sparse spectral discretization of the continuum equation
- Computation of invariant sets for complex systems
- Constructing quadratic Lyapunov functions for conditionally stable fluid dynamics systems
- Optimizing quasi-dissipative evolution equations with the moment-SOS hierarchy
- Solving moment and polynomial optimization problems on Sobolev spaces
- Polynomial optimization for nonlinear dynamics: theory, algorithms and applications. Abstracts from the workshop held July 28 -- August 2, 2024
- Exact moment representation in polynomial optimization
- Minimal time nonlinear control via semi-infinite programming
- The gap between a variational problem and its occupation measure relaxation
- A review on estimation of stability region for nonlinear systems
- Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations
- Modal occupation measures and LMI relaxations for nonlinear switched systems control
This page was built for publication: Convex Computation of the Region of Attraction of Polynomial Control Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983254)
