Application of collective movement in real life scenarios

Overview of current flocking solutions

Bernát Wiandt, András Kokuti, V. Simon

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Today more and more attention is given to collective movement of dynamic nodes, called "flocking". The main problem is how to control the nodes to behave as a group and make them move together to destinations (and moreover complete some tasks such as sensing, transporting, etc.). Currently there are many works, which attempt to solve the flocking problem, but very few of them are suitable for real world use. This is because most of the algorithms are overlooking crucial physical limitations or the used model is not detailed enough. In this paper we survey the existing flocking algorithms, including a review of the most important requirements for real application scenarios.

Original languageEnglish
Pages (from-to)233-248
Number of pages16
JournalScalable Computing
Volume16
Issue number3
DOIs
Publication statusPublished - 2015

Keywords

  • Collective movement
  • Flocking
  • Self-organising
  • Self-propelled particles

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Application of collective movement in real life scenarios : Overview of current flocking solutions. / Wiandt, Bernát; Kokuti, András; Simon, V.

In: Scalable Computing, Vol. 16, No. 3, 2015, p. 233-248.

Research output: Contribution to journalArticle

@article{d45ba5541cc245af970e5f8109326a17,
title = "Application of collective movement in real life scenarios: Overview of current flocking solutions",
abstract = "Today more and more attention is given to collective movement of dynamic nodes, called {"}flocking{"}. The main problem is how to control the nodes to behave as a group and make them move together to destinations (and moreover complete some tasks such as sensing, transporting, etc.). Currently there are many works, which attempt to solve the flocking problem, but very few of them are suitable for real world use. This is because most of the algorithms are overlooking crucial physical limitations or the used model is not detailed enough. In this paper we survey the existing flocking algorithms, including a review of the most important requirements for real application scenarios.",
keywords = "Collective movement, Flocking, Self-organising, Self-propelled particles",
author = "Bern{\'a}t Wiandt and Andr{\'a}s Kokuti and V. Simon",
year = "2015",
doi = "10.12694/scpe.v16i3.1099",
language = "English",
volume = "16",
pages = "233--248",
journal = "Scalable Computing",
issn = "1895-1767",
publisher = "universitatea de vest",
number = "3",

}

TY - JOUR

T1 - Application of collective movement in real life scenarios

T2 - Overview of current flocking solutions

AU - Wiandt, Bernát

AU - Kokuti, András

AU - Simon, V.

PY - 2015

Y1 - 2015

N2 - Today more and more attention is given to collective movement of dynamic nodes, called "flocking". The main problem is how to control the nodes to behave as a group and make them move together to destinations (and moreover complete some tasks such as sensing, transporting, etc.). Currently there are many works, which attempt to solve the flocking problem, but very few of them are suitable for real world use. This is because most of the algorithms are overlooking crucial physical limitations or the used model is not detailed enough. In this paper we survey the existing flocking algorithms, including a review of the most important requirements for real application scenarios.

AB - Today more and more attention is given to collective movement of dynamic nodes, called "flocking". The main problem is how to control the nodes to behave as a group and make them move together to destinations (and moreover complete some tasks such as sensing, transporting, etc.). Currently there are many works, which attempt to solve the flocking problem, but very few of them are suitable for real world use. This is because most of the algorithms are overlooking crucial physical limitations or the used model is not detailed enough. In this paper we survey the existing flocking algorithms, including a review of the most important requirements for real application scenarios.

KW - Collective movement

KW - Flocking

KW - Self-organising

KW - Self-propelled particles

UR - http://www.scopus.com/inward/record.url?scp=84941566095&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84941566095&partnerID=8YFLogxK

U2 - 10.12694/scpe.v16i3.1099

DO - 10.12694/scpe.v16i3.1099

M3 - Article

VL - 16

SP - 233

EP - 248

JO - Scalable Computing

JF - Scalable Computing

SN - 1895-1767

IS - 3

ER -