An algorithmic differentiation technique gives a simpler, faster power series expansion of the finite displacement of a closed-loop linkage. It accomplishes this by using a higher order than what has been implemented by complicated prior formulas for kinematic derivatives. In this expansion, the joint rates and axis lines generate the instantaneous screw of each link. Constraining the terminal link to have a zero instantaneous screw satisfies closure. In order to maintain closure over a finite displacement, it is necessary to track the spatial trajectory of each joint axis line, which in turn is directed by the instantaneous screw of a link to which it is attached. Prior algorithms express these screws in a common ground-referenced coordinate frame. Motivated by the kinematics solver portion of the recursive Newton–Euler algorithm, an alternative formulation uses sparse matrices to update the instantaneous screw between successive link-local frames. The recursive Newton–Euler algorithm, however, conducts the expansion to only second order, where this paper shows local coordinate frames that are only instantaneously aligned with their respective links give identical expressions to those in frames that move with the links. Moving frames, however, require about 40% of the operations of the global-frame formulation in the asymptotic limit. Both incrementally translated (Java) and statically compiled (C++) software implementations offer more modest performance gains; execution profiling shows reasons in order of importance (1) balance of calculation tasks when below the asymptotic limit, (2) Java array bounds checking, and (3) hardware acceleration of loops.
Integration of finite displacement interface element in reference and current configurations
