Material label data management method based on multiple scenarios

Abstract

The present invention discloses a material tag data management method based on multiple scenarios, which relates to the technical field of data management. The method comprises the following steps: matching, pushing and sorting materials according to material information to obtain a preferred push route, performing road segment replacement and forward optimization push on the preferred push route to obtain a recommended delivery route; performing data stream conversion on the recommended delivery route to obtain a push data stream, performing flow segment decomposition and feature combination on the push data stream according to the push path segment to obtain a path identification matrix and performing intra-group calibration to obtain a path calibration matrix; performing route monitoring on material transportation according to the recommended delivery route to obtain a monitored delivery route, performing transportation inspection and status statistics on the monitored delivery route to obtain a monitoring code status, performing delivery verification on the monitored delivery route according to the monitoring code status to obtain a qualified push route and an error code push route; the material tracking capability is greatly improved, the transportation efficiency is improved, and it is beneficial to reduce delivery errors, waste and rework.

Description

Technical Field

[0001] The present invention relates to the technical field of data management, and in particular to a material label data management method based on multiple scenarios. Background Art

[0002] Material tag data management has a wide range of applications in multiple scenarios, including supply chain management scenarios, logistics management fields, retail fields, manufacturing fields, and e-commerce fields. Although material tag data management has many advantages in multiple scenarios, it also has some disadvantages and deficiencies: tag identification may have recognition errors or be inaccurate; the consistency and integrity of material tag data may be affected by factors such as label quality, data entry errors, or system integration problems; material tag data involves sensitive information; it may increase costs and maintenance complexity; therefore, it is of great theoretical and practical significance to monitor the safety of material transportation through the tag data of materials in different scenarios.

[0003] The problem we need to solve is how to use data management technology to match, push and sort material information, obtain the optimal push route, replace the road segment and push forward, and obtain the recommended delivery route; convert the recommended delivery route into data stream, obtain the push data stream, decompose the push data stream into segments and calibrate it within the group according to the push path segment, and obtain the path calibration matrix; monitor the material transportation route according to the recommended delivery route, obtain the monitored delivery route, and verify the monitored delivery route according to the path calibration matrix to obtain the qualified push route and the error push route. To this end, a material label data management method based on multiple scenarios is now provided. Summary of the invention

[0004] The purpose of the present invention can be achieved through the following technical solutions:

[0005] The material label data management method based on multiple scenarios includes the following steps:

[0006] Step S1: Setting a multilateral scanning terminal to scan data of a material to obtain multi-source label data, wherein the multi-source label data includes material information and transportation information;

[0007] Step S2: Set the transport node for the transport information and divide the delivery into segments to obtain the delivery path segments, match and push the materials according to the material information, obtain the matching recommendation coefficients, sort the matching recommendation coefficients, obtain the preferred push route, replace the road segments at the transport node according to the preferred push route, obtain the replacement cost coefficient, and push the transport route forward according to the replacement cost coefficient to obtain the recommended delivery route;

[0008] Step S3: performing data stream conversion on the recommended delivery route to obtain a push data stream, performing flow segment decomposition and feature combination on the push data stream according to the push path segments to obtain a path identification matrix, and performing intra-group calibration on the path identification matrix to obtain a path calibration matrix;

[0009] Step S4: Monitor the material transportation route according to the recommended distribution route, obtain the monitored distribution route, perform transportation inspection on the monitored distribution route according to the obtained path matrix set, obtain the monitoring transportation code, perform status statistics on the obtained monitoring transportation code, obtain the monitoring code status, perform distribution inspection on the monitored distribution route according to the obtained monitoring code status, and obtain a qualified push route and an error code push route.

[0010] The process of obtaining the preferred push route includes:

[0011] Setting a transportation node for the obtained transportation information, dividing the transportation information into distribution segments according to the obtained transportation nodes, and obtaining distribution path segments;

[0012] Match and push materials based on the obtained material information to obtain matching recommendation coefficients;

[0013] The obtained matching recommendation coefficients are sorted to obtain the preferred push route.

[0014] The process of obtaining a recommended delivery route includes:

[0015] According to the obtained preferred push route, the road section is replaced at the transportation node to obtain the replacement optimized path;

[0016] Obtaining a replacement cost coefficient according to the obtained replacement optimization path;

