Answers are grounded in this paper and cite their sources.
In this article, we study distributed consensus of heterogeneous multi-agent systems with fixed and switching topologies. The analysis is based on graph theory and nonnegative matrix theory. We propose two kinds of consensus protocols based on the consensus protocol of first-order and second-order multi-agent systems. Some necessary and sufficient conditions that the heterogeneous multi-agent system solves the consensus problems under different consensus protocols are presented with fixed topology. We also give some sufficient conditions for consensus of the heterogeneous multi-agent system with switching topology. Simulation examples are provided to demonstrate the effectiveness of the theoretical results.
No takes yet. Share an insight, caveat, or question.
Zheng et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: