Motion planning efficient trajectories for industrial bin-picking
- 20 June 2013
- journal article
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 32 (9-10), 991-1004
- https://doi.org/10.1177/0278364913487237
Abstract
This paper presents an algorithm for planning efficient trajectories in a bin-picking scenario. The presented algorithm is designed to provide paths, which are applicable for typical industrial manipulators, and does not require customized research interfaces to the robot controller. The method provides paths (almost) instantaneously, which is important for running efficiently in production. To achieve this, the method utilizes that all motions start and end within sub-volumes of the work envelope. A database of paths can thus be pre-computed, such that all paths are optimized with respect to a specified cost function, thereby ensuring close to optimal solutions. When queried, the method searches the database for a feasible path candidate and adapts it to the specific query. To achieve an efficient execution on the robot, blends are added to ensure a smooth transition between segments. Two algorithms for calculating feasible blends based on the clearance between robot and obstacles are therefore provided. Finally, the method is tested in a real bin-picking application where it solves queries efficiently and provides paths, which are significantly faster than those currently used for bin-picking in the industry.Keywords
This publication has 24 references indexed in Scilit:
- Robust 3D object registration without explicit correspondence using geometric integrationMachine Vision and Applications, 2009
- Motion Planning for Legged Robots on Varied TerrainThe International Journal of Robotics Research, 2008
- Creating High-quality Paths for Motion PlanningThe International Journal of Robotics Research, 2007
- Anytime RRTsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Smart robot that picks parts from binsAssembly Automation, 2006
- Planning AlgorithmsPublished by Cambridge University Press (CUP) ,2006
- A Monte-Carlo algorithm for path planning with many degrees of freedomPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- OBBTreePublished by Association for Computing Machinery (ACM) ,1996
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975