A printing planning method adaptable to nozzle state disturbances

By constructing candidate matching relationships between nozzles and printable points and employing a local replanning method, the problem of uneven printing planning caused by nozzle state disturbances was solved, achieving rapid updates and stable printing planning results.

CN123104236APending Publication Date: 2026-11-17HUAZHONG UNIV OF SCI & TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611314656.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-08-27
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

In large-size substrates and high-resolution patterned printing scenarios, the uniqueness of nozzle resources and the limited number of docking points lead to uneven printing planning results, and nozzle state disturbances cause the original planning solution to fail. Existing technologies make it difficult to quickly update the printing plan.

Method used

By constructing candidate matching relationships between nozzles and printable points, a printing planning solution is obtained. After the nozzle state is disturbed, a local replanning update is performed to identify and repair failed and degraded printable points. By combining the local replanning and global planning framework, repeated global solutions are avoided.

Benefits of technology

It improves the efficiency and stability of printing planning, ensuring that the printing plan can be quickly updated after changes in nozzle status, maintaining overall rationality and local coordination.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123104236A_ABST
    Figure CN123104236A_ABST
Patent Text Reader

Abstract

This invention belongs to the field of patterned printing and thin-film encapsulation technology, and proposes a printing planning method that adapts to nozzle state disturbances. This method constructs candidate matching relationships based on the reachability between the nozzle ejection landing position and the position of the point to be printed, and obtains a printing planning solution containing resource occupancy information such as docking points and nozzle numbers through integer programming. When the nozzle ejection state changes, a new candidate relationship is regenerated based on the changed landing position, identifying failed or degraded points to be repaired in the original printing planning solution, constructing the repair region corresponding to the repaired point, and solving it through a local replanning model; if the replanning result affects printing points outside the region, the affected points are incorporated into the repair region for iterative solution; after repair, a new printing planning solution is generated by combining the original printing planning solution. This invention takes into account both global planning and local replanning updates, which can reduce repeated global solutions after state changes, improving printing planning efficiency and result stability.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention belongs to the technical field of patterned printing and thin film encapsulation, and more specifically, relates to a printing planning method that adapts to nozzle state disturbances. Background Technology

[0002] With the development of high-resolution displays, flexible electronics, and functional thin-film devices, inkjet printing technology based on piezoelectric and electrofluid jetting processes has been widely used in patterning manufacturing processes such as thin-film encapsulation (TFE). In this type of printing process, it is usually necessary to allocate appropriate nozzle resources to a large number of printable dots based on the nozzle position, the position of the printable dots, and the reachability between the two, in order to achieve comprehensive control of the jetting position and pattern consistency.

[0003] In large-size substrate and high-resolution patterned printing scenarios, the number of printable dots and nozzles is substantial, and constraints such as the uniqueness of nozzle resources and the limited number of docking points exist. Using only point-by-point search or local allocation methods can easily overlook the global competition among nozzle resources, leading to multiple printable dots competing for the same nozzle resource or uneven utilization of docking points, thus affecting the final printing planning result. Therefore, a global planning model is needed to determine the matching relationship between printable dots and nozzle resources to obtain a printing planning solution that satisfies resource constraints.

[0004] However, in actual printing processes, the nozzle spraying state may change due to factors such as nozzle failure, spray degradation, or landing point deviation, causing some candidate relationships in the original printing programming solution to become invalid or experience performance degradation. If the global programming solution is re-solved after each nozzle state change, it will incur significant computational overhead, making it difficult to meet the needs of rapid updates in the printing process and engineering applications. Summary of the Invention

[0005] To address the aforementioned deficiencies or improvement needs of existing technologies, this invention provides a printing planning method that adapts to nozzle state disturbances. The purpose is to obtain the globally optimal solution for printing planning and then perform local replanning and updates after nozzle state disturbances occur, thereby improving printing planning efficiency and result stability.

[0006] To achieve the above objectives, according to one aspect of the present invention, a printing planning method adapting to nozzle state disturbances is provided, comprising: Based on the reachability relationship between the nozzle landing point and the printout location, candidate matching relationships are constructed between the printhead docking point, the nozzle, and each printout location. Through global programming, the original printing planning solution that represents a change in the relative nozzle landing point position is determined from the candidate matching relationships. The original printing planning solution includes the set of docking points. And the original optimal resource combination corresponding to each printing point, including the docking point and nozzle number; When the nozzle state is disturbed, the set of stopping points in the original printing plan solution is maintained. Under unchanged conditions, based on the spatial distribution of the changed printhead landing points, a new candidate matching relationship is reconstructed for each print point to be printed. Based on this new candidate matching relationship, the failed and degraded print points in the original printing planning solution are identified, forming a set of points to be repaired. Among them, the failed print points indicate that their original optimal resource combination does not exist in the new candidate matching relationship, and the degraded print points indicate that the current printing deviation corresponding to their original optimal resource combination has increased, or that the original optimal resource combination ranks higher in the new candidate matching relationship compared to the candidate matching relationship used in the global planning, after sorting the candidate resource combinations in ascending order according to the printing deviation. For each point in the set of points to be repaired, a corresponding local printing area to be repaired is constructed. The optimal matching relationship between each printing point in the area and the printhead docking point and nozzle is locally replanned. During the replanning process, if the optimal matching result of a certain printing point conflicts with the current optimal resource combination of printing points outside the current local printing area to be repaired, the printing point outside the area is merged into the current local printing area to be repaired and replanned locally. After the local printing areas of all printing points to be repaired are repaired, a new printing planning solution is generated by combining the original printing planning solution.

