On the Delayed Scaled Consensus Problems
Source abstract
Abstract
In this note, we study the scaled consensus (tracking) problems, wherein all agents reach agreement, but with different assigned ratios in the asymptote. Based on the nearest neighbor-interaction rules, the scaled consensus processes are characterized with and without time delay. We consider both the signal transmission and signal processing delays and calculate the final scaled consensus values. When the underlying communication network contains a spanning tree, it is found that the scaled consensus can be achieved independent of the transmission delays while the specified consensus values in the asymptote depend on the initial history of the agents over a period of time. This phenomenon is in sharp contrast to the case of processing delays, where large delays are likely to jeopardize the consensus behavior, but the scaled consensus values once achieved are the same as the undelayed case.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Distributed Control Multi-Agent Systems · Gene Regulatory Network Analysis · Game Theory and Applications
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Mathematical Sciences, Tongji University, Shanghai 200092, China
References (22)
Show source-provided references
1. Mesbahi, M., and Egerstedt, M. (2010). Graph Theoretic Methods in Multiagent Networks, Princeton University Press.10.1515/9781400835355 ↗
2. Consensus and cooperation in networked multi-agent systems10.1109/JPROC.2006.887293 ↗
3. An overview of recent progress in the study of distributed multi-agent coordination10.1109/TII.2012.2219061 ↗
4. Haddad, W.M., Chellaboina, V., and Hui, Q. (2010). Nonnegative and Compartmental Dynamical Systems, Princeton University Press.10.1515/9781400832248 ↗
5. Design and development of guidance navigation and control algorithms for spacecraft rendezvous and docking experimentation10.1016/j.actaastro.2013.02.010 ↗
6. Scaled consensus10.1016/j.automatica.2014.10.073 ↗
7. A combinatorial necessary and sufficient condition for cluster consensus10.1016/j.neucom.2016.08.025 ↗
8. Consensus problems on networks with antagonistic interactions10.1109/TAC.2012.2224251 ↗
9. Signed consensus problems on networks of agents with fixed and switching topologies10.1080/00207179.2016.1172260 ↗
10. Robust consensus algorithms for multiscale coordination control of multivehicle systems with disturbances10.1109/TIE.2015.2478740 ↗
11. Scaled consensus problems on switching networks10.1109/TAC.2015.2479119 ↗
12. Scaled cluster consensus of discrete-time multi-agent systems with general directed topologies
13. Finite-time scaled consensus through parametric linear iterations10.1080/00207721.2017.1309593 ↗
14. On the duality between consensus problems and Markov processes, with application to delay systems
15. Horn, R.A., and Johnson, C.R. (2012). Matrix Analysis, Cambridge University Press.10.1017/CBO9781139020411 ↗
16. Consensus seeking in multiagent systems under dynamically changing interaction topologies10.1109/TAC.2005.846556 ↗
17. Laplacian matrices of graphs: A survey10.1016/0024-3795(94)90486-3 ↗
18. Atay, F.M. (2013). The consensus problem in networks with transmission delays. Phil. Trans. R. Soc. A, 371.10.1098/rsta.2012.0460 ↗
19. Haken, H. (1978). Synergetics, Springer.10.1007/978-3-642-96469-5 ↗
20. Necessary and sufficient condition for absolute stability of normal neural networks10.1016/S0893-6080(03)00075-3 ↗
21. Roots of the transcendental equation associated with a certain differential difference equation10.1112/jlms/s1-25.3.226 ↗
22. Shang, Y. (2017). Consensus in averager-copier-voter networks of moving dynamical agents. Chaos, 27.10.1063/1.4976959 ↗