Title: Mechanical cloak via data-driven aperiodic metamaterial design
Mechanical cloaks are materials engineered to manipulate the elastic response around objects to make them indistinguishable from their homogeneous surroundings. Typically, methods based on material-parameter transformations are used to design optical, thermal, and electric cloaks. However, they are not applicable in designing mechanical cloaks, since continuum-mechanics equations are not form invariant under general coordinate transformations. As a result, existing design methods for mechanical cloaks have so far been limited to a narrow selection of voids with simple shapes. To address this challenge, we present a systematic, data-driven design approach to create mechanical cloaks composed of aperiodic metamaterials using a large precomputed unit cell database. Our method is flexible to allow the design of cloaks with various boundary conditions, multiple loadings, different shapes and numbers of voids, and different homogeneous surroundings. It enables a concurrent optimization of both topology and properties distribution of the cloak. Compared to conventional fixed-shape solutions, this results in an overall better cloaking performance and offers unparalleled versatility. Experimental measurements on additively manufactured structures further confirm the validity of the proposed approach. Our research illustrates the benefits of data-driven approaches in quickly responding to new design scenarios and resolving the computational challenge associated with multiscale designs of functional structures. It could be generalized to accommodate other applications that require heterogeneous property distribution, such as soft robots and implants design.  more » « less
Award ID(s):
1835677 1835782 1835648
PAR ID:
10378213
Author(s) / Creator(s):
; ; ; ; ;
Date Published:
Journal Name:
Proceedings of the National Academy of Sciences
Volume:
119
Issue:
13
ISSN:
0027-8424
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Zero Poisson’s ratio structures are a new class of mechanical metamaterials wherein the absence of lateral deformations allows the structure to adapt and conform their geometries to desired shapes with minimal interventions. These structures have gained attention in large deformation applications where shape control is a key performance attribute, with examples including but not limited to shape morphing, soft robotics, and flexible electronics. The present study introduces an experimentally driven approach that leads to the design and development of (near) zero Poisson’s ratio structures with considerable load-bearing capacities through concurrent density and architecture gradations in hybrid honeycombs created from hexagonal and re-entrant cells. The strain-dependent Poisson’s ratios in hexagonal and re-entrant honeycombs with various cell wall thicknesses have been characterized experimentally. A mathematical approach is then proposed and utilized to create hybrid structures wherein the spatial distribution of different cell shapes and densities leads to the development of honeycombs with minimal lateral deformations under compressive strains as high as 0.7. Although not considered design criteria, the load-bearing and energy absorption capacities of the hybrid structures are shown to be comparable with those of uniform cell counterparts. Finally, the new hybrid structures indicate lesser degrees of instability (in the form of cell buckling and collapse) due to the self-constraining effects imposed internally by the adjacent cell rows in the structures. 
    more » « less
  2. Pre-trained graph neural networks (GNNs) have demonstrated significant success in leveraging large-scale graph data to learn transferable representations. However, their performance often degrades under distribution shifts, particularly in real-world scenarios where test labels are unavailable. To address this challenge, we propose Graph Optimization via Augmented Transformations (GOAT), a novel self-supervised test-time tuning paradigm that adapts pre-trained GNNs to distribution-shifted test data by focusing exclusively on node feature transformations. By avoiding complex and often suboptimal graph structure transformations, GOAT overcomes the limitations of existing data-centric methods. To further address the issue of transformation collapse, where feature transformations converge to trivial solutions—such as when the test-time learned data-centric transformation degenerates into a constant or identity mapping across different inputs, we introduce a parameter-efficient low-rank adapter that generates diverse transformations tailored to individual input graphs. This design not only enhances adaptation performance but also improves interpretability by avoiding modifications to the graph structure. Through extensive experiments on six real-world datasets with diverse distribution shifts, we demonstrate that GOAT achieves consistent performance improvements across different pre-trained GNN backbones, outperforming state-of-the-art test-time adaptation methods. 
    more » « less
  3. Soft deployable structures – unlike conventional piecewise rigid deployables based on hinges and springs – can assume intricate 3‐D shapes, thereby enabling transformative soft robotic and manufacturing technologies. Their virtually infinite degrees of freedom allow precise control over the final shape. The same enabling high dimensionality, however, poses a challenge for solving the inverse problem: fabrication of desired 3D structures requires manufacturing technologies with extensive local actuation and control, and a trial‐and‐error search over a large design space. Both of these shortcomings are addressed by first developing a simplified planar fabrication approach that combines two ingredients: strain mismatch between two layers of a composite shell and kirigami cuts that relieves localized stress. In principle, it is possible to generate targeted 3‐D shapes by designing the appropriate kirigami cuts and the amount of prestretch (without any local control). Second, a data‐driven physics‐guided framework is formulated that reduces the dimensionality of the inverse design problem using autoencoders and efficiently searches through the “latent” parameter space in an active learning approach. The rapid design procedure is demonstrated via a range of target shapes, such as peanuts, pringles, flowers, and pyramids. Experiments and our numerical predictions are found to be in good agreement. 
    more » « less
  4. null (Ed.)
    Concolic testing combines concrete execution with symbolic execution along the executed path to automatically generate new test inputs that exercise program paths and deliver high code coverage during testing. The GKLEE tool uses this approach to expose data races in CUDA programs written for execution of GPGPUs. In programs employing concurrent dynamic data structures, automatic generation of data structures with appropriate shapes that cause threads to follow selected, possibly divergent, paths is a challenge. Moreover, a single non-conflicting data structure must be generated for multiple threads, that is, a single shape must be found that simultaneously causes all threads to follow their respective chosen paths. When an execution exposes a bug (e.g., a data race), the generated data structure shape helps the programmer understand the cause of the bug. Because GKLEE does not permit pointers that construct dynamic data structures to be made symbolic, it cannot automatically generate data structures of different shapes and must rely on the user to write code that constructs them to exercise desired paths. We have developed DSGEN for automatically generating non-conflicting dynamic data structures with different shapes and integrated it with GKLEE to uncover and facilitate understanding of data races in programs that employ complex concurrent dynamic data structures. In comparison to GKLEE, DSGEN increases the number of races detected from 10 to 25 by automatically generating a total of 1,897 shapes in implementations of four complex concurrent dynamic data structures -- B-Tree, Hash-Array Mapped Trie, RRB-Tree, and Skip List. 
    more » « less
  5. Abstract Magnetically actuated intelligent structures have shown great promise in various applications ranging from soft robotics to biomedical devices. One important type of structure involves embedding rigid magnets in polymer matrices, thanks to their simplicity in manufacturing and flexibility in structure design. However, accurately modeling their behavior remains challenging due to the strong nonlinear coupling between large deformation and spatially varying magnetic fields. To address this, we employ a fictitious magnetic charge method to transfer the magnetic forces and torques into surface traction under both uniform and nonuniform external magnetic actuation. We implement the proposed method in the commercial finite element software abaqus and validate it through a series of benchmark examples, which cover tuning the area of magneto-mechanical metamaterials, the shape changing of magnetic lattice structures, and the magnetic-field-driven buckling of cellular structures. Our approach enables accurate prediction of shape transformations in magnetically responsive structures, offering a practical tool for the design and optimization of future magneto-mechanical metamaterials and devices. 
    more » « less