ABC-Center: Approximate-Center Election in Modular Robots
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | ABC-Center: Approximate-Center Election in Modular Robots |
| Type de publication | Conference Paper |
| Year of Publication | 2015 |
| Auteurs | Naz A, Piranda B, Goldstein SCopen, Bourgeois J |
| Conference Name | 2015 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS) |
| Publisher | IEEE; RSJ; Univ Hamburg; DFG; RA; New Technol Fdn; SICE; KUKA; DJI; Rethink Robot; BOSCH; Chinese Acad Sci, SIAT; Boozhong; Adept; Automatica; HIT; Ascending Technol; OPTOFORCE; DST Robot; BA Syst; Rainbow Robot; SIA; CLEARPATH Robot; Swiss Natl Ctr Compe |
| Conference Location | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN Number | 978-1-4799-9994-1 |
| Mots-clés | Center election, Distributed algorithm, Modular robotic |
| Résumé | Modular robots are composed of many independent connected modules which are able to achieve common goals through communications. Many distributed algorithms have better performance if the modules that have to communicate with all the others, are placed at the center of the system. In this paper, we propose ABC-Center, an iterative algorithm for electing an approximate-center module in modular robots. ABC-Center uses O(1) space per module and O(kd) time, where k is the number of iterations required to terminate and d the diameter of the system. We evaluated our algorithm both on hardware modular robots and in a simulator for large ensemble of robots. The average expected eccentricity of the module elected by ABC-Center is less than 1.25 blocks off for random systems composed of up to 1000 modules. Furthermore, experiments show that our algorithm terminates after a few iterations. Hence, ABC-Center is scalable and adapted to modular robots with low memory resources. |