Pages that link to "Item:Q4561432"

The following pages link to Under-Approximating Reach Sets for Polynomial Continuous Systems (Q4561432):

Displaying 9 items.

• Reachable set computation of linear systems with nonconvex constraints via convex optimization (Q2097796) (← links)
• OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations (Q2154032) (← links)
• Reachability analysis using dissipation inequalities for uncertain nonlinear systems (Q2203460) (← links)
• A generalization of Bellman's equation with application to path planning, obstacle avoidance and invariant set estimation (Q2664240) (← links)
• A New Setting for Polynomial Continuous-Time Systems, and a Realization Theorem (Q3778594) (← links)
• Backward Reachability for Polynomial Systems on a Finite Horizon (Q5033904) (← links)
• Inner-Approximating Reachable Sets for Polynomial Systems With Time-Varying Uncertainties (Q5125565) (← links)
• Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems (Q5232243) (← links)
• Polynomial Level-Set Method for Polynomial System Reachable Set Estimation (Q5353361) (← links)