Control Synthesis for Permutation-Symmetric High-Dimensional Systems With Counting Constraints

2017/06/23 by Nilsson, Petter, Ozay, Necmiye · 1 citation
#FOS: Electrical engineering #FOS: Mathematics #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · doi:10.48550/arxiv.1706.07863

Abstract

General purpose correct-by-construction synthesis methods are limited to systems with low dimensionality or simple specifications. In this work we consider highly symmetrical counting problems and exploit the symmetry to synthesize provably correct controllers for systems with tens of thousands of states. The key ingredients of the solution are an aggregate abstraction procedure for mildly heterogeneous systems and a formulation of counting constraints as linear inequalities.

Cited by

• Homomorphic Mappings for Value-Preserving State Aggregation in Markov Decision Processes

Related

• Synthesis of Infinite State Systems
• Symmetry-based Abstraction Algorithm for Accelerating Symbolic Control Synthesis
• Localization of Control Synthesis Problem for Large-Scale Interconnected System Using IQC and Dissipativity Theories
• Symmetric Synthesis
• Computing control invariant sets in high dimension is easy