×

Robust iterative learning protocols for finite-time consensus of multi-agent systems with interval uncertain topologies. (English) Zbl 1312.93008

Summary: This paper is devoted to the robust finite-time output consensus problems of multi-agent systems under directed graphs, where all agents and their communication topologies are subject to interval uncertainties. Distributed protocols are constructed by using iterative learning control (ILC) algorithms, where information is exchanged only at the end of one iteration and learning is used to update the control inputs after each iteration. It is proved that under ILC-based protocols, the finite-time consensus can be achieved with an increasing number of iterations if the communication network of agents is guaranteed to have a spanning tree. Moreover, if the information of any desired terminal output is available to a portion (not necessarily all) of the agents, then the consensus output that all agents finally reach can be enabled to be the desired terminal output. It is also proved that for all ILC-based protocols, gain selections can be provided in terms of bound values, and consensus conditions can be developed associated with bound matrices. Simulation results are given to demonstrate the effectiveness of our theoretical results.

MSC:

93A14 Decentralized systems
68T42 Agent technology and artificial intelligence
68T05 Learning and adaptive systems in artificial intelligence
93C41 Control/observation systems with incomplete information
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1109/TSMCC.2007.905759
[2] DOI: 10.1016/j.automatica.2006.11.020 · Zbl 1117.93075
[3] DOI: 10.1002/rnc.1538 · Zbl 1204.93082
[4] DOI: 10.1016/j.automatica.2011.01.042 · Zbl 1219.93005
[5] DOI: 10.1137/S0363012997321358 · Zbl 0945.34039
[6] DOI: 10.1109/MCS.2006.1636313
[7] DOI: 10.1109/TNN.2010.2050601
[8] DOI: 10.1109/TAC.2011.2139450 · Zbl 1368.93659
[9] DOI: 10.1109/TAC.2008.928332 · Zbl 1367.93427
[10] DOI: 10.1016/j.automatica.2006.06.015 · Zbl 1261.93058
[11] DOI: 10.1016/j.automatica.2010.08.008 · Zbl 1205.93045
[12] DOI: 10.1016/j.sysconle.2009.08.005 · Zbl 1181.93009
[13] DOI: 10.1016/j.sysconle.2010.10.005 · Zbl 1207.93004
[14] DOI: 10.1016/j.automatica.2006.06.010 · Zbl 1115.68128
[15] DOI: 10.1017/CBO9780511810817 · Zbl 0576.15001
[16] DOI: 10.1109/TSMCB.2008.2007810
[17] DOI: 10.1016/j.physa.2006.08.015
[18] DOI: 10.1137/06067359X · Zbl 1182.93108
[19] DOI: 10.1109/TAC.2003.812781 · Zbl 1364.93514
[20] DOI: 10.1109/TMECH.2009.2014057
[21] DOI: 10.1080/00207720701778403 · Zbl 1168.93370
[22] DOI: 10.1109/TAC.2010.2042982 · Zbl 1368.93548
[23] DOI: 10.1016/j.sysconle.2008.01.002 · Zbl 1140.93355
[24] DOI: 10.1049/iet-cta.2011.0047
[25] DOI: 10.1016/j.sysconle.2011.10.013 · Zbl 1250.93012
[26] DOI: 10.1080/00207721.2013.775380 · Zbl 1317.93017
[27] DOI: 10.1080/00207721.2011.564324 · Zbl 1305.93092
[28] DOI: 10.1109/TAC.2009.2031564 · Zbl 1367.93739
[29] DOI: 10.1016/j.automatica.2010.09.005 · Zbl 1205.93010
[30] DOI: 10.1109/TAC.2004.834113 · Zbl 1365.93301
[31] DOI: 10.1016/j.mechatronics.2005.08.002
[32] DOI: 10.1109/TAC.2005.846556 · Zbl 1365.93302
[33] DOI: 10.1080/00207721.2011.569586 · Zbl 1305.93077
[34] DOI: 10.1080/00207721.2010.517857 · Zbl 1258.93014
[35] DOI: 10.1016/j.automatica.2010.06.025 · Zbl 1204.93122
[36] DOI: 10.1080/00207720110052021 · Zbl 1017.93042
[37] DOI: 10.1109/TMECH.2008.2004627
[38] DOI: 10.1016/j.automatica.2009.01.009 · Zbl 1162.93027
[39] DOI: 10.1016/j.automatica.2010.10.002 · Zbl 1209.93152
[40] DOI: 10.1016/j.automatica.2009.06.033 · Zbl 1179.93087
[41] DOI: 10.1007/s11424-010-7254-2 · Zbl 1197.93097
[42] DOI: 10.1109/TAC.2010.2041610 · Zbl 1368.93391
[43] DOI: 10.1016/j.sysconle.2004.02.022 · Zbl 1157.90347
[44] DOI: 10.1080/00207179.2011.574236 · Zbl 1227.93053
[45] DOI: 10.1016/S0005-1098(02)00143-7 · Zbl 1011.93511
[46] DOI: 10.1016/j.automatica.2007.10.024 · Zbl 1283.93178
[47] DOI: 10.1016/j.automatica.2010.03.006 · Zbl 1192.93019
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.