Goods placement shortest path planning method and system, electronic equipment and storage medium

Abstract

The invention provides a goods placement shortest path planning method and system, electronic equipment and a storage medium. The method comprises the following steps: acquiring data of RFID tags of goods of a current to-be-placed batch and position information of a shelf number of a secondary warehouse; generating a to-be-placed shelf position set corresponding to all the goods according to the obtained data of the RFID tags of the current to-be-placed batch of goods; according to the to-be-placed shelf position set, generating a directed graph transfer closure between the shelf numbers of the second-level warehouse; taking the central warehouse as an initial node, taking any node in the position set of to-be-placed goods shelves as a target node, calculating distance values from the initial node to the target node one by one based on a directed graph transfer closure, and reordering according to the distance values from small to large to generate a node set of the shortest to-be-placed path. According to the method and the device, a plurality of goods can be quickly placed in the shortest path, and the optimal path can be reasonably planned according to the position information corresponding to the goods to be placed.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a method, system, electronic device and storage medium for planning the shortest path for goods placement. Background Art

[0002] In the central warehouse of the hospital, consumables and reagents are gradually managed in an intelligent and orderly manner. Among them, the main function of the central warehouse of the hospital is to temporarily store various medical devices and consumables delivered to the hospital from suppliers. Most of these medical devices and consumables are transported in full boxes or packages, and are characterized by large size, heavy weight, and a large number of categories. After receiving the goods, the central warehouse staff will unpack and sort them, and then send them to the secondary warehouse of the hospital for use after classification.

[0003] When goods are transferred from the central warehouse to the secondary warehouse for use, in order to reduce the labor intensity of manual operation and improve the efficiency of goods placement, RFID technology is usually used to classify goods after unpacking. After unpacking the goods transported in the form of a whole box or a whole package, an RFID tag is attached to each of the goods, and then the RFID tag information is read and automatically classified by the automated system. However, since the goods after unpacking need to be placed in different locations according to the different labels attached, how to quickly place multiple goods in the shortest path requires reasonable planning of the best route based on the location information corresponding to the goods to be placed. Summary of the invention

[0004] The purpose of the present application is to provide a method, system, electronic device and storage medium for planning the shortest path for goods placement, which solves the problem of being unable to plan the best route when multiple unpacked goods are transferred from a central warehouse to a secondary warehouse for use.

[0005] The purpose of this application is achieved by the following technical solutions:

[0006] In a first aspect, the present application provides a method for planning the shortest path for placing goods, which is used to plan the shortest path for placing multiple goods, and the method includes:

[0007] Obtain the data of the RFID tags of the current batch of goods to be placed and the location information of the shelf number in the secondary warehouse;

[0008] Generate a set of shelf locations corresponding to all goods to be placed based on the data of the RFID tags of the current batch of goods to be placed;

[0009] Generate a directed graph transitive closure between the shelf numbers in the secondary warehouse according to the set of shelf positions to be placed;

[0010] Taking the central warehouse as the initial node and any node in the set of shelf locations to be placed as the target node, the distance values ​​from the initial node to the target node are calculated one by one based on the directed graph transfer closure, and the nodes are reordered from small to large according to the distance values ​​to generate a set of nodes with the shortest path to be placed.

[0011] In some optional embodiments, the data of the RFID tags of the current batch of goods to be placed are identified one by one by the RFID tags of the current batch of goods to be placed within the readable range through an RFID reader, and the RFID reader obtains the goods association information of the identified RFID tag data one by one from the local database.

[0012] In some optional embodiments, the product-related information includes the batch, type, name, corresponding secondary warehouse shelf number and shelf layer of the product.

[0013] In some optional embodiments, the method for generating a directed graph transitive closure between the shelf numbers of the secondary warehouse according to the set of shelf positions to be placed is:

[0014] Get the set of shelf locations to be placed;

[0015] Determine whether there is a transfer path between each shelf position node in the to-be-placed shelf position set and any remaining shelf position node and the distance of the transfer path;

[0016] A directed graph transfer closure of the set of shelf positions to be placed is generated according to the judgment result, and the distance of the transfer path is used as the edge between the shelf position nodes.

[0017] In some optional embodiments, the shelf to be placed corresponding to the minimum distance value from the initial node to the target node is used as the initial shelf of the secondary warehouse shelf number; the shelf to be placed corresponding to the maximum distance value from the initial node to the target node is used as the terminal shelf of the secondary warehouse shelf number, and the shortest path to be placed between the intermediate nodes from the initial shelf to the terminal shelf is generated based on the directed graph transfer closure.

