This paper deals with a refined analysis and modification of existing results on the flocking algorithms proposed for the second order dynamic agents. In the present work, the limiting condition of ever connectivity is removed and it is proved that the flocking can be reached if only the union of the network proximity graphs during nonoverlapping time intervals becomes connected frequently enough. Also, it is proved that including a static virtual leader cannot model the group objective of achieving the desired velocity and it will stop eventually at a predefined point in the space. The convergence rate to this fixed point is determined too. The last contribution of this paper is definition of group configuration when only a fraction of agents are informed about the virtual leader.
Skip Nav Destination
Article navigation
January 2014
Research-Article
Theoretical Analysis of Flocking Algorithms in Networks of Second Order Dynamic Agents With Switching Topologies
Mohammad Haeri
Mohammad Haeri
e-mail: haeri@sina.sharif.edu
Electrical Engineering Department,
Sharif University of Technology,
Advanced Control Systems Lab
,Electrical Engineering Department,
Sharif University of Technology,
Tehran 11155-4363
, Iran
Search for other works by this author on:
Mohammad Haeri
e-mail: haeri@sina.sharif.edu
Electrical Engineering Department,
Sharif University of Technology,
Advanced Control Systems Lab
,Electrical Engineering Department,
Sharif University of Technology,
Tehran 11155-4363
, Iran
Contributed by the Dynamic Systems Division of ASME for publication in the JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT, AND CONTROL. Manuscript received November 9, 2012; final manuscript received September 11, 2013; published online October 10, 2013. Assoc. Editor: Prashant Mehta.
J. Dyn. Sys., Meas., Control. Jan 2014, 136(1): 011013 (9 pages)
Published Online: October 10, 2013
Article history
Received:
November 9, 2012
Revision Received:
September 11, 2013
Citation
Atrianfar, H., and Haeri, M. (October 10, 2013). "Theoretical Analysis of Flocking Algorithms in Networks of Second Order Dynamic Agents With Switching Topologies." ASME. J. Dyn. Sys., Meas., Control. January 2014; 136(1): 011013. https://doi.org/10.1115/1.4025456
Download citation file:
Get Email Alerts
Electromagnetic Model of Linear Resonant Actuators
J. Dyn. Sys., Meas., Control (May 2023)
Discrete Robust Control of Robot Manipulators Using an Uncertainty and Disturbance Estimator
J. Dyn. Sys., Meas., Control (May 2023)
Model-Based Estimation of Vehicle Center of Gravity Height and Load
J. Dyn. Sys., Meas., Control (May 2023)
Micro-Energy Harvesting From Automotive Dynamics
J. Dyn. Sys., Meas., Control (May 2023)
Related Articles
On Exponential Flocking to the Virtual Leader in Network of Agents With Double-Integrator Dynamics
J. Dyn. Sys., Meas., Control (May,2013)
Lyapunov–Schmidt Reduction for Fractional Differential Systems
J. Comput. Nonlinear Dynam (September,2016)
A Computational Approach to Conley’s Decomposition Theorem
J. Comput. Nonlinear Dynam (October,2006)
Numerical Simulation and Convergence Analysis of Fractional Optimization Problems With Right-Sided Caputo Fractional Derivative
J. Comput. Nonlinear Dynam (January,2018)
Related Proceedings Papers
Related Chapters
Dual Scrambling Image Encryption Algorithm Based on Chaotic System with Variable Parameter
Proceedings of the International Conference on Internet Technology and Security
A High Resolution DOA Estimation Method Based on Maximal Eigenvector Reconstruction
International Conference on Future Computer and Communication, 3rd (ICFCC 2011)
Hybrid Method for Better Active Learning
Intelligent Engineering Systems through Artificial Neural Networks