Abstract
Self-reconfiguration planning (SRP) of modular robots has been a major research for the past decade and still is a key issue. In this paper, we present a novel new graph signature approach for SRP based on Multiple Views Theory, called MVGS (Multi-View Graph Signature). In the proposed method the time complexity of the graph signature generation reduced to O(logn), in which n is the number of modules, from the best solutions with O(n2). Also, we propose a new similarity metric, between graph signatures to better guide the heuristic search toward the final configuration. The proposed approach has been implemented in a simulator and the results show significantly better performance than the other previously proposed methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
