Single-probe traversal optimization for testing of MCM substrate interconnections

Collision-free motion planning and scheduling

“…5(b) and 6(b)), and a cost function is defined for each sequence where the distance D is calculated according to (6). The number of stages ns is introduced to take into account the loss of time caused by accelerations and decelerations.…”

“…Nevertheless, papers dealing with flying probe testing have referred to multi-chip modules (MCM) [6][7][8], in which no obstacles were present and any point could be accessed by any probe. The flatness of the modules permits both a direct path calculation and very simple coordination procedures in the case of detecting interferences between the movements of the probes [9].…”

A heuristic algorithm to generate test program sequences for moving probe electronic test equipment

“…Crowell and Keogh (1984) are among the first to show how the unlimited testing flexibility of the test makes it useful for electronic manufacturers. Tests that previously took weeks to develop, due to the need to build a test fixture, are now available in hours (Hassig, 1998) (Pendurkar, Tovey, Chatterjee, 1999). For multiple probes, Chou and Cheng (1993) developed an algorithm based on multidimensional traveling salesman problem (MDTSP).…”

“…This technique detects attenuation of the test stimulus applied through a tuned load using a single probe. Cost of equipment of single-probe tester is cheaper than multiple-probes (Pendurkar, Tovey, Chatterjee, 1999) and that have made some authors developed algorithms to solve the sequence for the single probe test. This new technique has the potential to be faster, cheaper and then more cost effective.…”

“…This new technique has the potential to be faster, cheaper and then more cost effective. Pendurkar, Tovey, Chatterjee (1999) assessed the advantage of single-probe test over double-probe test and intended to confirm that single-probe testing has an increasing advantage over double-probe testing as the number of nets increases. After that, they Satisfactory low-cost results are also obtained with an algorithm proposed by Kim, Pinshan and Se Hyun (1999).…”