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.
翻译:深入学习的掌握的预测模型已成为机器人垃圾挑选系统的一个行业标准。 为了最大限度地取得成功,生产环境往往配备几种最终效果工具,可以根据目标对象进行实时交换。 然而,工具变化需要时间。 选择执行的掌握顺序和相应的工具变化行动可以改进系统输送过程;这是我们工作的主题。 规划工具变化的主要挑战是不确定性 - 我们通常无法看到目前隐蔽的垃圾桶中的对象。 在排队和接收控制问题的启发下,我们把问题模拟成一个Markov 决策程序(MDP),其目标是最大限度地实现预期产出的最大化,我们追求一种基于模型预测控制的近似解决办法,在每一阶段我们只根据目前可见的物体进行规划。我们的方法是空空空区域的概念,这些空空区域是未知的天体边界,因此在规划过程中无法解释。 我们的规划问题可以通过直线编程序(ILP)解决。 然而,我们发现,光线程序(MDP)将问题作为模型的模型转换成一个大致解决方案,而我们只能根据模型预测性的工作,我们最终提出一个精确的路径,我们通过精确的模型来测量结果。