skip to main content


Title: Interlocking block assembly
This paper presents a design for interlocking blocks and an algorithm that allows these blocks to be assembled into desired shapes. During and after assembly, the structure is kinematically interlocked if a small number of blocks are immobilized relative to other blocks. There are two types of blocks: cubes and double-height posts, each with a particular set of male and female joints. Layouts for shapes involving thousands of blocks have been planned automatically, and shapes with several hundred blocks have been built by hand. As a proof of concept, a robot was used to assemble sixteen blocks. The paper also describes a method for assembling blocks in parallel.  more » « less
Award ID(s):
1813043
NSF-PAR ID:
10113080
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Workshop on the Algorithmic Foundations of Robotics
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    With improving biofabrication technology, 3D bioprinted constructs increasingly resemble real tissues. However, the fundamental principles describing how cell-generated forces within these constructs drive deformations, mechanical instabilities, and structural failures have not been established, even for basic biofabricated building blocks. Here we investigate mechanical behaviours of 3D printed microbeams made from living cells and extracellular matrix, bioprinting these simple structural elements into a 3D culture medium made from packed microgels, creating a mechanically controlled environment that allows the beams to evolve under cell-generated forces. By varying the properties of the beams and the surrounding microgel medium, we explore the mechanical behaviours exhibited by these structures. We observe buckling, axial contraction, failure, and total static stability, and we develop mechanical models of cell-ECM microbeam mechanics. We envision these models and their generalizations to other fundamental 3D shapes to facilitate the predictable design of biofabricated structures using simple building blocks in the future.

     
    more » « less
  2. Abstract

    Building a live cell from non‐living building blocks would be a fundamental breakthrough in biological sciences, and it would enable engineering new lineages of life, not directly descendant of the Last Universal Common Ancestor. Fully engineered synthetic cells will have architectures that can be radically different from the natural cells, yet most life processes reconstituted in synthetic cells so far are built from natural and biosimilar building blocks. Most natural processes have already been reconstituted in synthetic cell chassis. This paper summarizes recent advancements in using non‐living building blocks to reconstitute some of the most crucial features of living systems in a fully engineerable chassis of a synthetic cell.

     
    more » « less
  3. Dielectric elastomer actuators (DEAs) are among the fastest and most energy-efficient, shape-morphing materials. To date, their shapes have been controlled using patterned electrodes or stiffening elements. While their actuated shapes can be analyzed for prescribed configurations of electrodes or stiffening elements (the forward problem), the design of DEAs that morph into target shapes (the inverse problem) has not been fully addressed. Here, we report a simple analytical solution for the inverse design and fabrication of programmable shape-morphing DEAs. To realize the target shape, two mechanisms are combined to locally control the actuation magnitude and direction by patterning the number of local active layers and stiff rings of varying shapes, respectively. Our combined design and fabrication strategy enables the creation of complex DEA architectures that shape-morph into simple target shapes, for instance, those with zero, positive, and negative Gaussian curvatures as well as complex shapes, such as a face.

     
    more » « less
  4. FPGAs are well-suited for accelerating deep learning (DL) applications owing to the rapidly changing algorithms, network architectures and computation requirements in this field. However, the generic building blocks available on traditional FPGAs limit the acceleration that can be achieved. Many modifications to FPGA architecture have been proposed and deployed including adding specialized artificial intelligence (AI) processing engines, adding support for smaller precision math like 8-bit fixed point and IEEE half-precision (fp16) in DSP slices, adding shadow multipliers in logic blocks, etc. In this paper, we describe replacing a portion of the FPGA’s programmable logic area with Tensor Slices. These slices have a systolic array of processing elements at their heart that support multiple tensor operations, multiple dynamically-selectable precisions and can be dynamically fractured into individual multipliers and MACs (multiply-and-accumulate). These slices have a local crossbar at the inputs that helps with easing the routing pressure caused by a large block on the FPGA. Adding these DL-specific coarse-grained hard blocks to FPGAs increases their compute density and makes them even better hardware accelerators for DL applications, while still keeping the vast majority of the real estate on the FPGA programmable at fine-grain. 
    more » « less
  5. Though many compilation and runtime systems have been developed for DNNs in recent years, the focus has largely been on static DNNs. Dynamic DNNs, where tensor shapes and sizes and even the set of operators used are dependent upon the input and/or execution are becoming common. This paper presents SoD2, a comprehensive framework for optimizing Dynamic DNNs. The basis of our approach is a classification of common operators that form DNNs, and the use of this classification towards a Rank and Dimension Propagation (RDP) method. This framework statically determines the shapes of operators as known constants, symbolic constants, or operations on these. Next, using RDP we enable a series of optimizations, like fused code generation, execution (order) planning, and even runtime memory allocation plan generation. By evaluating the framework on 10 emerging Dynamic DNNs and comparing it against several existing systems, we demonstrate both reductions in execution latency and memory requirements, with RDP-enabled key optimizations responsible for much of the gains. 
    more » « less