scispace - formally typeset
Search or ask a question
Topic

Minimum weight

About: Minimum weight is a research topic. Over the lifetime, 2002 publications have been published within this topic receiving 28244 citations.


Papers
More filters
Proceedings ArticleDOI
01 Aug 1997
TL;DR: A polynomial-time algorithm is given that computes a triangulations compatible with a set of polyhedral obstacles; the area of the triangulation is within a multiplicative constant of the smallest possible.
Abstract: Consider an environment filled with polyhedral obstacles. The answer to aray-shoottng queyis the first obstacle encountered by the ray. A simple way to answer ray-shooting queries is to triangulate space in a manner compatible with theobstades,and then walk through thetriangulation along therayuntil the first obstacle is encountered. Weshow that the average walk length can be reduced by choosing a triangulation with weight (i.e., length in two dimensions or area in three dimensions) as small as possible. In two dimensions, we observe that the length of the minimum-length triangulation can be estimated by the total length of the obstacles plus the total length of a minimum spanuing tree of the obstacles, up to a logarithmic factor; this gives an a prior-i estimate of the average-cese walk length. Our main result is in three dimensions. We give a polynomial-time algorithm that computes a triangulation compatible with a set of polyhedral obstacles; the area of the triangulation is within a multiplicative constant of the smallest possible.

16 citations

Journal ArticleDOI
TL;DR: In this article, the guide-weight method and its Lagrange multipliers' solution methods are presented to solve two kinds of topology optimization problems with multiple loads in two different scenarios.
Abstract: The guide-weight method is introduced to solve two kinds of topology optimization problems with multiple loads in this paper. The guide-weight method and its Lagrange multipliers’ solution methods are presented first, and the Lagrange multipliers’ solution method of problems with multiple constraints is improved by the dual method. Then the iterative formulas of the guide-weight method for topology optimization problems of minimum compliance and minimum weight are derived and corresponding numerical examples are calculated. The results of the examples exhibits that when the guide-weight method is used to solve topology optimization problems with multiple loads, it works very well with simple iterative formulas, and has fast convergence and good solution. After comparison with the results calculated by the SCP method in Ansys, one can conclude that the guide-weight method is an effective method and it provides a new way for solving topology optimization problems.

16 citations

Proceedings ArticleDOI
02 May 1993
TL;DR: Numerical analysis shows that the weight of a flexible manipulator can be reduced significantly through the optimal distribution of mass and stiffness.
Abstract: The problem of designing a minimum-weight one-link flexible manipulator for a given fundamental vibration frequency is investigated. The optimum design problem is investigated. The optimum design problem is formulated by using the variational method. Iteration schemes are developed for solving the nonlinear Euler equations derived from variational calculus in various situations. Numerical analysis shows that the weight of a flexible manipulator can be reduced significantly through the optimal distribution of mass and stiffness. >

16 citations

Journal ArticleDOI
TL;DR: In this paper, a technique for the optimization of stability-constrained geometrically nonlinear shallow trusses with snap-through behavior is demonstrated using the arc length method and a strain energy density approach within a discrete finite-element formulation.

16 citations

Journal ArticleDOI
TL;DR: The results show the possibility to treat two-objectives problems, even if the two objectives are apparently conflicting, finally finding a compromize that minimizes both the volume and the compliance of the structure.

16 citations


Network Information
Related Topics (5)
Upper and lower bounds
56.9K papers, 1.1M citations
76% related
Time complexity
36K papers, 879.5K citations
73% related
Numerical analysis
52.2K papers, 1.2M citations
73% related
Optimization problem
96.4K papers, 2.1M citations
73% related
Polynomial
52.6K papers, 853.1K citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202321
202239
202153
202051
201966
201858