Abstract
This paper considers the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. The basic theory of herdable systems is presented, including a necessary and sufficient condition for herdability. This paper then considers the impact of the underlying graph structure of a linear system on the herdability of the system, for the case where the graph is represented as signed and directed. By classifying nodes based on the length and sign of walks from an input, we find a class of completely herdable systems as well as provide a complete characterization of nodes that can be herded in systems with an underlying graph that is a directed out-branching rooted at a single input.
| Original language | English (US) |
|---|---|
| Title of host publication | 2018 Annual American Control Conference, ACC 2018 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1807-1812 |
| Number of pages | 6 |
| ISBN (Print) | 9781538654286 |
| DOIs | |
| State | Published - Aug 9 2018 |
| Event | 2018 Annual American Control Conference, ACC 2018 - Milwauke, United States Duration: Jun 27 2018 → Jun 29 2018 |
Publication series
| Name | Proceedings of the American Control Conference |
|---|---|
| Volume | 2018-June |
| ISSN (Print) | 0743-1619 |
Conference
| Conference | 2018 Annual American Control Conference, ACC 2018 |
|---|---|
| Country/Territory | United States |
| City | Milwauke |
| Period | 06/27/18 → 06/29/18 |
Bibliographical note
Publisher Copyright:© 2018 AACC.
ASJC Scopus subject areas
- Electrical and Electronic Engineering