Pith. sign in

REVIEW

A Compositional Approach to Certifying the Almost Global Asymptotic Stability of Cascade 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 2303.15535 v4 pith:XVRNIN6J submitted 2023-03-27 math.OC cs.ROmath.DS

A Compositional Approach to Certifying the Almost Global Asymptotic Stability of Cascade Systems

classification math.OC cs.ROmath.DS
keywords almostasymptoticglobalstabilitysystemssubsystemsasymptoticallycascade
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

In this work, we give sufficient conditions for the almost global asymptotic stability of a cascade in which the subsystems are only almost globally asymptotically stable. The result is extended to upper triangular systems of arbitrary size. In particular, if the unforced subsystems are almost globally asymptotically stable and their only chain recurrent points are hyperbolic equilibria, then the boundedness of forward trajectories is sufficient for the almost global asymptotic stability of the full upper triangular system. We show that unboundedness of such cascades is prohibited by growth rate conditions on the interconnection term and a Lyapunov function for the unforced outer subsystem, and the required structure for the chain recurrent set is enjoyed by classes of systems common in geometric control e.g. dissipative mechanical systems. Our results stand in contrast to prior works that require either time scale separation, prohibitively strong disturbance robustness properties, or global asymptotic stability in the subsystems.

discussion (0)

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