Local Interactions for Cohesive Flexible Swarms
Multiagent Systems
2019-03-25 v1
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.
Cite
@article{arxiv.1903.09259,
title = {Local Interactions for Cohesive Flexible Swarms},
author = {Rotem Manor and Ariel Barel and Alfred M. Bruckstein},
journal= {arXiv preprint arXiv:1903.09259},
year = {2019}
}