[0017] Sort the obtained replacement cost coefficients to obtain the replacement path push sorting;

[0018] The transportation route is pushed forward according to the obtained replacement path push ranking to obtain a recommended delivery route, and the delivery path segments in the recommended delivery route are marked as push path segments.

[0019] The process of obtaining the path identification matrix includes:

[0020] Performing data stream conversion on the obtained recommended delivery routes to obtain a push data stream;

[0021] Decomposing the pushed data stream into stream segments according to the obtained pushed path segments to obtain path stream sub-segments;

[0022] The path flow sub-segments are feature combined within the push path segment to obtain a path identification matrix.

[0023] The process of obtaining the path calibration matrix includes:

[0024] Performing intra-group calibration on the obtained path identification matrix to obtain a path calibration matrix;

[0025] Matching the obtained path calibration matrix with the push path segment, and associating the successfully matched push path segment with the corresponding path calibration matrix;

[0026] The obtained path calibration matrices are sorted and combined according to the obtained recommended delivery routes to obtain a path matrix set.

[0027] The process of obtaining the monitoring code status includes:

[0028] Perform route monitoring on material transportation according to the obtained recommended delivery route, obtain a monitored delivery route, and mark the push path segment in the monitored delivery route as a monitored path segment;

[0029] Sorting the obtained monitoring path segments according to the obtained monitoring delivery routes to obtain a monitoring segment sequence;

[0030] Based on the sequence of monitored sections and the obtained path matrix set, the monitored distribution route is inspected for transportation and the monitored transportation code is obtained.

[0031] The process of transport inspection of the monitored distribution route based on the obtained path matrix set includes:

[0032] Perform matrix calibration on the first monitoring path segment in the monitoring path segment sequence and the first path calibration matrix in the path matrix set to obtain a monitoring transport code;

[0033] The second monitoring path segment in the monitoring section sequence is matrix-calibrated with the first path calibration matrix in the path matrix set to obtain the monitoring transport code, until all monitoring path segments in the monitoring section sequence are matrix-calibrated with the path calibration matrix in the path matrix set to obtain the monitoring transport code.

[0034] The process of obtaining qualified push routes and error push routes includes:

[0035] Perform status statistics on the obtained monitoring transport code to obtain the monitoring code status;

[0036] The monitoring transport codes are arranged in sequence according to the monitoring distribution route to obtain a monitoring transport code sequence;

[0037] Mark the monitoring code status of the monitoring transport code sequence to obtain the retrieval monitoring code group;

[0038] The retrieved monitoring code group is checked according to the obtained monitoring code status to obtain the qualified push route and the error code push route.

[0039] Compared with the prior art, the present invention has the following beneficial effects: matching, pushing and sorting materials according to material information to obtain a preferred push route, performing road segment replacement and forward optimization push on the preferred push route to obtain a recommended delivery route; performing data stream conversion on the recommended delivery route to obtain a push data stream, performing flow segment decomposition and feature combination on the push data stream according to the push path segment to obtain a path identification matrix and perform intra-group calibration to obtain a path calibration matrix; by monitoring material tags, it can ensure that materials are transported along the correct route, reduce transportation time and cost, and improve overall transportation efficiency;

[0040] Monitor the material transportation route according to the recommended distribution route to obtain the monitored distribution route, perform transportation inspection on the monitored distribution route according to the obtained path matrix set, obtain the monitored transportation code, perform status statistics on the obtained monitored transportation code, obtain the monitoring code status, and perform distribution inspection on the monitored distribution route according to the obtained monitoring code status to obtain a qualified push route and an error code push route; help reduce delivery errors during transportation, ensure that materials are sent to the correct location, and reduce waste and rework; according to the unique label corresponding to the material, it is easy to track the location and movement of the material in the supply chain, which helps to improve the transparency and traceability of the material. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0042] Figure 1 It is a schematic diagram of the present invention. DETAILED DESCRIPTION

[0043] The technical solution of the present invention will be clearly and completely described below in conjunction with the embodiments. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0044] like Figure 1 As shown, the material label data management method based on multiple scenarios includes the following steps:

[0045] Step S1: Setting a multilateral scanning terminal to scan data of a material to obtain multi-source label data, wherein the multi-source label data includes material information and transportation information;