[0018] In some optional embodiments, based on the directed graph transitive closure, the distance of the transfer path corresponding to the edge between the shelf location nodes is used as the weight between the two shelf location nodes;

[0019] Calculate the minimum weight of the intermediate node shelves from the initial shelf to the final shelf, and generate the shortest placement path for the intermediate nodes between the initial shelf and the final shelf.

[0020] In the second aspect, the present application provides a system for planning the shortest path for placing goods, which is used to plan the shortest path for placing multiple goods. The system includes: an RFID reader / writer, which is used to identify the RFID tags of the current batch of goods to be placed one by one, and obtain the product association information of the identified RFID tag data; a local database, which is used to store the product association information of the RFID tag data of the goods and the location information of the secondary warehouse shelf number; a path generation module, which is used to generate a directed graph transitive closure between the secondary warehouse shelf numbers according to the set of shelf positions to be placed; a server, which is used to receive the product association information of the identified RFID tag data, and retrieve the set of shelf positions to be placed corresponding to the product association information; and is also used to calculate the distance value from the initial node to the target node one by one according to the directed graph transitive closure between the secondary warehouse shelf numbers, and re-sort from small to large according to the distance value to generate a set of nodes for the shortest path to be placed.

[0021] In some optional embodiments, the shortest path planning system for goods placement also includes: a weight calculation module, which uses the distance of the transfer path corresponding to the edge between the shelf location nodes as the weight between the two shelf location nodes, and calculates the minimum weight of the intermediate node shelf from the initial shelf to the terminal shelf.

[0022] In a third aspect, the present application provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of any of the above methods when executing the computer program.

[0023] In a fourth aspect, the present application provides a storage medium, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, the steps of any of the above methods are implemented.

[0024] The technical solution provided by this application has the following beneficial effects:

[0025] The present application discloses a method, system, electronic device and storage medium for planning the shortest path for placing goods, which can expand the application of RFID tags in placing goods after unpacking, making their application more extensive. By using the shelf information obtained through identification, based on the directed graph transfer closure between related shelves, the shortest path planning containing all batches of goods to be placed is calculated, and the nodes of the shortest path to be placed are placed one by one. Multiple goods can be quickly placed within the shortest path, and the best route can be reasonably planned according to the location information corresponding to the goods to be placed.

[0026] These and other aspects of the present application will be more concise and understandable in the following description of the embodiments. It should be understood that the above general description and the following detailed description are only exemplary and explanatory and cannot limit the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] The present application is further described below in conjunction with the accompanying drawings and embodiments.

[0028] Figure 1 It is a flowchart of a method for planning the shortest path for placing goods provided in an embodiment of the present application;

[0029] Figure 2 It is a flow chart of directed graph transfer closure generation in a method for planning the shortest path for placing goods provided in an embodiment of the present application;

[0030] Figure 3 A schematic diagram of an intermediate node on the shortest path in a method for planning the shortest path for placing goods provided in an embodiment of the present application;

[0031] Figure 4 It is a schematic diagram of shelf positions in a method for planning the shortest path for placing goods provided in an embodiment of the present application;

[0032] Figure 5 It is a schematic diagram of a shelf adjacency matrix in a method for planning the shortest path for placing goods provided in an embodiment of the present application;

[0033] Figure 6 It is a schematic diagram of a two-dimensional array of shelves in a method for planning the shortest path for placing goods provided in an embodiment of the present application;

[0034] Figure 7 It is a schematic diagram listing all the paths in a method for planning the shortest path for placing goods provided in an embodiment of the present application;

[0035] Figure 8 It is a schematic diagram of an adjacency matrix after all paths are listed in a method for planning the shortest path for placing goods provided in an embodiment of the present application;

[0036] Fig. 9 It is a structural schematic diagram of a system for planning the shortest path for placing goods provided in an embodiment of the present application;

[0037] Fig.10 It is a structural schematic diagram of another system for planning the shortest path for placing goods provided in an embodiment of the present application;

[0038] Fig.11 It is a structural schematic diagram of an electronic device provided in an embodiment of the present application;

[0039] Fig.12 It is a structural schematic diagram of a program product for implementing a method for planning the shortest path for placing goods provided in an embodiment of the present application. DETAILED DESCRIPTION

