Resource-Constrained Scheduling for Multi-Robot Cooperative Three-Dimensional PrintingSource: Journal of Mechanical Design:;2021:;volume( 143 ):;issue: 007::page 072002-1DOI: 10.1115/1.4050380Publisher: The American Society of Mechanical Engineers (ASME)
Abstract: Cooperative three-dimensional (3D) printing (C3DP)—a representative realization of cooperative manufacturing (CM)—is a novel approach that utilizes multiple mobile 3D printing robots for additive manufacturing (AM). It makes the make-span much shorter compared with traditional 3D printing due to parallel printing. In C3DP, collision-free scheduling is critical to the realization of cooperation and parallel operation among mobile printers. In the extant literature, there is a lack of methods to schedule multi-robot C3DP with limited resources. This study addresses this gap with two methods. The first method, dynamic dependency list algorithm (DDLA), uses a constraint-satisfaction approach to eliminate solutions that could result in collisions between robots and collisions between robots with already-printed materials. The second method, modified genetic algorithm (GA), uses chromosomes to represent chunk assignments and utilizes GA operators, such as the crossover and mutation, to generate diverse print schedules while maintaining the dependencies between chunks. Three case studies, including two large rectangular bars in different scales and a foldable sport utility vehicle (SUV), are used to demonstrate the effectiveness and performance of the two methods. The results show that both methods can effectively generate valid print schedules using a specified number of robots while attempting to minimize the make-span. The results also show that both methods generate a print schedule with equal print time for the first two case studies with homogeneous chunks. In contrast, the modified GA outperforms the DDLA in the third case study, where the chunks are heterogeneous in volume and require different times to print.
|
Collections
Show full item record
contributor author | Poudel, Laxmi | |
contributor author | Zhou, Wenchao | |
contributor author | Sha, Zhenghui | |
date accessioned | 2022-02-05T21:47:37Z | |
date available | 2022-02-05T21:47:37Z | |
date copyright | 4/1/2021 12:00:00 AM | |
date issued | 2021 | |
identifier issn | 1050-0472 | |
identifier other | md_143_7_072002.pdf | |
identifier uri | http://yetl.yabesh.ir/yetl1/handle/yetl/4276348 | |
description abstract | Cooperative three-dimensional (3D) printing (C3DP)—a representative realization of cooperative manufacturing (CM)—is a novel approach that utilizes multiple mobile 3D printing robots for additive manufacturing (AM). It makes the make-span much shorter compared with traditional 3D printing due to parallel printing. In C3DP, collision-free scheduling is critical to the realization of cooperation and parallel operation among mobile printers. In the extant literature, there is a lack of methods to schedule multi-robot C3DP with limited resources. This study addresses this gap with two methods. The first method, dynamic dependency list algorithm (DDLA), uses a constraint-satisfaction approach to eliminate solutions that could result in collisions between robots and collisions between robots with already-printed materials. The second method, modified genetic algorithm (GA), uses chromosomes to represent chunk assignments and utilizes GA operators, such as the crossover and mutation, to generate diverse print schedules while maintaining the dependencies between chunks. Three case studies, including two large rectangular bars in different scales and a foldable sport utility vehicle (SUV), are used to demonstrate the effectiveness and performance of the two methods. The results show that both methods can effectively generate valid print schedules using a specified number of robots while attempting to minimize the make-span. The results also show that both methods generate a print schedule with equal print time for the first two case studies with homogeneous chunks. In contrast, the modified GA outperforms the DDLA in the third case study, where the chunks are heterogeneous in volume and require different times to print. | |
publisher | The American Society of Mechanical Engineers (ASME) | |
title | Resource-Constrained Scheduling for Multi-Robot Cooperative Three-Dimensional Printing | |
type | Journal Paper | |
journal volume | 143 | |
journal issue | 7 | |
journal title | Journal of Mechanical Design | |
identifier doi | 10.1115/1.4050380 | |
journal fristpage | 072002-1 | |
journal lastpage | 072002-12 | |
page | 12 | |
tree | Journal of Mechanical Design:;2021:;volume( 143 ):;issue: 007 | |
contenttype | Fulltext |