[0046] Step S2: Set the transport node for the transport information and divide the delivery into segments to obtain the delivery path segments, match and push the materials according to the material information, obtain the matching recommendation coefficients, sort the matching recommendation coefficients, obtain the preferred push route, replace the road segments at the transport node according to the preferred push route, obtain the replacement cost coefficient, and push the transport route forward according to the replacement cost coefficient to obtain the recommended delivery route;

[0047] Step S3: performing data stream conversion on the recommended delivery route to obtain a push data stream, performing flow segment decomposition and feature combination on the push data stream according to the push path segments to obtain a path identification matrix, and performing intra-group calibration on the path identification matrix to obtain a path calibration matrix;

[0048] Step S4: Monitor the material transportation route according to the recommended distribution route, obtain the monitored distribution route, perform transportation inspection on the monitored distribution route according to the obtained path matrix set, obtain the monitoring transportation code, perform status statistics on the obtained monitoring transportation code, obtain the monitoring code status, perform distribution inspection on the monitored distribution route according to the obtained monitoring code status, and obtain a qualified push route and an error code push route.

[0049] It should be further explained that, in the specific implementation process, the process of collecting multi-source label data includes:

[0050] Set up a multi-sided scanning terminal to scan the material data and obtain multi-source label data;

[0051] The multi-source label data includes material information and transportation information;

[0052] Furthermore, the material information includes product name, batch information, product storage quantity and storage location; the transportation information includes transportation starting point, transportation end point, transportation route, transportation time and transportation cost;

[0053] It should be further explained that, in the specific implementation process, the transportation route represents all the routes that the material can run between the same transportation starting point and transportation end point, that is, the transportation route, and the transportation cost represents all the overhead costs between the distribution of the material from the transportation starting point to the transportation end point.

[0054] Setting a transportation node for the obtained transportation information, dividing the transportation information into distribution segments according to the obtained transportation nodes, and obtaining distribution path segments;

[0055] The obtained delivery path segment is marked as P i , where i is the number of the delivery path segment in the transportation route, i=1, 2, 3, ..., u1, u1 is a positive integer;

[0056] Furthermore, the transport node means setting the transport node in the transport route according to the storage quantity and storage location of the product, setting the obtained transport node in the transport route, and segmenting at the transport node to obtain the distribution path segment;

[0057] Match and push materials based on the obtained material information to obtain matching recommendation coefficients;

[0058] The obtained matching recommendation coefficient is marked as Z, where: θ represents the set of transportation routes for materials;

[0059] Furthermore, the matching recommendation coefficient is calculated by the LOW-RANK ADAPTATION fine-tuning method, targeting the task-specific parameter increments. Encoded by a smaller set of transport route parameters θ, where |θ| is much smaller than |ψ0|;

[0060] The obtained matching recommendation coefficients are sorted in descending order to obtain a matching recommendation ranking;

[0061] Mark the transport routes corresponding to the matching recommendation coefficients ranked in the first a positions as the preferred push routes;

[0062] According to the obtained preferred push route, the road section is replaced at the transportation node to obtain the replacement optimized path;

[0063] It should be further explained that, in the specific implementation process, the route replacement means that all transport nodes in the obtained preferred push route are randomly replaced, that is, the delivery path segment is randomly replaced to obtain newly added transport nodes and deleted transport nodes, wherein the newly added transport node means that the delivery path segment replaced with another transport route generates a new transport node, and a new delivery path segment is generated correspondingly; but at the same time, the transport node corresponding to the replaced delivery path segment must be deleted, and the original delivery path segment is deleted accordingly;

[0064] The replacement cost coefficient is obtained according to the obtained replacement optimization path, and the obtained replacement cost coefficient is marked as C(P i ),in, W e The default weights of the delivery path segment e are all 1, E add represents the set of delivery path segments added to replace the optimized path, E del represents the set of delivery path segments deleted by the replacement optimization path, W v The default weights of transport nodes v are all 1, V add represents the set of newly added transport nodes in the replacement optimization path, V delrepresents the set of transport nodes deleted by the replacement optimization path;

[0065] The obtained replacement cost coefficients are sorted in descending order to obtain the replacement path push sorting;

[0066] Further, the obtained replacement path push ranking means sorting the replacement cost coefficients in descending order to obtain the replacement cost ranking, obtaining the replacement optimization paths corresponding to the replacement cost coefficients, sorting the replacement optimization paths, and obtaining the replacement path push ranking;

