Online Tool Selection with Learned Grasp Prediction Models
- URL: http://arxiv.org/abs/2302.07940v1
- Date: Wed, 15 Feb 2023 20:52:38 GMT
- Title: Online Tool Selection with Learned Grasp Prediction Models
- Authors: Khashayar Rohanimanesh, Jake Metzger, William Richards, and Aviv Tamar
- Abstract summary: Deep learning-based grasp prediction models have become an industry standard for robotic bin-picking systems.
To maximize pick success, production environments are often equipped with several end-effector tools that can be swapped on-the-fly, based on the target object.
We show how to choose the order of grasps to perform, and corresponding tool-change actions, to improve system throughput.
- Score: 15.915410623440875
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Deep learning-based grasp prediction models have become an industry standard
for robotic bin-picking systems. To maximize pick success, production
environments are often equipped with several end-effector tools that can be
swapped on-the-fly, based on the target object. Tool-change, however, takes
time. Choosing the order of grasps to perform, and corresponding tool-change
actions, can improve system throughput; this is the topic of our work. The main
challenge in planning tool change is uncertainty - we typically cannot see
objects in the bin that are currently occluded. Inspired by queuing and
admission control problems, we model the problem as a Markov Decision Process
(MDP), where the goal is to maximize expected throughput, and we pursue an
approximate solution based on model predictive control, where at each time step
we plan based only on the currently visible objects. Special to our method is
the idea of void zones, which are geometrical boundaries in which an unknown
object will be present, and therefore cannot be accounted for during planning.
Our planning problem can be solved using integer linear programming (ILP).
However, we find that an approximate solution based on sparse tree search
yields near optimal performance at a fraction of the time. Another question
that we explore is how to measure the performance of tool-change planning: we
find that throughput alone can fail to capture delicate and smooth behavior,
and propose a principled alternative. Finally, we demonstrate our algorithms on
both synthetic and real world bin picking tasks.
Related papers
- Adaptive Planning with Generative Models under Uncertainty [20.922248169620783]
Planning with generative models has emerged as an effective decision-making paradigm across a wide range of domains.
While continuous replanning at each timestep might seem intuitive because it allows decisions to be made based on the most recent environmental observations, it results in substantial computational challenges.
Our work addresses this challenge by introducing a simple adaptive planning policy that leverages the generative model's ability to predict long-horizon state trajectories.
arXiv Detail & Related papers (2024-08-02T18:07:53Z) - Planning as In-Painting: A Diffusion-Based Embodied Task Planning
Framework for Environments under Uncertainty [56.30846158280031]
Task planning for embodied AI has been one of the most challenging problems.
We propose a task-agnostic method named 'planning as in-painting'
The proposed framework achieves promising performances in various embodied AI tasks.
arXiv Detail & Related papers (2023-12-02T10:07:17Z) - Model Checking for Closed-Loop Robot Reactive Planning [0.0]
We show how model checking can be used to create multistep plans for a differential drive wheeled robot so that it can avoid immediate danger.
Using a small, purpose built model checking algorithm in situ we generate plans in real-time in a way that reflects the egocentric reactive response of simple biological agents.
arXiv Detail & Related papers (2023-11-16T11:02:29Z) - AI planning in the imagination: High-level planning on learned abstract
search spaces [68.75684174531962]
We propose a new method, called PiZero, that gives an agent the ability to plan in an abstract search space that the agent learns during training.
We evaluate our method on multiple domains, including the traveling salesman problem, Sokoban, 2048, the facility location problem, and Pacman.
arXiv Detail & Related papers (2023-08-16T22:47:16Z) - Robots That Ask For Help: Uncertainty Alignment for Large Language Model
Planners [85.03486419424647]
KnowNo is a framework for measuring and aligning the uncertainty of large language models.
KnowNo builds on the theory of conformal prediction to provide statistical guarantees on task completion.
arXiv Detail & Related papers (2023-07-04T21:25:12Z) - Effective Baselines for Multiple Object Rearrangement Planning in
Partially Observable Mapped Environments [5.32429768581469]
This paper aims to enable home-assistive intelligent agents to efficiently plan for rearrangement under partial observability.
We investigate monolithic and modular deep reinforcement learning (DRL) methods for planning in our setting.
We find that monolithic DRL methods do not succeed at long-horizon planning needed for multi-object rearrangement.
We also show that our greedy modular agents are empirically optimal when the objects that need to be rearranged are uniformly distributed in the environment.
arXiv Detail & Related papers (2023-01-24T08:03:34Z) - Learning to Search in Task and Motion Planning with Streams [20.003445874753233]
Task and motion planning problems in robotics combine symbolic planning over discrete task variables with motion optimization over continuous state and action variables.
We propose a geometrically informed symbolic planner that expands the set of objects and facts in a best-first manner.
We apply our algorithm on a 7DOF robotic arm in block-stacking manipulation tasks.
arXiv Detail & Related papers (2021-11-25T15:58:31Z) - Learning Models as Functionals of Signed-Distance Fields for
Manipulation Planning [51.74463056899926]
This work proposes an optimization-based manipulation planning framework where the objectives are learned functionals of signed-distance fields that represent objects in the scene.
We show that representing objects as signed-distance fields not only enables to learn and represent a variety of models with higher accuracy compared to point-cloud and occupancy measure representations.
arXiv Detail & Related papers (2021-10-02T12:36:58Z) - Multiple Plans are Better than One: Diverse Stochastic Planning [26.887796946596243]
In planning problems, it is often challenging to fully model the desired specifications.
In particular, in human-robot interaction, such difficulty may arise due to human's preferences that are either private or complex to model.
We formulate a problem, called diverse planning, that aims to generate a set of representative behaviors that are near-optimal.
arXiv Detail & Related papers (2020-12-31T07:29:11Z) - POMP: Pomcp-based Online Motion Planning for active visual search in
indoor environments [89.43830036483901]
We focus on the problem of learning an optimal policy for Active Visual Search (AVS) of objects in known indoor environments with an online setup.
Our POMP method uses as input the current pose of an agent and a RGB-D frame.
We validate our method on the publicly available AVD benchmark, achieving an average success rate of 0.76 with an average path length of 17.1.
arXiv Detail & Related papers (2020-09-17T08:23:50Z) - Meta Cyclical Annealing Schedule: A Simple Approach to Avoiding
Meta-Amortization Error [50.83356836818667]
We develop a novel meta-regularization objective using it cyclical annealing schedule and it maximum mean discrepancy (MMD) criterion.
The experimental results show that our approach substantially outperforms standard meta-learning algorithms.
arXiv Detail & Related papers (2020-03-04T04:43:16Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.