[0040] Below, the present application is further described in conjunction with the accompanying drawings and specific implementation methods. It should be noted that, under the premise of no conflict, the various embodiments or technical features described below can be arbitrarily combined to form a new embodiment.

[0041] The following will be combined with the drawings in the exemplary embodiments of the present invention to clearly and completely describe the technical solutions in the exemplary embodiments of the present invention. Obviously, the exemplary embodiments described are only part of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0042] See also Figure 1 The embodiment of the present application provides a method for planning the shortest path for placing goods, which is used to plan the shortest path for placing multiple goods. The method includes steps S101-S104.

[0043] The goods contain RFID tags for automatic classification, which are read by an automated system. The login identification corresponding to the automated system may include at least one of a mobile phone, a tablet computer (such as an iPad), a computer, a smart wearable device, other user-end devices commonly used for remote login, and a collection-end device dedicated to RFID tag reading.

[0044] In the embodiment of the present application, the RFID tag includes but is not limited to one or more of LF, HF (NFC), UHF and MW. Among them, when the reading distance is usually not more than 3m, UHF (Ultra high frequency) tags are preferably used, which are suitable for use in the identification and logistics transmission of goods, and are also applicable to the present application. When the reading distance is usually not more than 10m, NFC (Near field communication) tags are preferably used, which are suitable for electronic payment and short-range data transmission for terminal users, and are also applicable to the application of short-range data transmission of goods in the present application, and are also applicable to the present application.

[0045] Step S101: Obtain the data of the RFID tags of the current batch of goods to be placed and the location information of the shelf number of the secondary warehouse.

[0046] In some embodiments, the data of the RFID tags of the current batch of goods to be placed are identified one by one by the RFID tags of the current batch of goods to be placed within the readable range through an RFID reader, and the RFID reader obtains the goods association information of the identified RFID tag data one by one from the local database.

[0047] The product-related information includes the batch, type, name, corresponding secondary warehouse shelf number and shelf layer of the product.

[0048] Step S102: Generate a set of shelf locations to be placed corresponding to all goods based on the data of the RFID tags of the current batch of goods to be placed.

[0049] In an embodiment of the present application, a data identification method of an RFID tag is also provided, comprising:

[0050] The RFID tags of the current batch of goods to be placed are within the readable range of the RFID reader, and the RFID reader obtains the data of the RFID tags of the current batch of goods to be placed one by one;

[0051] The RFID reader is provided with a simulator for obtaining the product RFID tag data from a local database.

[0052] In the embodiment of the present application, the RFID reader is provided with a simulator which is also used by the cloud server to obtain the RFID tag data of the goods.

[0053] In an embodiment of the present application, the local database and the cloud server can be implemented through an automated system that includes product RFID tag data. Using this automated system, the acquisition of product association information can be achieved between RFID tags of different types of goods, which is conducive to the implementation of the RFID support function of the terminal.

[0054] For example, only the NFC function, which is relatively easy to set up and has little impact on the portability of the smart mobile terminal, can be equipped on the smart mobile terminal. With the cooperation of the data application system of the embodiment of the present application, the reading and writing functions of various types of RFID tags can still be realized.

[0055] In an embodiment of the present application, the RFID reader can obtain the associated data of the goods RFID tag data from a cloud server or a local database based on the goods RFID tag data. The cloud server or the local database is implemented by a mass storage device. These mass storage devices can be in the cloud relative to the location of the RFID data application device, that is, they are not in the same place as the physical location of the RFID data application device. The RFID data application device can access these databases through the Internet, that is, the database is a cloud database. The database can also be a local database, that is, the physical location of the RFID data application device and the mass storage device are in the same place, and can be connected by, for example, wireless or wired methods. The wireless or wired access methods include: WIFI / 2G / 3G / 4G mobile network access methods, or satellite communication, wireless broadcast communication access methods.

[0056] Step S103: Generate a directed graph transitive closure between the shelf numbers in the secondary warehouse according to the set of shelf positions to be placed.

[0057] In the examples of this application, see Figure 2 As shown, the method for generating a directed graph transitive closure between the shelf numbers of the secondary warehouse according to the set of shelf positions to be placed is:

[0058] S301, obtaining a set of shelf locations to be placed;

[0059] S302, determining whether there is a transfer path between each shelf position node in the to-be-placed shelf position set and any remaining shelf position node and the distance of the transfer path;

