Search

RU-2026110321-A - METHOD FOR DETERMINING DATA ON THE DISTRIBUTION OF BEAM BY ZONES FOR A DEVICE FOR BEAM LAYER-BY-LAYER POWDER SINTERING

RU2026110321ARU 2026110321 ARU2026110321 ARU 2026110321ARU-2026110321-A

Inventors

  • МАРТИНЕС АЛЬВАРЕС, Хуан Мануэль
  • ФЕРНАНДЕС ГАРСИА, Эфрен
  • ХИМЕНЕС МЕАНА, Хорхе
  • СЕРРАНО ОРТЕГА, Мария Луйса

Assignees

  • АРСЕЛОРМИТТАЛ

Dates

Publication Date
20260505
Application Date
20240906
Priority Date
20230913

Claims (20)

  1. 1. A method for determining beam distribution data by zones for a device (1.1) for beam layer-by-layer powder sintering suitable for emitting one or more beams for selectively curing individual zones of a powder layer, comprising the following steps performed by a computer (1.6), in which:
  2. at step s1) data is collected defining a set (E) of dashed lines (L) along which said one or more rays (B1-B4) must follow for the gradual solidification of zones of the layer (1.7) of powder for the production of a section (S) of the part (P),
  3. at step s2) the set (E) of dash lines is divided into a plurality of different subsets, each of which combines several dash lines and forms a zone (R1-R8) that must be processed by one of the said one or more beams (B1-B4),
  4. at step s3) data on the distribution of beams by zones are determined, which for each of the said one or more beams (B1-B4) indicate a sequence of zones to be processed by the beam in question, among the set of said zones (R1-R8), wherein step s3 is performed using an optimization procedure designed to optimize at least one characteristic of the manufacturing process of the said section of the part using the said one or more beams,
  5. and stage s2 includes:
  6. step s20), in which a graph (G) is constructed representing the specified set (E) of dashed lines, wherein
  7. each dashed line is represented by a node of the graph, and
  8. for any pair of two dash lines that are located side by side, the two corresponding nodes of the graph are connected by an edge of the graph;
  9. partitioning the graph (G) or partitioning the compressed graph (Gc) obtained from said graph (G) to determine said zones, such that at least some of said zones include a set of consecutive nodes of the graph (G) or the compressed graph (Gc), wherein said set of consecutive nodes does not form forks.
  10. 2. The method according to claim 1, characterized in that at step s2, for at least several zones: at step s22, several dash lines (L) are grouped to form the zone in question, wherein said dash lines are not truncated and are adjacent to each other in the lateral direction, located one to the side of the other, one after the other sequentially.
  11. 3. The method according to paragraph 2, characterized in that at least for several zones, dash lines are distributed, located one next to the other, one after the other in sequence, from the first dash line of the zone to one or more last dash lines of the zone, and wherein said first dash line or one of said one or more last dash lines of the zone is one of the following dash lines:
  12. dash line (L3, L5, L7) of the edge of the section, that is, a dash line that does not have an adjacent lateral dash line on one side;
  13. boundary dash-line (Lf), that is, a dash-line that has on one side at least more than one dash-line (La, Lb), adjacent laterally to this boundary dash-line (Lf).
  14. 4. The method according to paragraph 2 or 3, characterized in that step s2 comprises:
  15. step s21, in which at least two of the dash lines (L5, L7) which are located in continuation of each other, one after the other in the direction (Dh) parallel to the dash lines (L) are grouped together in one of the said zones, provided that at least one of the two dash lines (L3, L5) does not have an adjacent lateral dash line on one side.
  16. 5. The method according to any of the preceding claims, characterized in that step s2 comprises:
  17. a graph compression stage (s21) in which a compressed graph (Gc) is determined from said graph (G), wherein at the graph compression stage:
  18. combine one of the nodes (5) of the graph with another node (7) of the graph, when two nodes (5, 7) correspond to two dash lines (L5, L7), which are located on the continuation of each other, one after the other in the direction (Dh), parallel to the dash lines, when at least one of the two nodes (5, 7) is an end node of the graph.
  19. step s22), in which the compressed graph (Gc) is partitioned to determine said zones in such a way that at least some of the zones consist of a set of consecutive nodes of the compressed graph, wherein said set of consecutive nodes does not form forks.
  20. 6. The method according to paragraph 5, characterized in that at the stage (s21) of graph compression: