Inner-Approximating Reachable Sets for Polynomial Systems With Time-Varying Uncertainties

DOI10.1109/TAC.2019.2923049MaRDI QIDQ5125565zbMATH OpenWikidataFDO

Authors Bai Xue, Martin Fränzle, Naijun Zhan

Publication date 7 October 2020

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1811.01086

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Recommendations

• Inner Approximating Robust Reach-Avoid Sets for Discrete-Time Polynomial Dynamical Systems
• Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
• Under-approximating reach sets for polynomial continuous systems
• Reachable set estimation for linear systems with time-varying delay and polytopic uncertainties
• Further result on reachable set bounding for linear uncertain polytopic systems with interval time-varying delays
• Reachable set computation for uncertain time-varying linear systems
• On polyhedral estimates for reachable sets of discrete-time systems with bilinear uncertainty
• Hybrid Systems: Computation and Control
• On Polyhedral Estimates of Reachable Sets of Discrete-Time Systems with Uncertain Matrices and Integral Bounds on Additive Terms
• On the reachable set bounding of uncertain dynamic systems with time-varying delays and disturbances

Cited in

(10)

• A dimensionality reduction method for computing reachable tubes based on piecewise pseudo-time dependent Hamilton-Jacobi equation
• Reachable set estimation and safety verification of nonlinear systems via iterative sums of squares programming
• Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
• Polynomial Level-Set Method for Polynomial System Reachable Set Estimation
• Synthesizing robust domains of attraction for state-constrained perturbed polynomial systems
• k-Inductive Barrier Certificates for Stochastic Systems
• Inner-Approximating Reachable Sets for Polynomial Systems with Time-Varying Uncertainties
• Estimating the minimal domains of attraction of uncertain discrete-time switched systems under state-dependent switching
• A new framework for bounding reachability probabilities of continuous-time stochastic systems
• Converse barrier certificates for finite-time safety verification of continuous-time perturbed deterministic systems

This page was built for publication: Inner-Approximating Reachable Sets for Polynomial Systems With Time-Varying Uncertainties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5125565)