[0060] S303: Generate a directed graph transfer closure of the set of shelf positions to be placed according to the judgment result, and use the distance of the transfer path as the edge between the shelf position nodes.

[0061] Step S104: Taking the central warehouse as the initial node and any node in the set of shelf locations to be placed as the target node, the distance values ​​from the initial node to the target node are calculated one by one based on the directed graph transfer closure, and the distance values ​​are reordered from small to large to generate a node set of the shortest path to be placed.

[0062] In an embodiment of the present application, the shelf to be placed corresponding to the minimum distance value from the initial node to the target node is used as the initial shelf of the secondary warehouse shelf number; the shelf to be placed corresponding to the maximum distance value from the initial node to the target node is used as the terminal shelf of the secondary warehouse shelf number, and the shortest path to be placed between the intermediate nodes from the initial shelf to the terminal shelf is generated based on the directed graph transitive closure.

[0063] Among them, based on the directed graph transfer closure, the distance of the transfer path corresponding to the edge between the shelf location nodes is used as the weight between the two shelf location nodes;

[0064] Calculate the minimum weight of the intermediate node shelves from the initial shelf to the final shelf, and generate the shortest placement path for the intermediate nodes between the initial shelf and the final shelf.

[0065] In a specific application scenario, a method for planning the shortest path for placing goods in the present application considers the intermediate nodes on a shortest path.

[0066] In the embodiment of the present application, the simple path p= <v1,v2,…,v l >The intermediate nodes on the path p are those except v1 and v l Any node outside the set {v2, v3…, v l-1} in the node.

[0067] In this application, assume that all nodes of graph G are V = {1, 2..., n}, consider a subset {1, 2, ..., k}, for any node pair i, j∈V, consider all paths from i to j where all intermediate nodes are taken from the set {1, 2, ..., k}, and let p be the path with the smallest weight, that is, p is the shortest path. Consider the case where node k is an intermediate node on path p.

[0068] See also Figure 3 As shown in Figure 2, whether node k is an intermediate node on path p includes the following two different situations:

[0069] Assuming k is not an intermediate node on p, all intermediate nodes on p belong to the set {1, 2, ..., k-1}. Therefore, a shortest path from i to j with intermediate nodes from {1, 2, ..., k-1} is also a shortest path from i to j with intermediate nodes from {1, 2, ..., k}.

[0070] Assuming that node k is an intermediate node on path p, path p is decomposed into p1: i→k and p2: k→j. It can be obtained that p1 is a shortest path from node i to node k, because k is the last node and all intermediate nodes are taken from the set {1, 2, ..., k-1}. Similarly, p2 is a shortest path from node k to node j, and all intermediate nodes are taken from the set {1, 2, ..., k-1}.

[0071] Assumptions is the shortest path weight from node i to node j when all intermediate nodes are from {1, 2, ..., k}. When K = 0, the path consists of only one edge. Based on the above definition, it can be recursively defined as:

[0072]

[0073] Under this definition, the matrix This is the final answer we want, because all nodes are between 1 and n.

[0074] The shortest path weight can be calculated from the bottom up, and the algorithm input is n×n n Matrix W, return the shortest path weight matrix D (n) .

[0075] In the embodiment of the present application, when setting the transitive closure of a directed graph, given a directed graph G = (V, E), the node set is V = {1, 2, ..., n}, and a determination is made as to whether all node pairs contain a path from i to j. The transitive closure of the graph G is defined as a graph G′ = (V, E′), where E′ = {(i, j)}, and if G contains a path from i to j, it is added to E′.

[0076] In the embodiment of the present application, when there is a path in the graph G where all intermediate nodes from node i to j are taken from the set {1, 2, ..., k}, then otherwise

[0077] In the embodiment of the present application, the method for constructing the transitive closure is: put the edge (i, j) into the set E' if and only if The recursive definition is as follows:

[0078]

[0079] Similarly, the matrix is ​​calculated using increasing order

[0080] In the examples of this application, see Figure 4 As shown in the figure, assuming that the initial position is the starting point of shelf No. 0, the method for calculating the shortest distance from the starting point of shelf No. 0 to other shelf positions is as follows:

[0081] There are four shelves (0, 1, 2, 3). The distance between two shelves is the number on the edge. If there is no edge connecting two points, they cannot be reached and are infinite.

