Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

## Finite state $\rho/ \mu$ approximations for control design

Back
Abstract:
Hybrid systems, involving interacting continuous and discrete dynamics, are pervasive in both manmade and natural systems and pose a broad spectrum of technical challenges. While several frameworks have been investigated, the past decade has witnessed particular interest in finite state approximations as a means of attacking some of these technical challenges. In particular, plants that are constrained to interact with their controllers via fixed discrete alphabet sets ( `systems over finite alphabets' ) can be thought of as a special class of hybrid systems: Effectively, the discrete alphabet setting gives rise to non-trivial state estimation problems, in addition to the challenging control design problems inherent in hybrid dynamics.

In this talk, we survey a set of analysis tools that are tailored towards systems over finite alphabets, as well as synthesis tools for finite state models. A common component of these tools is the use of input/output constraints as a means of describing system properties of interest. We then propose a notion of approximation, referred to as '$\rho / \mu$ approximation', that seeks to approximate systems over finite alphabets by finite memory models, and to quantify the quality of approximation in a manner compatible with the developed analysis and synthesis tools. Finally, we present constructive algorithms for generating such $\rho/\mu$ approximations.

Type of Seminar:
IfA Seminar
Speaker:
Prof. Danielle C. Tarraf
Department of Electrical and Computer Engineering, Johns Hopkins University, Baltimore
Date/Time:
Jun 07, 2012   16:15
Location:

HG E 21, Rämistr. 101
Contact Person:

John Lygeros