CUED Publications database

Disturbance decoupling problem for multi-agent systems: A graph topological approach

Monshizadeh, N and Zhang, S and Camlibel, MK (2015) Disturbance decoupling problem for multi-agent systems: A graph topological approach. Systems and Control Letters, 76. pp. 35-41. ISSN 0167-6911

Full text not available from this repository.

Abstract

© 2014 Elsevier B.V. All rights reserved. This paper studies the disturbance decoupling problem for multi-agent systems with single integrator dynamics and a directed communication graph. We are interested in topological conditions that imply the disturbance decoupling of the network, and more generally guarantee the existence of a state feedback rendering the system disturbance decoupled. In particular, we will develop a class of graph partitions, which can be described as a "topological translation" of controlled invariant subspaces in the context of dynamical networks. Then, we will derive sufficient conditions in terms of graph partitions such that the network is disturbance decoupled, as well as conditions guaranteeing solvability of the disturbance decoupling problem. The proposed results are illustrated by a numerical example.

Item Type: Article
Subjects: UNSPECIFIED
Divisions: Div B > Electronics, Power & Energy Conversion
Depositing User: Cron Job
Date Deposited: 17 Jul 2017 19:53
Last Modified: 23 Nov 2017 03:41
DOI: