Abstract

This paper presents a characterization of distributed controllers subject to delay constraints induced by a strongly connected communication graph that achieve a prescribed closed loop H∞ norm. Inspired by the solution to the H2 problem subject to delays, we exploit the fact that the communication graph is strongly connected to decompose the controller into a local finite impulse response component and a global but delayed infinite impulse response component. This allows us to reduce the control synthesis problem to a linear matrix inequality feasibility test.