Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Convergence Speed in Distributed Consensus and Averaging
SIAM Journal on Control and Optimization
Self-stabilizing leader election in networks of finite-state anonymous agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Distributed Coordination Control of Multiagent Systems While Preserving Connectedness
IEEE Transactions on Robotics
Potential Fields for Maintaining Connectivity of Mobile Networks
IEEE Transactions on Robotics
Towards efficient private distributed computation on unbounded input streams
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Hi-index | 0.00 |
Swarm gathering and swarm flocking may conflict each other. Without explicit communication, such conflicts may lead to undesired topological changes since there is no global signal that facilitates coordinated and safe switching from one behavior to the other. Moreover, without coordination signals multiple swarm members might simultaneously assume leadership, and their conflicting leading direction is likely to nullify a successful flocking effort. To the best of our knowledge, we present the first set of swarm flocking algorithms that maintain connectivity while electing direction for flocking. The algorithms allow spontaneous direction requests and support direction changes.