On the Reachability and Observability of Path and Cycle Graphs

DOI10.1109/TAC.2011.2168912MaRDI QIDQ5352749zbMATH OpenOpenAlexFDO

Authors Gianfranco Parlangeli, Giuseppe Notarstefano

Publication date 8 September 2017

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

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)

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.

Cited in

(53)

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

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)