By Topic

Flocking of Multi-Agent Non-Holonomic Systems With Proximity Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jiandong Zhu ; Sch. of Math. Sci., Nanjing Normal Univ., Nanjing, China ; Jinhu Lu ; Xinghuo Yu

Multi-agent systems are ubiquitous in the real-world and have received an increasing attention by many researchers worldwide. A multi-agent system is composed of many agents interconnected by a communication network. This paper aims to further investigate the flocking and preserving connectedness in multi-agent nonholonomic systems with proximity graphs, in which the positions and the relative distances are not available to the distributed controllers. Several sufficient conditions are derived to resolve the above problem based on the kinematic model and the dynamic model, respectively. These sufficient conditions indicate that, for any given distinct initial positions and connected initial graph, there always exist gains of the linear protocols to preserve the connectedness of the graph and realize flocking. Moreover, under an additional condition on initial heading angles, the similar result is obtained for a nonlinear protocol with the form of Kuramoto model. Finally, numerical simulations are given to validate the above theoretical results.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:60 ,  Issue: 1 )