DBPF: A Framework for Efficient and Robust Dynamic Bin-Picking
<|reference_start|>DBPF: A Framework for Efficient and Robust Dynamic Bin-Picking: Efficiency and reliability are critical in robotic bin-picking as they directly impact the productivity of automated industrial processes. However, traditional approaches, demanding static objects and fixed collisions, lead to deployment limitations, operational inefficiencies, and process unreliability. This paper introduces a Dynamic Bin-Picking Framework (DBPF) that challenges traditional static assumptions. The DBPF endows the robot with the reactivity to pick multiple moving arbitrary objects while avoiding dynamic obstacles, such as the moving bin. Combined with scene-level pose generation, the proposed pose selection metric leverages the Tendency-Aware Manipulability Network optimizing suction pose determination. Heuristic task-specific designs like velocity-matching, dynamic obstacle avoidance, and the resight policy, enhance the picking success rate and reliability. Empirical experiments demonstrate the importance of these components. Our method achieves an average 84% success rate, surpassing the 60% of the most comparable baseline, crucially, with zero collisions. Further evaluations under diverse dynamic scenarios showcase DBPF's robust performance in dynamic bin-picking. Results suggest that our framework offers a promising solution for efficient and reliable robotic bin-picking under dynamics.<|reference_end|>
@article{li2024dbpf:,
    title={DBPF: A Framework for Efficient and Robust Dynamic Bin-Picking},
    author={Yichuan Li, Junkai Zhao, Yixiao Li, Zheng Wu, Rui Cao, Masayoshi
  Tomizuka, Yunhui Liu},
    journal={arXiv preprint arXiv:2403.16786},
    year={2024},
    doi={10.1109/LRA.2024.3387145},
    archivePrefix={arXiv},
    eprint={2403.16786},
    primaryClass={cs.RO cs.SY eess.SY}
}