Tuning robotic part feeder parameters to maximize throughput

被引:0
|
作者
Gudmundsson, D
Goldberg, K
机构
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study a programmable robotic part feeder that relies on a sequence of three conveyor belts to singulate and re-circulate parts. In industrial practice, belt speeds are set in an ad-hoc fashion. Experience with real feeders reveals that throughput can suffer due to (1) starvation where no parts are visible to the camera and (2) saturation, where too many parts are visible, which prevents identifying part pose or grasping due to obstruction by nearby parts. This motivates our search for a systematic approach to setting belt speeds. Our goal is to optimize throughput, measured in terms of how many parts per second are delivered from the robotic feeder. We describe a planar model of the belts with a Poisson arrival process to stochastically model how belt speeds affect throughput. Initially, we study the finite case where N parts are placed into the feeder and re-circulated until they are all delivered by the robot. Our first insight is that the vision belt should be run at maximum achievable velocity. We run simulations to empirically determine optimal buffer belt velocity as a function of lot size. Finally, we develop a theoretical model for the case where N = infinity, which approximates common usage where the buffer is replenished before it becomes empty. From this model, we derive the optimal buffer belt velocity and show that it produces throughput five times greater than that achieved with ad-hoc settings.
引用
收藏
页码:2440 / 2445
页数:6
相关论文
共 50 条
  • [41] Optimization of IMC-PID Tuning Parameters for Adaptive Control: Part 1
    Chu, Chih-Wei
    Ydstie, B. Erik
    Sahinidis, Nikolaos V.
    21ST EUROPEAN SYMPOSIUM ON COMPUTER AIDED PROCESS ENGINEERING, 2011, 29 : 758 - 762
  • [42] A study of single-machine scheduling problem to maximize throughput
    Nodari Vakhania
    Journal of Scheduling, 2013, 16 : 395 - 403
  • [43] A Note on Scheduling Equal-Length Jobs to Maximize Throughput
    Marek Chrobak
    Christoph Dürr
    Wojciech Jawor
    Łukasz Kowalik
    Maciej Kurowski
    Journal of Scheduling, 2006, 9 : 71 - 73
  • [44] Dynamics of part motion on a linear vibratory feeder
    Balaji, B.
    Gupta Burela, Ramesh
    Ponniah, Ganeshthangaraj
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART C-JOURNAL OF MECHANICAL ENGINEERING SCIENCE, 2022, 236 (02) : 886 - 893
  • [45] OPTIMAL CHOICE OF INTERMEDIATE LATCHING TO MAXIMIZE THROUGHPUT IN VLSI CIRCUITS
    CAPPELLO, PR
    LAPAUGH, A
    STEIGLITZ, K
    IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1984, 32 (01): : 28 - 33
  • [46] Host Software Stack Optimizations to Maximize Aggregate Fabric Throughput
    Ravi, Vignesh T.
    Erwin, James
    Sivakumar, Pradeep
    Tang, C. Q.
    Xiong, Jianxin
    Ganapathi, Ravindra Babu
    Debbage, Mark
    2017 IEEE 25TH ANNUAL SYMPOSIUM ON HIGH-PERFORMANCE INTERCONNECTS (HOTI), 2017, : 95 - 102
  • [47] A study of single-machine scheduling problem to maximize throughput
    Vakhania, Nodari
    JOURNAL OF SCHEDULING, 2013, 16 (04) : 395 - 403
  • [48] A note on scheduling equal-length jobs to maximize throughput
    Chrobak, M
    Dürr, C
    Jawor, W
    Kowalik, L
    Kurowski, M
    JOURNAL OF SCHEDULING, 2006, 9 (01) : 71 - 73
  • [49] Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput
    Agrawal, Kunal
    Li, Jing
    Lu, Kefu
    Moseley, Benjamin
    PROCEEDINGS OF THE 29TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'17), 2017, : 87 - 89
  • [50] Exploiting Multiple Rates to Maximize the Throughput of Wireless Mesh Networks
    Lin, Kate Ching-Ju
    Chou, Cheng-Fu
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (12) : 6038 - 6049