On the Reachability and Observability of Path and Cycle Graphs

DOI10.1109/TAC.2011.2168912zbMATH Open1369.93382arXiv1109.3556OpenAlexW1977594883MaRDI QIDQ5352749FDOQ5352749

Authors: Gianfranco Parlangeli, Giuseppe Notarstefano 

Publication date: 8 September 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Abstract: 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 and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the network system is reachable (respectively observable). Interesting immediate corollaries of our results are: (i) a path graph is reachable (observable) from any single node if and only if the number of nodes of the graph is a power of two, $n=2^i,iinatural$, and (ii) a cycle is reachable (observable) from any pair of nodes if and only if $n$ is a prime number. For any set of control (observation) nodes, we provide a closed form expression for the (unreachable) unobservable eigenvalues and for the eigenvectors of the (unreachable) unobservable subsystem.

Full work available at URL: https://arxiv.org/abs/1109.3556

Mathematics Subject Classification ID

Paths and cycles (05C38) Decentralized systems (93A14) Attainable sets, reachability (93B03) Observability (93B07) Discrete event control/observation systems (93C65)

Cited In (42)

• A necessary and sufficient condition for the controllability of single-leader multi-chain systems
• Second-order controllability of two-time-scale multi-agent systems
• Controllability of Kronecker product networks
• Reachability, observability and strict equivalence of networks of linear systems
• Strong structural controllability of networks
• Leader-following consensus of multi-agent systems under directed communication topology via distributed adaptive nonlinear protocol
• Controllability and observability of multi-agent systems with heterogeneous and switching topologies
• Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms
• The robust minimal controllability and observability problem
• Controllability and observability of coordinated linear systems
• Controllability of discrete-time multi-agent systems with directed topology and input delay
• Controllability of NEPSes of graphs
• Controllability of heterogeneous multi-agent systems under directed and weighted topology
• Controllability improvement for multi-agent systems: leader selection and weight adjustment
• Stabilisation of multi-agent systems over finite fields based on high-order fully actuated system approaches
• Controllability of multi-agent systems with directed and weighted signed networks
• Unified understanding and new results of controllability model of multi‐agent systems
• Zero forcing number, constrained matchings and strong structural controllability
• Group controllability of discrete-time multi-agent systems
• A new perspective to algebraic characterization on controllability of multiagent systems
• Almost equitable partitions and controllability of leader-follower multi-agent systems
• Group controllability of discrete-time time-delayed multiagent systems with multiple leaders
• The robust minimal controllability problem
• Quadratic stabilisability of multi-agent systems under switching topologies
• Almost equitable partitions and new necessary conditions for network controllability
• Nodes selection strategy in cooperative tracking problem
• Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
• Disturbance scaling in bidirectional vehicle platoons with different asymmetry in position and velocity coupling
• Topological and Graph-Coloring Conditions on the Parameter-Independent Stability of Second-Order Networked Systems
• Controllability and observability of switched multi-agent systems
• Optimal controlled nodes selection for fast consensus
• Controllability of networked multiagent systems based on linearized Turing's model
• Constructing a controllable graph under edge constraints
• On the herdability of linear time-invariant systems with special topological structures
• Design of controllable leader-follower networks via memetic algorithms
• Controllability of multi-agent systems with periodically switching topologies and switching leaders
• Controllability of heterogeneous multiagent systems with two-time-scale feature
• Controllability and observability of multi-agent systems with general linear dynamics under switching topologies
• On reachability in graphs with obstacles
• Laplacian controllability classes for threshold graphs
• Sampled-data based structural controllability of multi-agent systems with switching topology
• Relative controllability of nonlinear delayed multi-agent systems

This page was built for publication: On the Reachability and Observability of Path and Cycle Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5352749)