Efficient Parallel Self-reconfiguration Algorithm for MEMS Microrobots
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | Efficient Parallel Self-reconfiguration Algorithm for MEMS Microrobots |
| Type de publication | Conference Paper |
| Year of Publication | 2014 |
| Auteurs | Lakhlef H, Mabed H, Bourgeois J |
| Editor | Aldinucci M, DAgostino D, Kilpatrick P |
| Conference Name | 2014 22ND EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING (PDP 2014) |
| Publisher | NVidia Corp; IBM Corp; E4 Comp Engn; Sistemi HS; Univ Turin, Comp Sci Dept; European Assoc Theoret Comp Sci, Italian Chapter; Regione Piemonte; Turismo Torino & Provincia |
| Conference Location | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN Number | 978-1-4799-2728-9 |
| Mots-clés | distributed algorithms, Logical topology, Optimality, Parallel Algorithms, Physical topology, Self-reconfiguration |
| Résumé | In this paper we propose a distributed and efficient parallel self-reconfiguration algorithm for MEMS microrobots. MEMS microrobots perform various missions and tasks in a wide range of applications including odor localization, firefighting, medical service, surveillance and security, and search and rescue. To achieve these tasks the self-reconfiguration for MEMS microrobots is required. The self-reconfiguration with shared map does not scale. Because with the map (predefined positions of the target shape) each node should store all predefined positions of the target shape, therefore this is not always possible as MEMS nodes have a low-memory capacity. In this paper, we present an efficient self-reconfiguration algorithm without predefined positions of the target shape, which reduces the memory usage to a constant complexity. This algorithm improves the energy consumption by minimizing the amount of displacement and the number of messages. |
| DOI | 10.1109/PDP.2014.35 |