Title :
Configuration Matching in Self-reconfigurable Process of Modular Self-reconfigurable Robots
Author :
Zhao, Jie ; Ren, Zongwei ; Zhang, Yuhua
Author_Institution :
Robot Res. Inst., Harbin Inst. of Technol.
Abstract :
It´s an important step to find out the best matching scheme in the self-reconfiguring process of self-reconfigurable robots. In this paper, some relative concepts of self-reconfigurable robot and its topological representation and configuration matching are defined, and a matching arithmetic is designed and tested by genetic arithmetic. Testing results show that this matching arithmetic can search out the best matching scheme to improve the self-reconfigurable efficiency of self-reconfigurable robot
Keywords :
arithmetic; genetic algorithms; robots; self-adjusting systems; topology; configuration matching; genetic arithmetic; modular self-reconfigurable robots; self-reconfigurable process; topological representation; Arithmetic; Automatic testing; Genetic algorithms; Mechatronics; Orbital robotics; Robot sensing systems; Robotics and automation; Space exploration; Switches; Topology; Configuration matching; Genetic algorithm; Self-reconfigurable robot; Topology;
Conference_Titel :
Mechatronics and Automation, Proceedings of the 2006 IEEE International Conference on
Conference_Location :
Luoyang, Henan
Print_ISBN :
1-4244-0465-7
Electronic_ISBN :
1-4244-0466-5
DOI :
10.1109/ICMA.2006.257528
