Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.00313 v1 pith:HGBJFPG7 submitted 2018-09-30 cs.SY cs.SY

classification cs.SY
keywords controlstoragesynthesisalgorithmbackwardfinitefunctionhorizon
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools