A Task-Driven Approach to Optimal Synthesis of Planar Four-Bar Linkages for Extended Burmester Problem

作者：Deshpande Shrinath; Purwar Anurag

来源：Journal of Mechanisms and Robotics, 2017, 9(6): 061005.

DOI：10.1115/1.4037801

<jats:p>The classic Burmester problem is concerned with computing dimensions of planar four-bar linkages consisting of all revolute joints for five-pose problems. We define extended Burmester problem as the one where all types of planar four-bars consisting of dyads of type RR, PR, RP, or PP (R: revolute, P: prismatic) and their dimensions need to be computed for n-geometric constraints, where a geometric constraint is an algebraically expressed constraint on the pose, pivots, or something equivalent. In addition, we extend it to linear, nonlinear, exact, and approximate constraints. This extension also includes the problems when there is no solution to the classic Burmester problem, but designers would still like to design a four-bar that may come closest to capturing their intent. Machine designers often grapple with such problems while designing linkage systems where the constraints are of different varieties and usually imprecise. In this paper, we present (1) a unified approach for solving the extended Burmester problem by showing that all linear and nonlinear constraints can be handled in a unified way without resorting to special cases, (2) in the event of no or unsatisfactory solutions to the synthesis problem, certain constraints can be relaxed, and (3) such constraints can be approximately satisfied by minimizing the algebraic fitting error using Lagrange multiplier method. We present a new algorithm, which solves new problems including optimal approximate synthesis of Burmester problem with no exact solutions.</jats:p>

• 出版日期2017-12