2020
DOI: 10.14736/kyb-2020-3-0578
|View full text |Cite
|
Sign up to set email alerts
|

Topology design for group consensus in directed multi-agent systems

Abstract: Institute of Mathematics of the Czech Academy of Sciences provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 25 publications
(41 reference statements)
0
4
0
Order By: Relevance
“…Note that for a multi-agent network with dynamics given in Equation 1 (or equivalently Equation 4for discrete-time networks), the number of groups is related to the structure of the network [9][10][11][12]16]. The following lemma states relationship between the number of groups and the graph partitioning based on Definition 1.…”
Section: Definition 2 (Group Consensus)mentioning
confidence: 99%
See 2 more Smart Citations
“…Note that for a multi-agent network with dynamics given in Equation 1 (or equivalently Equation 4for discrete-time networks), the number of groups is related to the structure of the network [9][10][11][12]16]. The following lemma states relationship between the number of groups and the graph partitioning based on Definition 1.…”
Section: Definition 2 (Group Consensus)mentioning
confidence: 99%
“…Consider a network of 14 agents whose edge set is given by šø 1 = {(š‘£ 1 , š‘£ 2 ), (š‘£ 1 , š‘£ 3 ), (š‘£ 2 , š‘£ 3 ), (š‘£ 3 , š‘£ 2 ), (š‘£ 3 , š‘£ 9 ), (š‘£ 3 , š‘£ 11 ), (š‘£ 4 , š‘£ 5 ), (š‘£ 5 , š‘£ 6 ), (š‘£ 5 , š‘£ 7 ), (š‘£ 6 , š‘£ 7 ), (š‘£ 7 , š‘£ 4 ), (š‘£ 7 , š‘£ 5 ), (š‘£ 7 , š‘£ 11 ), (š‘£ 8 , š‘£ 9 ), (š‘£ 8 , š‘£ 14 ), (š‘£ 9 , š‘£ 10 ), (š‘£ 10 , š‘£ 11 ), (š‘£ 10 , š‘£ 14 ), (š‘£ 11 , š‘£ 12 ), (š‘£ 11 , š‘£ 14 ), (š‘£ 12 , š‘£ 13 ), (š‘£ 12 , š‘£ 14 ), (š‘£ 13 , š‘£ 12 )}. (12) Since there is no spanning tree in the graph š‘® šŸ = (š‘½ šŸ , š‘¬ šŸ ), multiple groups will be formed in the network. Once the directed edges are entered as inputs to GraParT, Figure 2 illustrates the network graph, the reduced graph; the PLS and SLS of š‘® šŸ , and evolutions of the states of the agents as functions of time.…”
Section: Examplementioning
confidence: 99%
See 1 more Smart Citation
“…In the last two decades, multi-agent systems (MASs) have received substantial research attention in a variety of fields including sensor networks [1], computer networks [2], clock synchronization [3], distributed decision making [4], distributed optimization [5], social networks [6], load balancing in power systems [7], formation-containment control [8,9], persistent monitoring [10], and robotics [11,12]. The consensus problem was investigated for the networks with first-order [13][14][15][16] and second-order agent dynamics [17][18][19][20] extensively. However, the agents in the distributed network may not have the same dynamics in practical applications [21].…”
Section: Introductionmentioning
confidence: 99%