|
|
Consensus of high-order continuous-time multi-agent systems with time-delays and switching topologies |
Yang Tan(杨谈)a)†, Jin Yue-Hui(金跃辉)b), Wang Wei(王伟) c), and Shi Ying-Jing(史莹晶) d) |
a School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China; b State Key Laboratory of Networking and Switching, Beijing University of Posts and Telecommunications, Beijing 100876, China; c School of Mechatronics Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China; d Institute of Astronautics and Aeronautics, University of Electronic Science and Technology of China, Chengdu 611731, China |
|
|
Abstract Consensus problems of high-order continuous-time multi-agent systems with time-delays and switching topologies are studied. The motivation of this work is to extend second-order continuous-time multi-agent systems from the literature. It is shown that consensus can be reached with arbitrarily bounded time-delays even though the communication topology might not have spanning trees. A numerical example is included to show the theoretical results.
|
Received: 01 July 2010
Revised: 26 August 2010
Accepted manuscript online:
|
PACS:
|
05.65.+b
|
(Self-organized systems)
|
|
02.10.Yn
|
(Matrix theory)
|
|
87.10.-e
|
(General theory and mathematical aspects)
|
|
Fund: Project supported by the National Natural Science Foundation of China (Grant No. 60672029), the National Basic Research Program of China (Grant No. 2009CB320505), and the National Defense Science and Technology Foundation of State Key Laboratory of Secure Communication (Grant No. 9140C1104020903). |
Cite this article:
Yang Tan(杨谈), Jin Yue-Hui(金跃辉), Wang Wei(王伟) , and Shi Ying-Jing(史莹晶) Consensus of high-order continuous-time multi-agent systems with time-delays and switching topologies 2011 Chin. Phys. B 20 020511
|
[1] |
Fukuda Olfati-Saber R and Murray R M 2004 IEEE Trans. Automat. Control 49 1520
|
[2] |
RenWand Breard R 2005 IEEE Trans. Automat. Control 50 655
|
[3] |
Hong Y, Gao L, Cheng D and Hu J 2007 IEEE Trans.Automat. Control 52 943
|
[4] |
G Xie and L Wang 2007 Int. J. Robust Nonlin. 17 941
|
[5] |
Li Y M and Guan X P 2009 Chin. Phys. B 18 3355
|
[6] |
Hu J and Hong Y 2007 Physica A 374 853
|
[7] |
Xiao F and Wang L 2008 IEEE Trans. Automat. Control 53 1804
|
[8] |
Lin P and Jia Y 2009 Automatica 45 2154
|
[9] |
Ren W, Moore K and Chen Y 2006 Proceeding of IEEE In-ternational Conference on Networking, Sensing and Con-trol p. 457
|
[10] |
Lin P and Jia Y 2010 IEEE Trans. Automat. Control 55 778
|
[11] |
Lin P 2010 Ph. D. Thesis (Beijing: Beihang University)p. 69 (in Chinese)
|
[12] |
Moreau L 2004 Proceedings of IEEE Conference on Deci-sion and Control p. 3998
|
[13] |
Li H, Lin P and Zhang C 2009 Acta Phys. Sin. 58 158 (in Chinese)
|
[14] |
Hu J and Yuan H 2009 Chin. Phys. B 18 3777
|
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
|
|
|