[0007] Furthermore, the method for constructing the candidate matching relationship between the printhead docking point, the nozzle, and each point to be printed is as follows: During the entire printing process, the number of dots to be printed is recorded as follows: The number of nozzle docking points is The number of nozzles is ,in , , , ; According to the reachability relationship, if the first The first stop The nozzle can spray to the first The nth point to be printed, then the nth The first stop, the Each nozzle is denoted as a candidate resource combination for that print point; and the calculation of the first... Printing deviation of each candidate resource combination for each print point; By the All candidate resource combinations for each point to be printed constitute the candidate resource combination set, denoted as . ,in, Indicates the first The first point to be printed A candidate resource combination, characterized by including stop point numbers. Nozzle number Resource usage information Indicates the first The total number of candidate resource combinations for each print point; and the determination of each candidate resource combination based on the printing deviation. The deviation weight is denoted as This is used to characterize the spatial deviation cost when a candidate resource is ejected to the point to be printed. The value satisfies the following: the larger the printing deviation, the greater the printing deviation weight. This completes the process of determining the nozzle docking point, nozzle orifice, and the... Construction of candidate matching relationships between points to be printed.

[0008] Furthermore, construct the nozzle docking point, nozzle orifice, and the first When considering the candidate matching relationships between the n points to be printed, it also includes: the nth In the set of candidate resource combinations for each print point, all candidate resource combinations are sorted in ascending order according to the printing deviation.

[0009] Furthermore, the method for obtaining the printing planning solution through global programming is as follows: The optimal matching process between the printhead docking point-orifice resource combination and each printing point is modeled as a minimum deviation integer programming model: Decision variables are ; The variable for enabling docking points is ; The objective function is: ; The constraint is that each point to be printed selects only its set of candidate resource combinations. One of the candidates is represented as: Any nozzle at any docking point can only be selected once, as shown below: The unique candidate dock to which each print point belongs should be enabled, indicated as: The total number of docking points in use cannot exceed a specified value, expressed as: ; Solving the minimum deviation integer programming model yields the printing programming solution, where the optimal resource combination for each printing point is denoted as... ,in, Indicates the point to be printed. Selected from the candidate resource combination set And obtain the set of enabled docking points. .

[0010] Furthermore, the following local replanning steps are performed for each point to be repaired: (1) Construct a local printable area containing the point to be repaired, including A number of points to be printed, using characters q Traverse the One printable point; based on the printable point q The new candidate matching relationships determine the new set of candidate resource combinations, denoted as . ; Indicates the point to be printed. q The A new candidate resource combination, characterized by including stop point numbers. Nozzle number Resource usage information; Indicates the point to be printed. q The total number of new candidate resource combinations; (2) The optimal matching process between the nozzle docking point-orifice resource combination and each print point in the current local print area to be repaired is modeled as a local replanning model: Decision variables are ; The objective function is denoted as: ; The constraint is: for each point to be printed q Select only One of the candidates: Each nozzle at any docking point can only be selected once: In the formula, This represents the combination of the point to be printed q and the candidate resources. The deviation weight, determined by the printing deviation between the two, is used to characterize the candidate resource combination. Spray onto the point to be printed q The spatial deviation cost during printing is determined by the following condition: the larger the printing deviation, the greater the weight of the printing deviation. (3) Solve the local replanning model to obtain the current optimal resource combination of each print point in the current local print area to be repaired; if the current optimal resource combination of a print point conflicts with the current optimal resource combination of a print point outside the current local print area to be repaired, then the print point outside the area is merged into the current local print area to be repaired, and the process is transferred to step (1) to iteratively execute local replanning until the preset termination condition is reached.

[0011] Furthermore, for each point to be repaired, during the first local replanning execution, A value of 1 means that there is only one point to be printed within the local area to be repaired and printed.

[0012] Furthermore, the preset termination condition is: There is no conflict between the optimal resource combination of a certain print point in the current local print area to be repaired and the optimal resource combination of print points outside the current local print area to be repaired, or the current local print area to be repaired has reached the preset maximum size.

