A Note on a Motion Control Problem for a Placement Machine

Abstract

Assembling printed circuit boards effciently using automated placement machines is a challenging task. Here, we focus on a motion control problem for a specific type of placement machines. More specifically,the problem is to establish movement patterns for the robot arm, the feeder rack,and -when appropriate- the work table, of a sequential, pick-and-place machine. In this note we show that a (popular) greedy strategy may not always yield an optimum solution. However, under the Tchebychev metric, as well as under the Manhattan metric, we can model the problem as a linear program, thereby establishing the existence of a polynomial time algorithm for this motion control problem. Finally, we give experimental evidence that computing optimal solutions to this motion control problem can yield significantly better solutions than those found by a greedy method.

Keywords: Algorithms, Bids, Branch-and-price, Combinatorial auction, Complexity, Computational complexity, Exact algorithm, Mathematical programming, Matrix, Matrix bids, Research, Winner determination, Control, Printed circuit boards, Patterns, Work, Strategy, Yield, Model, Time, Optimal