TY - GEN
T1 - A Unified Approach to Dyad and Triad Synthesis for Planar Mechanisms for Motion Generation
AU - Deshpande, Shrinath
AU - Purwar, Anurag
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2022
Y1 - 2022
N2 - In this paper, we present a unified approach to the synthesis of planar dyads and triads found in planar closed-loop mechanisms for the motion generation problem. By decomposing a planar mechanism in terms of dyads and triads as building blocks, the problem of mechanism synthesis is reduced to the identification of such entities. By using planar quaternions and kinematic mapping, a common algebraic form of the geometric constraints of the dyads and triads is derived and a two-step algorithm then finds the type and dimensions of dyads and triads. The input to the problem is a set of constraints on poses, pivot locations, or other practical constraints, which can be represented in an algebraic form. The two-step algorithm first assembles these constraints as a set of linear equations, uses Singular Value Decomposition to obtain a candidate solution space, which is further subjected to constrained Lagrangian optimization to find the exact or approximate dyads or triads. This algorithm outputs a set of dyads and triads as solutions, which can be combined to obtain four-bar and six-bar mechanisms as well as planar parallel manipulators.
AB - In this paper, we present a unified approach to the synthesis of planar dyads and triads found in planar closed-loop mechanisms for the motion generation problem. By decomposing a planar mechanism in terms of dyads and triads as building blocks, the problem of mechanism synthesis is reduced to the identification of such entities. By using planar quaternions and kinematic mapping, a common algebraic form of the geometric constraints of the dyads and triads is derived and a two-step algorithm then finds the type and dimensions of dyads and triads. The input to the problem is a set of constraints on poses, pivot locations, or other practical constraints, which can be represented in an algebraic form. The two-step algorithm first assembles these constraints as a set of linear equations, uses Singular Value Decomposition to obtain a candidate solution space, which is further subjected to constrained Lagrangian optimization to find the exact or approximate dyads or triads. This algorithm outputs a set of dyads and triads as solutions, which can be combined to obtain four-bar and six-bar mechanisms as well as planar parallel manipulators.
KW - Dyad synthesis
KW - Motion generation
KW - Planar parallel manipulators
KW - Simultaneous type and dimension synthesis
KW - Triad synthesis
UR - https://www.scopus.com/pages/publications/85128745235
U2 - 10.1007/978-3-030-99826-4_21
DO - 10.1007/978-3-030-99826-4_21
M3 - Conference contribution
AN - SCOPUS:85128745235
SN - 9783030998257
T3 - Mechanisms and Machine Science
SP - 243
EP - 261
BT - Proceedings of the 2022 USCToMM Symposium on Mechanical Systems and Robotics
A2 - Larochelle, Pierre
A2 - McCarthy, J. Michael
PB - Springer Science and Business Media B.V.
T2 - 2nd USCToMM Symposium on Mechanical Systems and Robotics, USCToMM MSR 2022
Y2 - 19 May 2022 through 21 May 2022
ER -