[0013] Furthermore, after the local replanning of each point to be repaired is completed, the completed local replanning results are saved to form a reusable prior structure; the prior structure includes the new candidate matching relationship of each point to be printed in the local printing area to be repaired and the current optimal resource combination obtained by replanning; When each print point in the current local area to be repaired has the same candidate matching relationship with the saved prior structure, the saved optimal resource combination is called as the initial result or reference result in the current local replanning solution process.

[0014] According to another aspect of the present invention, a pattern planning and printing system for inkjet printing is provided, comprising: an inkjet planning module and a printing module; The printing planning module is used to execute the printing planning method described above, obtain the optimal resource combination for each printing point, and use it to plan the nozzle ejection timing. The printing module, including a printhead control unit and a motion control unit, is used to control the printhead ejection and platform movement based on the planning results of the printing planning module, so that each nozzle completes printing according to the planned sequence during the base scanning process.

[0015] According to another aspect of the invention, a computer-readable storage medium is provided, the computer-readable storage medium including a stored computer program, wherein, when the computer program is run by a processor, it controls the device where the storage medium is located to perform the steps of the method described above.

[0016] In summary, compared with the prior art, the technical solutions conceived by this invention have the following main advantages: This invention proposes a printing planning method adapted to nozzle state disturbances. It obtains a printing planning solution by constructing candidate matching relationships between nozzles and printable points. After a change in nozzle ejection state, new candidate relationships are generated based on the changed printhead landing point distribution. The method also identifies failed or degraded printable points in the original solution and performs local replanning updates. This method unifies the initial printing plan and the post-state change repair update within the same planning framework, ensuring the overall rationality of the original printing plan solution while avoiding repeated global solutions for all printable points after nozzle state changes. Specifically, in the local replanning, when the local replanning result affects printable points outside the designated area, the affected points are incorporated into the current repair area for iterative solution. This allows resource usage changes to be coordinated and updated locally, improving the feasibility and stability of the repair results. Attached Figure Description

[0017] Figure 1 A flowchart of a printing planning method for adapting to nozzle state disturbances provided in an embodiment of the present invention; Figure 2 This is a schematic diagram illustrating how changes in the nozzle ejection state lead to changes in the candidate relationship, as provided in an embodiment of the present invention. Figure 3 This is a schematic diagram of local conflict and local printing area expansion to be repaired provided in an embodiment of the present invention; Figure 4 This is a schematic diagram of TFE patterning planning, replanning, and printing provided in an embodiment of the present invention. Detailed Implementation

[0018] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention. Furthermore, the technical features involved in the various embodiments of this invention described below can be combined with each other as long as they do not conflict with each other.

[0019] Example 1 A printing planning method that adapts to nozzle state disturbances, such as Figure 1 As shown, it includes: Based on the reachability relationship between the nozzle landing point and the printout location, candidate matching relationships are constructed between the printhead docking point, the nozzle, and each printout location. Through global programming, the original printing planning solution that represents a change in the relative nozzle landing point position is determined from the candidate matching relationships. The original printing planning solution includes the set of docking points. And the original optimal resource combination corresponding to each printing point, including the docking point and nozzle number; When the nozzle state is disturbed, the set of stopping points in the original printing plan solution is maintained. Under unchanged conditions, based on the spatial distribution of the changed printhead landing points, a new candidate matching relationship is reconstructed for each print point to be printed. Based on this new candidate matching relationship, the failed and degraded print points in the original printing planning solution are identified, forming a set of points to be repaired. Among them, the failed print points indicate that their original optimal resource combination does not exist in the new candidate matching relationship, and the degraded print points indicate that the current printing deviation corresponding to their original optimal resource combination has increased, or that the original optimal resource combination ranks higher in the new candidate matching relationship compared to the candidate matching relationship used in the global planning, after sorting the candidate resource combinations in ascending order according to the printing deviation. For each point in the set of points to be repaired, a corresponding local printing area to be repaired is constructed. The optimal matching relationship between each printing point in the area and the printhead docking point and nozzle is locally replanned. During the replanning process, if the optimal matching result of a certain printing point conflicts with the current optimal resource combination of printing points outside the current local printing area to be repaired, the printing point outside the area is merged into the current local printing area to be repaired and replanned locally. After the local printing areas of all printing points to be repaired are repaired, a new printing planning solution is generated by combining the original printing planning solution.

[0020] This embodiment of the method obtains a printing planning solution by constructing candidate matching relationships between nozzles and printable points. After the nozzle ejection state changes, new candidate relationships are further generated based on the changed printhead landing point distribution, and failed or degraded points in the original printing planning solution that need repair are identified. Based on this, local replanning and updates are performed. This method unifies the initial printing planning and the repair updates after state changes into the same planning framework, ensuring the overall rationality of the original printing planning solution while avoiding repeated global solutions for all printable points after nozzle state changes.

