Group for Research in Decision Analysis

Scalable symbolic control

Murat Arcak University of California, Berkeley, United States

Symbolic control translates the control synthesis problem from the continuous- to the discrete-state domain, allowing the designer to address complex control specifications expressed as automata or temporal logic formulas. Existing tools for symbolic control are hampered by severe computational bottlenecks as the system dimension grows, particularly in the “abstraction” stage when the state space is partitioned into discrete states (“symbols") and transitions among the discrete states are determined with reachability analysis. This talk will present our results to overcome these bottlenecks by exploiting system structure. We will discuss: (1) taking advantage of monotonicity properties of the dynamical model for efficient reachability computations, (2) using sparsity structures in the dependency graph of state variables for parsimonious abstraction algorithms that dramatically reduce runtime, and (3) dividing the control synthesis task into sub-problems of manageable size with compositional procedures. We will demonstrate the scalability enabled by these ideas on several practically motivated examples.

Free entrance.
Welcome to everyone!