this paper presents the results of a comprehensive study on the efficiency of planar parallel mechanisms, considering their kinetostatic performance and also, their workspace. this aim is approached upon proceeding single- and multi-objective optimization procedures. kinetostatic performances of ten different planar parallel mechanisms are analyzed by resorting to a recent index, kinematic sens...

We propose the Dexterous Manipulation Graph as a tool to address in-hand manipulation and reposition an object inside a robot’s end-effector. This graph is used to plan a sequence of manipulation primitives so to bring the object to the desired end pose. This sequence of primitives is translated into motions of the robot to move the object held by the endeffector. We use a dual arm robot with p...

Nonholonomic constraints in robotic systems are the source of some di culties in planning and control; however, they also introduce interesting properties that can be practically exploited. In this paper we consider the design of a robot hand that achieves dexterity (i.e., the ability to arbitrarily locate and reorient manipulated objects) through rolling. Some interesting issues arising in pla...

This paper introduces a new technique to synthesize dexterous manipulation of cloth. Given a simple description of the desired cloth motion, our algorithm computes appropriate joint torques for physically simulated hands, such that, via contact forces, the result of cloth simulation follows the desired motion. Instead of optimizing the hand control forces directly, we formulate an optimization ...

The problem of information system (IS) workspace design is analysed. Different conceptions for IS workspace structure design are overviewed. Conceptions are based on Oracle CASE method, IDEF and UML application approach. The structure of the output driven requirements specification method is described. An approach to IS workspace design based on information flows specification is proposed. Some...

The problem of computing the 3-D workspace for redundant articulated chains has applications in a variety of fields such as robotics, computer aided design, and computer graphics. The computational complexity of the workspace problem is at least NP-hard. The recent advent of parallel computers has made practical solutions for the workspace problem possible. Parallel algorithms for computing the...