CSpace  > 系统科学研究所
Lower Bounds on the Proportion of Leaders Needed for Expected Consensus of 3-D Flocks
Li, Xuejing1; Wang, Lin2,3; Liu, Zhixin4; Dong, Daoyi5
2017-11-01
Source PublicationIEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS
ISSN2162-237X
Volume28Issue:11Pages:2555-2565
AbstractThis paper considers the consensus behavior of a spatially distributed 3-D dynamical network composed of heterogeneous agents: leaders and followers, in which the leaders have the preferred information about the destination, while the followers do not have. All followers move in a 3-D Euclidean space with a given speed and with their headings updated according to the average velocity of the corresponding neighbors. Compared with the 2-D model, a key point lies in how to analyze the dynamical behavior of a "linear" nonhomogeneous equation where the nonhomogeneous term strongly nonlinearly depends on the states of all agents. Using the network structure and the estimation of some characteristics for the initial states, we present a proper decaying rate for the nonhomogeneous term and then establish lower bounds on the ratio of the number of leaders to the number of followers that is needed for the expected consensus by considering two cases: 1) fixed speed and neighborhood radius and 2) variable speed and neighborhood radius with respect to the population size. Some simulation examples are given to justify the theoretical results.
Keyword3-D flocking model expected consensus leader-follower model lower bound
DOI10.1109/TNNLS.2016.2598576
Language英语
Funding ProjectNational Natural Science Foundation of China[61273221] ; National Natural Science Foundation of China[61473189] ; Research Fund for the Doctoral Program of Higher Education of China ; National Key Basic Research Program of China (973 program)[2014CB845302] ; Australian Research Council's Discovery Projects funding scheme[DP130101658]
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Artificial Intelligence ; Computer Science, Hardware & Architecture ; Computer Science, Theory & Methods ; Engineering, Electrical & Electronic
WOS IDWOS:000413403900008
PublisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/29077
Collection系统科学研究所
Affiliation1.Beijing Univ Technol, Coll Appl Sci, Beijing 100124, Peoples R China
2.Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China
3.Minist Educ, Key Lab Syst Control & Informat Proc, Shanghai 200240, Peoples R China
4.Chinese Acad Sci, Acad Math & Syst Sci, Key Lab Syst & Control, Beijing 100190, Peoples R China
5.Univ New South Wales, Sch Engn & Informat Technol, Canberra, ACT 2600, Australia
Recommended Citation
GB/T 7714
Li, Xuejing,Wang, Lin,Liu, Zhixin,et al. Lower Bounds on the Proportion of Leaders Needed for Expected Consensus of 3-D Flocks[J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS,2017,28(11):2555-2565.
APA Li, Xuejing,Wang, Lin,Liu, Zhixin,&Dong, Daoyi.(2017).Lower Bounds on the Proportion of Leaders Needed for Expected Consensus of 3-D Flocks.IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS,28(11),2555-2565.
MLA Li, Xuejing,et al."Lower Bounds on the Proportion of Leaders Needed for Expected Consensus of 3-D Flocks".IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 28.11(2017):2555-2565.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li, Xuejing]'s Articles
[Wang, Lin]'s Articles
[Liu, Zhixin]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li, Xuejing]'s Articles
[Wang, Lin]'s Articles
[Liu, Zhixin]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li, Xuejing]'s Articles
[Wang, Lin]'s Articles
[Liu, Zhixin]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.