Abstract
We present NoodlePrint, a generalized computational framework for maximally concurrent layer-wise cooperative 3D printing (C3DP) of arbitrary part geometries with multiple robots. NoodlePrint is inspired by a recently discovered set of helically interlocked space-filling shapes. Leveraging this unique geometric relationship, we introduce an algorithmic pipeline for generating helically interlocked cellular segmentation of arbitrary parts followed by layer-wise cell sequencing and path planning for cooperative 3D printing. Furthermore, we introduce a novel concurrence measure that quantifies the amount of printing parallelization across multiple robots. Consequently, we integrate this measure to optimize the location and orientation of a part for maximally parallel printing. We systematically study the relationship between the helix parameters (i.e., cellular interlocking), the cell size, the amount of concurrent printing, and the total printing time. Our study revealed that both concurrence and time to print primarily depend on the cell size, thereby allowing the determination of interlocking independent of time to print. To demonstrate the generality of our approach with respect to part geometry and the number of robots, we implemented two cooperative 3D printing systems with two and three printing robots and printed a variety of part geometries.
