Local Interactions for Cohesive Flexible Swarms.
arXiv: Multiagent Systems(2019)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要