[0067] According to the obtained push ranking of the replacement paths, the transportation routes are pushed forward to obtain the recommended delivery routes, and the delivery path segments in the recommended delivery routes are marked as push path segments;

[0068] Furthermore, the forward optimization means that the recommended delivery routes are pushed to the material transportation manager in sequence according to the obtained replacement path push sorting, and the material transportation manager controls the logistics distribution of the materials until they are delivered to the transportation destination, and checks the itinerary of the recommended delivery routes passed during the transportation process.

[0069] Performing data stream conversion on the obtained recommended delivery routes to obtain a push data stream;

[0070] Furthermore, the data stream conversion means converting the obtained recommended delivery route into a data stream composed of a number of binary code elements;

[0071] Decomposing the pushed data stream into stream segments according to the obtained pushed path segments to obtain path stream sub-segments;

[0072] It should be further explained that, in a specific implementation process, the flow segment decomposition means that 7 binary code elements are divided into one segment, i.e., a path flow sub-segment, according to the length of the push path segment in the push data stream, and the binary code elements in the obtained path flow sub-segment are marked as j=1, j=2, j=3, j=4, j=5, j=6 and j=7;

[0073] The obtained path flow sub-segments are split within the group to obtain the front-end code element and the central identity code element;

[0074] Furthermore, the intra-group splitting means that the first four binary symbols of the path stream sub-segment are divided into one group, i.e., j=1, j=2, j=3 and j=4 are grouped as front-end symbols; the last three binary symbols are divided into one group, i.e., j=5, j=6 and j=7 are grouped as center identity symbols;

[0075] Perform feature combination on the path flow sub-segments in the push path segment to obtain a path identification matrix, and mark the obtained path identification matrix as H;

[0076] It should be further explained that, in the specific implementation process, the feature combination means combining the path flow sub-segments into groups of three to obtain a path identification matrix. If the last group of path flow sub-segments does not meet the requirement of three, a supplementary combination is performed forward until three path flow sub-segments are met as a group to form a path identification matrix. The obtained path identification matrix is ​​a matrix of three rows and seven columns.

[0077] Performing intra-group calibration on the obtained path identification matrix to obtain a path calibration matrix, and marking the obtained path calibration matrix as H0;

[0078] Further, the intra-group calibration means that the path identification matrix is ​​first partitioned within the group, that is, the front-end code elements j=1, j=2, j=3 and j=4 are grouped as a group to form a front-end code group inside the path identification matrix, denoted as R, and the front-end code group is a matrix of three rows and four columns; the central identity code elements j=5, j=6 and j=7 are grouped as a group to form a central identity code group inside the path identification matrix, denoted as D, and the central identity code group is a matrix of three rows and three columns; the path identification matrix can be expressed as H=[R┆D];

[0079] Then, the path identification matrix is ​​modulo-2 added until the central identity code group inside the path identification matrix becomes the unit matrix, and the transformed path identification matrix is ​​marked as the path calibration matrix;

[0080] Matching the obtained path calibration matrix with the push path segment, and associating the successfully matched push path segment with the corresponding path calibration matrix;

[0081] It should be further explained that, in the specific implementation process, each row in the path identification matrix represents a push path segment, and associating the successfully matched push path segment with the corresponding path calibration matrix can more conveniently check the material distribution route to check whether the material distribution is carried out according to the recommended distribution route;

[0082] According to the obtained recommended delivery routes, the obtained path calibration matrices are sorted and combined to obtain a path matrix set;

[0083] Furthermore, the sorting and combining means sorting and combining the path calibration matrices according to the arrangement order of each pushed path segment in the recommended delivery route to obtain a set of path calibration matrices corresponding to the recommended delivery routes, that is, a path matrix set.

[0084] The material transportation is monitored according to the obtained recommended distribution route to obtain the monitored distribution route, and the push path segment in the monitored distribution route is marked as a monitored path segment, and the obtained monitored path segment is marked as P i ';

[0085] Furthermore, the obtained monitored delivery route represents the actual transportation route monitored when the material is delivered according to the recommended delivery route, i.e., the monitored delivery route. It cannot be ensured that the actual transportation route is completely consistent with the recommended delivery route, so the actual transportation route needs to be checked to determine whether the transportation and delivery are carried out according to the recommended delivery route;

