Flocking for multi-agent dynamic systems: algorithms and theory

@article{OlfatiSaber2006FlockingFM,
  title={Flocking for multi-agent dynamic systems: algorithms and theory},
  author={Reza Olfati-Saber},
  journal={IEEE Transactions on Automatic Control},
  year={2006},
  volume={51},
  pages={401-420}
}
  • R. Olfati-Saber
  • Published 13 March 2006
  • Computer Science
  • IEEE Transactions on Automatic Control
In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of flocking in free-space and presence of multiple obstacles are considered. We present three flocking algorithms: two for free-flocking and one for constrained flocking. A comprehensive analysis of the first two algorithms is provided. We demonstrate the first algorithm embodies all three rules of Reynolds. This is a formal approach to extraction of interaction rules that… 
A local flocking algorithm of multi-agent dynamic systems
TLDR
A control algorithm of local flocking is proposed, which is a biologically inspired approach that assimilates key characteristics of flocking and anti-flocking and the stability of the second-order multi-agent system is proven in detail.
Multi-agent flocking via generalized control algorithms: Existence and properties
  • Jun Zhou, H. Qian, Xinbiao Lu
  • Mathematics
    2016 14th International Conference on Control, Automation, Robotics and Vision (ICARCV)
  • 2016
In this paper, we propose a class of generalized flocking algorithms based on the Olfati-Saber's results for self-driving multi-agent networks by introducing some metric weighting matrix and
Survey of Flocking Algorithms in Multi-agent Systems
TLDR
A rigorous survey study of flocking algorithms for agents in MAS in the perspective of various instances of agents shows that there lies a huge scope for the researchers to apply, experiment and analyse various techniques locally to achieve global objectives.
Flocking for multi-robot systems via the Null-Space-based Behavioral control
TLDR
This paper approaches the problem of letting a group of robots flock by resorting to a behavior-based control architecture, namely Null-Space-based Behavioral (NSB) control, and analyzes the flocking behavior in a variety of conditions.
A novel alignment repulsion algorithm for flocking of multi-agent systems based on the number of neighbours per agent
TLDR
It is mathematically proved that the motion of multiple agents converges to a rigid and uncrowded flock if the group is jointly connected just for an instant.
Flocking in target pursuit for multi-agent systems with partial informed agents
TLDR
This study presents a distributed topology optimisation scheme to reduce the communication complexity of keeping connectivity while the multi-agent system pursuits a virtual target.
Fast Flocking Algorithm for Multi-agent Systems by Optimizing Local Interactive Topology
A fast flocking algorithm for multi-agent systems is presented to improve the speed of consensus of multiagent systems based on local interactive topology optimization by considering the phenomenon
Flocking for Multiagent Systems with Partial Information Exchange Based on Inclusion Principle
This paper investigates the flocking problem of multi-agents with partial information exchange, which means that only part, but not all, of the agents are informed of the group objective. A
Bipartite flocking for multi-agent systems
Simulation platform for flocking in multi-agent systems with a virtual leader
TLDR
This paper designs an animated simulation platform for flocking by using Java language, which can show the users practical effect of flocking algorithm with a virtual leader.
...
...

References

SHOWING 1-10 OF 87 REFERENCES
Flocking with Obstacle Avoidance
TLDR
A dynamic graph theoretical framework for flocking in presence of multiple obstacles is provided and formal definitions of nets and flocks as spatially induced graphs are given, which allows task representation and execution for a network of agents called alpha-agents.
Flocking with obstacle avoidance: cooperation with limited communication in mobile networks
  • R. Olfati-Saber, R. Murray
  • Computer Science
    42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)
  • 2003
TLDR
This paper gives formal definitions of nets and flocks as spatially induced graphs and define flocking and introduces the notion of framenets and describes a procedure for automatic construction of an energy function for groups of agents.
Stable flocking of mobile agents part I: dynamic topology
This is the second of a two-part paper, investigating the stability properties of a system of multiple mobile agents with double integrator dynamics. In this second part, we allow the topology of the
Stable flocking of mobile agents, part I: fixed topology
TLDR
This first part generates stable flocking motion for the group using a coordination control scheme which gives rise to smooth control laws for the agents, ensuring collision avoidance and cohesion of the group and an aggregate motion along a common heading direction.
A Unified Analytical Look at Reynolds Flocking Rules
TLDR
A unified theoretical view of the so-called ``Flocking Rules of Reynolds'' is presented, and a single protocol called the (alpha,alpha) protocol is obtained that encompasses all three flocking rules of Reynolds.
Consensus and Cooperation in Networked Multi-Agent Systems
This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in
Coordination of groups of mobile autonomous agents using nearest neighbor rules
TLDR
Simulation results are provided which demonstrate that the nearest neighbor rule they are studying can cause all agents to eventually move in the same direction despite the absence of centralized coordination and despite the fact that each agent's set of nearest neighbors change with time as the system evolves.
Stability of multiagent systems with time-dependent communication links
  • L. Moreau
  • Computer Science
    IEEE Transactions on Automatic Control
  • 2005
TLDR
It is observed that more communication does not necessarily lead to faster convergence and may eventually even lead to a loss of convergence, even for the simple models discussed in the present paper.
Flocks, herds, and schools: A quantitative theory of flocking
We present a quantitative continuum theory of ``flocking'': the collective coherent motion of large numbers of self-propelled organisms. In agreement with everyday experience, our model predicts the
Flocks, herds and schools: A distributed behavioral model
TLDR
This paper explores an approach based on simulation as an alternative to scripting the paths of each bird individually, an elaboration of a particle systems, with the simulated birds being the particles.
...
...