Back
Graph signature for self-reconfiguration planning
This project incorporates modular robots as build- ing blocks for furniture that moves and self-reconfigures. The reconfiguration is done using dynamic connection / disconnection of modules and rotations of the degrees of freedom. This paper introduces a new approach to self-reconfiguration planning for modular robots based on the graph signature and the graph edit-distance. The method has been tested in simulation on two type of modules: YaMoR and M-TRAN. The simulation results shows interesting features of the approach, namely rapidly finding a near-optimal solution.
@inproceedings{escidoc:2316391, title = {Graph signature for self-reconfiguration planning}, booktitle = {Proceedings of the 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems}, abstract = {This project incorporates modular robots as build- ing blocks for furniture that moves and self-reconfigures. The reconfiguration is done using dynamic connection / disconnection of modules and rotations of the degrees of freedom. This paper introduces a new approach to self-reconfiguration planning for modular robots based on the graph signature and the graph edit-distance. The method has been tested in simulation on two type of modules: YaMoR and M-TRAN. The simulation results shows interesting features of the approach, namely rapidly finding a near-optimal solution.}, pages = {863--869}, publisher = {IEEE}, address = {Nice}, year = {2008}, slug = {escidoc-2316391}, author = {Asadpour, Masoud and Spr{\"o}witz, Alexander and Billard, Aude and Dillenbourg, Pierre and Ijspeert, Auke Jan} }
More information