Asadpour, MasoudAshtiani, Mohammad Hassan ZokaeiSproewitz, AlexanderIjspeert, Auke Jan2009-12-092009-12-092009-12-09200910.1109/IROS.2009.5353943https://infoscience.epfl.ch/handle/20.500.14299/44748In 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.self reconfiguration planningself reconfiguring modular roboticsgraph signaturegraph edit distancesimilarity matrixmodules with symmetrytext::conference output::conference proceedings::conference paper