##
**Consensus protocols for discrete-time multi-agent systems with time-varying delays.**
*(English)*
Zbl 1155.93312

Summary: This paper addresses consensus problems for discrete-time multi-agent systems with time-varying delays and switching interaction topologies and provides a class of effective consensus protocols that are built on repeatedly using the same state information at two time-steps. We show that those protocols can solve consensus problems under milder conditions than the popular consensus algorithm proposed by Jadbabaie et al., specifically, the presented protocols allow for the case that agents can only use delayed information of themselves, whereas the popular one is invalid. It is proved that if the union of the interaction topologies across the time interval with some given length always has a spanning tree, then in the presence of bounded time-varying delays, those protocols solve consensus problems.

### MSC:

93A14 | Decentralized systems |

93C55 | Discrete-time control/observation systems |

93C85 | Automated systems (robots, etc.) in control theory |

### Keywords:

multi-agent systems; coordination; consensus protocols; switching topologies; time-varying delays
PDF
BibTeX
XML
Cite

\textit{F. Xiao} and \textit{L. Wang}, Automatica 44, No. 10, 2577--2582 (2008; Zbl 1155.93312)

Full Text:
DOI

### References:

[1] | Angeli, D.; Bliman, P.A., Stability of leaderless discrete-time multi-agent systems, Mathematics of control, signals, and systems, 18, 293-322, (2006) · Zbl 1117.93058 |

[2] | Fang, L., & Antsaklis, P. J. (2005). Information consensus of asynchronous discrete-time multi-agent systems. In Proceedings of the 2005 American control conference (pp. 1883-1888) |

[3] | Jadbabaie, A.; Lin, J.; Morse, A.S., Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE transactions on automatic control, 48, 9, 988-1001, (2003) · Zbl 1364.93514 |

[4] | Moreau, L., Stability of multiagent systems with time-dependent communication links, IEEE transactions on automatic control, 50, 2, 169-182, (2005) · Zbl 1365.93268 |

[5] | Olfati-Saber, R.; Murray, R.M., Consensus problems in networks of agents with switching topology and time-delays, IEEE transactions on automatic control, 49, 9, 1520-1533, (2004) · Zbl 1365.93301 |

[6] | Ren, W.; Beard, R.W., Consensus seeking in multiagent systems under dynamically changing interaction topologies, IEEE transactions on automatic control, 50, 5, 655-661, (2005) · Zbl 1365.93302 |

[7] | Tanner, H. G., & Christodoulakis, D. K. (2005). State synchronization in local-interaction networks is robust with respect to time delays. In Proceedings of the 44th IEEE conference on decision and control, and the European control conference (pp. 4945-4950) |

[8] | Tsitsiklis, J. N. (1984). Problems in decentralized decision making and computation. Ph.D. thesis.http://web.mit.edu/jnt/www/PhD-84-jnt.pdf |

[9] | Tsitsiklis, J.N.; Bertsekas, D.P.; Athans, M., Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE transactions on automatic control, 31, 9, 803-812, (1986) · Zbl 0602.90120 |

[10] | Vicsek, T.; Czirok, A.; Jacob, E.B.; Cohen, I.; Schochet, O., Novel type of phase transitions in a system of self-driven particles, Physical review letters, 75, 6, 1226-1229, (1995) |

[11] | Wolfowitz, J., Products of indecomposable, aperiodic, stochastic matrices, Proceedings of the American mathematical society, 15, 733-736, (1963) · Zbl 0116.35001 |

[12] | Xiao, F.; Wang, L., State consensus for multi-agent systems with switching topologies and time-varying delays, International journal of control, 79, 10, 1277-1284, (2006) · Zbl 1330.94022 |

[13] | Yu, M., Wang, L., Chu, T., & Hao, F. (2004). An LMI approach to networked control systems with data packet dropout and transmission delays. In Proceedings of 43rd IEEE conference on decision and control (pp. 3545-3550) |

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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.