Assembly processing management method and system for automobile lamp production
By preparing multiple resolution paths and their timing factors, and using artificial intelligence models to predict and match the optimal resolution knowledge, the problem of resolving decision-making game events in automobile lamp production is solved, and the efficiency of assembly and processing management is improved.
Patent Information
- Application Number
- CN202510579703.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-05-07
- Publication Date
- 2025-09-19
- Estimated Expiration
- 2045-05-07
AI Technical Summary
The existing technology lacks a preparatory method for resolving decision-making game events in the production of automobile lamps, resulting in the inability to properly resolve decision-making game events at the appropriate time, thereby reducing the efficiency of automobile lamp assembly and processing management.
For the decision-making game events in assembly and processing management in the automobile lamp production scenario, multiple resolution paths and their timing factors are prepared. Based on the resolution path of the decision-making game events that develop in the future to the timing factor that is first triggered, the decision-making game events that will develop in the future are resolved, and the artificial intelligence model is used to predict possible development events and match the optimal resolution knowledge.
It achieves the proper resolution of decision-making game events at the appropriate time, improves the efficiency of automobile lamp assembly and processing management, and avoids affecting production efficiency.
Smart Images

Figure CN120672015A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of intelligent production management, and in particular to an assembly and processing management method and system for automobile lamp production. Background Art
[0002] Currently, in automotive lamp production scenarios, due to the complex and ever-changing on-site conditions, computer systems frequently engage in decision-making and game-playing when managing the assembly and processing of automotive lamps. These decision-making and game-playing events typically arise from the competition and coordination between multiple participants in the production process regarding resources, time, and processes. For example, when multiple stages of automotive lamp production compete for limited production resources, or when multiple process flows are interdependent and conflicting, game-like decision-making is required when faced with different options.
[0003] The existing technology lacks a preparatory method to resolve these decision-making game events, resulting in the inability to properly resolve decision-making game events at the appropriate time, reducing the efficiency of automobile lamp assembly and processing management, and even affecting automobile lamp production efficiency.
[0004] Therefore, a solution is urgently needed. Summary of the Invention
[0005] One of the purposes of the present invention is to provide an assembly and processing management method for automobile lamp production to solve the above-mentioned problems.
[0006] An embodiment of the present invention provides an assembly and processing management method for automobile lamp production, comprising:
[0007] For the decision-making game events of assembly and processing management in the automotive lighting production scenario, multiple resolution paths and their timing factors are prepared;
[0008] Based on the resolution path of the timing factor that is first triggered when the decision-making game event develops in the future, the decision-making game event that develops in the future is resolved.
[0009] Optionally, the preliminary steps for multiple resolution paths and their timing factors include:
[0010] Based on the first historical development information of decision-making game events, predict multiple possible development events;
[0011] Match the best resolution knowledge to each of multiple possible development events;
[0012] For multiple possible development events, the best resolution knowledge matching each of them is used to determine multiple resolution paths and their timing factors; wherein, one resolution path and its timing factor corresponds to one possible development event.
[0013] Optionally, the best solution knowledge matching step includes:
[0014] Traverse each possible development event in turn, and each time it is traversed:
[0015] Represent the possible development events traversed into an event development timeline;
[0016] Obtain the matching weights of multiple event development intervals on the event development timeline;
[0017] Generate knowledge matching constraints based on the matching weights of multiple event development intervals;
[0018] Based on the knowledge matching constraint, the optimal resolution knowledge is matched for the traversed possible development events according to the first characteristics of each of the multiple event development intervals;
[0019] Among them, knowledge matching constraints include:
[0020] When at least two mutually replaceable first parts of knowledge are matched, the first part of knowledge with the largest matching weight for the event development interval derived from the first feature is retained, and the remaining first parts of knowledge are discarded;
[0021] Furthermore, when at least two first features are jointly matched to the second portion of knowledge, if the average of the matching weights of the event development intervals from which the at least two first features originate exceeds a mean threshold, the second portion of knowledge is retained; otherwise, it is discarded;
[0022] Among them, the first characteristic includes: event development factors, development period, and development order.
[0023] Optionally, the steps for obtaining the matching weight include:
[0024] Based on the knowledge matching contribution allocation table, the knowledge matching contribution of each event development interval is determined according to the second characteristics of each of the multiple event development intervals on the event development timeline;
[0025] When the prediction confidence of an event development interval exceeds the confidence threshold, the matching weight of the corresponding event development interval is calculated as the weighted sum of its prediction confidence and the contribution of knowledge matching;
[0026] Otherwise, if the prediction confidence of other event development intervals before and after the corresponding event development interval on the event development timeline exceeds the confidence threshold, and the contribution types of the knowledge matching contributions of the three are the same, the matching weight of the corresponding event development interval is calculated as the weighted sum of its prediction confidence and the contribution degree of the knowledge matching contribution;
[0027] Otherwise, the matching weight of the corresponding event development interval is calculated as the corresponding value of its prediction confidence in the weight table;
[0028] Among them, the second feature includes: event development type.
[0029] Optionally, if the future development of the decision-making game event exceeds a threshold time and still has not triggered the timing factor, multiple triggering degree curves are drawn in which the decision-making game event approaches triggering different timing factors during the future development process; wherein, one triggering degree curve corresponds to one timing factor;
[0030] Based on each trigger degree curve, an induced trigger timing factor is selected from the timing factors;
[0031] Induce the current decision-making game event to develop into triggering the induced triggering timing factor;
[0032] Based on the resolution path of the induced triggering timing factors, the decision-making game events that will develop in the future are resolved.
[0033] Optionally, the steps for selecting the induction trigger timing factor include:
[0034] When there is a trigger degree curve with at least two peaks, the timing factor corresponding to the trigger degree curve with at least two peaks and the largest peak average value is used as the induced trigger timing factor;
[0035] Otherwise, if the first peak and the maximum peak in each trigger degree curve are the same, the timing factor corresponding to the trigger degree curve where the corresponding peak appears will be used as the induced trigger timing factor;
[0036] Otherwise, the peak evaluation value of each peak appearing in each triggering degree curve is calculated based on the weighted sum of the peak generation time sequence, the minimum generation time interval between the peak and other peaks, and the peak value;
[0037] The timing factor corresponding to the triggering degree curve of the peak with the maximum peak evaluation value is used as the induced triggering timing factor.
[0038] Optionally, the step of inducing the current decision-making game event to develop into triggering the induced triggering timing factor includes:
[0039] Matching the induction triggering knowledge based on the second historical development information of the decision game event in the future development process and the induction triggering timing factor;
[0040] Based on the induced triggering knowledge, the current decision-making game event is induced to develop into the triggering induced triggering timing factor.
[0041] An embodiment of the present invention provides an assembly and processing management system for automobile lamp production, comprising:
[0042] A preparation module is used to prepare multiple resolution paths and timing factors for decision-making game events in assembly and processing management in automotive lighting production scenarios;
[0043] The resolution module is used to resolve future decision-making game events based on the resolution path of the timing factor that is first triggered in the future development of the decision-making game event.
[0044] An embodiment of the present invention provides a computer-readable storage medium, wherein a computer program is stored on the computer-readable storage medium, and a processor executes the computer program to implement any of the methods described above.
[0045] An embodiment of the present invention provides an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement any of the methods described above.
[0046] The present invention has achieved the following beneficial effects:
[0047] The present invention prepares multiple resolution paths and timing factors for decision-making game events in assembly and processing management in automobile lamp production scenarios in advance. Based on the resolution path of the timing factor that is first triggered when the decision-making game event develops in the future, the decision-making game event that will develop in the future is resolved, thereby realizing preparatory resolution of the decision-making game event, ensuring that the decision-making game event is properly resolved at an appropriate time, improving the efficiency of automobile lamp assembly and processing management, and avoiding affecting the production efficiency of automobile lamps.
[0048] Other features and advantages of the present invention will be described in the following description, and in part will become apparent from the description, or will be understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures particularly pointed out in the written description and the accompanying drawings.
[0049] The technical solution of the present invention is further described in detail below through the accompanying drawings and embodiments. BRIEF DESCRIPTION OF THE DRAWINGS
[0050] The accompanying drawings are used to provide a further understanding of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the present invention and do not constitute a limitation of the present invention. In the accompanying drawings:
[0051] Figure 1 This is a flow chart of an assembly and processing management method for automobile lamp production according to an embodiment of the present invention;
[0052] Figure 2 This is another flow chart of an assembly and processing management method for automobile lamp production according to an embodiment of the present invention;
[0053] Figure 3 Schematic diagram of an assembly and processing management system for automobile lamp production according to an embodiment of the present invention. DETAILED DESCRIPTION
[0054] The preferred embodiments of the present invention are described below with reference to the accompanying drawings. It should be understood that the preferred embodiments described herein are only used to illustrate and explain the present invention, and are not used to limit the present invention.
[0055] Example 1:
[0056] The embodiment of the present invention provides an assembly and processing management method for automobile lamp production, such as Figure 1 Shown, including:
[0057] S1. Prepare multiple resolution paths and timing factors for the decision-making game events in assembly and processing management in the automotive lamp production scenario;
[0058] S2. Based on the resolution path of the timing factor that is first triggered when the decision-making game event develops in the future, the decision-making game event that will develop in the future is resolved.
[0059] The resolution path is the execution path for resolving the decision game event, and its timing factor is the appropriate time for the path execution. Specifically, for example: the light source installation and shell assembly on the temporary emergency assembly line require the use of the same high-precision robot. The decision game event is to decide which process should give priority to the high-precision robot. Then, resolution path 1 is to decide that the shell assembly process should give priority to the high-precision robot. Its timing factor is that the shell assembly has an urgent need. Resolution path 2 is to comprehensively decide which process should give priority to the robot based on the process priority, time requirements and resource utilization. Its timing factor is when the decision is made to consider any one of the factors among process priority, time requirements and resource utilization to decide on the process priority.
[0060] After multiple resolution paths and their timing factors are prepared, the decision-making game events will continue to develop in the future. When they develop to the point where they meet the timing factors, the timing factors will be triggered. Based on the resolution path of the timing factor that was triggered first, the decision-making game events that will develop in the future will be resolved.
[0061] The present invention prepares multiple resolution paths and timing factors for decision-making game events in assembly and processing management in automobile lamp production scenarios in advance. Based on the resolution path of the timing factor that is first triggered when the decision-making game event develops in the future, the decision-making game event that will develop in the future is resolved, thereby realizing preparatory resolution of the decision-making game event, ensuring that the decision-making game event is properly resolved at an appropriate time, improving the efficiency of automobile lamp assembly and processing management, and avoiding affecting the production efficiency of automobile lamps.
[0062] Example 2:
[0063] In the embodiment of the present invention, Figure 2 As shown, in S1, the preparatory steps for multiple resolution paths and their timing factors include:
[0064] S11. Predicting multiple possible development events based on the first historical development information of the decision game event;
[0065] S12. Match the best resolution knowledge for each of multiple possible development events;
[0066] S13. For multiple possible development events, use the best matching resolution knowledge to determine multiple resolution paths and their timing factors; wherein one resolution path and its timing factor corresponds to one possible development event.
[0067] The first historical development information includes at least the changes in the development process of the decision-making game event from its occurrence to the preparation of multiple resolution paths and their timing factors, such as changes in demand and external factors. Based on this first historical development information, multiple possible future development events of the decision-making game event can be predicted. When making predictions, an artificial intelligence model obtained through machine learning training based on the development processes of a large number of historical decision-making game events as training samples can be used to make predictions based on the first historical development information.
[0068] Optimal resolution knowledge indicates how and when to optimally resolve potential development events. Based on this optimal resolution knowledge, the resolution path and timing factors for potential development events can be determined. A potential development event represents a possible future development of a decision-making game event. Its resolution path and timing factors serve as preparations, waiting for the actual development of the decision-making game event to trigger the corresponding resolution path, thus achieving a preparatory resolution for the decision-making game event.
[0069] Overall, the accuracy, comprehensiveness and applicability of multiple mitigation paths and their timing factors have been greatly improved.
[0070] Example 3:
[0071] In an embodiment of the present invention, the step of matching the optimal solution knowledge includes:
[0072] Traverse each possible development event in turn, and each time it is traversed:
[0073] Represent the possible development events traversed into an event development timeline;
[0074] Obtain the matching weights of multiple event development intervals on the event development timeline;
[0075] Generate knowledge matching constraints based on the matching weights of multiple event development intervals;
[0076] Based on the knowledge matching constraint, the optimal resolution knowledge is matched for the traversed possible development events according to the first characteristics of each of the multiple event development intervals;
[0077] Among them, knowledge matching constraints include:
[0078] When at least two mutually replaceable first parts of knowledge are matched, the first part of knowledge with the largest matching weight for the event development interval derived from the first feature is retained, and the remaining first parts of knowledge are discarded;
[0079] Furthermore, when at least two first features are jointly matched to the second portion of knowledge, if the average of the matching weights of the event development intervals from which the at least two first features originate exceeds a mean threshold, the second portion of knowledge is retained; otherwise, it is discarded;
[0080] Among them, the first characteristic includes: event development factors, development period, and development order.
[0081] When representing the event development timeline, possible development events are divided into multiple local events according to the development stage, and each local event is set in the corresponding time interval on the timeline according to its development period. The local event forms an event development interval within the set time interval.
[0082] The matching weight of an event development interval represents its importance for optimal resolution knowledge matching. When matching optimal resolution knowledge, matching is performed based on the event development factors, development time periods, and development orders of each of the multiple event development intervals. In the first feature, event development factors refer to factors in the event development process, development time periods refer to the event segments of the event development, and development order refers to the order in which the events develop. A first portion of knowledge matching different first features is pre-set (for example, if the first feature's event development factor is an urgent need for shell assembly, the corresponding first portion of knowledge is determined to prioritize the use of a high-precision robot in the shell assembly process) and a second portion of knowledge matching different first features is pre-set (for example, if the first feature's event development factors are process priority and time requirements, the development time periods are adjacent, and the development orders are sequential, the corresponding second portion of knowledge is determined to prioritize the use of a robot in the process based on process priority, time requirements, and resource utilization). During matching, the first and second portions of knowledge retained after knowledge matching constraints are combined to obtain optimal resolution knowledge.
[0083] Therefore, when using knowledge matching constraints to constrain the matching process, when matching at least two mutually interchangeable first portions of knowledge, the first portion of knowledge with the largest matching weight for the event development interval derived from the first feature is retained, so that the retained first portion of knowledge is most suitable for use as a combination of optimal resolution knowledge after comprehensively considering the importance of using it for optimal resolution knowledge matching. When at least two first features are jointly matched to a second portion of knowledge, if the mean of the matching weights for the event development intervals derived from the at least two first features exceeds the mean threshold, indicating that the second portion of knowledge is suitable for use as a combination of optimal resolution knowledge after comprehensively considering the importance of using it for optimal resolution knowledge matching, it can be retained.
[0084] When matching the optimal resolution knowledge, the embodiment of the present invention represents possible development events as an event development timeline, and generates knowledge matching constraints based on the matching weights of multiple event development intervals. The constraints constrain the process of matching the optimal resolution knowledge according to the first features of multiple event development intervals, so that the importance of matching the optimal resolution knowledge for the event development interval is fully considered during matching, and the most appropriate choice is made when matching at least two mutually interchangeable first parts of knowledge and when at least two first features are jointly matched to the second part of knowledge, which greatly improves the accuracy of the optimal resolution knowledge matching and improves the applicability of the system.
[0085] Example 4:
[0086] In this embodiment of the present invention, the step of obtaining the matching weight includes:
[0087] Based on the knowledge matching contribution allocation table, the knowledge matching contribution of each event development interval is determined according to the second characteristics of each of the multiple event development intervals on the event development timeline;
[0088] When the prediction confidence of an event development interval exceeds the confidence threshold, the matching weight of the corresponding event development interval is calculated as the weighted sum of its prediction confidence and the contribution of knowledge matching;
[0089] Otherwise, if the prediction confidence of other event development intervals before and after the corresponding event development interval on the event development timeline exceeds the confidence threshold, and the contribution types of the knowledge matching contributions of the three are the same, the matching weight of the corresponding event development interval is calculated as the weighted sum of its prediction confidence and the contribution degree of the knowledge matching contribution;
[0090] Otherwise, the matching weight of the corresponding event development interval is calculated as the corresponding value of its prediction confidence in the weight table;
[0091] Among them, the second feature includes: event development type.
[0092] The knowledge matching contribution refers to the contribution of the event development interval to matching the optimal resolution knowledge. It has a contribution degree, which represents the extent of this contribution. For example, if the event development interval includes the event development factor "urgent need for shell assembly", the knowledge matching contribution is used to directly determine the resolution path (determining the priority use of the high-precision robot in the shell assembly process) and its timing factor (urgent need for shell assembly), corresponding to a larger contribution degree of 10. The knowledge matching contribution allocation table pre-sets the knowledge matching contribution corresponding to the second feature of different event development intervals.
[0093] The prediction confidence of the event development interval is the degree to which the artificial intelligence model is certain of the occurrence of the local event when predicting it. The confidence threshold is the threshold representing a higher prediction confidence. When the prediction confidence of the event development interval exceeds the confidence threshold, it means that it is more certain to occur. When quantifying the importance of the event development interval as the best solution to knowledge matching, its prediction confidence and the contribution of knowledge matching should be combined. The matching weight of the corresponding event development interval is calculated as the weighted sum of its prediction confidence and the contribution of knowledge matching (the sum of the two multiplied by the pre-set weights).
[0094] Otherwise, it means that the degree to which it is certain to occur is small, but if the prediction confidence of other event development intervals before and after it exceeds the confidence threshold and the contribution types of the knowledge matching contributions of the three (the event development interval and other event development intervals before and after it) are the same, it means that the corresponding event development interval has a greater impact on making the same knowledge matching contribution. When quantifying the importance of the event development interval as the best solution to knowledge matching, its prediction confidence and the contribution of knowledge matching should also be comprehensively considered. The matching weight of the corresponding event development interval is calculated as the weighted sum of its prediction confidence and the contribution of knowledge matching.
[0095] Otherwise, it means that the degree of its occurrence is less certain and its impact on the contribution to the same knowledge match is smaller. When quantifying the importance of the event development interval as the best solution to the knowledge match, quantification is performed only based on the prediction confidence, and the corresponding value in the weight table is queried as the matching weight. The greater the prediction confidence in the weight table, the greater the corresponding value.
[0096] When obtaining matching weights, the present invention introduces prediction confidence and contribution, and quantifies the importance of event development intervals for optimal knowledge matching in three situations, thereby greatly improving the accuracy and comprehensiveness of matching weight acquisition.
[0097] Example 5:
[0098] In an embodiment of the present invention, if the future development of a decision-making game event exceeds a threshold time and still has not triggered a timing factor, multiple triggering degree curves are drawn that are close to triggering different timing factors during the future development of the decision-making game event; wherein, one triggering degree curve corresponds to one timing factor;
[0099] Based on each trigger degree curve, an induced trigger timing factor is selected from the timing factors;
[0100] Induce the current decision-making game event to develop into triggering the induced triggering timing factor;
[0101] Based on the resolution path of the induced triggering timing factors, the decision-making game events that will develop in the future are resolved.
[0102] The threshold duration is a threshold representing a longer duration. If the future development of a decision-making game event exceeds the threshold duration and the timing factor is still not triggered, it means that the decision-making game event has not been resolved using an appropriate resolution path for a long time. At this time, multiple triggering degree curves are drawn for the decision-making game event to approach triggering different triggering timing factors in the future development process. When drawing, based on the triggering degree (conformity with the timing factor) and its conformity time of the process change of the decision-making game event in the second historical development information of the future development process, the corresponding multiple coordinate points are found in the template curve (the horizontal axis is time, the vertical axis is the curve of the triggering degree size) and connected in sequence to obtain the triggering degree curve.
[0103] Multiple triggering degree curves reflect the situation in which decision-making game events are close to triggering different timing factors in the future development process. Based on this, we can select induced triggering timing factors that are suitable for induction triggering and implement induction. After the induction is completed, the decision-making game events that will develop in the future can be resolved based on the resolution path of the induced triggering timing factors.
[0104] In an embodiment of the present invention, when a decision-making game event has not been resolved using an appropriate resolution path for a long period of time, multiple trigger degree curves of the decision-making game event that are close to triggering different trigger timing factors in the future development process are drawn. Based on this, an induced trigger timing factor that is suitable for induced triggering is selected, and induction is implemented. After the induction is completed, the decision-making game event that will develop in the future is resolved based on the resolution path of the induced trigger timing factor, which further improves the resolution efficiency and timeliness of the decision-making game event and improves the applicability of the system.
[0105] Example 6:
[0106] In an embodiment of the present invention, the step of selecting the induction trigger timing factor includes:
[0107] When there is a trigger degree curve with at least two peaks, the timing factor corresponding to the trigger degree curve with at least two peaks and the largest peak average value is used as the induced trigger timing factor;
[0108] Otherwise, if the first peak and the maximum peak in each trigger degree curve are the same, the timing factor corresponding to the trigger degree curve where the corresponding peak appears will be used as the induced trigger timing factor;
[0109] Otherwise, the peak evaluation value of each peak appearing in each triggering degree curve is calculated based on the weighted sum of the peak generation time sequence, the minimum generation time interval between the peak and other peaks, and the peak value;
[0110] The timing factor corresponding to the triggering degree curve of the peak with the maximum peak evaluation value is used as the induced triggering timing factor.
[0111] When a peak appears in the triggering degree curve, it indicates that the decision-making game event is continuously approaching triggering a timing factor during its future development, and then continuously moving away from triggering that timing factor. When a triggering degree curve with at least two peaks exists, and the triggering degree curve with at least two peaks and the largest average peak value corresponds to the triggering timing factor where the decision-making game event repeatedly approaches triggering during its future development, and the final average degree of proximity to triggering is the highest, the corresponding timing factor can be used as the induction target.
[0112] Otherwise, it means that there is only one peak in each trigger degree curve. If the first peak and the maximum peak in each trigger degree curve are the same, it means that the decision-making game event is constantly approaching triggering the corresponding timing factor for the first time in the future development process, and the final degree of proximity to the trigger is the highest. Its corresponding timing factor can be used as an induction target.
[0113] Otherwise, the weighted calculation sum (the sum of the three multiplied by the preset weights and added together) of the peak generation time order (the generation time order of each peak in different curves, the larger the peak generation time order, the closer it is to the trigger, and it is correlated with the peak evaluation value), the minimum generation time interval between the peak and other peaks (the larger the time interval, the smaller the degree of simultaneous approach to other timing factors, and it is correlated with the peak evaluation value), and the peak value size (the larger the peak value, the higher the degree of continuous approach, and it is correlated with the peak evaluation value) is used as the peak evaluation value of each peak appearing in each trigger degree curve, and the timing factor corresponding to the trigger degree curve of the peak with the maximum peak evaluation value is used as the induced trigger timing factor.
[0114] When selecting the induced trigger timing factor, the embodiment of the present invention accurately determines the timing factor most suitable as the induced trigger timing factor based on the peak conditions of each trigger degree curve, which greatly improves the accuracy, comprehensiveness and efficiency of the selection of the induced trigger timing factor.
[0115] Example 7:
[0116] In an embodiment of the present invention, the step of inducing the current decision-making game event to develop into triggering the induction triggering timing factor includes:
[0117] Matching the induction triggering knowledge based on the second historical development information of the decision game event in the future development process and the induction triggering timing factor;
[0118] Based on the induced triggering knowledge, the current decision-making game event is induced to develop into the triggering induced triggering timing factor.
[0119] Similarly, the second historical development information includes information about process changes during the future development process. Pre-set induction triggering knowledge matches different second historical development information and induction triggering timing factors. This induction triggering knowledge indicates how to induce the current decision-making game event (a decision-making game event whose future development exceeds a threshold duration and has not yet triggered the timing factor) to develop into a triggering induction triggering timing factor. For example, if the second historical development information is to prioritize the process based on the results of communication with the process manager, and the induction triggering timing factor is to prioritize the process based on any one of the following factors: process priority, time requirements, and resource utilization, then the induction triggering knowledge provides the computer system with ideas for considering process priority, time requirements, etc.
[0120] When the embodiment of the present invention induces the current decision-making game event to develop to trigger the induction triggering timing factor, the induction triggering knowledge is matched based on the second historical development information of the decision-making game event in the future development process and the induction triggering timing factor, and induction is implemented based on the induction triggering knowledge, thereby improving the induction accuracy and efficiency.
[0121] Example 8:
[0122] The embodiment of the present invention provides an assembly and processing management system for automobile lamp production, such as Figure 3 Shown, including:
[0123] Preparation module 1 is used to prepare multiple resolution paths and timing factors for the decision-making game events of assembly and processing management in the automotive lamp production scenario;
[0124] The resolution module 2 is used to resolve the decision-making game events that will develop in the future based on the resolution path of the timing factor that is first triggered when the decision-making game events develop in the future.
[0125] An embodiment of the present invention provides a computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, and a processor executes the computer program to implement any of the methods described above.
[0126] An embodiment of the present invention provides an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement any of the methods described above.
[0127] Obviously, those skilled in the art may make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if such changes and modifications fall within the scope of the claims and their equivalents, the present invention is intended to include such changes and modifications.
Claims
1. A method for managing assembly and processing of automobile lamp production, characterized in that: include: For the decision-making game events of assembly and processing management in the automotive lighting production scenario, multiple resolution paths and their timing factors are prepared; Based on the resolution path of the timing factor that is first triggered when the decision-making game event develops in the future, the decision-making game event that develops in the future is resolved.
2. The assembly and processing management method for automobile lamp production according to claim 1, characterized in that: Preparatory steps for multiple mitigation pathways and their timing factors include: Based on the first historical development information of decision-making game events, predict multiple possible development events; Match the best resolution knowledge to each of multiple possible development events; For multiple possible development events, the best resolution knowledge matching each of them is used to determine multiple resolution paths and their timing factors; wherein, one resolution path and its timing factor corresponds to one possible development event.
3. The assembly and processing management method for automobile lamp production according to claim 2, characterized in that: The steps for matching the best solution knowledge include: Traverse each possible development event in turn, and each time it is traversed: Represent the possible development events traversed into an event development timeline; Obtain the matching weights of multiple event development intervals on the event development timeline; Generate knowledge matching constraints based on the matching weights of multiple event development intervals; Based on the knowledge matching constraint, the optimal resolution knowledge is matched for the traversed possible development events according to the first characteristics of each of the multiple event development intervals; Among them, knowledge matching constraints include: When at least two mutually replaceable first parts of knowledge are matched, the first part of knowledge with the largest matching weight for the event development interval derived from the first feature is retained, and the remaining first parts of knowledge are discarded; Furthermore, when at least two first features are jointly matched to the second portion of knowledge, if the average of the matching weights of the event development intervals from which the at least two first features originate exceeds a mean threshold, the second portion of knowledge is retained; otherwise, it is discarded; Among them, the first characteristic includes: event development factors, development period, and development order.
4. The assembly and processing management method for automobile lamp production according to claim 3, characterized in that: The steps to obtain the matching weight include: Based on the knowledge matching contribution allocation table, the knowledge matching contribution of each event development interval is determined according to the second characteristics of each of the multiple event development intervals on the event development timeline; When the prediction confidence of an event development interval exceeds the confidence threshold, the matching weight of the corresponding event development interval is calculated as the weighted sum of its prediction confidence and the contribution of knowledge matching; Otherwise, if the prediction confidence of other event development intervals before and after the corresponding event development interval on the event development timeline exceeds the confidence threshold, and the contribution types of the knowledge matching contributions of the three are the same, the matching weight of the corresponding event development interval is calculated as the weighted sum of its prediction confidence and the contribution degree of the knowledge matching contribution; Otherwise, the matching weight of the corresponding event development interval is calculated as the corresponding value of its prediction confidence in the weight table; Among them, the second feature includes: event development type.
5. The assembly and processing management method for automobile lamp production according to claim 1, wherein: If the future development of the decision-making game event exceeds the threshold time and still has not triggered the timing factor, draw multiple triggering degree curves of the decision-making game event in the future development process that are close to triggering different timing factors; where one triggering degree curve corresponds to one timing factor; Based on each trigger degree curve, an induced trigger timing factor is selected from the timing factors; Induce the current decision-making game event to develop into triggering the induced triggering timing factor; Based on the resolution path of the induced triggering timing factors, the decision-making game events that will develop in the future are resolved.
6. The assembly and processing management method for automobile lamp production according to claim 5, characterized in that: The steps for selecting the triggering timing factor include: When there is a trigger degree curve with at least two peaks, the timing factor corresponding to the trigger degree curve with at least two peaks and the largest peak average value is used as the induced trigger timing factor; Otherwise, if the first peak and the maximum peak in each trigger degree curve are the same, the timing factor corresponding to the trigger degree curve where the corresponding peak appears will be used as the induced trigger timing factor; Otherwise, the peak evaluation value of each peak appearing in each triggering degree curve is calculated based on the weighted sum of the peak generation time sequence, the minimum generation time interval between the peak and other peaks, and the peak value; The timing factor corresponding to the triggering degree curve of the peak with the maximum peak evaluation value is used as the induced triggering timing factor.
7. The assembly and processing management method for automobile lamp production according to claim 5, characterized in that: The steps of inducing the current decision-making game event to develop into triggering the induced triggering timing factor include: Matching the induction triggering knowledge based on the second historical development information of the decision game event in the future development process and the induction triggering timing factor; Based on the induced triggering knowledge, the current decision-making game event is induced to develop into the triggering induced triggering timing factor.
8. An assembly and processing management system for automobile lamp production, characterized in that: include: A preparation module is used to prepare multiple resolution paths and timing factors for decision-making game events in assembly and processing management in automotive lighting production scenarios; The resolution module is used to resolve future decision-making game events based on the resolution path of the timing factor that is first triggered in the future development of the decision-making game event.
9. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and the processor executes the computer program to implement the method according to any one of claims 1 to 7.
10. An electronic device, characterized in that: The electronic device includes a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the method according to any one of claims 1 to 7.
Citation Information
Patent Citations
Power distribution network planning method considering reliable electricity price and multi-agent game
CN113935551A
Multi-state switch planning method and device for multi-agent game in market environment
CN116090753A
Flexible job shop scheduling method and device based on game evolutionary algorithm, electronic equipment and medium
CN116523266A