[0021] In addition, the method in this embodiment identifies the failed and degraded printing points in the original printing planning solution based on the new candidate matching relationship after the change of nozzle state, and constructs a corresponding local repair area and local replanning model for the repair points; when the local replanning result affects the printing points outside the area, the affected points are incorporated into the current repair area for iterative solution, so that the resource occupation change can be coordinated and updated in a local range, improving the feasibility and stability of the repair result.

[0022] As a preferred implementation, the candidate matching relationship between the printhead docking point, the nozzle, and each printing point is constructed as follows: During the entire printing process, the number of dots to be printed is recorded as follows: The number of nozzle docking points is The number of nozzles is ,in , , , The printable point represents the location on the substrate where jet deposition needs to be performed; the docking point represents the planned position where the printhead or printhead assembly can dock or pass through during the printing process; and the nozzle represents a single jetting unit in the printhead that can perform the jetting action. According to the reachability relationship, if the first The first stop The nozzle can spray to the first The nth point to be printed, that is, for the nth... The nth print point, if the nth print point, The first stop The jet point of the first nozzle can reach the first... If the number of printable points is within the reachable range, then the number of printable points will be... The first stop, the Each nozzle is denoted as a candidate resource combination for the printing point, wherein the distance between the center points of the sprayable areas of two adjacent printing points should be less than the distance between droplets that can form a film; and the calculation of the first... The printing deviation of each candidate resource combination for the nth print point, that is, the printing deviation of the nth print point for each candidate resource combination. The deviation between the position of each print point and the ejection position of the candidate docking point-nozzle; By the All candidate resource combinations for each point to be printed constitute the candidate resource combination set, denoted as . ,in, Indicates the first The first point to be printed A candidate resource combination, characterized by including stop point numbers. Nozzle number Resource usage information Indicates the first The total number of candidate resource combinations for each print point; and the determination of each candidate resource combination based on the printing deviation. The deviation weight is denoted as This is used to characterize the spatial deviation cost when a candidate resource is ejected to the point to be printed. The value satisfies the following: the larger the printing deviation, the greater the printing deviation weight. This completes the process of determining the nozzle docking point, nozzle orifice, and the... Construction of candidate matching relationships between points to be printed.

[0023] Considering that the method in this embodiment requires identifying the degraded printing points in the original printing planning solution after the nozzle state perturbation, it can be used as a preferred implementation to construct the printhead docking point, nozzle, and the first... When considering the candidate matching relationships between the n points to be printed, it also includes: the nth In the set of candidate resource combinations for each print point, all candidate resource combinations are sorted in ascending order of printing deviation to facilitate the subsequent identification of degraded print points. It should be noted that "degraded" means that the previously planned optimal resource combination is no longer optimal. Generally, the smaller the deviation between the spray point and the print point, the smaller the corresponding deviation weight, and the higher the candidate ranking.

[0024] As a preferred implementation method, the printing planning solution can be obtained through global programming as follows: The optimal matching process between the printhead docking point-orifice resource combination and each printing point is modeled as a minimum deviation integer programming model: Decision variables are ; The variable for enabling docking points is ; The objective function is: The objective function is used to minimize the sum of the deviation weights of the candidate resource combinations selected for all print points, so that the overall printing planning result selects nozzle resources with smaller deviations as much as possible while satisfying resource constraints. The constraint is that each point to be printed selects only its set of candidate resource combinations. One of the candidates is represented as: Any nozzle at any docking point can only be selected once, as shown below: The unique candidate dock to which each print point belongs should be enabled, indicated as: The total number of docking points in use cannot exceed a specified value, expressed as: ; This indicates the maximum number of docking points allowed during the printing process. This constraint is used to control the number of printhead movements or dockings, and to avoid an excessive number of docking points in the planning results, which would affect printing efficiency. Solving the minimum deviation integer programming model yields the printing programming solution, where the optimal resource combination for each printing point is denoted as... ,in, Indicates the point to be printed. Selected from the candidate resource combination set And obtain the set of enabled docking points. .

[0025] The proposed global planning solution uses a minimum deviation integer programming model to solve the matching relationship between the print point and the candidate nozzle resources. Under the constraints of unique allocation of print points, unique occupation of nozzle resources, and limited number of docking points, the solution obtains a printing planning solution that includes resource occupation information such as docking points and nozzle numbers. This improves the global coordination of nozzle resource allocation and the feasibility of printing planning results, and solves the problems of complex matching planning between nozzles and print points and difficulty in coordinating global constraints of nozzle resources in the prior art.

[0026] The original printing planning solution includes at least the docking point corresponding to the point to be printed, the nozzle number, the candidate selection results, and the resource usage relationship. The original printing planning solution is not only used for subsequent printing sequence planning, but also serves as the basis for local replanning after the nozzle printing state changes.

