Group decision making with multiple leaders: local rules, weighted networks and consensus
by Fei Chen, Zengqiang Chen, Zhongxin Liu, Linying Xiang, Zhuzhi Yuan
International Journal of Systems, Control and Communications (IJSCC), Vol. 1, No. 2, 2008

Abstract: In this paper, a realistic and simple discrete-time model based on nearest neighbour rules for describing the movements of autonomous agents is introduced. Two kinds of networks are considered here: weighted directed networks with fixed topology; weighted directed networks with switching topology. The analysis is based on a blend of graph-theoretic and system-theoretic tools. In addition to the stability analysis, the steady state of convergence is also analysed. It turns out that homogenous digraphs plays a central role in addressing average-consensus problems, where the notation 'leadership' is introduced to measure the influence of a node to the consensus of the group. Finally, numerical examples are included which find very good agreements with the analytical results.

Online publication date: Tue, 04-Nov-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Systems, Control and Communications (IJSCC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com