Related papers: Generalizing Laplacian Controllability of Paths
In this work we consider the Laplacian controllability of a graph constructed by interconnecting a finite number of single-input Laplacian controllable graphs. We first study the interconnection realized by the composite graph of two…
This paper is concerned with the controllability problem of a connected threshold graph following the Laplacian dynamics. An algorithm is proposed to generate a spanning set of orthogonal Laplacian eigenvectors of the graph from a…
In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary…
In this paper, we investigate the controllability of a linear time-invariant network following a Laplacian dynamics defined on a threshold graph. In this direction, an algorithm for deriving the modal matrix associated with the Laplacian…
In this paper, we present a class of network topologies under which the Laplacian consensus dynamics exhibits undesirable controllability properties under a broadcast control signal. Specifically, the networks we characterize are…
Consensus over networked agents is typically studied using undirected or directed communication graphs. Undirected graphs enforce symmetry in information exchange, leading to convergence to the average of initial states, while directed…
In this technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external control inputs are injected to only some of the agents, namely…
This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed…
The existing results on controllability of multi-agents networks are mostly based on homogeneous nodes. This paper focuses on controllability of heterogeneous multi-agent networks, where the agents are modeled as two types. One type is that…
In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentralized fashion by updating its state in accordance with a…
We propose an adaptive control protocol for identifying the topology of dynamical networks interconnected over undirected graphs with cooperative and antagonistic interactions. The signed network is modeled using a repelling Laplacian.…
In this paper, controllability of undirected networked systems with {diffusively coupled subsystems} is considered, where each subsystem is of {identically {\emph{fixed}}} general high-order single-input-multi-output dynamics. The…
The ability to control a complex network towards a desired behavior relies on our understanding of the complex nature of these social and technological networks. The existence of numerous control schemes in a network promotes us to wonder:…
In this paper, we examine the controllability of Laplacian dynamic networks on cographs. Cographs appear in modeling a wide range of networks and include as special instances, the threshold graphs. In this work, we present necessary and…
Controllability of complex networks arises in many technological problems involving social, financial, road, communication, and smart grid networks. In many practical situations, the underlying topology might change randomly with time, due…
This paper presents conditions for establishing topological controllability in undirected networks of diffusively coupled agents. Specifically, controllability is considered based on the signs of the edges (negative, positive or zero). Our…
The control of dynamical, networked systems continues to receive much attention across the engineering and scientific research fields. Of particular interest is the proper way to determine which nodes of the network should receive external…
In this paper, classic controllability and structural controllability under two protocols are investigated. For classic controllability, the multiplicity of eigenvalue zero of general Laplacian matrix $L^*$ is shown to be determined by the…
Control of complex processes is a major goal of network analyses. Most approaches to control nonlinearly coupled systems require the network topology and/or network dynamics. Unfortunately, neither the full set of participating nodes nor…
This paper formulates and studies the problem of controlling a networked SIS model using a single input in which the network structure is described by a connected undirected graph. A necessary and sufficient condition on the values of…