Convex Relaxation for Optimal Fixture Layout Design
From MaRDI portal
Publication:6401293
arXiv2206.02877MaRDI QIDQ6401293FDOQ6401293
Jeffrey H. Hunt, Jianjun Shi, Zhen Zhong, Shancong Mou
Publication date: 6 June 2022
Abstract: This paper proposes a general fixture layout design framework that directly integrates the system equation with the convex relaxation method. Note that the optimal fixture design problem is a large-scale combinatorial optimization problem, we relax it to a convex semidefinite programming (SDP) problem by adopting sparse learning and SDP relaxation techniques. It can be solved efficiently by existing convex optimization algorithms and thus generates a near-optimal fixture layout. A real case study in the half-to-half fuselage assembly process indicates the superiority of our proposed algorithm compared to the current industry practice and state-of-art methods.
This page was built for publication: Convex Relaxation for Optimal Fixture Layout Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6401293)
