A self-reconfigurable robot is a non-linear complex system composed of a large number of modules. The complexity caused by non-linearity makes it difficult to solve the problem of module motion planning and shape-chan...A self-reconfigurable robot is a non-linear complex system composed of a large number of modules. The complexity caused by non-linearity makes it difficult to solve the problem of module motion planning and shape-changing control with the traditional algorithm. In this paper, a full-discrete metamorphic algorithm is proposed. The modules concurrently process the local sensing information, update their eigenvector, and act by the same predetermined logical rules. Then a reasonable motion sequence for modules and the global metamorphosis can be obtained. Therefore, the complexity of metamorphic algorithm is reduced, the metamorphic procedure is simplified, and the self-organizing metamorphosis can be obtained. The algorithm cases of several typical systems are studied and evaluated through simulation program of 2-D planar homogeneous modular systems.展开更多
文摘A self-reconfigurable robot is a non-linear complex system composed of a large number of modules. The complexity caused by non-linearity makes it difficult to solve the problem of module motion planning and shape-changing control with the traditional algorithm. In this paper, a full-discrete metamorphic algorithm is proposed. The modules concurrently process the local sensing information, update their eigenvector, and act by the same predetermined logical rules. Then a reasonable motion sequence for modules and the global metamorphosis can be obtained. Therefore, the complexity of metamorphic algorithm is reduced, the metamorphic procedure is simplified, and the self-organizing metamorphosis can be obtained. The algorithm cases of several typical systems are studied and evaluated through simulation program of 2-D planar homogeneous modular systems.
