Loading…

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 pr...

Full description

Saved in:
Bibliographic Details
Published in:Mechanism and machine theory 2003-06, Vol.38 (6), p.579-594
Main Authors: SANCHEZ MARIN, Francisco T, PEREZ GONZALEZ, Antonio
Format: Article
Language:English
Subjects:
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0094-114X
1873-3999
DOI:10.1016/S0094-114X(03)00010-7