[0027] In this embodiment, the reachability relationship between the nozzle landing point and the point to be printed is fully considered in the candidate matching relationship construction stage. In the solution stage, the minimum deviation integer programming model is used to uniformly consider the allocation of the point to be printed, the unique occupation of the nozzle resources, and the limitation on the number of docking points, so as to obtain a printing planning solution that satisfies the global resource constraints.

[0028] Based on the aforementioned printing planning solution, when the nozzle ejection state changes, a new candidate matching relationship is further generated according to the spatial distribution of the changed nozzle landing point state, and a local replanning is performed based on the original printing planning solution to quickly obtain a new printing planning solution.

[0029] When constructing candidate matching relationships using the aforementioned method, the method for identifying failed and degraded printable points in the original inkjet printing plan solution is as follows: Based on the new candidate matching relationships, a new set of candidate resource combinations is determined for each point to be printed, denoted as […]. ;in, Indicates the first The first point to be printed A new candidate resource combination, characterized by including stop point numbers. Nozzle number Resource usage information; Indicates the first The total number of new candidate resource combinations for each printable point; the new candidate resource combination set is recalculated based on the changed nozzle injection point, which can reflect the new reachability and deviation relationship between the nozzle resource and the printable point after nozzle failure, nozzle degradation or injection point offset. like Figure 2 As shown, the original inkjet printing plan solution is matched against the set of new candidate resource combinations for all print points. If the... The original optimal resource combination for each print point is not present. In, that is Then it is determined to be the first in the original inkjet printing planning solution. The original optimal resource combination of a printable point fails. This means that the original docking point-nozzle resource combination allocated to the printable point can no longer satisfy the candidate reachability relationship of the printable point after the nozzle state changes. If the first The original optimal resource combination for each print point exists in In, that is And the original optimal resource combination in In the process of reducing candidate ranking based on printing bias, the matching cost may increase significantly. For example, if the original candidate ranking is changed by... Change to And satisfy: Alternatively, the change in deviation weights satisfies: If so, it is determined to be a degenerate printing plan solution, where, The sorting degradation threshold, As a cost, the degradation threshold, Indicates the first One point to be printed The deviation weights. The set of points to be repaired consists of the aforementioned failed or degraded print points.

[0030] For the set of points to be repaired For each point to be repaired, a corresponding repair area is constructed, and a local replanning model is established. Unlike the aforementioned global printing planning, local replanning is more lightweight. It only redefines the matching relationship between the printing point and the docking point-nozzle resource combination within the current repair area, thereby reducing the cost of repeated global solutions after the nozzle state changes.

[0031] It should be noted that the method for constructing the set of points to be repaired and the local replanning method in this embodiment are not limited to the original global planning method described above. Any method that can achieve the original global planning can be implemented in conjunction with the subsequent method for constructing the set of points to be repaired and the local replanning method in this embodiment to achieve printing planning that adapts to nozzle state disturbances.

[0032] As a preferred implementation, the following local replanning steps can be performed on each point to be repaired: (1) Construct a local printable area containing the point to be repaired, including A number of points to be printed, using characters q Traverse the One printable point; based on the printable point q The new candidate matching relationships determine the new set of candidate resource combinations, denoted as . ; Indicates the point to be printed. qThe A new candidate resource combination, characterized by including stop point numbers. Nozzle number Resource usage information; Indicates the point to be printed. q The total number of new candidate resource combinations; (2) The optimal matching process between the nozzle docking point-orifice resource combination and each print point in the current local print area to be repaired is modeled as a local replanning model: Decision variables are ; The objective function is denoted as: ; The constraint is: for each point to be printed q Select only One of the candidates: Each nozzle at any docking point can only be selected once: In the formula, This represents the combination of the point to be printed q and the candidate resources. The deviation weight, determined by the printing deviation between the two, is used to characterize the candidate resource combination. Spray onto the point to be printed q The spatial deviation cost at that time is determined by the following condition: the larger the printing deviation, the greater the weight of the printing deviation. Through the above constraints, the local replanning result still meets the requirements of unique allocation of printing points and unique occupation of nozzle resources within the repair area. (3) Solve the local replanning model to obtain the current optimal resource combination of each print point in the current local print area to be repaired; if the current optimal resource combination of a print point conflicts with the current optimal resource combination of a print point outside the current local print area to be repaired, then the print point outside the area is merged into the current local print area to be repaired, and the process is transferred to step (1) to iteratively execute local replanning until the preset termination condition is reached.

[0033] In other words, during the process of solving the local printable area corresponding to each point to be repaired, the local printable area to be repaired... It is dynamically changing: when a printable point within the current local area to be repaired reselects nozzle resources and affects the resource occupancy of other printable points outside the current local area to be repaired, the local area to be repaired expands accordingly, and its expansion range is limited by a preset termination condition. The expansion of the repair area is related to the replanning results.

