Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Optimizing Component-Placement Data

IP.com Disclosure Number: IPCOM000100751D
Original Publication Date: 1990-Jun-01
Included in the Prior Art Database: 2005-Mar-16
Document File: 2 page(s) / 54K

Publishing Venue

IBM

Related People

Ahmadi, JH: AUTHOR [+3]

Abstract

There is disclosed a technique for implementation in software which provides automatic numeric control (NC) program generation and placement optimization for an automatic component-placement machine of the type wherein the circuit board to be populated is positioned on an X-Y table and undergoes relative motion with respect to a robotic placement arm.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 96% of the total text.

Optimizing Component-Placement Data

       There is disclosed a technique for implementation in
software which provides automatic numeric control (NC) program
generation and placement optimization for an automatic
component-placement machine of the type wherein the circuit board to
be populated is positioned on an X-Y table and undergoes relative
motion with respect to a robotic placement arm.

      User input includes information such as dates, user-chosen file
names, board identification and characteristics of components to be
placed thereon.  Other required inputs include information particular
to placement machine make, such as parts feeder type and location.

      Program logic flow is shown in Fig. 1.  Optimization of X-Y
table movement is accomplished using the well-known traveling
salesman algorithm problem shown in Fig. 2.

      The concept is preferably implemented on a personal computer
system for those situations when time is of the essence and/or a few
boards only are to be populated. An optimized set of motions is
obtained in a relatively short time, yielding exceptionally good
results.

      When board volumes reach production levels, the technique may
be augmented with iterative placement data optimization using
three-opt and farthest insertion traveling salesman algorithms.  This
application is better run on a main frame, since significantly more
computation is required to yield a somewhat lower placement time per
board. This sho...