Skip to main navigation Skip to search Skip to main content

Configuration matching in self-reconfigurable process of modular self-reconfigurable robots

  • Zhao Jie*
  • , Ren Zongwei
  • , Zhang Yuhua
  • *Corresponding author for this work
  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2006 IEEE International Conference on Mechatronics and Automation, ICMA 2006
Pages284-288
Number of pages5
DOIs
StatePublished - 2006
Event2006 IEEE International Conference on Mechatronics and Automation, ICMA 2006 - Luoyang, China
Duration: 25 Jun 200628 Jun 2006

Publication series

Name2006 IEEE International Conference on Mechatronics and Automation, ICMA 2006
Volume2006

Conference

Conference2006 IEEE International Conference on Mechatronics and Automation, ICMA 2006
Country/TerritoryChina
CityLuoyang
Period25/06/0628/06/06

Keywords

  • Configuration matching
  • Genetic algorithm
  • Self-reconfigurable robot
  • Topology

Fingerprint

Dive into the research topics of 'Configuration matching in self-reconfigurable process of modular self-reconfigurable robots'. Together they form a unique fingerprint.

Cite this