pith. sign in

arxiv: 1810.00313 · v1 · pith:HGBJFPG7new · submitted 2018-09-30 · 💻 cs.SY

Finite Horizon Backward Reachability Analysis and Control Synthesis for Uncertain Nonlinear Systems

classification 💻 cs.SY
keywords controlstoragesynthesisalgorithmbackwardfinitefunctionhorizon
0
0 comments X
read the original abstract

We present a method for synthesizing controllers to steer trajectories from an initial set to a target set on a finite time horizon. The proposed control synthesis problem is decomposed into two steps. The first step under-approximates the backward reachable set (BRS) from the target set, using level sets of storage functions. The storage function is constructed with an iterative algorithm to maximize the volume of the under-approximated BRS. The second step obtains a control law by solving a pointwise min-norm optimization problem using the pre-computed storage function. A closed-form solution of this min-norm optimization can be computed through the KKT conditions. This control synthesis framework is then extended to uncertain nonlinear systems with parametric uncertainties and L_2 disturbances. The computation algorithm for all cases is derived using sum-of-squares (SOS) programming and the S-procedure. The proposed method is applied to several robotics and aircraft examples.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.