Global optimization in path synthesis based on design space reduction

In this paper, the global optimum obtaining problem in approximate path synthesis of linkages is considered. A combined gross-fine search method is suggested as optimization strategy. The application of a design space reduction technique decreases considerably the computational cost and makes the problem affordable. The approach has been satisfactorily tested with several examples. The low times of computation prove the efficiency of the method.