Global-Local Search for Topology Optimization of Linkage Mechanisms Using Spring-Connected Link Model

Abstract This study presents a novel optimization-based synthesis framework for linkage mechanisms with a single degree-of-freedom. Current topology optimization-based mechanism synthesis methods often result in infeasible solutions due to the highly nonlinear and multi-modal nature of the objective function. To address this, we propose a new optimization framework that uses binary links as design components, defining candidate mechanisms through node adjacency matrices that specify topologies, end effector positions, and ground-anchoring nodes. These candidates are screened for invalid motions and topologies by considering reducibility and isomorphism. Our approach conducts global-local optimization exclusively on candidates with valid degrees-of-freedom, ensuring a higher chance of identifying feasible solutions by avoiding the exploration of invalid mechanisms. The first optimization step involves a global search that simultaneously optimizes the topology and shape of a linkage to best follow the target path. The second step fine-tunes the linkage shape by optimizing the nodal coordinates. The effectiveness of the proposed method is validated through case studies, demonstrating its capability to solve mechanisms with up to seven-node linkages.

Authors

Institutions

Publication Details

Journal
Journal of Mechanical Design
Published
2025-04-18
DOI
https://doi.org/10.1115/1.4068488
Citations
2
Primary Topic
Robotic Mechanisms and Dynamics
Type
article
Field-Weighted Citation Impact
2.43

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Global-Local Search for Topology Optimization of Linkage Mechanisms Using Spring-Connected Link Model

Ikjin Lee, Y.C. Park, Jihwan Park, Gang‐Won Jang et al.
2 citations
Journal of Mechanical Design
Robotic Mechanisms and Dynamics
2.43
article

Global-Local Search for Topology Optimization of Linkage Mechanisms Using Spring-Connected Link Model

Ikjin Lee, Y.C. Park, Jihwan Park, Gang‐Won Jang, Quang Dat Tran
article en
2 citations

Abstract

Abstract This study presents a novel optimization-based synthesis framework for linkage mechanisms with a single degree-of-freedom. Current topology optimization-based mechanism synthesis methods often result in infeasible solutions due to the highly nonlinear and multi-modal nature of the objective function. To address this, we propose a new optimization framework that uses binary links as design components, defining candidate mechanisms through node adjacency matrices that specify topologies, end effector positions, and ground-anchoring nodes. These candidates are screened for invalid motions and topologies by considering reducibility and isomorphism. Our approach conducts global-local optimization exclusively on candidates with valid degrees-of-freedom, ensuring a higher chance of identifying feasible solutions by avoiding the exploration of invalid mechanisms. The first optimization step involves a global search that simultaneously optimizes the topology and shape of a linkage to best follow the target path. The second step fine-tunes the linkage shape by optimizing the nodal coordinates. The effectiveness of the proposed method is validated through case studies, demonstrating its capability to solve mechanisms with up to seven-node linkages.

Journal of Mechanical DesignVol. 147(11)
Daejeon University (KR), Korea Advanced Institute of Science and Technology (KR), Sejong University (KR)
National Research Foundation of Korea
Openalex Percentile: Top 12%
Robotic Mechanisms and Dynamics
2.43
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.