[0082] When the distance between any two shelves (for example, from vertex a to vertex b) needs to be shortened, a third point (vertex k) can be introduced, and the original distance from vertex a to vertex b can be shortened by transferring through vertex k, i.e. a->k->b. The calculation process is as follows:

[0083] like Figure 5 As shown, the distance 0->1 is 5, 0->2 is unreachable and the distance is ∞, 0->3 is 7, and so on. The graph can be converted into an adjacency matrix in sequence. The main diagonal, that is, from itself to itself, specifies the distance as 0, and the unreachable distance as infinity, as shown in Figure 5 As shown, the matrix is ​​used to store the shortest path weight between any pair of shelves.

[0084]

[0085] like Figure 6 As shown, create another two-dimensional array Path path array to store the shortest path between any pair of shelves. The content of each cell represents the shelf from point i to point j. (Initially, the search has not started yet, the default is -1).

[0086]

[0087] Then, start looking.

[0088] See also Figure 7 As shown, all paths are listed, where the path from the shelf to itself is 0.

[0089] That is:

[0090] 0 -> 1, 0 -> 2, 0 -> 3,

[0091] 1 -> 0, 1 -> 2, 1 -> 3,

[0092] 2 -> 0, 1 -> 1, 1 -> 3

[0093] Converted into a two - dimensional array, it is:

[0094] {0, 1}, {0, 2}, {0, 3}, {1, 0}, {1, 2}, {1, 3}, {2, 0}, {2, 1}, {2, 3}, {3, 0}, {3, 1}, {3, 2}

[0095] Select the shelf numbered 0 as the mid - point.

[0096] {0, 1}, {0, 2}, {0, 3}, {1, 0}, {1, 2}, {1, 3}, {2, 0}, {2, 1}, {2, 3}, {3, 0}, {3, 1}, {3, 2}

[0097] Starting from the first element of the two - tuple set above, loop and execute the following process:

[0098] 1. Use two variables i and j to point to the two elements in the two - tuple respectively. For example, for the two - tuple {0, 1}, i points to 0; j points to 1.

[0099] 2. Judge whether (A[i][0] + A[0][j]) < A[i][j], that is, judge whether the distance from point i to point j is less than the distance through the 0 - th shelf transfer. If false, judge the next set of two - dimensional arrays.

[0100] 3. If the expression is true, update the value of A[i][j] to A[i][0] + A[0][j], and the value of Path[i][j] to point 0, that is, set that i to j needs to pass through the 0 - th shelf for transfer.

[0101] After {0, 1} is executed according to this process; the distance of 0 -> 0 + 0 -> 1 is not less than 0 -> 1, and the same is true for the next groups {0, 2}, {0, 3}, {1, 0}, {2, 0}, {3, 0}.

[0102] After {1, 2} is executed according to this process, A[1, 0] is infinite, A[0, 2] is also infinite, and A[1, 4] = 4, so the transfer from point 1 to point 2 will not pass through the 0 - th shelf.

[0103] The same is true for A[1][0] being infinite and the next groups {1, 2}, {1, 3}.

[0104] {2, 1} According to this process, A[2][0]=3, A[0][1]=5, A[2][1]=3, then A[2][0]+, A[0][1]>A[2][1]

[0105] ………

[0106] By analogy, when traversing the set of two-tuples, no shelf No. 0 is suitable for transfer.

[0107] Similarly, select the shelf numbered 1 as the middle point, select the shelf numbered 2 as the middle point, and so on, traversing the tuple set {0, 1}, {0, 2}, {0, 3}, {1, 0}, {1, 2}, {1, 3}, {2, 0}, {2, 1}, {2, 3}, {3, 0}, {3, 1}, {3, 2};

[0108] When traversing {3, 0}, A[3][2] = 1, A[2][0] = 3, A[3][0] = unreachable, so shelf 2 is suitable as a transfer point between shelf 3 and shelf 0.

[0109] Set the distance matrix A[3][0]=1+3=4 and the path matrix Path[3][0]=2 points, indicating that the transfer from 3 to 0 is at shelf 2, which is the shortest distance.

[0110] See also Figure 8 As shown, from 3 to 0, the shortest distance is 4, and it is transferred at shelf 2. Similarly, after traversing the set of two-tuples, the shelf numbered 3 is selected as the middle point, and the final result is similar, traversing the set of two-tuples until all vertices have been the middle point once.

[0111] Based on the final result, we can know the shortest distance and path between any two points.

