|
|
Multi-agent coordination in directed moving neighbourhood random networks |
Shang Yi-Lun (尚轶伦) |
Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200240, China |
|
|
Abstract This paper considers the consensus problem of dynamical multiple agents that communicate via a directed moving neighbourhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant. For such a framework, we present sufficient conditions for almost sure asymptotic consensus. Numerical examples are taken to show the effectiveness of the obtained results.
|
Received: 19 September 2009
Revised: 10 November 2009
Accepted manuscript online:
|
PACS:
|
02.50.Cw
|
(Probability theory)
|
|
05.40.Fb
|
(Random walks and Levy flights)
|
|
02.10.Yn
|
(Matrix theory)
|
|
Cite this article:
Shang Yi-Lun (尚轶伦) Multi-agent coordination in directed moving neighbourhood random networks 2010 Chin. Phys. B 19 070201
|
[1] |
DeGroot M H 1974 J. Am. Statistical Assoc. bf69 118
|
[2] |
Olfati-Saber R, Fax J A and Murray R M 2007 Proc. IEEE bf95 215
|
[3] |
Ren W, Beard R W and Atkins E M 2005 Proc. American Control Conference Oregon, June 8--10, 2005 p1859
|
[4] |
Tan F X, Guan X P and Liu D R 2008 Chin. Phys. B 17 3531
|
[5] |
Luo X Y, Li S B and Guan X P 2009 Chin. Phys. B 18 3104
|
[6] |
Jadbabaie A, Lin J and Morse A S 2003 IEEE Trans. Autom. Control 48 988
|
[7] |
Vicsek T, Czirók A, Ben-Jacob E, Cohen I and Shochet O 1995 Phys. Rev. Lett. 75 1226
|
[8] |
Hatano Y and Mesbahi M 2005 IEEE Trans. Autom. Control 50 1867
|
[9] |
Porfiri M and Stilwell D J 2007 IEEE Trans. Autom. Control bf52 1767
|
[10] |
Tahbaz-Salehi A and Jadbabaie A 2008 IEEE Trans. Autom. Control 53 791
|
[11] |
Skufca J D and Bollt E M 2004 Math. Biosci. Eng. 1 347
|
[12] |
Stilwell D J, Bollt E M and Roberson D G 2006 SIAM J. Appl. Dynam. Syst. 6 140
|
[13] |
Olfati-Saber R and Murray R M 2004 IEEE Trans. Autom. Control 49 1520
|
[14] |
Mudasir F, Porfiri M and Kapila V 2007 Proc. IEEE Conference on Decision and Control New Orleans, December 12--14, 2007 p4239
|
[15] |
Kushner H 1971 Introduction to Stochastic Control (New York: Holt, Rinehart and Winston) p195--197
|
[16] |
Seneta E 2006 Non-negative Matrices and Markov Chains (New York: Springer) p3--4, 119
|
[17] |
Chung F R K 1997 Spectral Graph Theory (Providence: American Mathematical Society) p69--70
|
[18] |
Lov'asz L 1996 Combinatorics, Paul Erdos is Eighty (Vol. 2) (Bolyai: Bolyai Society) p4--5
|
[19] |
Billingsley P 1995 Probability and Measure (New York: John Wiley & Sons) p128--130
|
[20] |
Porfiri M, Stilwell D J, Bollt E M and Skufca J D 2006 Physica D bf224 102
|
[21] |
Horn R A and Johnson C R 1985 Matrix Analysis (Cambridge: Cambridge University Press) p455--461
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|