zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
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.

93A14Decentralized systems
93C55Discrete-time control systems
93C85Automated control systems (robots, etc.)
Full Text: DOI
[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 · doi:10.1007/s00498-006-0006-0
[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, No. 9, 988-1001 (2003)
[4] Moreau, L.: Stability of multiagent systems with time-dependent communication links, IEEE transactions on automatic control 50, No. 2, 169-182 (2005)
[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, No. 9, 1520-1533 (2004)
[6] Ren, W.; Beard, R. W.: Consensus seeking in multiagent systems under dynamically changing interaction topologies, IEEE transactions on automatic control 50, No. 5, 655-661 (2005)
[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 · Zbl 0527.93067
[9] Tsitsiklis, J. N.; Bertsekas, D. P.; Athans, M.: Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE transactions on automatic control 31, No. 9, 803-812 (1986) · Zbl 0602.90120 · doi:10.1109/TAC.1986.1104412
[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, No. 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 · doi:10.2307/2034984
[12] Xiao, F.; Wang, L.: State consensus for multi-agent systems with switching topologies and time-varying delays, International journal of control 79, No. 10, 1277-1284 (2006) · Zbl 05062627
[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)