Technical Brief

Enumeration of Configurations and Their Kinematics for ModRED II Modular Robots

[+] Author and Article Information
Kazi M. Hossain

Department of Mechanical and Materials Engineering,
University of Nebraska-Lincoln,
W342 Nebraska Hall,
Lincoln, NE 68588-0526
e-mail: kazi.mashfique@gmail.com

Carl A. Nelson

Department of Mechanical and Materials Engineering,
University of Nebraska-Lincoln,
W342 Nebraska Hall,
Lincoln, NE 68588-0526
e-mail: cnelson5@unl.edu

Prithviraj Dasgupta

Department of Computer Science,
University of Nebraska at Omaha,
1110 S. 67th Street, PKI 172,
Omaha, NE 68106
e-mail: pdasgupta@unomaha.edu

Manuscript received October 15, 2016; final manuscript received April 25, 2017; published online June 22, 2017. Assoc. Editor: Hai-Jun Su.

J. Mechanisms Robotics 9(5), 054501 (Jun 22, 2017) (5 pages) Paper No: JMR-16-1310; doi: 10.1115/1.4036740 History: Received October 15, 2016; Revised April 25, 2017

Modular robotics is a popular topic for robotic applications and design. The reason behind this popularity is the ability to use and reuse the same robot modules for accomplishing different tasks through reconfiguration. The robots are capable of self-reconfiguration based on the requirements of the task and environmental constraints. It is possible to have a large number of configuration combinations for the same set of modules. Therefore, it is important to identify unique configurations from among the full set of possible configurations and establish a kinematic strategy for each before reconfiguring the robots into a new shape. This becomes more difficult for robot units having more than one connection type and more degrees of freedom (DOF) For example, ModRED II modules have two types of connections and four DOF per module. In this paper, the set of configurations is enumerated, and determination of configuration isomorphism is accomplished for ModRED II modules using graph theory. Kinematic equations are then derived for unique configurations. The kinematic method is then demonstrated for certain example configurations using ModRED II modules.

Copyright © 2017 by ASME
Topics: Kinematics , Robots
Your Session has timed out. Please sign back in to continue.


Crossley, F. R. E. , 1964, “ The Permutations of Kinematic Chains of Eight Members or Less from the Graph Theoretic Viewpoint,” Developments in Theoretical and Applied Mechanics, Vol II, Pergamon Press, Oxford, UK, pp. 467–486.
Freudenstein, F. , and Dobrjanskyj, L. , 1964, “ On a Theory for the Type Synthesis of Mechanisms,” 11th International Congress of Applied Mechanics, Munich, Germany, pp. 420–428.
Ullmann, J. R. , 1976, “ An Algorithm for Subgraph Isomorphism,” J. Assoc. Comput. Mach., 23(1), pp. 31–42. [CrossRef]
Mesbahi, M. , and Egerstedt, M. , 2010, Graph Theoretic Methods in Multiagent Networks, Princeton University Press, Princeton, NJ.
Sunkari, R. P. , and Schmidt, L. C. , 2005, “ Laplace and Extended Adjacency Matrices for Isomorphism Detection of Kinematic Chains Using the Characteristic Polynomial Approach,” ASME Paper No. DETC2005-84609.
Uicker, J. J. , and Raicu, A. , 1975, “ A Method for the Identification and Recognition of Equivalence of Kinematic Chains,” Mech. Mach. Theory, 10(5), pp. 375–383. [CrossRef]
Mruthyunjaya, T. S. , and Raghavan, M. R. , 1979, “ Structural Analysis of Kinematic Chains and Mechanisms Based on Matrix Representation,” ASME J. Mech. Des., 101(3), pp. 488–494. [CrossRef]
Chang, K.-S. , and Khatib, O. , 2000, “ Operational Space Dynamics: Efficient Algorithms for Modeling and Control of Branching Mechanisms,” IEEE International Conference on Robotics and Automation (ICRA), San Francisco, CA, Apr. 24–28, Vol. 1, pp. 850–856.
Craig, J. J. , 2004, Introduction to Robotics: Mechanics and Control, 3rd ed., Prentice Hall, Upper Saddle River, NJ.
Tsai, L.-W. , 1987, “ An Application of the Linkage Characteristic Polynomial to the Topological Synthesis of Epicyclic Gear Trains,” ASME J. Mech., Transm., Autom. Des., 109(3), pp. 329–336. [CrossRef]
Nelson, C. A. , and Cipra, R. J. , 2004, “ An Algorithm for Efficient Self-Reconfiguration of Chain-Type Unit-Modular Robots,” ASME Paper No. DETC2004-57488.
Nelson, C. A. , 2011, “ Concurrent Type and Dimensional Synthesis of Planar Mechanisms Using Graph-Theoretic Enumeration, Automatic Loop Closure Equation Generation, and Descent-Based Optimization,” ASME Paper No. IMECE2011-64055.
Parrish, B. E. , McCarthy, J. M. , and Eppstein, D. , 2015, “ Automated Generation of Linkage Loop Equations for Planar One Degree-of-Freedom Linkages, Demonstrated Up to 8-Bar,” ASME J. Mech. Rob., 7(1), p. 011006. [CrossRef]
Lenarčič, J. , and Umek, A. , 1991, “ A Pascal Program for Automatic Generation of Robot Kinematic Equations,” Rob. Comput.-Integr. Manuf., 8(3), pp. 149–155. [CrossRef]
Hossain, S. G. M. , 2014, “ Towards a Sustainable Modular Robot System for Planetary Exploration,” Ph.D. dissertation, University of Nebraska-Lincoln, Lincoln, NE. http://digitalcommons.unl.edu/mechengdiss/69/
Hossain, K. M. , Nelson, C. A. , Dasgupta, P. , and Baca, J. , 2016, “ Modular Robot Task Functionality Driven by Hybrid Automata,” 12th IEEE/ASME International Conference on Mechatronic and Embedded Systems and Applications (MESA), Auckland, New Zealand, Aug. 29–31, pp. 1–6.


Grahic Jump Location
Fig. 1

Graph representation of robot configuration: (a) a four-module structure and (b) its graph representation

Grahic Jump Location
Fig. 2

(a) Adjacency matrix and (b) weighted adjacency matrix for configuration in Fig. 1

Grahic Jump Location
Fig. 3

Reference frames for a single module—adapted from Ref. [15]




Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In