The Concept of a Novel Path Planning Strategy for Wire + Arc Additive Manufacturing of Bulky Parts: Pixel
| Autor: | Américo Scotti, Rafael Pereira Ferreira |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
lcsh:TN1-997
0209 industrial biotechnology Computer science 02 engineering and technology Travelling salesman problem greedy randomized adaptive search procedure (GRASP) 020901 industrial engineering & automation Reglerteknik wire arc additive manufacturing (WAAM) General Materials Science Local search (optimization) Motion planning optimization heuristics Metaheuristic Greedy randomized adaptive search procedure lcsh:Mining engineering. Metallurgy Pixel business.industry Metals and Alloys Robotics Control Engineering 021001 nanoscience & nanotechnology travelling salesman problem (TSP) Robotteknik och automation Trajectory 0210 nano-technology Heuristics business trajectory planning Algorithm |
| Zdroj: | Metals, Vol 11, Iss 498, p 498 (2021) Metals Volume 11 Issue 3 |
| ISSN: | 2075-4701 |
| Popis: | An innovative trajectory strategy was proposed and accessed for wire arc additive manufacturing (WAAM), applicable to different and more complex geometries, rather than being a single solution. This strategy, named Pixel, can be defined as a complex multitask procedure to carry out optimized path planning, whose operation is made through computational algorithms (heuristics), with accessible computational resources and tolerable computational time. The model layers are fractioned in squared grids, and a set of dots is systematically generated and distributed inside the sliced outlines, resembling pixels on a screen, over which the trajectory is planned. The Pixel strategy was based on creating trajectories from the technique travelling salesman problem (TSP). Unlike existing algorithms, the Pixel strategy uses an adapted greedy randomized adaptive search procedure (GRASP) metaheuristic, aided by four concurrent trajectory planning heuristics, developed by the authors. Interactions provide successive trajectories from randomized initial solutions (global search) and subsequent iterative improvements (local search). After all recurrent loops, a trajectory is defined and written in machine code. Computational evaluation was implemented to demonstrate the effectof each of the heuristics on the final trajectory. An experimental evaluation was eventually carried out using two different not easily printable shapes to demonstrate the practical feasibility of the proposed strategy. Funding information:Conselho Nacional de Desenvolvimento Científico e TecnológicoGrant number 302863/2016-8 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|