Multiconsensus control of homogeneous LTI hybrid systems under time-driven jumps

In this paper, we consider a network of homogeneous LTI hybrid dynamics under time-driven aperiodic jumps and exchanging information over a fixed communication graph. Based on the notion of almost equitable partitions, we explicitly characterize the clusters induced by the network over the nodes and, consequently, the corresponding multi-consensus trajectories. Then, we design a decentralized control ensuring convergence of all agents to the corresponding multi-consensus trajectory. Simulations over an academic example illustrate the results

Structure-preserving model reduction of physical network systems by clustering

In this paper, we establish a method for model order reduction of a certain class of physical network systems. The proposed method is based on clustering of the vertices of the underlying graph, and yields a reduced order model within the same class. To capture the physical properties of the network, we allow for weights associated to both the edges as well as the vertices of the graph. We extend the notion of almost equitable partitions to this class of graphs. Consequently, an explicit model reduction error expression in the sense of H2-norm is provided for clustering arising from almost equitable partitions. Finally the method is extended to second-order systems

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

Çamlıbel, Mehmet Kanat (Dogus Author)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