In this paper, we present a novel localized movement control algorithm to form a fault-tolerant bi-connected robotic network topology from a connected network, such that total distance of movement of robots is minimized. The proposed distributed algorithm uses p-hop neighbor information to identify critical head robots that can direct two neighbors to move toward each other and bi-connect their neighborhood. Simulation results show that the total distance of movement of robots decreases significantly with our localized algorithm when compared to the globalized one, and our localized algorithm achieved 100% success on considered non-bi-connected networks. To the best of our knowledge, it is the first work on localized movement control for the fault tolerance of mobile robot networks. © 2007 International Federation for Information Processing.
CITATION STYLE
Das, S., Liu, H., Kamath, A., Nayak, A., & Stojmenović, I. (2007). Localized movement control for fault tolerance of mobile robot networks. In IFIP International Federation for Information Processing (Vol. 248, pp. 1–12). https://doi.org/10.1007/978-0-387-74899-3_1
Mendeley helps you to discover research relevant for your work.