Freeform Assembly Planning
Matthew K. Gelber, Greg Hurst, Rohit Bhargava

TL;DR
This paper addresses the complex planning problem in freeform 3D printing, proposing algorithms to generate feasible printing sequences that maximize fidelity and reduce failure, validated through experimental printing of intricate structures.
Contribution
The authors develop a novel sequencing algorithm for freeform assembly that handles process constraints and is validated on complex, real-world structures.
Findings
Determining feasible sequences is NP-complete in general.
For typical topologies, finding feasible or optimal sequences is tractable.
Experimental validation with thousands of microfilaments demonstrates the approach's effectiveness.
Abstract
3D printing enables the fabrication of complex architectures by automating long sequences of additive steps. The increasing sophistication of printers, materials, and generative design promises to make geometric complexity a non-issue in manufacturing; however, this complexity can only be realized if a design can be translated into a physically executable sequence of printing operations. We investigate this planning problem for freeform direct-write assembly, in which filaments of material are deposited through a nozzle translating along a 3D path to create sparse, frame-like structures. We enumerate the process constraints for different variants of the freeform assembly process and show that, in the case where material stiffens via a glass transition, determining whether a feasible sequence exists is NP-complete. Nonetheless, for topologies typically encountered in real-world…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
