Flocking for multi-agent dynamic systems: algorithms and theory

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 compreh...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 51; no. 3; pp. 401 - 420
Main Author:	Olfati-Saber, R.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.03.2006 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms Applied sciences Biosensors Computer science; control theory; systems Computer systems and distributed systems. User interface Consensus theory Construction costs Control theory. Systems Cost function Deviation Distributed control dynamic graphs Dynamical systems Dynamics Exact sciences and technology Heuristic algorithms Lyapunov method Maneuvers mobile sensor networks networked autonomous vehicles Obstacles Peer to peer computing Self-assembly self-assembly of networks self-organizing systems Software Studies swarms Unmanned aerial vehicles Vehicle dynamics Autonomous system Peer to peer swarms Moving robot Similarity Lyapunov method Potential function Fragmentation dynamic graphs Self organization User interface Swarm intelligence networked autonomous vehicles mobile sensor networks Collective process Consensus theory self-organizing systems Computer animation Knowledge extraction Consensus Lattice Multiagent system self-assembly of networks Distributed algorithm Distributed control Wireless network Sensor array Mobile computing Lyapunov function
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!