[0086] Sorting the obtained monitoring path segments according to the obtained monitoring delivery routes to obtain a monitoring segment sequence;

[0087] Further, the monitoring section sequence obtained is obtained by sorting the monitoring path sections in the monitoring delivery route in order to obtain the monitoring section sequence;

[0088] Based on the sequence of the monitored sections, the monitored distribution route is checked for transportation according to the obtained path matrix set, and the monitored transportation code is obtained, and the obtained monitored transportation code is marked as S i ,in, represents the transpose of the path calibration matrix H0;

[0089] It should be further explained that, in the specific implementation process, the transportation inspection process includes:

[0090] The first monitoring path segment in the monitoring segment sequence is matrix-calibrated with the first path calibration matrix in the path matrix set to obtain a monitoring transport code, and the obtained monitoring transport code is marked as S1, where:

[0091] The second monitoring path segment in the monitoring segment sequence is matrix-calibrated with the first path calibration matrix in the path matrix set to obtain a monitoring transport code, and the obtained monitoring transport code is marked as S2, where: Until all monitoring path segments in the monitoring path segment sequence are matrix-calibrated with the path calibration matrix in the path matrix set to obtain the monitoring transport code;

[0092] In particular, since the path calibration matrix is ​​composed of three pushed path segments, each three monitoring path segments form a group, corresponding to a path calibration matrix, and the fourth monitoring path segment in the monitoring path segment sequence is matrix-calibrated with the second path calibration matrix in the path matrix set, and the seventh monitoring path segment in the monitoring path segment sequence is matrix-calibrated with the third path calibration matrix in the path matrix set;

[0093] Performing status statistics on the obtained monitoring transport code to obtain the monitoring code status, wherein the monitoring code status includes a zero monitoring code and an abnormal monitoring code;

[0094] Furthermore, the zero monitoring code indicates that the matrix state of the monitoring transport code is a zero matrix, and the abnormal monitoring code indicates that the matrix state of the monitoring transport code is a non-zero matrix;

[0095] The monitoring path segment corresponding to the obtained zero monitoring code is marked as 0, and the monitoring path segment corresponding to the obtained abnormal monitoring code is marked as 1;

[0096] According to the obtained monitoring code status, the monitoring delivery route is verified to obtain the qualified delivery route and the error code delivery route;

[0097] It should be further explained that, in the specific implementation process, the delivery verification process includes:

[0098] The monitoring transport codes are arranged in sequence according to the monitoring distribution route to obtain a monitoring transport code sequence;

[0099] Mark the monitoring code status of the monitoring transport code sequence, mark the position of the monitoring transport code sequence where the monitoring transport code is zero as 0, mark the position of the monitoring transport code sequence where the monitoring transport code is abnormal as 1, and mark the monitoring transport code sequence that has completed the position marking as a retrieval monitoring code group;

[0100] Check the retrieval monitoring code group. If the retrieval monitoring code group is all 0, the monitoring distribution route corresponding to the retrieval monitoring code group is a qualified push route, indicating that the material distribution is transported completely according to the recommended distribution route;

[0101] If the retrieved monitoring code group is not all 0, the monitoring distribution route corresponding to the retrieved monitoring code group is an erroneous push route, indicating that the material distribution is not transported completely according to the recommended distribution route, that is, during the transportation process, there are monitoring path segments that do not match the push path segments, that is, the transportation is not carried out according to the push path segments. According to the position information of 1 in the retrieved monitoring code group, the monitoring path segments that are not transported according to the push path segments can be obtained, which is convenient for management personnel to conduct safety monitoring of the material transportation process.

[0102] The preferred embodiments of the present invention disclosed above are only used to help explain the present invention. The preferred embodiments do not describe all the details in detail, nor do they limit the invention to only specific implementation methods. Obviously, many modifications and changes can be made according to the content of this specification. This specification selects and specifically describes these embodiments in order to better explain the principles and practical applications of the present invention, so that those skilled in the art can understand and use the present invention well. The present invention is limited only by the claims and their full scope and equivalents.

Claims

