Home /Research /Backward Reachability for Polynomial Systems on a Finite Horizon
OTHER

Backward Reachability for Polynomial Systems on a Finite Horizon

He Yin, Murat Arcak, Andrew Packard, Peter Seiler

Year
2021
Citations
19

Abstract

A method is presented to obtain an inner-approximation of the backward reachable set of a given target tube, along with an admissible controller that maintains trajectories inside this tube. The proposed optimization algorithms are formulated as nonlinear optimization problems, which are decoupled into tractable subproblems and solved by an iterative algorithm using the polynomial S-procedure and sum-of-squares techniques. This framework is also extended to uncertain nonlinear systems with <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {L}_2$</tex-math></inline-formula> disturbances and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {L}_{\infty }$</tex-math></inline-formula> parametric uncertainties. The effectiveness of the method is demonstrated on several nonlinear robotics and aircraft systems with control saturation.

Keywords

ReachabilityNonlinear systemParametric statisticsMathematicsPolynomialSet (abstract data type)Applied mathematicsDiscrete mathematicsAlgorithmMathematical optimization

Related papers

Browse all OTHER papers