6,577 research outputs found
Safe Robotic Grasping: Minimum Impact-Force Grasp Selection
This paper addresses the problem of selecting from a choice of possible
grasps, so that impact forces will be minimised if a collision occurs while the
robot is moving the grasped object along a post-grasp trajectory. Such
considerations are important for safety in human-robot interaction, where even
a certified "human-safe" (e.g. compliant) arm may become hazardous once it
grasps and begins moving an object, which may have significant mass, sharp
edges or other dangers. Additionally, minimising collision forces is critical
to preserving the longevity of robots which operate in uncertain and hazardous
environments, e.g. robots deployed for nuclear decommissioning, where removing
a damaged robot from a contaminated zone for repairs may be extremely difficult
and costly. Also, unwanted collisions between a robot and critical
infrastructure (e.g. pipework) in such high-consequence environments can be
disastrous. In this paper, we investigate how the safety of the post-grasp
motion can be considered during the pre-grasp approach phase, so that the
selected grasp is optimal in terms applying minimum impact forces if a
collision occurs during a desired post-grasp manipulation. We build on the
methods of augmented robot-object dynamics models and "effective mass" and
propose a method for combining these concepts with modern grasp and trajectory
planners, to enable the robot to achieve a grasp which maximises the safety of
the post-grasp trajectory, by minimising potential collision forces. We
demonstrate the effectiveness of our approach through several experiments with
both simulated and real robots.Comment: To be appeared in IEEE/RAS IROS 201
Real-Time Online Re-Planning for Grasping Under Clutter and Uncertainty
We consider the problem of grasping in clutter. While there have been motion
planners developed to address this problem in recent years, these planners are
mostly tailored for open-loop execution. Open-loop execution in this domain,
however, is likely to fail, since it is not possible to model the dynamics of
the multi-body multi-contact physical system with enough accuracy, neither is
it reasonable to expect robots to know the exact physical properties of
objects, such as frictional, inertial, and geometrical. Therefore, we propose
an online re-planning approach for grasping through clutter. The main challenge
is the long planning times this domain requires, which makes fast re-planning
and fluent execution difficult to realize. In order to address this, we propose
an easily parallelizable stochastic trajectory optimization based algorithm
that generates a sequence of optimal controls. We show that by running this
optimizer only for a small number of iterations, it is possible to perform real
time re-planning cycles to achieve reactive manipulation under clutter and
uncertainty.Comment: Published as a conference paper in IEEE Humanoids 201
Optimization Model for Planning Precision Grasps with Multi-Fingered Hands
Precision grasps with multi-fingered hands are important for precise
placement and in-hand manipulation tasks. Searching precision grasps on the
object represented by point cloud, is challenging due to the complex object
shape, high-dimensionality, collision and undesired properties of the sensing
and positioning. This paper proposes an optimization model to search for
precision grasps with multi-fingered hands. The model takes noisy point cloud
of the object as input and optimizes the grasp quality by iteratively searching
for the palm pose and finger joints positions. The collision between the hand
and the object is approximated and penalized by a series of least-squares. The
collision approximation is able to handle the point cloud representation of the
objects with complex shapes. The proposed optimization model is able to locate
collision-free optimal precision grasps efficiently. The average computation
time is 0.50 sec/grasp. The searching is robust to the incompleteness and noise
of the point cloud. The effectiveness of the algorithm is demonstrated by
experiments.Comment: Submitted to IROS2019, experiment on BarrettHand, 8 page
- …