Distributed and efficient algorithm for self-reconfiguration of MEMS microrobots

Authors:
Hicham Lakhlef;Hakim Mabed;Julien Bourgeois
Affiliations:
University of Franche Comte, Montbeliard, France;University of Franche Comte, Montbeliard, France;University of Franche Comte, Montbeliard, France
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 7
Cited 0

Crystalline Robots: Self-Reconfiguration with Compressible Unit Modules

Autonomous Robots
Smart Dust: Communicating with a Cubic-Millimeter Computer

Computer
Hormone-Inspired Self-Organization and Distributed Control of Robotic Swarms

Autonomous Robots
Spray computers: Explorations in self-organization

Pervasive and Mobile Computing
A Language for Large Ensembles of Independently Executing Nodes

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Sensors Deployment Enhancement by a Mobile Robot in Wireless Sensor Networks

ICN '10 Proceedings of the 2010 Ninth International Conference on Networks
Redeploying mobile wireless sensor networks with virtual forces

WD'09 Proceedings of the 2nd IFIP conference on Wireless days

Quantified Score

Hi-index	0.00

Visualization

Abstract

Self-reconfiguration for moving MEMS microrobots currently needs a positioning system and a map of the target shape. Traditional positioning solutions like GPS or multilateration are not applicable in the micro-world and maps sharing does not scale. In this paper we present self-reconfiguration method where nodes are unaware of their positions, and where they do not have the final coordinates of each microrobots. In other words, nodes do not store the correct positions that build the target shape. Consequently memory usage for each node is reduced to O(1). This algorithm does not need message exchange to achieve the self-reconfiguration from a chain to square configuration (microrobots are organized in square shape) that represents the optimal logical topology for messages sending and it ensures a Snap-connectivity. Obtained results show a rapid convergence of the algorithm. The worst-case time complexity is of n movement rounds, where n represents the number of microrobots. Our algorithm is implemented in the declarative language MELD and executed in the simulator DPRSim.