Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/inderscience-publishers/controllability-analysis-of-multi-agent-systems-using-relaxed-fQqOg6bcpZ
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- Inderscience Publishers
- Copyright
- Copyright © Inderscience Enterprises Ltd. All rights reserved
- ISSN
- 1755-9340
- eISSN
- 1755-9359
- DOI
- 10.1504/IJSCC.2010.03116
- Publisher site
- See Article on Publisher Site
Abstract
This paper investigates how to make decentralised networks, amenable to external control, i.e., how to ensure that they are appropriately organised so that they can be effectively 'reprogrammed'. In particular, we study networked systems whose interaction dynamics are given by a nearest-neighbour averaging rule, with one leader node providing the control input to the entire system. The main result is a necessary and sufficient condition for the controllability of such systems in terms of the graph topology. In particular, we give a graph theoretic interpretation of the controllability properties through the so-called relaxed equitable partition.
Journal
International Journal of Systems, Control and Communications – Inderscience Publishers
Published: Jan 1, 2010