1. A material label data management method based on multiple scenarios, characterized in that: The following steps are involved: Step S1: Setting a multilateral scanning terminal to scan data of a material to obtain multi-source label data, wherein the multi-source label data includes material information and transportation information; Step S2: Set the transport node for the transport information and divide the delivery into segments to obtain the delivery path segments, match and push the materials according to the material information, obtain the matching recommendation coefficients, sort the matching recommendation coefficients, obtain the preferred push route, replace the road segments at the transport node according to the preferred push route, obtain the replacement cost coefficient, and push the transport route forward according to the replacement cost coefficient to obtain the recommended delivery route; Step S3: convert the recommended delivery route into a data stream to obtain a push data stream, decompose the push data stream into segments and combine features according to the push path segments to obtain a path identification matrix, and perform intra-group calibration on the path identification matrix. The process of obtaining the path calibration matrix includes: Performing intra-group calibration on the obtained path identification matrix to obtain a path calibration matrix; Matching the obtained path calibration matrix with the push path segment, and associating the successfully matched push path segment with the corresponding path calibration matrix; According to the obtained recommended delivery routes, the obtained path calibration matrices are sorted and combined to obtain a path matrix set; Step S4: Monitor the material transportation route according to the recommended distribution route, obtain the monitored distribution route, perform transportation inspection on the monitored distribution route according to the obtained path matrix set, obtain the monitoring transportation code, perform status statistics on the obtained monitoring transportation code, obtain the monitoring code status, perform distribution inspection on the monitored distribution route according to the obtained monitoring code status, and obtain a qualified push route and an error code push route.

2. The material label data management method based on multiple scenarios according to claim 1 is characterized in that: The process of obtaining the preferred push route includes: Setting a transportation node for the obtained transportation information, dividing the transportation information into distribution segments according to the obtained transportation nodes, and obtaining distribution path segments; Match and push materials based on the obtained material information to obtain matching recommendation coefficients; The obtained matching recommendation coefficients are sorted to obtain the preferred push route.

3. The material label data management method based on multiple scenarios according to claim 2 is characterized in that: The process of obtaining a recommended delivery route includes: According to the obtained preferred push route, the road section is replaced at the transportation node to obtain the replacement optimized path; Obtaining a replacement cost coefficient according to the obtained replacement optimization path; Sort the obtained replacement cost coefficients to obtain the replacement path push sorting; The transportation route is pushed forward according to the obtained replacement path push ranking to obtain a recommended delivery route, and the delivery path segments in the recommended delivery route are marked as push path segments.

4. The multi-scenario material label data management method according to claim 3 is characterized in that: The process of obtaining the path identification matrix includes: Performing data stream conversion on the obtained recommended delivery routes to obtain a push data stream; Decomposing the pushed data stream into stream segments according to the obtained pushed path segments to obtain path stream sub-segments; The path flow sub-segments are feature combined within the push path segment to obtain a path identification matrix.

5. The multi-scenario material tag data management method according to claim 4 is characterized in that: The process of obtaining the monitoring code status includes: Perform route monitoring on material transportation according to the obtained recommended delivery route, obtain a monitored delivery route, and mark the push path segment in the monitored delivery route as a monitored path segment; Sorting the obtained monitoring path segments according to the obtained monitoring delivery routes to obtain a monitoring segment sequence; Based on the sequence of monitored sections and the obtained path matrix set, the monitored distribution route is inspected for transportation and the monitored transportation code is obtained.

6. The multi-scenario material tag data management method according to claim 5 is characterized in that: The process of transport inspection of the monitored distribution route based on the obtained path matrix set includes: Perform matrix calibration on the first monitoring path segment in the monitoring path segment sequence and the first path calibration matrix in the path matrix set to obtain a monitoring transport code; The second monitoring path segment in the monitoring section sequence is matrix-calibrated with the first path calibration matrix in the path matrix set to obtain the monitoring transport code, until all monitoring path segments in the monitoring section sequence are matrix-calibrated with the path calibration matrix in the path matrix set to obtain the monitoring transport code.

7. The multi-scenario material tag data management method according to claim 6 is characterized in that: The process of obtaining qualified push routes and error push routes includes: Perform status statistics on the obtained monitoring transport code to obtain the monitoring code status; The monitoring transport codes are arranged in sequence according to the monitoring distribution route to obtain a monitoring transport code sequence; Mark the monitoring code status of the monitoring transport code sequence to obtain the retrieval monitoring code group; The retrieved monitoring code group is checked according to the obtained monitoring code status to obtain the qualified push route and the error code push route.

Images