LP problem formulation of extremal path accelerations for a rigid body handled by multiple linkages

摘要

The minimum traveling time of a rigid body along a specified geometric path can be achieved by switching between extremal allowable accelerations. A linear programming (LP) problem is formulated to obtain such extreme accelerations for a body handled by multiple robotic manipulators or robotic fingers. Both rigid grasping and grasping with point contacts have been treated.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>