SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:uu-205875"
 

Search: onr:"swepub:oai:DiVA.org:uu-205875" > Attraction Based Mo...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Attraction Based Models of Collective Motion

Strömbom, Daniel (author)
Uppsala universitet,Matematiska institutionen
Sumpter, David J. T. (thesis advisor)
Uppsala universitet,Matematiska institutionen
Deutsch, Andreas (opponent)
Technical University Dresden, Centre for Information Services and High Performance Computing (ZIH)
 (creator_code:org_t)
ISBN 9789150623680
Uppsala : Department of Mathematics, 2013
English 35 s.
Series: Uppsala Dissertations in Mathematics, 1401-2049 ; 82
  • Doctoral thesis (other academic/artistic)
Abstract Subject headings
Close  
  • Animal groups often exhibit highly coordinated collective motion in a variety of situations. For example, bird flocks, schools of fish, a flock of sheep being herded by a dog and highly efficient traffic on an ant trail. Although these phenomena can be observed every day all over the world our knowledge of what rules the individual's in such groups use is very limited. Questions of this type has been studied using so called self-propelled particle (SPP) models, most of which assume that collective motion arises from individuals aligning with their neighbors. Here we introduce and analyze a SPP-model based on attraction alone. We find that it produces all the typical groups seen in alignment-based models and some novel ones. In particular, a group that exhibits collective motion coupled with non-trivial internal dynamics. Groups that have this property are rarely seen in SPP-models and we show that even when a repulsion term is added to the attraction only model such groups are still present. These findings suggest that an interplay between attraction and repulsion may be the main driving force in real flocks and that the alignment rule may be superfluous.We then proceed to model two different experiments using the SPP-model approach. The first is a shepherding algorithm constructed primarily to model experiments where a sheepdog is herding a flock of sheep. We find that in addition to modeling the specific experimental situation well the algorithm has some properties which may make it useful in more general shepherding situations. The second is a traffic model for leaf-cutting ants bridges. Based on earlier experiments a set of traffic rules for ants on a very narrow bridge had been suggested. We show that these are sufficient to produce the observed traffic dynamics on the narrow bridge. And that when extended to a wider bridge by replacing 'Stop' with 'Turn' the new rules are sufficient to produce several key characteristics of the dynamics on the wide bridge, in particular three-lane formation.

Subject headings

NATURVETENSKAP  -- Matematik -- Annan matematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics -- Other Mathematics (hsv//eng)
NATURVETENSKAP  -- Biologi -- Ekologi (hsv//swe)
NATURAL SCIENCES  -- Biological Sciences -- Ecology (hsv//eng)

Keyword

flocking
swarming
self-propelled particles
alignment-free models
agent-based modelling
leaf-cutting ant traffic
sheep-sheepdog system
the Shepherding problem
Mathematics with specialization in Applied Mathematics
Matematik med inriktning mot tillämpad matematik

Publication and Content Type

vet (subject category)
dok (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Strömbom, Daniel
Sumpter, David J ...
Deutsch, Andreas
About the subject
NATURAL SCIENCES
NATURAL SCIENCES
and Mathematics
and Other Mathematic ...
NATURAL SCIENCES
NATURAL SCIENCES
and Biological Scien ...
and Ecology
Parts in the series
Uppsala Disserta ...
By the university
Uppsala University

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view