Matrix analysis
Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster
IEEE Transactions on Parallel and Distributed Systems
A linguistic modeling of consensus in group decision making basedon OWA operators
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A consensus model for multiperson decision making with different preference structures
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.01 |
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.