2019
DOI: 10.1080/01605682.2019.1590135
|View full text |Cite
|
Sign up to set email alerts
|

Combining heuristics for tool-path optimisation in material extrusion additive manufacturing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…Instead of continuously switching the printing areas, the path planning algorithm was improved to complete the maximum number of layers that the nozzle could reach, and then moved to other areas to continue printing, so as to shorten the travelling paths and time. Volpato et al [12] compared two MEX path optimisation schemes to reduce the time spent on nozzle repositioning. One was based on greedy algorithm, while the other combined the 2-opt heuristics and the nearest insertion algorithms.…”
Section: Background and Motivationmentioning
confidence: 99%
“…Instead of continuously switching the printing areas, the path planning algorithm was improved to complete the maximum number of layers that the nozzle could reach, and then moved to other areas to continue printing, so as to shorten the travelling paths and time. Volpato et al [12] compared two MEX path optimisation schemes to reduce the time spent on nozzle repositioning. One was based on greedy algorithm, while the other combined the 2-opt heuristics and the nearest insertion algorithms.…”
Section: Background and Motivationmentioning
confidence: 99%
“…Continuous path infill strategies are developed to reduce the tool starting and stopping and reduce the printing time [163]. In this sense, the spiral infill was developed [145,228] (see Fig.…”
Section: Contourmentioning
confidence: 99%
“…The minimization of non-productive times in material extrusion additive manufacturing is investigated in [17,18], where vertices in a class encode the entry and exit points for closed contours and processing directions for open filling rasters within each layer. For solving the problem, heuristics and mixed-integer linear programming are combined in [17], whereas the performance of different heuristics is compared in [18].…”
Section: Survey Of Robotic Task Sequencing Problemsmentioning
confidence: 99%