An algorithm to resolve the optimal locomotion problem of modular robots

Mencek, Hakan
In this study, a novel optimal motion planning algorithm is developed for the locomotion of modular robots. The total energy consumption of the robot is considered to be the optimization criteria. In order to determine the energy consumption of the system, the kinematic and dynamic analyses of the system are performed. Due to the variable number of modules in the system, a recursive formulation is developed for both kinematic and dynamic analyses. Coulomb's static and dynamic friction models are used to model the frictional forces at the contact points. In modular robot locomotion, the number of contact points and the positions of the contact points vary with time. As a result, the structure of the dynamic equilibrium equations changes. Depending upon the number and type of contacts (i.e., contact with static or dynamic friction), the dynamic equilibrium equations may lead to an overdetermined, regular or underdetermined system of equations. The last case implies that the system is statically indeterminate. A novel solution method, which takes into account the deflections of the flexible links in the modular robot, is introduced to resolve this statical indeterminacy problem. Another important contribution is the identification of the singularities associated with the dynamic equilibrium equations. It is shown that these equations become singular when all tangential contact point velocities are in the same direction. The developed optimal motion planning algorithm ensures that such singularities are avoided. The procedure is illustrated via a modular, self reconfigurable robot called MTRAN. However, the method may be easily extended to other modular robots by changing the structural parameters. In order to display the resulting motion, a visual simulation program is developed for MTRAN using the commercial software Mathematica.


Dynamic stability analysis of modular, self-reconfigurable robotic systems
Böke, Tevfik Ali; Soylu, Reşit; Department of Mechanical Engineering (2005)
In this study, an efficient algorithm has been developed for the dynamic stability analysis of self-reconfigurable, modular robots. Such an algorithm is essential for the motion planning of self-reconfigurable robotic systems. The building block of the algorithm is the determination of the stability of a rigid body in contact with the ground when there exists Coulomb friction between the two bodies. This problem is linearized by approximating the friction cone with a pyramid and then solved, efficiently, us...
Prediction of slip in cable-drum systems using structured neural networks
KILIÇ, Ergin; Dölen, Melik (SAGE Publications, 2014-02-01)
This study focuses on the slip prediction in a cable-drum system using artificial neural networks for the prospect of developing linear motion sensing scheme for such mechanisms. Both feed-forward and recurrent-type artificial neural network architectures are considered to capture the slip dynamics of cable-drum mechanisms. In the article, the network development is presented in a progressive (step-by-step) fashion for the purpose of not only making the design process transparent to the readers but also hig...
Design, development and manufacturing of an all terrain modular robot platform
Kul, Mustafa Cihangir; Koku, Ahmet Buğra; Department of Mechanical Engineering (2010)
The aim of this thesis is to create a flexible multi-purpose modular all terrain robot platform, which has the potential to be used in commercial applications as well as in education and research. In developing this robot platform, it is aimed to use readily available commercial products as much as possible in order to keep the cost of the product low, increase maintainability, and benefit from the improvements made to these components in time. The modularity is attained by designing a two wheeled base modu...
A Modified Parallel Learning Vector Quantization Algorithm for Real-Time Hardware Applications
Alkim, Erdem; AKLEYLEK, SEDAT; KILIÇ, ERDAL (2017-10-01)
In this study a modified learning vector quantization (LVQ) algorithm is proposed. For this purpose, relevance LVQ (RLVQ) algorithm is effciently combined with a reinforcement mechanism. In this mechanism, it is shown that the proposed algorithm is not affected constantly by both relevance-irrelevance input dimensions and the winning of the same neuron. Hardware design of the proposed scheme is also given to illustrate the performance of the algorithm. The proposed algorithm is compared to the corresponding...
Hershberger, John; Suri, Subhash; Yıldız, Hakan (2022-01-01)
© 2022 Society for Industrial and Applied Mathematics.We propose an algorithm for the problem of computing shortest paths among curved obstacles in the plane. If the obstacles have O(n) description complexity, then the algorithm runs in O(n log n) time plus a term dependent on the properties of the boundary arcs. Specifically, if the arcs allow a certain kind of bisector intersection to be computed in constant time, or even in O(log n) time, then the running time of the overall algorithm is O(n log n). If t...
Citation Formats
H. Mencek, “An algorithm to resolve the optimal locomotion problem of modular robots,” M.S. - Master of Science, Middle East Technical University, 2007.