Papers
Topics
Authors
Recent
2000 character limit reached

Dissipativity verification with guarantees for polynomial systems from noisy input-state data

Published 7 Aug 2020 in eess.SY and cs.SY | (2008.03231v2)

Abstract: In this paper, we investigate the verification of dissipativity properties for polynomial systems without an explicitly identified model but directly from noise-corrupted measurements. Contrary to most data-driven approaches for nonlinear systems, we determine dissipativity properties over all finite time horizons using noisy input-state data. To this end, we propose two noise characterizations to deduce two data-based set-membership representations of the ground-truth system. Each representation then serves as a framework to derive computationally tractable conditions to verify dissipativity properties with rigorous guarantees from noise-corrupted data using sum of squares (SOS) optimization.

Citations (24)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.