[0112] Assuming that it is necessary to go from shelf 1 to shelf 2, according to the path matrix Path[1][2]=3, it means the transfer starts from shelf 3, that is, 1->3->2.

[0113] When there are more than one transfer points, the route will be shorter if it passes through two or more transfer points, i.e. a->k1->k2b-> or a->k1->k2…->k->i…->b.

[0114] For example, from shelf 1 to shelf 0, the array path is:

[0115] Path[1][0] = 3, indicating that shelf 3 is the transfer point, so go from 3 to 0;

[0116] Path[3][0] = 2, which means from 3 to 0, shelf 2 is the transfer point, and then from 2 to 0;

[0117] Path[2][0]=-1, indicating that there is no path vertex from shelf 2 to shelf 0, that is, shelf 2 can go directly to shelf 0, that is, they are connected by an edge.

[0118] Finally, the shortest path is 1->3->2->0, and the distance is A[1][0]=6.

[0119] The shortest path planning method for placing goods in the present application can expand the application of RFID tags in the placement of goods after unpacking, making its application more extensive. By using the shelf information obtained by identification, based on the directed graph transfer closure between related shelves, the shortest path planning containing all batches of goods to be placed is calculated, and they are placed one by one according to the node set of the shortest path to be placed. Multiple goods can be quickly placed within the shortest path, and the best route can be reasonably planned according to the location information corresponding to the goods to be placed.

[0120] See also Fig. 9 The embodiment of the present application also provides a shortest path planning system for goods placement, which is used to implement the method recorded in the above embodiment. Its specific implementation method is consistent with the implementation method and the technical effect achieved in the embodiment of the above parameter adjustment method, and some contents will not be repeated here.

[0121] The shortest path planning system for goods placement is used to plan the shortest path for multiple goods to be placed, including: an RFID reader 101, used to identify the RFID tags of the current batch of goods to be placed one by one, and obtain the goods association information of the identified RFID tag data; a database 102, used to store the goods association information of the RFID tag data of the goods and the location information of the secondary warehouse shelf number; a path generation module 103, used to generate a directed graph transitive closure between the secondary warehouse shelf numbers according to the set of shelf positions to be placed; a server 104, used to receive and obtain the goods association information of the identified RFID tag data, and retrieve the set of shelf positions to be placed corresponding to the goods association information; it is also used to calculate the distance value from the initial node to the target node one by one according to the directed graph transitive closure between the secondary warehouse shelf numbers, and re-sort them from small to large according to the distance value to generate a node set of the shortest path to be placed.

[0122] See also Fig.10 In some embodiments, the shortest path planning system for goods placement also includes: a weight calculation module 105, which is used to use the distance of the transfer path corresponding to the edge between the shelf location nodes as the weight between the two shelf location nodes, and calculate the minimum weight of the intermediate node shelf from the initial shelf to the terminal shelf.

[0123] In some embodiments, the system performs the following steps:

[0124] Obtain the data of the RFID tags of the current batch of goods to be placed and the location information of the shelf number in the secondary warehouse;

[0125] Generate a set of shelf locations corresponding to all goods to be placed based on the data of the RFID tags of the current batch of goods to be placed;

[0126] Generate a directed graph transitive closure between the shelf numbers in the secondary warehouse according to the set of shelf positions to be placed;

[0127] Taking the central warehouse as the initial node and any node in the set of shelf locations to be placed as the target node, the distance values ​​from the initial node to the target node are calculated one by one based on the directed graph transfer closure, and the nodes are reordered from small to large according to the distance values ​​to generate a set of nodes with the shortest path to be placed.

[0128] The data of the RFID tags of the current batch of goods to be placed are identified one by one by the RFID tags of the current batch of goods to be placed within the readable range through the RFID reader, and the RFID reader obtains the goods-related information of the identified RFID tag data one by one from the local database.

[0129] In some implementations, the method for generating a directed graph transitive closure between shelf numbers in the secondary warehouse according to the set of shelf positions to be placed is:

[0130] Get the set of shelf locations to be placed;

[0131] Determine whether there is a transfer path between each shelf position node in the to-be-placed shelf position set and any remaining shelf position node and the distance of the transfer path;

[0132] A directed graph transfer closure of the set of shelf positions to be placed is generated according to the judgment result, and the distance of the transfer path is used as the edge between the shelf position nodes.

