Journal ArticleDOI
Optimization of variable stiffness laminates with gap-overlap and curvature constraints
TLDR
In this paper, the gap-overlap and curvature constraints on fiber tows are considered in the design optimization of variable stiffness laminates, and the problem of compliance minimization with manufacturability constraints is solved with the MMA optimization algorithm.About:
This article is published in Composite Structures.The article was published on 2019-12-15. It has received 18 citations till now. The article focuses on the topics: Rectangle & Curvature.read more
Citations
More filters
Journal ArticleDOI
An inverse approach to the accurate modelling of 3D-printed sandwich panels with lattice core using beams of variable cross-section
TL;DR: In this paper, a novel approach for the modeling of lattice structures based on beam elements with variable cross-section is proposed. But the authors do not consider the material concentration in the vicinity of the intersecting nodes and general defects in the member struts issued from AM.
Journal ArticleDOI
Optimization of parts manufactured using continuous fiber three-dimensional printing technology
TL;DR: In this article, a topology optimization framework for continuous composite fiber 3D printing is presented, which allows optimization of parts within complex computer-aided design models and considers different types of nonlinearities in the finite-element model.
Journal ArticleDOI
Manufacturable insight into modelling and design considerations in fibre-steered composite laminates: state of the art and perspective
TL;DR: In this article, the authors summarize and discuss underlying fiber placement technologies including tailored fiber placement (TFP), continuous tow shearing (CTS), and automated fibre placement (AFP), followed by a detailed discussion on the manufacturing limitations and constraints of the AFP process.
Journal ArticleDOI
A parametric divergence-free vector field method for the optimization of composite structures with curvilinear fibers
TL;DR: In this paper, a parametric divergence-free vector field (pDVF) is constructed through an expansion by using a set of basis vector fields, and the expansion coefficients are regarded as design variables in the optimization.
Journal ArticleDOI
Topology optimization with discrete geometric components made of composite materials
Hollis A. Smith,Julián A. Norato +1 more
TL;DR: A novel topology optimization (TO) method for the design of structures composed of bars that are made of an orthotropic, fiber-reinforced material that interpolation of the material properties at the junction of multiple bars ensures that the optimizer chooses the single best material.
References
More filters
Journal ArticleDOI
The method of moving asymptotes—a new method for structural optimization
TL;DR: In this article, a new method for non-linear programming in general and structural optimization in particular is presented, in which a strictly convex approximating subproblem is generated and solved.
Journal ArticleDOI
Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science (2nd edition)
Journal ArticleDOI
A fast marching level set method for monotonically advancing fronts
TL;DR: A fast marching level set method is presented for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation.
Book
Level set methods and fast marching methods : evolving interfaces in computational geometry, fluid mechanics, computer vision, and materials science
TL;DR: In this paper, the Hamilton-Jacobi equations and associated theory are used to formulate the interface propagation problem and then algorithms for the initial and boundary value formulations are proposed for semi-conductor manufacturing.
Journal ArticleDOI
A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
TL;DR: This paper deals with a certain class of optimization methods, based on conservative convex separable approximations (CCSA), for solving inequality-constrained nonlinear programming problems, and it is proved that the sequence of iteration points converges toward the set of Karush--Kuhn--Tucker points.