Path Optimization Along Lattices in Additive Manufacturing Using the Chinese Postman Problem
Source abstract
Abstract
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.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Additive Manufacturing and 3D Printing Technologies · Manufacturing Process and Optimization · Additive Manufacturing Materials and Processes
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Oak Ridge National Laboratory
University of Tennessee
References (32)
Show source-provided references
1. 10.1016/S0278-6125(03)90018-510.1016/S0278-6125(03)90018-5 ↗
2. 10.1016/S0925-7721(00)00015-810.1016/S0925-7721(00)00015-8 ↗
3. Arkin EM Bender MA Demaine ED Fekete SP Mitchell JSB Sethia S. Optimal covering tours with turn costs. arxiv.org June 21 2005.10.1137/S0097539703434267 ↗
4. 10.1007/978-3-642-20662-7_2610.1007/978-3-642-20662-7_26 ↗
5. Kumar N, , Chhabra KK. An overview of optimization techniques for CNC milling machine. Int J Eng Manage Sci, 2014; 1:13–16.
6. 10.1016/j.ijmachtools.2008.01.00210.1016/j.ijmachtools.2008.01.002 ↗
7. 10.1145/245.24810.1145/245.248 ↗
8. 10.1016/S0010-4485(99)00080-910.1016/S0010-4485(99)00080-9 ↗
9. 10.1108/1355254011041043110.1108/13552540110410431 ↗
10. 10.1016/0278-6125(95)98872-410.1016/0278-6125(95)98872-4 ↗
11. 10.1108/1355254021041328410.1108/13552540210413284 ↗
12. 10.1016/0010-4485(94)90092-210.1016/0010-4485(94)90092-2 ↗
13. 10.1115/1.183049210.1115/1.1830492 ↗
14. 10.1007/s00170-008-1385-910.1007/s00170-008-1385-9 ↗
15. 10.1108/1355254001030985910.1108/13552540010309859 ↗
16. Bertoldi M, et al. Domain decomposition and space filling curves in toolpath planning and generation. Proceedings of the 1998 Solid Freeform Fabrication Symposium, The University of Texas at Austin, Austin, TX, 1998, pp. 267–274.
17. 10.1016/S0924-0136(02)00867-110.1016/S0924-0136(02)00867-1 ↗
18. 10.1016/S0278-6125(04)80040-210.1016/S0278-6125(04)80040-2 ↗
19. 10.1007/s00170-014-5808-510.1007/s00170-014-5808-5 ↗
20. 10.1016/j.addma.2014.08.00410.1016/j.addma.2014.08.004 ↗
21. 10.1177/095440621141164310.1177/0954406211411643 ↗
22. 10.1016/j.cad.2005.08.00510.1016/j.cad.2005.08.005 ↗
23. 10.1108/RPJ-12-2015-018310.1108/RPJ-12-2015-0183 ↗
24. 10.1557/jmr.2014.21210.1557/jmr.2014.212 ↗
25. Gibson I Rosen DW et al. Direct Digital Manufacturing Additive Manufacturing Technologies. New York: Springer 2010 pp. 363–384.10.1007/978-1-4419-1120-9 ↗
26. Bollweg P Hasanbegovic D Müller H Stöneberg M. Surface-adaptive and collision-avoiding path planning for five-axis milling January 2006. Forschungsbericht No. 808/2006.
27. Jungnickel D. Graphs, networks and algorithms. In: Algorithms and Computation in Mathematics, Chapter 2. Secaucus, NJ: Springer-Verlag New York, Inc., 2014.
28. 10.1287/opre.43.2.23110.1287/opre.43.2.231 ↗
29. 10.6028/jres.069B.01310.6028/jres.069B.013 ↗
30. Michel X. Goemans lecture notes on non-bipartite matching February 27 2007. Handout 5. Available at: http://math.mit.edu/goemans/18433S07/edmonds.pdf (last accessed January30 2017).
31. 10.1007/BF0144286610.1007/BF01442866 ↗
32. Kusner M. Edmond's blossom algorithm: A maximum matching algorithm for any graph. Available at http://matthewkusner.come/MatthewKusner_BlossomAlgorithmReport.pdf (last accessed January30 2017).