[0034] like Figure 3 As shown, the current repair area is The set of affected external print points is The expanded repair area can then be represented as: In other words, during local replanning, if the optimal matching result within the current repair area affects a point outside the repair area, that point is added to the repair area, and the expanded repair area undergoes local replanning again. Through this method, the repair area can expand as resource usage changes, ensuring coordinated updates of resource usage changes within a finite local scope.

[0035] During the iterative process of expanding the region to be repaired and local replanning, if no new affected external print points are generated, or if the current size of the region to be repaired reaches the preset maximum size, then the expansion of the current region to be repaired is terminated, that is: ;in, This is the maximum size of the preset repair area. After completing the local replanning of the current repair area, the local replanning result of the current repair area is merged with the original printing plan solution, and the correspondence between the printable points and the nozzle resources is updated.

[0036] In practical implementation, considering the discreteness of the repair set, it is preferable that, for each point to be repaired, during the first local replanning operation, A value of 1 means that there is only one point to be printed within the local area to be repaired and printed.

[0037] In practice, considering the accuracy and efficiency of local replanning solutions, the above-mentioned preset termination conditions are: there is no conflict between the optimal resource combination of a certain printing point in the current local printing area to be repaired and the optimal resource combination of printing points outside the current local printing area to be repaired, or the size of the current local printing area to be repaired reaches the preset maximum size.

[0038] As a preferred implementation, after the local replanning of each point to be repaired is completed, the completed local replanning results are saved to form a reusable prior structure. The prior structure includes the aforementioned new candidate matching relationship of each point to be printed in the local area to be repaired and the current optimal resource combination obtained by replanning. When each point to be printed in the current local area to be repaired has the same or similar candidate matching relationship with the saved prior structure, the saved optimal resource combination is called as the initial result or reference result in the current local replanning solution process.

[0039] Specifically, the prior structure includes at least the resource occupancy relationships of the set of points to be printed within the repair area, the candidate set, and the selected candidate results, which can be represented as: ;in, This indicates the repaired area that has been repaired. This represents a new candidate set of points to be printed within the repair area. This indicates the selected candidate results within the repair area. When the subsequent area to be repaired has the same or similar candidate set as the saved prior structure, the saved selected repair results can be used as the initial or reference results for the current local replanning. This can reduce the repeated construction and solution process and improve the efficiency and stability of printing planning updates under nozzle state changes.

[0040] After repairing all points to be repaired, the results of each local replanning are merged with the original printing planning solution to generate a new printing planning solution. The new printing planning solution retains the candidate selection results of unaffected printing points in the original printing planning solution, while updating the matching relationships of failed, degraded, and resource-consumption-affected printing points, thereby avoiding repeated global solutions for all printing points after changes in nozzle ejection status.

[0041] In this embodiment, when the nozzle spraying state changes, the original printing planning solution is not directly discarded. Instead, based on the original printing planning solution and the new candidate relationship, the points to be repaired are identified, and the planning results are updated through local replanning and expansion of the repair area. This method can balance the overall rationality of the original global printing planning solution with the efficiency of local updates after the nozzle state changes, thereby improving the efficiency of printing planning updates and the stability of planning results.

[0042] Example 2 A pattern planning and printing system for inkjet printing includes: an inkjet planning module and a printing module; The printing planning module is used to execute the printing planning method as described in Example 1, obtain the optimal resource combination for each printing point, and use it to plan the nozzle ejection sequence. The printing module, including a printhead control unit and a motion control unit, is used to control the printhead ejection and platform movement based on the planning results of the printing planning module, so that each nozzle completes printing according to the planned sequence during the base scanning process.

[0043] For example, in specific implementations, such as Figure 4 As shown, the inkjet pattern planning and printing system includes at least: an information acquisition module, an inkjet planning module, and a printing module.

[0044] The information acquisition module is used to collect the jet landing point position of each nozzle, the volume of the jetted ink droplets, the spatial coordinates of the dot matrix to be printed on the substrate, and the substrate tilt angle; Specifically, this is used to collect nozzle-side state information and substrate-side information on the points to be printed. The nozzle-side state information includes at least the position of each nozzle's ejection point and the volume of the ejected ink droplets; the substrate-side information on the points to be printed includes at least the spatial coordinates of the points to be printed on the substrate and the substrate tilt angle. This information is used to establish candidate matching relationships between nozzles and points to be printed, and to provide basic data for subsequent printing planning, nozzle state change identification, and ejection timing updates.

[0045] The printing planning module is used to complete the construction of the nozzle-printing point candidate relationship, the generation of printing planning solution, the local replanning after the nozzle state changes, and the printing timing planning based on the data provided by the information acquisition module.

[0046] Specifically, the printing planning module constructs a candidate matching relationship between the nozzles and the printable points based on the nozzle status information and printable point information input by the information acquisition module, and establishes a minimum deviation integer programming model to solve for the printing planning solution. When the nozzle spraying state changes, the printing planning module regenerates a new candidate relationship based on the changed nozzle landing point position and the original printing planning solution, and quickly obtains a new printing planning solution through local replanning.

