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 somorphism test between different configurations and the graph edit-distance is a similarity metric. But the algorithm is lot suitable for modules with symmetry. In this paper we improve the algorithm in order to deal with symmetric nodules. Also, we present a new heuristic function to guide the search strategy by penalizing the solutions with more number If actions. The simulation results show the new algorithm not only deals with symmetric modules successfully but also finds better solutions in a shorter time.