Thumbnail
Access Restriction
Subscribed

Author Saber, R.O. ♦ Murray, R.M.
Sponsorship Honeywell Lab. ♦ Xerox ♦ Nat. Instruments ♦ Math Works
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2003
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations ♦ Other branches of engineering
Subject Keyword Mobile communication ♦ Intelligent networks ♦ Protocols ♦ Equations ♦ Algorithm design and analysis ♦ Graph theory ♦ Communication system control ♦ Control systems ♦ Electronic mail ♦ Birds
Abstract In this paper, we provide a dynamic graph theoretic framework for flocking in presence of multiple obstacles. In particular, we give formal definitions of nets and flocks as spatially induced graphs and define flocking. We introduce the notion of framenets and describe a procedure for automatic construction of an energy function for groups of agents. The task of flocking is achieved via dissipation of this energy according to a protocol that only requires the use of local information. We show that all three rules of Reynolds are hidden in this single protocol. Three types of agents called /spl alpha/, /spl beta/, and /spl gamma/ agents are used to create flocking. Simulation results are provided that demonstrate flocking by 100 dynamic agents.
Description Author affiliation: Control & Dynamical Syst., California Inst. of Technol., Pasadena, CA, USA (Saber, R.O.; Murray, R.M.)
ISBN 0780379241
ISSN 01912216
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2003-12-09
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 414.25 kB
Page Count 7
Starting Page 2022
Ending Page 2028


Source: IEEE Xplore Digital Library