Abstract
Flocking is an archetype emergent behavior that is displayed by a wide variety of groups and has been extensively studied in both biological and robotic communities. Still today, the exact requirements on the detail and type of information required for the production of flocking motion is unclear; moreover, these requirements have large potential impacts on biological plausibility and robotic implementations. This work implements a previously published flocking algorithm (Local Crowed Horizon) on a robotic platform and in computer simulations to explore the effects that the type and detail of information have on the produced motions. Specifically, we investigate the level of detail needed for the observation of flock members and study the differences between the use of pose and bearing information. Surprisingly, the results show that there is no significant difference in the motions produce by any observation detail or type of information. From the results, we introduce and define information-abstracted flocking algorithms, which are structured in such a way that the rule is agnostic to the observation detail and/or type of information given as input. Moreover, we believe our implementation of the Local Crowded Horizon flocking algorithm produces motions that require the least and most simplistic type of information (bearing only) which has been validated on robotic hardware to date.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Conradt, L., Krause, J., Couzin, I.D., Roper, T.J.: “Leading According to Need” in Self-Organizing Groups. The American Naturalist 173(3), 304–312 (2009)
Gearbox. The gearbox home page (February 2012), gearbox.sourceforge.net
Hamilton, W.D.: Geometry for the Selfish Herd. Journal of Theoretical Biology 31(2), 295–311 (1971)
Hokuyo. The hokuyo home page (February 2012), www.hokuyo-aut.jb
iRobot. The irobot create home page (February 2012), store.irobot.com/shop/index.jsp?categoryId=3311368
Jadbabaie, A., Lin, J., Stephen Morse, A.: Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules. IEEE Transactions on Automatic Control 48(6), 988–1001 (2002)
Musser, D.R., Stepanov, A.A.: Generic Programming. In: International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 13–25 (1988)
Reynolds, C.W.: Flocks, herds and schools: A distributed behavioral model. Computer Graphics 21(4), 25–34 (1987)
Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., Shochet, O.: Novel Type of Phase Transition in a System of Self-Driven Particles. Phys. Rev. Let. 75(6), 1226–1229 (1995)
Viscido, S.V., Miller, M., Wethey, D.S.: The Dilemma of the Selfish Herd: The Search for a Realistic Movement Rule. Jour. of Theor. Bio. 217(2), 183–194 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fine, B.T., Shell, D.A. (2012). Examining the Information Requirements for Flocking Motion. In: Ziemke, T., Balkenius, C., Hallam, J. (eds) From Animals to Animats 12. SAB 2012. Lecture Notes in Computer Science(), vol 7426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33093-3_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-33093-3_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33092-6
Online ISBN: 978-3-642-33093-3
eBook Packages: Computer ScienceComputer Science (R0)