Path Optimization Along Lattices in Additive Manufacturing Using the Chinese Postman Problem

Gregory Dreifus; Kyle Goodrick; Scott Giles; Milan Patel; Reed Matthew Foster; Cody Williams; John Lindahl; Brian Post; Alex Roschli; Lonnie Love; Vlastimil Kunc

doi:10.1089/3dp.2017.0007

Path Optimization Along Lattices in Additive Manufacturing Using the Chinese Postman Problem

Gregory Dreifus, Kyle Goodrick, Scott Giles, Milan Patel, Reed Matthew Foster, Cody Williams, John Lindahl, Brian Post, Alex Roschli, Lonnie Love, Vlastimil Kunc

Research output: Contribution to journal › Article › peer-review

37 Scopus citations

Abstract

We develop a method for programming minimal time tool paths for single-bead-wide extrusions in additive manufacturing (AM) along an arbitrary lattice. We present a graphical model of the three-dimensional (3D) printing process and use the solution to the Chinese Postman Problem (CPP) to optimize the motion of an extruder on a given mesh. We present some graph theory background and explain how to solve the CPP. We then present experimental results, in which we demonstrate the implementation of the CPP in 3D printing. Last, we explain how our graphical understanding of AM can be further utilized to achieve greater optimization in additive research.

Original language	English
Pages (from-to)	98-104
Number of pages	7
Journal	3D Printing and Additive Manufacturing
Volume	4
Issue number	2
DOIs	https://doi.org/10.1089/3dp.2017.0007
State	Published - Jun 2017

Keywords

3D printing
Chinese Postman Problem
additive manufacturing
graph theory
lattices
software

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1089/3dp.2017.0007

Cite this

@article{86830396cc884d31b087749e57199fc3,

title = "Path Optimization Along Lattices in Additive Manufacturing Using the Chinese Postman Problem",

abstract = "We develop a method for programming minimal time tool paths for single-bead-wide extrusions in additive manufacturing (AM) along an arbitrary lattice. We present a graphical model of the three-dimensional (3D) printing process and use the solution to the Chinese Postman Problem (CPP) to optimize the motion of an extruder on a given mesh. We present some graph theory background and explain how to solve the CPP. We then present experimental results, in which we demonstrate the implementation of the CPP in 3D printing. Last, we explain how our graphical understanding of AM can be further utilized to achieve greater optimization in additive research.",

keywords = "3D printing, Chinese Postman Problem, additive manufacturing, graph theory, lattices, software",

author = "Gregory Dreifus and Kyle Goodrick and Scott Giles and Milan Patel and Foster, {Reed Matthew} and Cody Williams and John Lindahl and Brian Post and Alex Roschli and Lonnie Love and Vlastimil Kunc",

note = "Publisher Copyright: {\textcopyright} Copyright U.S. Department of Energy 2017.",

year = "2017",

month = jun,

doi = "10.1089/3dp.2017.0007",

language = "English",

volume = "4",

pages = "98--104",

journal = "3D Printing and Additive Manufacturing",

issn = "2329-7662",

publisher = "Mary Ann Liebert",

number = "2",

}

TY - JOUR

T1 - Path Optimization Along Lattices in Additive Manufacturing Using the Chinese Postman Problem

AU - Dreifus, Gregory

AU - Goodrick, Kyle

AU - Giles, Scott

AU - Patel, Milan

AU - Foster, Reed Matthew

AU - Williams, Cody

AU - Lindahl, John

AU - Post, Brian

AU - Roschli, Alex

AU - Love, Lonnie

AU - Kunc, Vlastimil

N1 - Publisher Copyright: © Copyright U.S. Department of Energy 2017.

PY - 2017/6

Y1 - 2017/6

N2 - We develop a method for programming minimal time tool paths for single-bead-wide extrusions in additive manufacturing (AM) along an arbitrary lattice. We present a graphical model of the three-dimensional (3D) printing process and use the solution to the Chinese Postman Problem (CPP) to optimize the motion of an extruder on a given mesh. We present some graph theory background and explain how to solve the CPP. We then present experimental results, in which we demonstrate the implementation of the CPP in 3D printing. Last, we explain how our graphical understanding of AM can be further utilized to achieve greater optimization in additive research.

AB - We develop a method for programming minimal time tool paths for single-bead-wide extrusions in additive manufacturing (AM) along an arbitrary lattice. We present a graphical model of the three-dimensional (3D) printing process and use the solution to the Chinese Postman Problem (CPP) to optimize the motion of an extruder on a given mesh. We present some graph theory background and explain how to solve the CPP. We then present experimental results, in which we demonstrate the implementation of the CPP in 3D printing. Last, we explain how our graphical understanding of AM can be further utilized to achieve greater optimization in additive research.

KW - 3D printing

KW - Chinese Postman Problem

KW - additive manufacturing

KW - graph theory

KW - lattices

KW - software

UR - http://www.scopus.com/inward/record.url?scp=85021085398&partnerID=8YFLogxK

U2 - 10.1089/3dp.2017.0007

DO - 10.1089/3dp.2017.0007

M3 - Article

AN - SCOPUS:85021085398

SN - 2329-7662

VL - 4

SP - 98

EP - 104

JO - 3D Printing and Additive Manufacturing

JF - 3D Printing and Additive Manufacturing

IS - 2

ER -

Path Optimization Along Lattices in Additive Manufacturing Using the Chinese Postman Problem

Abstract

Keywords

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this