Graph signature for self-reconfiguration planning of modules with symmetry

In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism test between different configurations and the graph edit-distance is a similarity metric. But the algorithm is not suitable for modules with symmetry. In this paper we improve the algorithm in order to deal with symmetric modules. Also, we present a new heuristic function to guide the search strategy by penalizing the solutions with more number of actions. The simulation results show the new algorithm not only deals with symmetric modules successfully but also finds better solutions in a shorter time.


Published in:
Proceedings of 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, 5295-5300
Presented at:
2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, St. Louis, USA, October 11-15, 2009
Year:
2009
Keywords:
Laboratories:




 Record created 2009-12-09, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)