Compositional (In)Finite Abstractions for Large-Scale Interconnected Stochastic Systems
Abolfazl Lavaei, Sadegh Soudjani, Majid Zamani

TL;DR
This paper introduces a compositional framework for constructing both infinite and finite abstractions of large-scale interconnected stochastic systems, enabling scalable controller synthesis with guaranteed error bounds.
Contribution
It develops small-gain based conditions for compositional abstraction of stochastic systems and constructs finite MDPs from reduced models with provable accuracy guarantees.
Findings
Successfully applied to a 20-subsystem network with 100 dimensions.
Constructed finite MDPs with guaranteed error bounds.
Demonstrated temperature regulation in a 1000-room building network.
Abstract
This paper is concerned with a compositional approach for constructing both infinite (reduced-order models) and finite abstractions (a.k.a. finite Markov decision processes (MDPs)) of large-scale interconnected discrete-time stochastic systems. The proposed framework is based on the notion of stochastic simulation functions enabling us to employ an abstract system as a substitution of the original one in the controller design process with guaranteed error bounds. In the first part of the paper, we derive sufficient small-gain type conditions for the compositional quantification of the probabilistic distance between the interconnection of stochastic control subsystems and that of their infinite abstractions. We then construct infinite abstractions together with their corresponding stochastic simulation functions for a particular class of discrete-time nonlinear stochastic control…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
