34 research outputs found
Regrasp Planning using 10,000s of Grasps
This paper develops intelligent algorithms for robots to reorient objects.
Given the initial and goal poses of an object, the proposed algorithms plan a
sequence of robot poses and grasp configurations that reorient the object from
its initial pose to the goal. While the topic has been studied extensively in
previous work, this paper makes important improvements in grasp planning by
using over-segmented meshes, in data storage by using relational database, and
in regrasp planning by mixing real-world roadmaps. The improvements enable
robots to do robust regrasp planning using 10,000s of grasps and their
relationships in interactive time. The proposed algorithms are validated using
various objects and robots
Dexterous Manipulation Graphs
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 end-effector. We use a dual arm robot
with parallel grippers to test our method on a real system and show successful
planning and execution of in-hand manipulation
A Certified-Complete Bimanual Manipulation Planner
Planning motions for two robot arms to move an object collaboratively is a
difficult problem, mainly because of the closed-chain constraint, which arises
whenever two robot hands simultaneously grasp a single rigid object. In this
paper, we propose a manipulation planning algorithm to bring an object from an
initial stable placement (position and orientation of the object on the support
surface) towards a goal stable placement. The key specificity of our algorithm
is that it is certified-complete: for a given object and a given environment,
we provide a certificate that the algorithm will find a solution to any
bimanual manipulation query in that environment whenever one exists. Moreover,
the certificate is constructive: at run-time, it can be used to quickly find a
solution to a given query. The algorithm is tested in software and hardware on
a number of large pieces of furniture.Comment: 12 pages, 7 figures, 1 tabl