Pith. sign in

REVIEW 2 cited by

From Data to Control: A Formal Compositional Framework for Large-Scale Interconnected Networks

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 2409.12469 v2 pith:QPRWGRM7 submitted 2024-09-19 eess.SY cs.SY

classification eess.SYcs.SY
keywords compositionalnetworkdatadata-driveninterconnectedsafetysubsystemsunknown
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce a compositional data-driven methodology with noisy data for designing fully-decentralized safety controllers applicable to large-scale interconnected networks, encompassing a vast number of subsystems with unknown mathematical models. Our compositional scheme leverages the interconnection topology and breaks down the network analysis into the examination of distinct subsystems. This is accompanied by utilizing a concept of control storage certificates (CSCs) to capture joint dissipativity-type properties among subsystems. These CSCs are instrumental in a compositional derivation of a control barrier certificate (CBC) specialized for the interconnected network, thereby ensuring its safety. In our data-driven scheme, we gather only a single noise-corrupted input-state trajectory from each unknown subsystem within a specified time frame. By fulfilling a specific rank condition, this process facilitates the construction of a CSC for each subsystem. Following this, by adhering to compositional dissipativity reasoning, we compose CSCs derived from noisy data and build a CBC for the unknown network, ensuring its safety over an infinite time horizon, while providing correctness guarantees. We demonstrate that our compositional data-driven approach significantly enhances the design of a CBC and its robust safety controller under noisy data across the interconnected network. This advancement is achieved by reducing the computational complexity from a polynomial growth in relation to network dimension, when using sum-of-squares (SOS) optimization, to a linear scale based on the number of subsystems. We apply our data-driven findings to a variety of benchmarks, involving physical networks with unknown models and diverse interconnection topologies.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Robust Safety Controllers for Uncertain Input-Affine Polynomial Systems

    eess.SY 2024-12 conditional novelty 6.0 of 10

    A single observed trajectory plus a known disturbance bound is enough to synthesize a robust safety certificate and controller for unknown input-affine polynomial systems.

  2. Abstraction-based Control of Unknown Continuous-Space Models with Just Two Trajectories

    eess.SY 2024-12 conditional novelty 6.0 of 10

    A two-trajectory data-driven method constructs a symbolic abstraction and a formal alternating simulation certificate, enabling controller refinement for unknown polynomial systems.

Pith tools