Mathematics > Optimization and Control
[Submitted on 3 Aug 2021 (v1), last revised 4 Aug 2021 (this version, v2)]
Title:Algebraic and Graph-Theoretic Conditions for the Herdability of Linear Time-Invariant Systems
View PDFAbstract:In this paper we investigate a relaxed concept of controllability, known in the literature as herdability, namely the capability of a system to be driven towards the(interior of the) positive orthant. Specifically, we investigate herdability for linear time-invariant systems, both from an algebraic perspective and based on the graph representing the systems interactions. In addition, we focus on linear state-space models corresponding to matrix pairs (A;B) in which the matrix B is a selection matrix that determines the leaders in the network, and we show that the weights that followers give to the leaders do not affect the herdability of the system. We then focus on the herdability problem for systems with a single leader in which interactions are symmetric and the network topology is acyclic, in which case an algorithm for the leader selection is provided. In this context, under some additional conditions on the mutual distances, necessary and sufficient conditions for the herdability of the overall system are given.
Submission history
From: Giulia De Pasquale [view email][v1] Tue, 3 Aug 2021 15:41:02 UTC (361 KB)
[v2] Wed, 4 Aug 2021 08:47:20 UTC (178 KB)
Current browse context:
math.OC
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.