BOMP: Bin-Optimized Motion Planning

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Tam, Zachary, Dharmarajan, Karthik, Qiu, Tianshuang, Avigal, Yahav, Ichnowski, Jeffrey, Goldberg, Ken
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913569533067264
author Tam, Zachary
Dharmarajan, Karthik
Qiu, Tianshuang
Avigal, Yahav
Ichnowski, Jeffrey
Goldberg, Ken
author_facet Tam, Zachary
Dharmarajan, Karthik
Qiu, Tianshuang
Avigal, Yahav
Ichnowski, Jeffrey
Goldberg, Ken
contents In logistics, the ability to quickly compute and execute pick-and-place motions from bins is critical to increasing productivity. We present Bin-Optimized Motion Planning (BOMP), a motion planning framework that plans arm motions for a six-axis industrial robot with a long-nosed suction tool to remove boxes from deep bins. BOMP considers robot arm kinematics, actuation limits, the dimensions of a grasped box, and a varying height map of a bin environment to rapidly generate time-optimized, jerk-limited, and collision-free trajectories. The optimization is warm-started using a deep neural network trained offline in simulation with 25,000 scenes and corresponding trajectories. Experiments with 96 simulated and 15 physical environments suggest that BOMP generates collision-free trajectories that are up to 58 % faster than baseline sampling-based planners and up to 36 % faster than an industry-standard Up-Over-Down algorithm, which has an extremely low 15 % success rate in this context. BOMP also generates jerk-limited trajectories while baselines do not. Website: https://sites.google.com/berkeley.edu/bomp.
format Preprint
id arxiv_https___arxiv_org_abs_2411_00221
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle BOMP: Bin-Optimized Motion Planning
Tam, Zachary
Dharmarajan, Karthik
Qiu, Tianshuang
Avigal, Yahav
Ichnowski, Jeffrey
Goldberg, Ken
Robotics
Machine Learning
In logistics, the ability to quickly compute and execute pick-and-place motions from bins is critical to increasing productivity. We present Bin-Optimized Motion Planning (BOMP), a motion planning framework that plans arm motions for a six-axis industrial robot with a long-nosed suction tool to remove boxes from deep bins. BOMP considers robot arm kinematics, actuation limits, the dimensions of a grasped box, and a varying height map of a bin environment to rapidly generate time-optimized, jerk-limited, and collision-free trajectories. The optimization is warm-started using a deep neural network trained offline in simulation with 25,000 scenes and corresponding trajectories. Experiments with 96 simulated and 15 physical environments suggest that BOMP generates collision-free trajectories that are up to 58 % faster than baseline sampling-based planners and up to 36 % faster than an industry-standard Up-Over-Down algorithm, which has an extremely low 15 % success rate in this context. BOMP also generates jerk-limited trajectories while baselines do not. Website: https://sites.google.com/berkeley.edu/bomp.
title BOMP: Bin-Optimized Motion Planning
topic Robotics
Machine Learning
url https://arxiv.org/abs/2411.00221