Saved in:
| Main Authors: | , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.09198 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917751931535360 |
|---|---|
| author | Huang, Yuming Guo, Yuhu Su, Renbo Han, Xingjian Ding, Junhao Zhang, Tianyu Liu, Tao Wang, Weiming Fang, Guoxin Song, Xu Whiting, Emily Wang, Charlie C. L. |
| author_facet | Huang, Yuming Guo, Yuhu Su, Renbo Han, Xingjian Ding, Junhao Zhang, Tianyu Liu, Tao Wang, Weiming Fang, Guoxin Song, Xu Whiting, Emily Wang, Charlie C. L. |
| contents | This paper presents a learning based planner for computing optimized 3D printing toolpaths on prescribed graphs, the challenges of which include the varying graph structures on different models and the large scale of nodes & edges on a graph. We adopt an on-the-fly strategy to tackle these challenges, formulating the planner as a Deep Q-Network (DQN) based optimizer to decide the next `best' node to visit. We construct the state spaces by the Local Search Graph (LSG) centered at different nodes on a graph, which is encoded by a carefully designed algorithm so that LSGs in similar configurations can be identified to re-use the earlier learned DQN priors for accelerating the computation of toolpath planning. Our method can cover different 3D printing applications by defining their corresponding reward functions. Toolpath planning problems in wire-frame printing, continuous fiber printing, and metallic printing are selected to demonstrate its generality. The performance of our planner has been verified by testing the resultant toolpaths in physical experiments. By using our planner, wire-frame models with up to 4.2k struts can be successfully printed, up to 93.3% of sharp turns on continuous fiber toolpaths can be avoided, and the thermal distortion in metallic printing can be reduced by 24.9%. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_09198 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Learning Based Toolpath Planner on Diverse Graphs for 3D Printing Huang, Yuming Guo, Yuhu Su, Renbo Han, Xingjian Ding, Junhao Zhang, Tianyu Liu, Tao Wang, Weiming Fang, Guoxin Song, Xu Whiting, Emily Wang, Charlie C. L. Robotics This paper presents a learning based planner for computing optimized 3D printing toolpaths on prescribed graphs, the challenges of which include the varying graph structures on different models and the large scale of nodes & edges on a graph. We adopt an on-the-fly strategy to tackle these challenges, formulating the planner as a Deep Q-Network (DQN) based optimizer to decide the next `best' node to visit. We construct the state spaces by the Local Search Graph (LSG) centered at different nodes on a graph, which is encoded by a carefully designed algorithm so that LSGs in similar configurations can be identified to re-use the earlier learned DQN priors for accelerating the computation of toolpath planning. Our method can cover different 3D printing applications by defining their corresponding reward functions. Toolpath planning problems in wire-frame printing, continuous fiber printing, and metallic printing are selected to demonstrate its generality. The performance of our planner has been verified by testing the resultant toolpaths in physical experiments. By using our planner, wire-frame models with up to 4.2k struts can be successfully printed, up to 93.3% of sharp turns on continuous fiber toolpaths can be avoided, and the thermal distortion in metallic printing can be reduced by 24.9%. |
| title | Learning Based Toolpath Planner on Diverse Graphs for 3D Printing |
| topic | Robotics |
| url | https://arxiv.org/abs/2408.09198 |