Optimizing Pinned Nodes to Maximize the Convergence Rate of Multiagent Systems with Digraph Topologies
This paper investigates how to choose pinned node set to maximize the convergence rate of multiagent systems under digraph topologies in cases of sufficiently small and large pinning strength. In the case of sufficiently small pinning strength, perturbation methods are employed to derive formulas in...
Saved in:
Main Authors: | Yujuan Han, Wenlian Lu, Tianping Chen, Changkai Sun |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2019/4096981 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Digraphs : theory, algorithms, and applications /
by: Bang-Jensen, Jørgen, 1960-
Published: (2009) -
The complete product of annihilatingly unique digraphs
by: C. S. GAN
Published: (2005-01-01) -
Maximal Soft Compact and Maximal Soft Connected Topologies
by: Samer Al Ghour, et al.
Published: (2022-01-01) -
Fixation Probabilities on Complete Star and Bipartite Digraphs
by: Chunming Zhang, et al.
Published: (2012-01-01) -
Achieving Synchronization in Arrays of Coupled Differential Systems with Time-Varying Couplings
by: Xinlei Yi, et al.
Published: (2013-01-01)