INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY |
Prev
Next
|
|
|
Consensus pursuit of heterogeneous multi-agent systems under a directed acyclic graph |
Yan Jing(闫敬)†, Guan Xin-Ping(关新平), and Luo Xiao-Yuan(罗小元) |
Institute of Electrical Engineering, Yanshan University, Qinhuangdao 066004, China |
|
|
Abstract This paper is concerned with the cooperative target pursuit problem by multiple agents based on directed acyclic graph. The target appears at a random location and moves only when sensed by the agents, and agents will pursue the target once they detect its existence. Since the ability of each agent may be different, we consider the heterogeneous multi-agent systems. According to the topology of the multi-agent systems, a novel consensus-based control law is proposed, where the target and agents are modeled as a leader and followers, respectively. Based on Mason's rule and signal flow graph analysis, the convergence conditions are provided to show that the agents can catch the target in a finite time. Finally, simulation studies are provided to verify the effectiveness of the proposed approach.
|
Received: 01 November 2010
Revised: 26 November 2010
Accepted manuscript online:
|
PACS:
|
89.20.Ff
|
(Computer science and technology)
|
|
87.85.St
|
(Robotics)
|
|
89.65.Ef
|
(Social organizations; anthropology ?)
|
|
02.30.Em
|
(Potential theory)
|
|
Fund: Project supported by the National Basic Research Program of China (Grant No. 2010CB731800), the Key Project of the National Natural Science Foundation of China (Grant No. 60934003), the National Natural Science Foundation of China (Grant No. 61074065), the Key Project for the Natural Science Research of Hebei Education Department, China (Grant No. ZD200908), and the Key Project for the Shanghai Committee of Science and Technology (Grant No. 08511501600). |
Cite this article:
Yan Jing(闫敬), Guan Xin-Ping(关新平), and Luo Xiao-Yuan(罗小元) Consensus pursuit of heterogeneous multi-agent systems under a directed acyclic graph 2011 Chin. Phys. B 20 048901
|
[1] |
Duan Z S, Chen G R and Huang L 2008 Phys. Lett. A % 372 3741 bibitem
|
[2] |
Tan F X, Guan X P and Liu D R 2008 Chin. Phys. B % 17 120 bibitem
|
[3] |
Zhang C X, Li H and Lin P 2008 Chin. Phys. B % 17 4458 bibitem
|
[4] |
Qi W, Xu X J and Hai W Y 2009 Chin. Phys. B % 18 4217 bibitem
|
[5] |
Lin Z Y, Broucke M and Francis B 2004 IEEE Trans. Autom. Control 49 622 bibitem
|
[6] |
Marshall J A, Broucke M and Francis B 2004 IEEE Trans. Autom. Control 49 1963 bibitem
|
[7] |
Marshall J A, Broucke M and Francis B 2006 Automatica % 42 3 bibitem
|
[8] |
Pavone M 2007 J. Dyn. Syst. Meas. Control 129 633 bibitem
|
[9] |
Zheng R H, Lin Z Y and Yan G F 2009 Automatica 45 2699 bibitem
|
[10] |
Kim T H 2007 Automatica 43 1426 bibitem
|
[11] |
Ding W, Yan G F and Lin Z Y 2010 Automatica % 46 174 bibitem
|
[12] |
Shang Y L 2010 Chin. Phys. B 19 070201 bibitem
|
[13] |
Couzin I D, Krause J, Franks N R and Levin S A 2005 % Nature 433 513 bibitem
|
[14] |
Olfati-Saber R and Murray R M 2004 IEEE Trans. Autom. Control 49 1520 bibitem
|
[15] |
Chen G R and Duan Z S 2008 Chaos 18 037102 bibitem
|
[16] |
Li Z K, Duan Z S, Chen G R and Huang L 2010 IEEE Trans. Circu. Systems-I 57 213 bibitem
|
[17] |
Duan Z S, Liu C and Chen G R 2008 Physica D 237% 1006 bibitem
|
[18] |
Semsar-Kazerooni E and Khorasani K 2009 Automatica 45 2205 bibitem
|
[19] |
Lawton J, Beard A and Yong B 2003 IEEE Trans. Robot. Autom. 19 933 bibitem
|
[20] |
Dusek Z 2010 J. Geom. Phys. 60 687 bibitem
|
[21] |
Tanner H and Kumar V 2004 IEEE Trans. Robot. Autom. % 20 443 bibitem
|
[22] |
Yoon Y, Shin J, Kim H J, Park Y and Sastry S 2009 % Control Engin. Pract. 17 741 bibitem
|
[23] |
Mason S J 1956 Proc. IRE 44 920 bibitem
|
[24] |
Bopardikar S D, Bullo F and Hespanha J P 2008 IEEE Trans. Robot. 24 1429 bibitem
|
[25] |
Krishnamurthi V 1972 IEEE Trans. Autom. Control % 17 144 endfootnotesize
|
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
|
|
|