A minimum manual component insertion algorithm for PCB assembly based on graph theory

In automated electronic printed circuit board assembly, it is cheaper to automatically assemble as many components as possible. This is done by creating a process plan that minimizes the number of conflicts between a component to be inserted and previously inserted components. This paper describes an algorithm based on graph theory that alleviates these conflicts by minimizing the number of PCB components that must be inserted manually. The algorithm handles parts that can be gripped in two possible directions. It can be used as an improved potential approach to process planning for PCBs.