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 -