Design of planar articulated mechanisms using branch and bound
DOI10.1007/S10107-005-0586-3zbMATH Open1066.70006OpenAlexW2068011066WikidataQ56050752 ScholiaQ56050752MaRDI QIDQ1780959FDOQ1780959
Authors: Mathias Stolpe, Atsushi Kawamoto 
Publication date: 14 June 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0586-3
Recommendations
- Articulated mechanism design with a degree of freedom constraint
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
- Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch‐and‐bound
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
- Path-generation of articulated mechanisms by shape and topology variations in non-linear truss representation
Applications of mathematical programming (90C90) Kinematics of mechanisms and robots (70B15) Robot dynamics and control of rigid bodies (70E60) Rods (beams, columns, shafts, arches, rings, etc.) (74K10) Optimization of other properties in solid mechanics (74P10)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Semidefinite Programming
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Robust Truss Topology Design via Semidefinite Programming
- Jointly constrained bilinear programs and related problems: An overview
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-reduce approach to global optimization
- Title not available (Why is that?)
- A symmetry extension of Maxwell's rule for rigidity of frames
- Title not available (Why is that?)
- Advanced preprocessing techniques for linear and quadratic programming
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- A bilinear approach to the pooling problem†
- Title not available (Why is that?)
- Title not available (Why is that?)
- Buckminster fuller's tensegrity structures and Clerk Maxwell's rules for the construction of stiff frames
- Modelling topology optimization problems as linear mixed 0-1 programs
- Presolving in linear programming
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- Equivalent displacement based formulations for maximum strength truss topology design
- Optimal Truss Design by Interior-Point Methods
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Title not available (Why is that?)
- A New Method for Optimal Truss Topology Design
- Optimal design of trusses under a nonconvex global buckling constraint
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch‐and‐bound
- Synthesis of mechanisms using time-varying dimensions
- Articulated mechanism design with a degree of freedom constraint
Cited In (9)
- Optimum exact/approximate point synthesis of planar mechanisms
- Articulated mechanism design with a degree of freedom constraint
- Topology optimization of planar linkage mechanisms
- Optimum dimensional synthesis of planar mechanisms with geometric constraints
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
- On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs
- Modeling and optimal design of neuro-mechanical shape memory devices
- Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
Uses Software
This page was built for publication: Design of planar articulated mechanisms using branch and bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780959)
