Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Group Behaviors for Systems with Significant Dynamics
Autonomous Robots
NASA's JPL Nanorover Outposts Project Develops Colony of Solar-Powered Nanorovers
IEEE Intelligent Systems
An Adaptive Flocking Algorithm for Spatial Clustering
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
On the Quality of Service of Failure Detectors Based on Control Theory
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Comparative Analysis of QoS and Memory Usage of Adaptive Failure Detectors
PRDC '07 Proceedings of the 13th Pacific Rim International Symposium on Dependable Computing
A Decentralized and Adaptive Flocking Algorithm for Autonomous Mobile Robots
GPC-WORKSHOPS '08 Proceedings of the 2008 The 3rd International Conference on Grid and Pervasive Computing - Workshops
Stabilizing flocking via leader election in robot networks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Fault-tolerant and self-stabilizing mobile robots gathering
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Distributed Diagnosis in Formations of Mobile Robots
IEEE Transactions on Robotics
Hi-index | 0.00 |
Recently, control and coordination of a set of autonomous mobile robots has been paid a lot of attentions, because the cooperation of simple robots offers several advantages, such as redundancy and flexibility, and allows performing hard tasks that could be impossible for one single robot. There are a lot of interesting applications of multiple robots, such as satellite exploration and surveillance missions. So far, there are many papers working on the coordination of mobile robots. The characteristic of simplicity of mobile robots brings potential wide applications; however this characteristic also lead to crash with higher probability during cooperation, especially in harsh environment. Surprisingly, only few researches consider the fault tolerance of mobile robots, especially for dynamic coordination application---robot flocking. In this paper, we summarize the existed flocking algorithms and discuss their characteristics. Then we briefly described our fault tolerant flocking algorithms in different models. Finally we proposed the potential future research directions for dynamic flocking of a group of mobile robots. In all, this work can provide a good reference for the researchers working on dynamic cooperation of agents in distributed system.