Backward Reachability for Polynomial Systems on a Finite Horizon

DOI10.1109/TAC.2021.3056611OpenAlexW3127322525MaRDI QIDQ5033904FDOQ5033904

Authors: He Yin, Murat Arcak, Peter Seiler, Andrew K. Packard 

Publication date: 24 February 2022

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

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

Recommendations

• Reachability computation for polynomial dynamical systems
• Hybrid Systems: Computation and Control
• scientific article; zbMATH DE number 26547
• Reachability in one-dimensional controlled polynomial dynamical systems
• Reachability analysis of polynomial systems using linear programming relaxations
• Simple Sufficient Conditions for Reachability of Discrete-Time Polynomial Systems
• Under-approximating reach sets for polynomial continuous systems
• Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
• scientific article; zbMATH DE number 4001948
• Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited In (3)

• Reachable set computation of linear systems with nonconvex constraints via convex optimization
• Bracketing backward reach sets of a dynamical system
• Viability, viscosity, and storage functions in model-predictive control with terminal constraints

This page was built for publication: Backward Reachability for Polynomial Systems on a Finite Horizon

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