Pith. sign in

REVIEW

Approximate abstractions of control systems with an application to aggregation

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 1809.03621 v2 pith:L5A3MSBU submitted 2018-09-10 math.OC

classification math.OC
keywords controlabstractionsconditionsabstractionaggregationapplicationapproachesfunctions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Previous approaches to constructing abstractions for control systems rely on geometric conditions or, in the case of an interconnected control system, a condition on the interconnection topology. Since these conditions are not always satisfiable, we relax the restrictions on the choice of abstractions, instead opting to select ones which nearly satisfy such conditions via optimization-based approaches. To quantify the resulting effect on the error between the abstraction and concrete control system, we introduce the notions of practical simulation functions and practical storage functions. We show that our approach facilitates the procedure of aggregation, where one creates an abstraction by partitioning agents into aggregate areas. We demonstrate the results on an application where we regulate the temperature in three separate zones of a building.

Discussion (0). Continue with ORCID to comment.

Pith tools