Abstract | ||
---|---|---|
In this paper we present a dynamic self reconfiguration protocol for MEMS micro robots. The protocol presented in this paper is without map of the target shape which makes it efficient and scalable. In other words, nodes do not store the positions that build the target shape. Consequently, memory usage for each node is reduced to a constant complexity. An algorithm of self-reconfiguration is deeply studied showing how to manage the dynamicity (wake up and sleep of micro robots)of the network to save energy. Our algorithm is implemented in Meld, a declarative language, and executed in a real environment simulator called DPRSim. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1109/UIC-ATC.2013.107 | Ubiquitous Intelligence and Computing, 2013 IEEE 10th International Conference and 10th International Conference Autonomic and Trusted Computing |
Keywords | Field | DocType |
real environment simulator,memory usage,micro robot,declarative language,microrobots reconfiguration,dynamic self reconfiguration protocol,constant complexity,mems micro robot,target shape,mobility,computational complexity,distributed algorithms,physical topology,mems | Computer science,Network topology,Distributed algorithm,Declarative programming,Robot,Control reconfiguration,Computational complexity theory,Embedded system,Distributed computing,Scalability,Robot programming | Conference |
ISBN | Citations | PageRank |
978-1-4799-2481-3 | 6 | 0.43 |
References | Authors | |
12 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hicham Lakhlef | 1 | 112 | 16.86 |
Hakim Mabed | 2 | 100 | 14.07 |
Bourgeois Julien | 3 | 403 | 63.53 |