Please use this identifier to cite or link to this item:
|Title:||Bounded consensus in multi-agent systems of asymmetrically coupled nonidentical agents|
|Source:||Wang, L.,Yan, S.-L.,Wang, Q.-G. (2013). Bounded consensus in multi-agent systems of asymmetrically coupled nonidentical agents. IEEE International Conference on Control and Automation, ICCA : 1172-1177. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCA.2013.6565022|
|Abstract:||This paper investigates consensus problems of multi-agent systems with asymmetrically coupled nonidentical agents in the sense of boundedness. By employing a Lyapunov function associated with the left eigenvector of the Laplacian matrix corresponding to eigenvalue zero and some graph theory, we derive a sufficient condition of global bounded consensus in form of several scalar inequalities. A distributed consensus protocol is then designed by solving a few of lower dimensional linear matrix inequalities. The presented framework for designing protocols is quite simple and of small conservation, without assuming the condition of node balance or calculating the eigenvalues of Laplacian matrix, which can be effectively used to design consensus protocols of various weighted and directed networks. © 2013 IEEE.|
|Source Title:||IEEE International Conference on Control and Automation, ICCA|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 13, 2018
checked on Feb 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.