[0047] Furthermore, based on the new printing plan solution, the printing planning module updates the ejection time corresponding to each nozzle in the X direction, combined with the positional deviation of the nozzle printing landing point, the substrate scanning motion parameters, and the substrate tilt angle information, and generates a printing plan file containing nozzle selection relationships, docking point information, resource occupation relationships, and ejection triggering sequence.

[0048] The specific technical solutions for candidate relation construction, minimum deviation integer programming solution and local reprogramming update are the same as in Implementation Example 1, and will not be repeated here.

[0049] The printing module includes a printhead control unit and a motion control unit. The printhead control unit comprises individual printhead control boards and printhead drive boards, while the motion control unit includes the base X-axis motion platform and the printhead Y-axis motion platform. The print planning module generates print data files and motion platform parameter data, which are then transmitted to the printhead control unit and the motion control unit, respectively.

[0050] Specifically, the printhead motion platform moves along the Y-axis, and the substrate moves along the X-axis under the drive of the base. By controlling the timing of the printhead's spraying action, each nozzle completes spraying at the corresponding Y-axis position according to the planned timing during the X-axis scanning motion of the base. By repeating the above process, the spraying control of the entire printing process is completed.

[0051] The relevant technical solutions are the same as above, and will not be repeated here.

[0052] Example 3 This application also relates to a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method described above.

[0053] Specifically, the memory may include high-speed random access memory, as well as non-volatile memory, such as hard disks, RAM, plug-in hard disks, smart media cards (SMC), secure digital (SD) cards, flash cards, at least one disk storage device, flash memory device, or other volatile solid-state storage devices.

[0054] The relevant technical solutions are the same as above, and will not be repeated here.

[0055] This invention proposes a printing planning method that adapts to changes in nozzle state. It constructs candidate matching relationships between nozzles and printable points and establishes a global planning model to obtain the original printing planning solution. When the nozzle ejection state changes, it combines the new candidate relationships with the original printing planning solution to identify failed or degraded points requiring repair. A new printing planning solution is then quickly generated through local replanning, thus balancing global planning and local updates, reducing repeated global solutions after state changes, and improving printing planning efficiency and result stability. In summary, this invention provides a printing planning and local replanning method that adapts to changes in nozzle state, solving the problems of complex nozzle-to-printable-point matching planning, difficulty in coordinating global constraints on nozzle resources, and high costs associated with repeated global solutions after nozzle state changes in existing technologies.

[0056] Those skilled in the art will readily understand that the above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method of jet printing planning that accommodates disturbances in nozzle state, the method comprising: receiving a print job; determining a print job plan; determining a print job plan that accommodates disturbances in nozzle state; and printing the print job plan. include: Based on the reachability relationship between the nozzle landing point and the printing point, candidate matching relationships are constructed between the nozzle docking point, the nozzle, and each printing point. determine, from the candidate matching relationships, a raw jet printing plan solution with a relative ejection orifice landing position change, the raw jet printing plan solution including a set of stops and a raw optimal resource combination including the stops and ejection orifice numbers corresponding to each point to be printed; When the nozzle state is disturbed, the set of stopovers in the original jet printing planning solution is maintained Under the condition of invariability, according to the changed spatial distribution of the drop positions of the nozzles, a new candidate matching relationship corresponding to each to-be-printed point is reconstructed, and based on the new candidate matching relationship, a to-be-repaired point set is formed by identifying the to-be-printed points that are invalid and degraded in the original jet printing planning solution; wherein the to-be-printed point that is invalid means that its original optimal resource combination does not exist in the new candidate matching relationship, and the to-be-printed point that is degraded means that the current printing deviation of the original optimal resource combination thereof is increased, or the ranking of the original optimal resource combination in the new candidate matching relationship is increased in ascending order of the candidate resource combinations according to the printing deviation. For each point in the set of points to be repaired, a corresponding local printing area to be repaired is constructed. The optimal matching relationship between each printing point in the area and the printhead docking point and nozzle is locally replanned. During the replanning process, if the optimal matching result of a certain printing point conflicts with the current optimal resource combination of printing points outside the current local printing area to be repaired, the printing point outside the area is merged into the current local printing area to be repaired and replanned locally. After the local printing areas of all printing points to be repaired are repaired, a new printing planning solution is generated by combining the original printing planning solution.