[0133] In some embodiments, the shelf to be placed corresponding to the minimum distance value from the initial node to the target node is used as the initial shelf of the secondary warehouse shelf number; the shelf to be placed corresponding to the maximum distance value from the initial node to the target node is used as the terminal shelf of the secondary warehouse shelf number, and the shortest path to be placed between the intermediate nodes between the initial shelf and the terminal shelf is generated based on the directed graph transitive closure.

[0134] Among them, based on the directed graph transfer closure, the distance of the transfer path corresponding to the edge between the shelf location nodes is used as the weight between the two shelf location nodes;

[0135] Calculate the minimum weight of the intermediate node shelves from the initial shelf to the final shelf, and generate the shortest placement path for the intermediate nodes between the initial shelf and the final shelf.

[0136] See also Fig.11 The embodiment of the present application further provides an electronic device 200, which includes at least one memory 210, at least one processor 220, and a bus 230 connecting different platform systems.

[0137] The memory 210 may include a readable medium in the form of a volatile memory, such as a random access memory (RAM) 211 and / or a cache memory 212 , and may further include a read-only memory (ROM) 213 .

[0138] Among them, the memory 210 also stores a computer program, which can be executed by the processor 220, so that the processor 220 executes the steps of the shortest path planning method for goods placement in the embodiment of the present application. Its specific implementation method is consistent with the implementation method and the technical effect achieved in the above-mentioned embodiment of the shortest path planning method for goods placement, and some contents will not be repeated here.

[0139] The memory 210 may also include a utility 214 having at least one program module 215, such program module 215 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0140] Accordingly, the processor 220 may execute the above-mentioned computer program and may execute the utility 214 .

[0141] The bus 230 may be a bus representing one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.

[0142] The electronic device 200 may also communicate with one or more external devices 240 such as keyboards, pointing devices, Bluetooth devices, etc., and may also communicate with one or more devices that can interact with the electronic device 200, and / or communicate with any device (such as a router, a modem, etc.) that enables the electronic device 200 to communicate with one or more other computing devices. Such communication may be performed through the input and output interface 250. In addition, the electronic device 200 may also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN) and / or a public network, such as the Internet) through a network adapter 260. The network adapter 260 may communicate with other modules of the electronic device 200 through the bus 230. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 200, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage platforms.

[0143] The embodiment of the present application also provides a storage medium for storing a computer program. When the computer program is executed, the steps of the method for planning the shortest path for goods placement in the embodiment of the present application are implemented. The specific implementation method is consistent with the implementation method and the technical effect achieved in the embodiment of the shortest path planning method for goods placement described above, and some contents will not be repeated here.

[0144] Fig.12 The program product 300 provided in this embodiment for realizing the above-mentioned method for planning the shortest path for placing goods is shown, which can adopt a portable compact disk read-only memory (CD-ROM) and include program code, and can be run on a terminal device, such as a personal computer. However, the program product 300 of the present application is not limited to this. In the present application, the readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, a system or a device or used in combination with it. The program product 300 can adopt any combination of one or more readable media. The readable medium can be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, system or device, or any combination of the above. More specific examples of readable storage media (non-exhaustive list) include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0145] The storage medium may include a data signal propagated in a baseband or as part of a carrier wave, wherein a readable program code is carried. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The readable storage medium may also be any readable medium, which may send, propagate, or transmit a program used by an instruction execution system, a system, or a device or used in combination with it. The program code contained on the readable storage medium may be transmitted with any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the above. The program code for performing the operation of the present application may be written in any combination of one or more programming languages, and the programming language includes object-oriented programming languages ​​such as Java, C++, etc., and also includes conventional procedural programming languages ​​such as C language or similar programming languages. The program code may be executed completely on a user computing device, partially on a user device, as an independent software package, partially on a user computing device, partially on a remote computing device, or completely on a remote computing device or server. Where a remote computing device is involved, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).

[0146] In summary, the shortest path planning method, system, electronic device and storage medium for placing goods in the present application can expand the application of RFID tags in the placement of goods after unpacking, making its application more extensive. By using the shelf information obtained by identification, based on the directed graph transfer closure between related shelves, the shortest path planning containing all batches of goods to be placed is calculated, and they are placed one by one according to the node set of the shortest path to be placed. Multiple goods can be quickly placed within the shortest path, and the best route can be reasonably planned according to the location information corresponding to the goods to be placed.

