Research On Consensus Problems Of Flock

Recently, with the rapid development of the global information technology, we enter ahigh-tech era. Especially, the rapid development of the information technology representedby the network enables us to live in the world with various complex networks. With theacceleration of the networks process, people need to have a deeper understanding andfurther research of various artifcial and natural complex networks. Multi-agent systemsas a frontier research in the feld of complex networks have received increasing attentionfrom all felds of natural and social sciences. As a universal phenomenon of multi-agentinteraction, flock has received more and more attention in many research felds, such asbiology, electronics, robotics and control theory. Consensus, as a fundamental form ofcoordinated motion of flock, is used to describe the collective emerging dynamics of flock.It is a point of penetration to further study the cooperation and coordinated control incomplex networks.This paper is devoted to the study of consensus problems for flock. Firstly, a briefdescription of historical background and research progress for complex network, multi-agent, flock and consensus is given. Secondly, the research work of the paper is introduced.We provide a more realistic flock model. Our model does not only take into account thedistance and relative distance between agents, but also, the exclusion efect betweenagents to ensure avoiding collision. We research on consensus of the new model withleader and without leader, respectively. And we provide the conditions to consensus intwo cases by using the active set and potential function theory. Thereafter, it is extendedto a more general case which is proved by the same method. Numerical simulations aregiven to demonstrate the efectiveness of our conclusion. And we analysis the dynamicalbehavior of the new model with random interference by numerical simulation. At last, thework of this dissertation is summarized and the prospective of future research is discussed.