Self-reconfiguration planning of adaptive modular robots with triangular structure based on extended binary trees

Author(s):  
Michael Gerbl ◽  
Johannes Gerstmayr
2018 ◽  
Vol 11 (1) ◽  
Author(s):  
Meibao Yao ◽  
Xueming Xiao ◽  
Christoph H. Belke ◽  
Hutao Cui ◽  
Jamie Paik

Reconfigurability in versatile systems of modular robots is achieved by appropriately actuating individual modular units. Optimizing the distribution of active and passive modules in modular architecture can significantly reduce both cost and energy of a reconfiguration task. This paper presents a methodology for planning this distribution in modular robots, resulting in a minimum number of active modules that guarantees the capability to reconfigure. We discuss the optimal distribution problem in layout-based and target-based planning schemes such that modular robots can instantly respond to reconfiguration commands with either an initial planar layout or a target configuration as input. We propose heuristic algorithms as solutions for the different scenarios, which we demonstrate by applying them to Mori, a modular origami robot, in simulation. The results show that our algorithms yield high-quality distribution schemes in reduced time, and are thus viable for real-time applications in modular robotic systems.


2014 ◽  
Vol 983 ◽  
pp. 67-70
Author(s):  
Vladimir Popov

In this paper, we consider the optimal reconfiguration planning problem of finding the least number of reconfiguration steps to transform between two configurations for chain-type modular robots. We propose an intelligent algorithm for solution of the problem. In particular, we use the set of parameterized k-covers problem and the approximate period problem to detect periodic regularities in genetic sequences of DNA nanomechanical robots. We try to use similar reconfiguration actions for similar parts of genetic sequences. We consider an artificial physics optimization algorithm. We use Runge Kutta neural networks for the prediction of virtual force law.


Author(s):  
Carl A. Nelson ◽  
Raymond J. Cipra

The problem of self-reconfiguration planning for chain-type unit-modular robots is a complex one, with many issues yet to be successfully addressed. This paper describes an approach to several sub-problems associated with self-reconfiguration, namely kinematic modeling and analysis, including kinematic constraint satisfaction, and load analysis and redistribution. These issues are addressed in a unified framework whose primary objective is minimization of the time and mechanical energy expended during reconfiguration. Computer simulation efforts are described and results presented.


2016 ◽  
Vol 79 ◽  
pp. 72-86 ◽  
Author(s):  
Khalil Taheri ◽  
Hadi Moradi ◽  
Masoud Asadpour ◽  
Parisa Parhami

Sign in / Sign up

Export Citation Format

Share Document