# Strong Structural Controllability of Diffusively Coupled Networks: Comparison of Bounds Based on Distances and Zero Forcing

@article{Yazcolu2020StrongSC,
title={Strong Structural Controllability of Diffusively Coupled Networks: Comparison of Bounds Based on Distances and Zero Forcing},
author={Yasin Yazıcıoğlu and Mudassir Shabbir and Waseem Abbas and Xenofon D. Koutsoukos},
journal={2020 59th IEEE Conference on Decision and Control (CDC)},
year={2020},
pages={566-571}
}
• Published 17 August 2020
• Mathematics, Computer Science
• 2020 59th IEEE Conference on Decision and Control (CDC)
We study the strong structural controllability (SSC) of diffusively coupled networks, where the external control inputs are injected to only some nodes, namely the leaders. For such systems, one measure of controllability is the dimension of strong structurally controllable subspace, which is equal to the smallest possible rank of controllability matrix under admissible (positive) coupling weights. In this paper, we compare two tight lower bounds on the dimension of strong structurally…
6 Citations

## Figures from this paper

• Computer Science, Mathematics
IEEE Transactions on Automatic Control
• 2022
This paper provides a polynomial time algorithm to compute a particular sequence of vectors containing distances between leaders and the remaining nodes in the underlying network graph that directly provides a lower bound on the dimension of strong structurally controllable subspace in networks with Laplacian dynamics.
• Mathematics
ArXiv
• 2022
In this paper, classic controllability and structural controllability under two protocols are investigated. For classic controllability, the multiplicity of eigenvalue zero of general Laplacian
• Computer Science, Mathematics
IEEE Control Systems Letters
• 2022
An edge augmentation algorithm that adds the maximum number of edges in a graph while preserving the ZF-based bound is provided, and a randomized algorithm is presented that guarantees an $\alpha$ –approximate solution with high probability.
—In this paper, the strong structural controllability of the network is analyzed. Based on the uniﬁed deﬁnition of equitable partition for kinds of scene, the upper bound of the strong structural
• Computer Science, Mathematics
2022 American Control Conference (ACC)
• 2022
It is shown that previously known greedy heuristic could give arbitrarily bad solutions for some graphs, and an optimal algorithm to compute a minimum zero forcing set (ZFS) in linear time in trees is presented.

## References

SHOWING 1-10 OF 20 REFERENCES

• Computer Science, Mathematics
2019 IEEE 58th Conference on Decision and Control (CDC)
• 2019
A polynomial time algorithm is provided to compute a desired sequence of distance-to-leader vectors with a fixed set of leaders, which directly provides a lower bound on the dimension of strong structurally controllable subspace in networks with Laplacian dynamics.
• Computer Science, Mathematics
IEEE Transactions on Automatic Control
• 2016
This work presents a graph topological lower bound on the rank of the controllability matrix of leader-follower networks, where the external control inputs are injected to only some of the agents, namely the leaders, and it is applicable to systems with arbitrary network topologies, coupling weights, and number of leaders.
• Mathematics, Computer Science
IEEE Transactions on Automatic Control
• 2014
This technical note studies the controllability of diffusively coupled networks where some agents, called leaders, are under the influence of external control inputs and provides lower and upper bounds for the controlling subspaces in terms of the distance partitions and the maximal almost equitable partitions, respectively.
• Mathematics
IEEE Transactions on Automatic Control
• 2018
By introducing the notion of a generalized zero forcing set, the structural controllability of undirected networks is discussed and lower bounds on the dimension of the controllable subspace are derived.
• Mathematics
2019 American Control Conference (ACC)
• 2019
This paper identifies networks that are maximally robust and then analyzes their strong structural controllability by determining the minimum number of leaders to make such networks completely controllable with arbitrary coupling weights between agents.
• Mathematics
IEEE Transactions on Automatic Control
• 2014
The problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph is considered, and a one-to-one correspondence between the set of leaders rendering the network controllable and zero forcing sets is established.
• Mathematics, Computer Science
2015 54th IEEE Conference on Decision and Control (CDC)
• 2015
The notion of zero forcing sets, which has been recently exploited in the context of structural controllability, is used to investigate the so-called “targeted controllable” of the network, where controllabilities is only required for a subset of nodes in the network.
• Computer Science, Mathematics
2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
• 2012
A tight lower bound on the rank of the controllability matrix associated with such systems is derived using the distances of nodes to the leaders, and valid for systems with arbitrary network topologies and possibly multiple leaders.
• Mathematics
2013 American Control Conference
• 2013
An O(n2) algorithm to validate if a set of inputs leads to a strongly structurally controllable network and to find such an input set and the problem of finding such a set with minimal cardinality is shown to be NP-complete.