2. The jet printing planning method of claim 1, wherein, The method for constructing the candidate matching relationship between the printhead docking point, the nozzle, and each point to be printed is as follows: In the whole printing process, the printing point number is , the nozzle landing point number is , the nozzle hole number is , wherein , , , ; According to the reachability relationship, if the first The first stop The nozzle can spray to the first The nth point to be printed, then the nth The first stop, the Each nozzle is denoted as a candidate resource combination for that print point; and the calculation of the first... Printing deviation of each candidate resource combination for each print point; By the All candidate resource combinations for each point to be printed constitute the candidate resource combination set, denoted as . ,in, Indicates the first The first point to be printed A candidate resource combination, characterized by including stop point numbers. Nozzle number Resource usage information Indicates the first The total number of candidate resource combinations for each print point; and the determination of each candidate resource combination based on the printing deviation. The deviation weight is denoted as This is used to characterize the spatial deviation cost when a candidate resource is ejected to the point to be printed. The value satisfies the following: the larger the printing deviation, the greater the printing deviation weight. This completes the process of determining the nozzle docking point, nozzle orifice, and the... Construction of candidate matching relationships between points to be printed.

3. The printing planning method as described in claim 2, characterized in that, Construct nozzle docking points, nozzle holes and the first When considering the candidate matching relationships between the n points to be printed, it also includes: the nth In the set of candidate resource combinations for each print point, all candidate resource combinations are sorted in ascending order according to the printing deviation.

4. The printing planning method as described in claim 2, characterized in that, The method for obtaining the inkjet printing planning solution through global programming is as follows: The optimal matching process between the printhead docking point-orifice resource combination and each printing point is modeled as a minimum deviation integer programming model: Decision variables are ; The variable for enabling docking points is ; The objective function is: ; The constraint is that each point to be printed selects only its set of candidate resource combinations. One of the candidates is represented as: Any nozzle at any docking point can only be selected once, as shown below: The unique candidate dock to which each print point belongs should be enabled, as shown below: The total number of docking points in use cannot exceed a specified value, expressed as: ; Solving the minimum deviation integer programming model yields the printing programming solution, where the optimal resource combination for each printing point is denoted as... ,in, Indicates the point to be printed. Selected from the candidate resource combination set And obtain the set of enabled docking points. .

5. The printing planning method as described in claim 1, characterized in that, Perform the following local replanning steps for each point to be repaired: (1) Construct a local printable area containing the point to be repaired, including... A number of points to be printed, using characters q Traverse the One printable point; Based on the point to be printed q The new candidate matching relationships determine the new set of candidate resource combinations, denoted as . ; Indicates the point to be printed. q The A new candidate resource combination, characterized by including stop point numbers. Nozzle number Resource usage information; Indicates the point to be printed. q The total number of new candidate resource combinations; (2) The optimal matching process between the nozzle docking point-orifice resource combination and each print point in the current local print area to be repaired is modeled as a local replanning model: Decision variables are ; The objective function is denoted as: ; The constraint is: for each point to be printed q Select only One of the candidates: Each nozzle at any docking point can only be selected once: In the formula, This represents the combination of the point to be printed q and the candidate resources. The deviation weight, determined by the printing deviation between the two, is used to characterize the candidate resource combination. Spray onto the point to be printed q The spatial deviation cost during printing is determined by the following condition: the larger the printing deviation, the greater the weight of the printing deviation. (3) Solve the local replanning model to obtain the current optimal resource combination of each print point in the current local print area to be repaired; if the current optimal resource combination of a print point conflicts with the current optimal resource combination of a print point outside the current local print area to be repaired, then the print point outside the area is merged into the current local print area to be repaired, and the process is transferred to step (1) to iteratively execute local replanning until the preset termination condition is reached.

6. The printing planning method as described in claim 5, characterized in that, For each point to be repaired, during the first local replanning execution, A value of 1 means that there is only one point to be printed within the local area to be repaired and printed.

7. The printing planning method as described in claim 5, characterized in that, The preset termination condition is: There is no conflict between the optimal resource combination of a certain print point in the current local print area to be repaired and the optimal resource combination of print points outside the current local print area to be repaired, or the current local print area to be repaired has reached the preset maximum size.

8. The inkjet printing planning method as described in claim 1, characterized in that, After the local replanning of each point to be repaired is completed, the completed local replanning results are saved to form a reusable prior structure; the prior structure includes the new candidate matching relationship of each point to be printed in the local printing area to be repaired and the current optimal resource combination obtained by replanning; When each print point in the current local area to be repaired has the same candidate matching relationship with the saved prior structure, the saved optimal resource combination is called as the initial result or reference result in the current local replanning solution process.

9. A pattern planning and printing system for inkjet printing, characterized in that, include: Printing planning module and printing module; The printing planning module is used to execute the printing planning method as described in any one of claims 1 to 8, obtain the optimal resource combination for each printing point, and use it to plan the nozzle ejection timing. The printing module, including a printhead control unit and a motion control unit, is used to control the printhead ejection and platform movement based on the planning results of the printing planning module, so that each nozzle completes printing according to the planned sequence during the base scanning process.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium includes a stored computer program, wherein the computer program, when executed by a processor, controls the device on which the storage medium resides to perform the steps of the method as described in any one of claims 1 to 8.