1,775 research outputs found
Footstep and Motion Planning in Semi-unstructured Environments Using Randomized Possibility Graphs
Traversing environments with arbitrary obstacles poses significant challenges
for bipedal robots. In some cases, whole body motions may be necessary to
maneuver around an obstacle, but most existing footstep planners can only
select from a discrete set of predetermined footstep actions; they are unable
to utilize the continuum of whole body motion that is truly available to the
robot platform. Existing motion planners that can utilize whole body motion
tend to struggle with the complexity of large-scale problems. We introduce a
planning method, called the "Randomized Possibility Graph", which uses
high-level approximations of constraint manifolds to rapidly explore the
"possibility" of actions, thereby allowing lower-level motion planners to be
utilized more efficiently. We demonstrate simulations of the method working in
a variety of semi-unstructured environments. In this context,
"semi-unstructured" means the walkable terrain is flat and even, but there are
arbitrary 3D obstacles throughout the environment which may need to be stepped
over or maneuvered around using whole body motions.Comment: Accepted by IEEE International Conference on Robotics and Automation
201
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
Recovering from External Disturbances in Online Manipulation through State-Dependent Revertive Recovery Policies
Robots are increasingly entering uncertain and unstructured environments.
Within these, robots are bound to face unexpected external disturbances like
accidental human or tool collisions. Robots must develop the capacity to
respond to unexpected events. That is not only identifying the sudden anomaly,
but also deciding how to handle it. In this work, we contribute a recovery
policy that allows a robot to recovery from various anomalous scenarios across
different tasks and conditions in a consistent and robust fashion. The system
organizes tasks as a sequence of nodes composed of internal modules such as
motion generation and introspection. When an introspection module flags an
anomaly, the recovery strategy is triggered and reverts the task execution by
selecting a target node as a function of a state dependency chart. The new
skill allows the robot to overcome the effects of the external disturbance and
conclude the task. Our system recovers from accidental human and tool
collisions in a number of tasks. Of particular importance is the fact that we
test the robustness of the recovery system by triggering anomalies at each node
in the task graph showing robust recovery everywhere in the task. We also
trigger multiple and repeated anomalies at each of the nodes of the task
showing that the recovery system can consistently recover anywhere in the
presence of strong and pervasive anomalous conditions. Robust recovery systems
will be key enablers for long-term autonomy in robot systems. Supplemental info
including code, data, graphs, and result analysis can be found at [1].Comment: 8 pages, 8 figures, 1 tabl
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
Data-Driven Grasp Synthesis - A Survey
We review the work on data-driven grasp synthesis and the methodologies for
sampling and ranking candidate grasps. We divide the approaches into three
groups based on whether they synthesize grasps for known, familiar or unknown
objects. This structure allows us to identify common object representations and
perceptual processes that facilitate the employed data-driven grasp synthesis
technique. In the case of known objects, we concentrate on the approaches that
are based on object recognition and pose estimation. In the case of familiar
objects, the techniques use some form of a similarity matching to a set of
previously encountered objects. Finally for the approaches dealing with unknown
objects, the core part is the extraction of specific features that are
indicative of good grasps. Our survey provides an overview of the different
methodologies and discusses open problems in the area of robot grasping. We
also draw a parallel to the classical approaches that rely on analytic
formulations.Comment: 20 pages, 30 Figures, submitted to IEEE Transactions on Robotic
Online, interactive user guidance for high-dimensional, constrained motion planning
We consider the problem of planning a collision-free path for a
high-dimensional robot. Specifically, we suggest a planning framework where a
motion-planning algorithm can obtain guidance from a user. In contrast to
existing approaches that try to speed up planning by incorporating experiences
or demonstrations ahead of planning, we suggest to seek user guidance only when
the planner identifies that it ceases to make significant progress towards the
goal. Guidance is provided in the form of an intermediate configuration
, which is used to bias the planner to go through . We
demonstrate our approach for the case where the planning algorithm is
Multi-Heuristic A* (MHA*) and the robot is a 34-DOF humanoid. We show that our
approach allows to compute highly-constrained paths with little domain
knowledge. Without our approach, solving such problems requires
carefully-crafting domain-dependent heuristics
Online, interactive user guidance for high-dimensional, constrained motion planning
We consider the problem of planning a collision-free path for a
high-dimensional robot. Specifically, we suggest a planning framework where a
motion-planning algorithm can obtain guidance from a user. In contrast to
existing approaches that try to speed up planning by incorporating experiences
or demonstrations ahead of planning, we suggest to seek user guidance only when
the planner identifies that it ceases to make significant progress towards the
goal. Guidance is provided in the form of an intermediate configuration
, which is used to bias the planner to go through . We
demonstrate our approach for the case where the planning algorithm is
Multi-Heuristic A* (MHA*) and the robot is a 34-DOF humanoid. We show that our
approach allows to compute highly-constrained paths with little domain
knowledge. Without our approach, solving such problems requires
carefully-crafting domain-dependent heuristics
- …