Teradyne, Inc.
SYSTEM AND METHOD FOR MULTI-GOAL PATH PLANNING

Abstract:

A method and computing system comprising identifying a plurality of robot configurations for each inspection point of a plurality of inspection points of a problem. A graph may be generated with each feasible robot configuration as a node on the graph. A distance may be calculated between a pair of feasible robot configurations. A shortest complete path connecting each node on the graph may be obtained based upon, at least in part, the distance between the pair of feasible robot configurations.