Weighted consensus problem for multiagent systems with edge- and node-weighted directed graphs (Q2336027)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7131146
Language Label Description Also known as
default for all languages
No label defined
    English
    Weighted consensus problem for multiagent systems with edge- and node-weighted directed graphs
    scientific article; zbMATH DE number 7131146

      Statements

      Weighted consensus problem for multiagent systems with edge- and node-weighted directed graphs (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      18 November 2019
      0 references
      Summary: In this paper, the concept of consensus is generalized to weighted consensus, by which the conventional consensus, the bipartite consensus, and the cluster consensus problems can be unified in the proposed weighted consensus frame. The dynamics of agents are modeled by the general linear time-invariant systems. The interaction topology is modeled by edge- and node-weighted directed graphs. Under both state feedback and output feedback control strategies, the weighted consensus problems are transformed into the equivalent conventional consensus problems. Then, some distributed state feedback and output feedback protocols are proposed to solve the weighted consensus problems. For output feedback case, a unified frame to construct the state-observer-based weighted consensus protocols is proposed, and different design approaches are discussed. As special cases, some related results for bipartite consensus and cluster consensus can be obtained directly. Finally, a simple example is given to illustrate the effectiveness of our proposed approaches.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references