BOMP: Bin-Optimized Motion Planning
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.
Authors
- Jeffrey Ichnowski (ORCID: https://orcid.org/0000-0003-4874-9478)
- Zachary Tam
- Ken Goldberg (ORCID: https://orcid.org/0000-0002-2661-4524)
- Yahav Avigal
- Karthik Dharmarajan
- Tianshuang Qiu
Institutions
- Berkeley Systems (United States) (US)
- Carnegie Mellon University (US)
- University of California, Berkeley (US)
Publication Details
- Published
- 2024-10-14
- DOI
- https://doi.org/10.1109/iros58592.2024.10801312
- Citations
- 2
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.50