[0147] This application is explained from the perspectives of purpose of use, effectiveness, progress and novelty, and has met the functional enhancement and usage requirements emphasized by the Patent Law. The above description and drawings of this application are only the preferred embodiments of this application, and are not intended to limit this application. Therefore, all structures, systems, features, etc. that are similar or identical to this application, that is, all equivalent replacements or modifications made in accordance with the scope of the patent application of this application, should fall within the scope of protection of the patent application of this application.

Claims

1. A method for planning the shortest path for placing goods, characterized in that: The method for planning the shortest path for placing multiple goods includes: Obtain the data of the RFID tags of the current batch of goods to be placed and the location information of the shelf number in the secondary warehouse; Generate a set of shelf locations corresponding to all goods to be placed based on the data of the RFID tags of the current batch of goods to be placed; Generate a directed graph transitive closure between the shelf numbers in the secondary warehouse according to the set of shelf positions to be placed; Taking the central warehouse as the initial node and any node in the set of shelf locations to be placed as the target node, the distance values ​​from the initial node to the target node are calculated one by one based on the directed graph transfer closure, and the nodes are reordered from small to large according to the distance values ​​to generate a set of nodes with the shortest path to be placed.

2. The method for planning the shortest path for placing goods according to claim 1, characterized in that: The data of the RFID tags of the current batch of goods to be placed are identified one by one by the RFID tags of the current batch of goods to be placed within the readable range through the RFID reader, and the RFID reader obtains the goods association information of the identified RFID tag data one by one from the local database.

3. The method for planning the shortest path for placing goods according to claim 2, characterized in that: The product-related information includes the batch, type, name, corresponding secondary warehouse shelf number and shelf layer of the product.

4. The method for planning the shortest path for placing goods according to claim 1, characterized in that: The method for generating a directed graph transitive closure between shelf numbers in the secondary warehouse according to the set of shelf positions to be placed is: Get the set of shelf locations to be placed; Determine whether there is a transfer path between each shelf position node in the to-be-placed shelf position set and any remaining shelf position node and the distance of the transfer path; A directed graph transfer closure of the set of shelf positions to be placed is generated according to the judgment result, and the distance of the transfer path is used as the edge between the shelf position nodes.

5. The method for planning the shortest path for placing goods according to claim 4, characterized in that: The shelf to be placed corresponding to the minimum distance value from the initial node to the target node is used as the initial shelf of the secondary warehouse shelf number; The shelf to be placed corresponding to the maximum distance value from the initial node to the target node is used as the terminal shelf of the secondary warehouse shelf number, and the shortest path to be placed between the intermediate nodes between the initial shelf and the terminal shelf is generated based on the directed graph transitive closure.

6. The method for planning the shortest path for placing goods according to claim 1, characterized in that: Based on the directed graph transitive closure, the distance of the transfer path corresponding to the edge between the shelf location nodes is used as the weight between the two shelf location nodes; Calculate the minimum weight of the intermediate node shelves from the initial shelf to the final shelf, and generate the shortest placement path for the intermediate nodes between the initial shelf and the final shelf.

7. A system for planning the shortest path for placing goods, characterized in that: For planning the shortest path for placing multiple goods, the system includes: RFID reader / writer, used to identify the RFID tags of the current batch of goods to be placed one by one, and obtain the goods-related information of the identified RFID tag data; A local database is used to store the product association information of the product RFID tag data and the location information of the secondary warehouse shelf number; A path generation module is used to generate a directed graph transitive closure between the shelf numbers of the secondary warehouse according to the set of shelf positions to be placed; The server is used to receive the product association information obtained by the identified RFID tag data, and retrieve the set of shelf positions to be placed corresponding to the product association information; it is also used to transfer the closure according to the directed graph between the shelf numbers of the secondary warehouse, calculate the distance value from the initial node to the target node one by one, and re-sort the distance values ​​from small to large to generate a set of nodes of the shortest path to be placed.

8. The shortest path planning system for goods placement according to claim 7, characterized in that: It also includes a weight calculation module, which is used to use the distance of the transfer path corresponding to the edge between the shelf location nodes as the weight between the two shelf location nodes, and calculate the minimum weight of the intermediate node shelf from the initial shelf to the terminal shelf.

9. An electronic device, characterized in that: The electronic device comprises a memory and a processor, the memory stores a computer program, and the processor implements the steps of the method according to any one of claims 1 to 6 when executing the computer program.

10. A storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images