skip to main content

Title: Accelerated fixed-point formulation of topology optimization: Application to compliance minimization problems
We present a simple, effective, and scalable approach for significantly accelerating the convergence in Topology Optimization simulations. Specifically, treating the design process as a fixed-point iteration, we propose employing a recently developed acceleration technique in which Anderson extrapolation is applied periodically, with simple weighted relaxation used for the remaining steps. Through selected examples in compliance minimization, we show that the proposed approach is able to accelerate the overall simulation several fold, while maintaining the quality of the solution.
; ;
Award ID(s):
Publication Date:
Journal Name:
Mechanics research communications
Page Range or eLocation-ID:
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract Lay Summary

    The Social Approach Task is widely used to assess social behavior in mice and is frequently used in studies modeling autism. However, reviewing published studies showed nearly half do not use correct comparisons to interpret these data. Using simulated and original data, we argue the correct statistical approach is a direct comparison of scores between groups. This simple solution should reduce false positives and improve consistency of results across studies.

    « less
  2. Abstract

    Assemblies of one-dimensional filaments appear in a wide range of physical systems: from biopolymer bundles, columnar liquid crystals, and superconductor vortex arrays; to familiar macroscopic materials, like ropes, cables, and textiles. Interactions between the constituent filaments in such systems are most sensitive to thedistance of closest approachbetween the central curves which approximate their configuration, subjecting these distinct assemblies to common geometric constraints. In this paper, we consider two distinct notions of constant spacing in multi-filament packings inR3:equidistance, where the distance of closest approach is constant along the length of filament pairs; andisometry, where the distances of closest approach between all neighboring filaments are constant and equal. We show that, although any smooth curve inR3permits one dimensional families of collinear equidistant curves belonging to a ruled surface, there are only two families of tangent fields with mutually equidistant integral curves inR3. The relative shapes and configurations of curves in these families are highly constrained: they must be either (isometric) developable domains, which can bend, but not twist; or (non-isometric) constant-pitch helical bundles, which can twist, but not bend. Thus, filament textures that are simultaneously bent and twisted, suchmore »as twisted toroids of condensed DNA plasmids or wire ropes, are doubly frustrated: twist frustrates constant neighbor spacing in the cross-section, while non-equidistance requires additional longitudinal variations of spacing along the filaments. To illustrate the consequences of the failure of equidistance, we compare spacing in three ‘almost equidistant’ ansatzes for twisted toroidal bundles and use our formulation of equidistance to construct upper bounds on the growth of longitudinal variations of spacing with bundle thickness.

    « less
  3. We consider recognition and reconfiguration of lattice-based cellular structures by very simple robots with only basic functionality. The underlying motivation is the construction and modification of space facilities of enormous dimensions, where the combination of new materials with extremely simple robots promises structures of previously unthinkable size and flexibility; this is also closely related to the newly emerging field of programmable matter. Aiming for large-scale scalability, both in terms of the number of the cellular components of a structure, as well as the number of robots that are being deployed for construction requires simple yet robust robots and mechanisms, while also dealing with various basic constraints, such as connectivity of a structure during reconfiguration. To this end, we propose an approach that combines ultra-light, cellular building materials with extremely simple robots. We develop basic algorithmic methods that are able to detect and reconfigure arbitrary cellular structures, based on robots that have only constant-sized memory. As a proof of concept, we demonstrate the feasibility of this approach for specific cellular materials and robots that have been developed at NASA.
  4. Abstract

    Objective.Combined proton–photon treatments, where most fractions are delivered with photons and only a few are delivered with protons, may represent a practical approach to optimally use limited proton resources. It has been shown that, when organs at risk (OARs) are located within or near the tumor, the optimal multi-modality treatment uses protons to hypofractionate parts of the target volume and photons to achieve near-uniform fractionation in dose-limiting healthy tissues, thus exploiting the fractionation effect. These plans may be sensitive to range and setup errors, especially misalignments between proton and photon doses. Thus, we developed a novel stochastic optimization method to directly incorporate these uncertainties into the biologically effective dose (BED)-based simultaneous optimization of proton and photon plans.Approach.The method considers the expected valueEband standard deviationσbof the cumulative BEDbin every voxel of a structure. For the target, a piecewise quadratic penalty function of the formbminEb2σb+2is minimized, aiming for plans in which the expected BED minus two times the standard deviation exceeds the prescribed BEDbmin.Analogously,more »close=')' open='(' separators=''>Eb+2σbbmax+2is considered for OARs.Main results.Using a spinal metastasis case and a liver cancer patient, it is demonstrated that the novel stochastic optimization method yields robust combined treatment plans. Tumor coverage and a good sparing of the main OARs are maintained despite range and setup errors, and especially misalignments between proton and photon doses. This is achieved without explicitly considering all combinations of proton and photon error scenarios.Significance.Concerns about range and setup errors for safe clinical implementation of optimized proton–photon radiotherapy can be addressed through an appropriate stochastic planning method.

    « less
  5. Abstract

    Objective.High-density electromyography (HD-EMG) decomposition algorithms are used to identify individual motor unit (MU) spike trains, which collectively constitute the neural code of movements, to predict motor intent. This approach has advanced from offline to online decomposition, from isometric to dynamic contractions, leading to a wide range of neural-machine interface applications. However, current online methods need offline retraining when applied to the same muscle on a different day or to a different person, which limits their applications in a real-time neural-machine interface. We proposed a deep convolutional neural network (CNN) framework for neural drive estimation, which takes in frames of HD-EMG signals as input, extracts general spatiotemporal properties of MU action potentials, and outputs the number of spikes in each frame. The deep CNN can generalize its application without retraining to HD-EMG data recorded in separate sessions, muscles, or participants.Approach.We recorded HD-EMG signals from the vastus medialis and vastus lateralis muscles from five participants while they performed isometric contractions during two sessions separated by ∼20 months. We identified MU spike trains from HD-EMG signals using a convolutive blind source separation (BSS) method, and then used the cumulative spike train (CST) of these MUs and the HD-EMG signals to train andmore »validate the deep CNN.Main results.On average, the correlation coefficients between CST from the BSS and that from deep CNN were0.983±0.006for leave-one-out across-sessions-and-muscles validation and0.989±0.002for leave-one-out across-participants validation. When trained with more than four datasets, the performance of deep CNN saturated at0.984±0.001for cross validations across muscles, sessions, and participants.Significance.We can conclude that the deep CNN is generalizable across the aforementioned conditions without retraining. We could potentially generate a robust deep CNN to estimate neural drive to muscles for neural-machine interfaces.

    « less