Local Interactions for Cohesive Flexible Swarms

Rotem Manor; Ariel Barel; Alfred M. Bruckstein

doi:10.48550/arXiv.1903.09259

Local Interactions for Cohesive Flexible Swarms

Rotem Manor, Ariel Barel, Alfred M. Bruckstein

Computer Science

Technion - Israel Institute of Technology

Research output: Working paper › Preprint

Abstract

Distributed gathering algorithms aim to achieve complete visibility graphs via a "never lose a neighbour" policy. We suggest a method to maintain connected graph topologies, while reducing the number of effective edges in the graph to order n. This allows to achieve different goals and swarming behaviours: the system remains connected but flexible, hence can maneuver in environments that are replete with obstacles and narrow passages, etc.

Original language	Undefined/Unknown
DOIs	https://doi.org/10.48550/arXiv.1903.09259
State	Published - 21 Mar 2019

Keywords

cs.MA

Access to Document

10.48550/arXiv.1903.09259

Cite this

@techreport{37ad987aaeea4668b4a6feedff359b3d,

title = "Local Interactions for Cohesive Flexible Swarms",

abstract = "Distributed gathering algorithms aim to achieve complete visibility graphs via a {"}never lose a neighbour{"} policy. We suggest a method to maintain connected graph topologies, while reducing the number of effective edges in the graph to order n. This allows to achieve different goals and swarming behaviours: the system remains connected but flexible, hence can maneuver in environments that are replete with obstacles and narrow passages, etc.",

keywords = "cs.MA",

author = "Rotem Manor and Ariel Barel and Bruckstein, {Alfred M.}",

year = "2019",

month = mar,

day = "21",

doi = "10.48550/arXiv.1903.09259",

language = "!!Undefined/Unknown",

type = "WorkingPaper",

}

TY - UNPB

T1 - Local Interactions for Cohesive Flexible Swarms

AU - Manor, Rotem

AU - Barel, Ariel

AU - Bruckstein, Alfred M.

PY - 2019/3/21

Y1 - 2019/3/21

N2 - Distributed gathering algorithms aim to achieve complete visibility graphs via a "never lose a neighbour" policy. We suggest a method to maintain connected graph topologies, while reducing the number of effective edges in the graph to order n. This allows to achieve different goals and swarming behaviours: the system remains connected but flexible, hence can maneuver in environments that are replete with obstacles and narrow passages, etc.

AB - Distributed gathering algorithms aim to achieve complete visibility graphs via a "never lose a neighbour" policy. We suggest a method to maintain connected graph topologies, while reducing the number of effective edges in the graph to order n. This allows to achieve different goals and swarming behaviours: the system remains connected but flexible, hence can maneuver in environments that are replete with obstacles and narrow passages, etc.

KW - cs.MA

U2 - 10.48550/arXiv.1903.09259

DO - 10.48550/arXiv.1903.09259

M3 - نسخة اولية

BT - Local Interactions for Cohesive Flexible Swarms

ER -