- Award ID(s):
- 1914249
- Publication Date:
- NSF-PAR ID:
- 10209029
- Journal Name:
- Journal of Computing and Information Science in Engineering
- Volume:
- 20
- Issue:
- 4
- ISSN:
- 1530-9827
- Sponsoring Org:
- National Science Foundation
More Like this
-
Cooperative 3D printing (C3DP) is a novel approach to additive manufacturing, where multiple printhead-carrying mobile robots work together cooperatively to print a desired part. The core of C3DP is the chunk-based printing strategy in which the desired part is first split into smaller chunks, and then the chunks are assigned to individual printing robots. These robots will work on the chunks simultaneously and in a scheduled sequence until the entire part is complete. Though promising, C3DP lacks proper framework that enables automatic chunking and scheduling given the available number of robots. In this study, we develop a computational framework that can automatically generate print schedule for specified number of chunks. The framework contains 1) a random generator that creates random print schedule using adjacency matrix which represents directed dependency tree (DDT) structure of chunks; 2) a set of geometric constraints against which the randomly generated schedules will be checked for validation; and 3) a printing time evaluation metric for comparing the performance of all valid schedules. With the developed framework, we present a case study by printing a large rectangular plate which has dimensions beyond what traditional desktop printers can print. The study showcases that our computation framework can successfullymore »
-
Abstract Cooperative 3D printing (C3DP) is a novel approach to additive manufacturing, where multiple printhead-carrying mobile robots work cooperatively to print the desired part. The core of C3DP is the chunk-based printing strategy in which the desired part is first split into smaller chunks and then the chunks are assigned to individual robots to print and bond. These robots will work simultaneously in a scheduled sequence to print the entire part. Although promising, C3DP lacks a generative approach that enables automatic chunking and scheduling. In this study, we aim to develop a generative approach that can automatically generate different print schedules for a chunked object by exploring a larger solution space that is often beyond the capability of human cognition. The generative approach contains (1) a random generator of diverse print schedules based on an adjacency matrix that represents a directed dependency tree structure of chunks; (2) a set of geometric constraints against which the randomly generated schedules will be checked for validation, and (3) a printing time evaluator for comparing the performance of all valid schedules. We demonstrate the efficacy of the generative approach using two case studies: a large simple rectangular bar and a miniature folding sport utilitymore »
-
Abstract Cooperative 3D printing (C3DP) is a novel approach to additive manufacturing, where multiple mobile 3D printing robots work together cooperatively to print the desired part. At the core of C3DP lies the chunk-based printing strategy. This strategy splits the desired part into smaller chunks, and then the chunks are assigned and scheduled to be printed by individual printing robots. In our previous work, we presented various hardware and software components of C3DP, such as mobile 3D printers, chunk-based slicing, scheduling, and simulation. In this study, we present a fully integrated and functional C3DP platform with all necessary components, including chunker, slicer, scheduler, printing robots, build floor, and outline how they work in unison from a system-level perspective. To realize C3DP, new developments of both hardware and software are presented, including new chunking approaches, scalable scheduler for multiple robots, SCARA-based printing robots, a mobile platform for transporting printing robots, modular floor tiles, and a charging station for the mobile platform. Finally, we demonstrate the capability of the system using two case studies. In these demonstrations, a CAD model of a part is fed to the chunker, divided into smaller chunks, passed to the scheduler, and assigned and scheduled to bemore »
-
Purpose The purpose of this research is to develop a new slicing scheme for the emerging cooperative three-dimensional (3D) printing platform that has multiple mobile 3D printers working together on one print job. Design/methodology/approach Because the traditional lay-based slicing scheme does not work for cooperative 3D printing, a chunk-based slicing scheme is proposed to split the print job into chunks so that different mobile printers can print different chunks simultaneously without interfering with each other. Findings A chunk-based slicer is developed for two mobile 3D printers to work together cooperatively. A simulator environment is developed to validate the developed slicer, which shows the chunk-based slicer working effectively, and demonstrates the promise of cooperative 3D printing. Research limitations/implications For simplicity, this research only considered the case of two mobile 3D printers working together. Future research is needed for a slicing and scheduling scheme that can work with thousands of mobile 3D printers. Practical implications The research findings in this work demonstrate a new approach to 3D printing. By enabling multiple mobile 3D printers working together, the printing speed can be significantly increased and the printing capability (for multiple materials and multiple components) can be greatly enhanced. Social implications The chunk-based slicingmore »
-
Abstract In this paper, we present a decentralized approach based on a simple set of rules to schedule multi-robot cooperative additive manufacturing (AM). The results obtained using the decentralized approach are compared with those obtained from an optimization-based method, representing the class of centralized approaches for manufacturing scheduling. Two simulated case studies are conducted to evaluate the performance of both approaches in total makespan. In the first case, four rectangular bars of different dimensions from small to large are printed. Each bar is first divided into small subtasks (called chunks), and four robots are then assigned to cooperatively print the resulting chunks. The second case study focuses on testing geometric complexity, where four robots are used to print a mask stencil (an inverse stencil, not face covering). The result shows that the centralized approach provides a better solution (shorter makespan) compared to the decentralized approach for small-scale problems (i.e., a few robots and chunks). However, the gap between the solutions shrinks while the scale increases, and the decentralized approach outperforms the centralized approach for large-scale problems. Additionally, the runtime for the centralized approach increased by 39-fold for the extra-large problem (600 chunks and four robots) compared to the small-scale problemmore »