Path planning method, device and equipment, readable storage medium and program product

Abstract

The invention relates to a path planning method, device and equipment, a readable storage medium and a program product. The method comprises the steps of obtaining a plurality of order tasks in a target account, determining article position identifiers corresponding to a plurality of to-be-picked goods according to each order task, determining a logic area comprising at least one article position identifier according to each article position identifier, obtaining a seed article position identifier, and sending the seed article position identifier to the target account. According to the seed article position identification, the article position identification and the logic areas, path planning is carried out, a target order picking path is obtained, and the order tasks comprise at least one of a real-time order task and a cumulative order task. By adopting the method, the picking efficiency can be improved.

Description

Technical Field

[0001] The present application relates to the field of warehousing technology, and in particular to a path planning method, device, equipment, readable storage medium and program product. Background Art

[0002] Modern warehouse management usually involves logistics business, and picking is the core link of logistics business, which is to select the goods in the order task from the storage area. However, the goods in an order task may be of multiple types. In related technologies, it is usually the staff who picks the goods included in each order task in turn according to the picking path corresponding to each order task.

[0003] However, the picking paths planned by traditional path planning methods have the problem of low picking efficiency. Summary of the invention

[0004] Based on this, it is necessary to provide a path planning method, device, equipment, readable storage medium and program product that can improve picking efficiency in response to the above technical problems.

[0005] In a first aspect, the present application provides a path planning method, comprising:

[0006] Acquire multiple order tasks in the target account, and determine the item location identifiers corresponding to the multiple items to be picked according to each order task, wherein the order task includes at least one of a real-time order task and an accumulated order task;

[0007] Determining a logical zone including at least one item location identifier based on each item location identifier;

[0008] The seed item location identifier is obtained, and path planning is performed based on the seed item location identifier, the location identifiers of each item, and each logical area to obtain the target picking path.

[0009] In one embodiment, path planning is performed according to the seed item location identifier, the item location identifiers, and the logical zones to obtain a target picking path, including:

[0010] For each logical area, path planning is performed according to the seed item location identifier and the target item location identifier included in each logical area to obtain the intra-area path corresponding to each logical area;

[0011] Perform path planning based on the distance between the logic area and the packaging station to obtain the out-of-area path corresponding to the logic area;

[0012] The target picking path is determined based on the in-area path and out-of-area path corresponding to each logical zone.

[0013] In one embodiment, path planning is performed according to the seed item location identifier and the target item location identifier included in each logical zone to obtain the intra-regional path corresponding to each logical zone, including:

[0014] If the logical area does not include the seed item location identifier, the target item location identifiers are sorted in descending order to obtain the intra-region path corresponding to the logical area.

[0015] In one embodiment, path planning is performed according to the seed item location identifier and the target item location identifier included in each logical zone to obtain the intra-regional path corresponding to each logical zone, and further includes:

[0016] If the logical area includes the seed item location identifier, then sorting the target item location identifiers that are larger than the seed item location identifier in ascending order to obtain a path in the first area;

[0017] Sort the target item location identifiers that are smaller than the seed item location identifier in descending order to obtain a path within the second area;

[0018] The intra-region path of the first region is combined with the intra-region path of the second region to obtain an intra-region path corresponding to the logical region.

[0019] In one embodiment, determining a target picking path according to the in-area paths and out-area paths corresponding to each logical area includes:

[0020] Determine the initial picking route based on the routes within each area and the routes outside the area;

[0021] Determine whether there are two parallel target logical areas in each logical area according to the logical area identifier corresponding to each logical area;

[0022] If there are no two parallel target logical areas, the initial picking path is determined as the target picking path.

[0023] In one embodiment, the item position identifier includes a sequence number, and the parity of the sequence number is related to the relative position relationship between the position corresponding to the item position identifier and the target logical area, and the method further includes:

[0024] If there are two parallel target logical areas, then the sequence numbers corresponding to the item position identifiers included in each target logical area are obtained;

[0025] The initial picking path is optimized according to the parity of the sequence number to obtain the target picking path.

[0026] In a second aspect, the present application provides a path planning device, comprising:

[0027] An acquisition module, used to acquire multiple order tasks in a target account, and determine item location identifiers corresponding to multiple items to be picked according to each order task, wherein the order task includes at least one of a real-time order task and an accumulated order task;

[0028] A partitioning module, used to determine a logical area including at least one item location identifier according to each item location identifier;

[0029] The planning module is used to obtain the seed item location identifier, and perform path planning based on the seed item location identifier, the location identifiers of each item and each logical area to obtain a target picking path.

[0030] In a third aspect, an embodiment of the present application provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method of the first aspect when executing the computer program.

[0031] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the method of the first aspect described above.

[0032] In a fifth aspect, the present application further provides a computer program product, wherein the computer program product comprises a computer program, and when the computer program is executed by a processor, the steps of the method in the first aspect are implemented.

[0033] The above-mentioned path planning method, device, equipment, readable storage medium and program product obtain multiple order tasks in the target account, and determine the item location identifiers corresponding to multiple items to be picked according to each order task. According to each item location identifier, a logical area including at least one item location identifier can be determined, and a seed item location identifier is obtained. Path planning is performed based on the seed item location identifier, each item location identifier and each logical area to obtain a target picking path, wherein the order task includes at least one of a real-time order task and a cumulative order task. In the above embodiment, by counting the item location identifiers corresponding to the items to be picked included in multiple order tasks, path planning can be performed according to the item location identifiers corresponding to each item to be picked, the logical area corresponding to each item location identifier, and the seed item location identifier at which the staff starts picking, so as to obtain the final target picking path. These order tasks can be order tasks acquired in real time when the staff is in a picking state, or can be order tasks accumulated in the target account corresponding to the staff when the staff is in an unpicked state. This avoids the problem of low picking efficiency caused by the traditional technology of planning the picking path for only one order task, which results in the staff being able to complete only one order task at a time. The technical solution provided in the present application can count the items to be picked in multiple real-time order tasks and accumulated order tasks. The planned picking path is for multiple order tasks, so that the staff can execute multiple order tasks at the same time, thereby improving the picking efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0035] Figure 1 A diagram of an application environment of a path planning method in an embodiment;

[0036] Figure 2 A schematic diagram of a process flow of a path planning method in one embodiment;

[0037] Figure 3 This is an example diagram of continuous encoding in another embodiment;

[0038] Figure 4 This is an example diagram of a newly formulated encoding rule in another embodiment;

[0039] Figure 5 is a schematic flow chart of step 203 in another embodiment;

[0040] Figure 6 is an exemplary warehouse structure diagram in another embodiment;

[0041] Figure 7 A schematic diagram of a path planning process in another embodiment;

[0042] Figure 8 is a flowchart of an exemplary path planning method in an embodiment;

[0043] Fig. 9 is a structural block diagram of a path planning device in one embodiment;

[0044] Fig.10 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0045] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0046] Modern warehousing management usually involves logistics business, and picking is the core link of logistics business, which is to select the goods in the order task from the storage area. However, the goods in an order task may be of multiple types. In related technologies, it is usually the staff who picks the goods included in each order task in turn according to the picking path corresponding to each order task. The picking path is usually obtained by path planning based on the code corresponding to the location of the goods included in the order task.

[0047] However, one picking route is only for one order task. When workers pick goods according to the picking route, they can only complete one order at a time, and multiple orders cannot be completed at the same time. Therefore, the picking route planned by the traditional path planning method has the problem of low picking efficiency.

[0048] In view of this, the present application provides a path planning method, apparatus, device, readable storage medium and program product, by obtaining multiple order tasks in a target account, and determining item location identifiers corresponding to multiple items to be picked according to each order task, and determining a logical area including at least one item location identifier according to each item location identifier, obtaining a seed item location identifier, and performing path planning based on the seed item location identifier, each item location identifier and each logical area to obtain a target picking path, wherein the order task includes at least one of a real-time order task and a cumulative order task. In the above embodiment, by counting the item location identifiers corresponding to the items to be picked included in multiple order tasks, path planning can be performed according to the item location identifiers corresponding to each item to be picked, the logical area corresponding to each item location identifier, and the seed item location identifier at which the staff starts picking, so as to obtain the final target picking path. These order tasks can be order tasks acquired in real time when the staff is in a picking state, or can be order tasks accumulated in the target account corresponding to the staff when the staff is in an unpicked state. This avoids the problem of low picking efficiency caused by the traditional technology of planning the picking path for only one order task, which results in the staff being able to complete only one order task at a time. The technical solution provided in the present application can count the items to be picked in multiple real-time order tasks and accumulated order tasks. The planned picking path is for multiple order tasks, so that the staff can execute multiple order tasks at the same time, thereby improving the picking efficiency.

[0049] The path planning method provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown. Among them, the data storage system can store the data that the server 101 needs to process. The data storage system can be integrated on the server 101, or it can be placed on the cloud or other network servers. The server 101 can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides cloud computing services.

[0050] In an exemplary embodiment, Figure 2 As shown, a path planning method is provided, which is applied to Figure 1 The server 101 in the example is used for explanation. It is understandable that the method can also be applied to a server, and can also be applied to a system including a terminal and a server, and is implemented through the interaction between the terminal and the server. The following steps 201 to 203 are included. Among them:

[0051] Step 201 : obtaining a plurality of order tasks in a target account, and determining item location identifiers corresponding to a plurality of items to be picked according to each order task.

[0052] The target account is the account of the picking staff in the picking system. In the embodiment of the present application, the target account can receive multiple order tasks.

[0053] The order task includes at least one of a real-time order task and a cumulative order task.

[0054] A real-time order task may be an order task received by the staff corresponding to the target account when the staff corresponding to the target account is in a picking state, and a cumulative order task may be at least one order task accumulated in the target account when the staff corresponding to the target account is in a non-picking state.

[0055] In an embodiment of the present application, an order task includes at least one item location identifier corresponding to an item to be picked, and the item location identifier is used to indicate the location of the task to be picked. When the server performs path planning for multiple order tasks, it can count the number of items to be picked corresponding to the item location identifiers in each order task, thereby obtaining the item location identifiers ultimately used for path planning. For example, order task A includes a milk location identifier and an apple location identifier, and order task B includes an apple location identifier and a potato chip location identifier. The item location identifiers ultimately used for path planning are the milk location identifier, the apple location identifier, and the potato chip location identifier.

[0056] In a possible implementation, the item location identifier may be encoded in a continuous encoding manner, referring to Figure 3 For example, if there are 48 item locations in the warehouse, each item location can be coded from far to near, and the item location identifier corresponding to each item location can be 001-048.

[0057] However, these items may be located on different shelves or on different layers of the same shelf. This coding method cannot reflect the specific location of each item. It is difficult for staff to quickly find the location of the items to be picked according to the continuously coded item location identifiers, which makes the picking efficiency low. Therefore, in another possible implementation, in order to facilitate staff to quickly find the location of the items according to the item location identifiers, the coding rules can be re-formulated. For example, the newly formulated coding rules are: logical area-shelf number-sequence number-layer number, refer to Figure 4, the entire warehouse can be divided into multiple logical areas, different logical areas correspond to different identifiers, the shelves in a logical area are visited from head to tail, and each shelf corresponds to a different shelf number. A shelf includes multiple layers, and each layer corresponds to a different layer number. In the embodiment of the present application, since a shelf is divided into left and right sides, and the left and right sides store different items respectively, in order to distinguish between the left and right, a sequence number is set. If the item is located on the left side of the shelf, the sequence number is an odd number, and if the item is located on the right side of the shelf, the sequence number is an even number. Exemplarily, the item position identifier is A-S1-2-1, and the item position corresponding to the item position identifier is in the first layer on the right side of the S1 shelf in the A logical area.

[0058] Step 202: Determine a logical zone including at least one item location identifier according to each item location identifier.

[0059] In an embodiment of the present application, the warehouse is divided into logical zones. The item locations corresponding to the item location identifiers may be in the same logical zone or in different logical zones. Therefore, the item location identifier also includes an identifier corresponding to the logical zone. In an embodiment of the present application, the server can determine at least one logical zone based on the identifier corresponding to the logical zone in each item location identifier.

[0060] Step 203, obtaining the seed item location identifier, and performing path planning according to the seed item location identifier, each item location identifier and each logical area to obtain a target picking path.

[0061] The seed item location identifier is the identifier corresponding to the item position at the beginning of the target picking path. Optionally, if the staff is in the picking state, the server can use the item location identifier corresponding to the last item picked by the staff as the seed item location identifier; optionally, the server can receive instructions input by the staff, and the instructions include the seed item location identifier.

[0062] In an embodiment of the present application, the server may use the seed item location identifier as the starting point of the target picking path, and then perform regional path planning for the item location identifiers included in each logical area. Finally, the paths corresponding to each logical area are merged to obtain the target picking path. Regarding the merging method, optionally, the server may sort each logical area according to the identifier corresponding to each logical area, and merge the paths corresponding to each logical area in sequence to obtain the target picking path; optionally, the server may continue to sort each logical area according to the distance between each logical area and the packing table (the location for confirming the completion of the order), and merge the paths corresponding to each logical area in sequence to obtain the target picking path.

[0063] In the above embodiment, by counting the item location identifiers corresponding to the items to be picked included in multiple order tasks, path planning can be performed according to the item location identifiers corresponding to each item to be picked, the logical area corresponding to each item location identifier, and the seed item location identifier at which the staff starts picking, so as to obtain the final target picking path. These order tasks can be order tasks acquired in real time when the staff is in a picking state, or can be order tasks accumulated in the target account corresponding to the staff when the staff is in an unpicked state. This avoids the problem of low picking efficiency caused by the traditional technology of planning the picking path for only one order task, which results in the staff being able to complete only one order task at a time. The technical solution provided in the present application can count the items to be picked in multiple real-time order tasks and accumulated order tasks. The planned picking path is for multiple order tasks, so that the staff can execute multiple order tasks at the same time, thereby improving the picking efficiency.

[0064] In one embodiment, based on the above Figure 2 The embodiment shown, see Figure 5 This embodiment involves a process of performing path planning based on the seed item location identifier, each item location identifier, and each logical zone to obtain a target picking path. Figure 5 As shown, step 203 may include steps 501 to 503 .

[0065] Step 501 : for each logical area, path planning is performed according to the seed item location identifier and the target item location identifier included in each logical area, so as to obtain the intra-area path corresponding to each logical area.

[0066] In the embodiment of the present application, the server performs regional path planning for the item location identifiers included in each logical area to obtain the intra-regional path corresponding to each logical area.

[0067] In a possible implementation, if the logical area does not include the seed object location identifier, the target object location identifiers are sorted in descending order to obtain the intra-region path corresponding to the logical area.

[0068] When the logical area does not include the seed item location identifier, the server can directly sort the target item location identifiers in descending order. In this embodiment, the larger the item location identifier, the farther the target item location is from the packing table. Sorting the target item location identifiers in descending order allows the staff to start picking from the place farthest from the packing table, and when the picking is completed, it will be closest to the packing table.

[0069] In another possible implementation, if the logical area includes a seed item location identifier, the server may sort the target item location identifiers that are larger than the seed item location identifier in order from small to large to obtain a path within the first area, sort the target item location identifiers that are smaller than the seed item location identifier in order from large to small to obtain a path within the second area, merge the path within the first area with the path within the second area to obtain an intra-area path corresponding to the logical area.

[0070] In this embodiment, the seed item location identifier is in the logical area, then the server needs to put the seed item location identifier in the first order, and compare the seed item location identifier with other item location identifiers included in the logical area, sort the target item location identifiers that are larger than the seed item location identifier in order from small to large, and obtain the path within the first area, then sort the target item location identifiers that are smaller than the seed item location identifier in order from large to small, and obtain the path within the second area, and finally, merge the path within the first area with the path within the second area to obtain the path within the area corresponding to the logical area.

[0071] Exemplarily, the item location identifiers in the logical area include 003, 008, 019, and 020, and the seed item location identifier is 015. Then, the target item location identifiers that are larger than the seed item location identifier are sorted in ascending order to obtain the path in the first area. The path in the first area is 015->019->020. At this time, the remaining item location identifiers 003 and 008 are smaller than the seed item location identifier 015. Then, the path in the second area is 008->003. The path in the first area is merged with the path in the second area to obtain the path in the area corresponding to the logical area 015->019->020->008->003.

[0072] Step 502 , performing path planning according to the distance between the logic area and the packaging station, and obtaining an out-of-area path corresponding to the logic area.

[0073] Since the distances between each logical area and the packing station are different, in order to avoid the staff from repeating unnecessary paths, in the embodiment of the present application, the server can obtain the distance between each logical area and the packing station, and sort each logical area according to the distance. In the embodiment of the present application, the server sorts the distances between each logical area and the packing station from far to near, thereby obtaining the out-of-area paths corresponding to each logical area. For example, refer to Figure 6 There are logical areas A, B, C, and D. The distances between each logical area and the packaging station are sorted from far to near, in the order of D, C, B, and A. The path outside the area is D->C->B->A.

[0074] Step 503: determine the target picking path according to the in-area path and the out-area path corresponding to each logical area.

[0075] After obtaining the intra-region path and the out-of-region path corresponding to each logical area, in a possible implementation, the server may merge the intra-region paths corresponding to each logical area according to the out-of-region path to obtain the target picking path. For example, the out-of-region path is C->B->A, the intra-region path corresponding to A is A8->A5->A3, the intra-region path corresponding to B is B8->B9->B11->B6->B1, and the intra-region path corresponding to C is C10->C7->C2, then the target picking path is "C10 -> C7 -> C2 -> B8 -> B9 -> B11 -> B6 -> B1->A8->A5->A3".

[0076] In another possible implementation, in some warehouses, there are logical areas placed side by side, and the left and right sides of the shelves in the logical areas are different items. At this time, if the intra-region paths corresponding to each logical area are simply merged according to the out-of-region paths, the staff may repeat unnecessary picking paths. Therefore, the server can determine the initial picking path based on the intra-region paths and the out-of-region paths. The initial picking path is obtained by merging the intra-region paths corresponding to each logical area according to the out-of-region paths.

[0077] Then, the server can determine whether there are two parallel target logical areas in each logical area based on the logical area identifiers corresponding to each logical area. For example, the server can obtain the arrangement relationship between the various logical areas, and the arrangement relationship includes a parallel relationship and a non-parallel relationship. The server can filter the arrangement relationship based on the logical area identifiers corresponding to each logical area to determine whether there are two parallel target logical areas.

[0078] Optionally, if there are no two parallel target logical areas, the initial picking path is determined to be the target picking path.

[0079] Optionally, the item location identifier includes a sequence number, and the parity of the sequence number is related to the relative position relationship between the position corresponding to the item location identifier and the target logical area. In this embodiment, if there are two parallel target logical areas, the server obtains the sequence number corresponding to the item location identifier included in each target logical area, optimizes the initial picking path according to the parity of the sequence number, and obtains the target picking path.

[0080] For example, refer to Figure 7, logical area A and logical area C are parallel, and the encoding rule is logical area-sequence number. The parity of the sequence number is related to the relative position relationship between the position corresponding to the item location identifier and the target logical area. For example, an even number represents the right side, and an odd number represents the left side. The physical location identifiers included in area A are A2, A4, and A10, and the physical location identifiers included in area C are C1, C7, and C15. The corresponding initial picking paths are A10->A4->A2->C15->C7->C1. The server determines that areas A and C are two parallel target logical areas, thereby determining that the right side of area A is adjacent to the left side of area C. That is, at this time, the server can optimize the initial picking path according to the parity of each sequence number, and sort the physical location identifiers included in logical area C and logical area A in order from large to small, and obtain the target picking path of C15->A10->C7->A4->C1->A1.

[0081] In the above embodiment, path planning is first performed on each logical area in a region-by-region manner to obtain the intra-region path corresponding to each logical area, thereby reducing the amount of calculation for path planning and improving the efficiency of path planning.

[0082] In one embodiment, referring to Figure 8 , provides an exemplary path planning method that can be applied to Figure 1 In the implementation environment shown.

[0083] Step 801: Acquire multiple order tasks in a target account, and determine item location identifiers corresponding to multiple items to be picked according to each order task.

[0084] The order task includes at least one of a real-time order task and a cumulative order task.

[0085] Step 802: Determine a logical zone including at least one item location identifier according to each item location identifier.

[0086] Step 803 , for each logical area, if the logical area does not include the seed item location identifier, sort the target item location identifiers in descending order to obtain the intra-area path corresponding to the logical area.

[0087] Step 804: If the logical area includes the seed item location identifier, then sort the target item location identifiers that are larger than the seed item location identifier in ascending order to obtain a path within the first area.

[0088] Step 805 , sort the target item location identifiers that are smaller than the seed item location identifier in descending order to obtain a path within the second area.

[0089] Step 806: merge the first intra-region path and the second intra-region path to obtain an intra-region path corresponding to the logical area.

[0090] Step 807, perform path planning according to the distance between the logic area and the packaging station to obtain an out-of-area path corresponding to the logic area.

[0091] Step 808, determining an initial picking path based on the paths within each area and the paths outside the area.

[0092] Step 809: Determine whether there are two parallel target logical areas in each logical area according to the logical area identifier corresponding to each logical area.

[0093] Step 810: If there are no two parallel target logical areas, the initial picking path is determined as the target picking path.

[0094] Step 811: If there are two parallel target logical areas, then the sequence numbers corresponding to the item location identifiers included in each target logical area are obtained.

[0095] Step 812, optimizing the initial picking path according to the parity of the sequence number to obtain the target picking path.

[0096] The item location identifier includes a sequence number, and the parity of the sequence number is related to the relative position relationship between the position corresponding to the item location identifier and the target logical area.

[0097] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0098] Based on the same inventive concept, the embodiment of the present application also provides a path planning device for implementing the path planning method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more path planning device embodiments provided below can refer to the limitations of the path planning method above, and will not be repeated here.

[0099] In an exemplary embodiment, Fig. 9As shown, a path planning device is provided, including: an acquisition module 901, a division module 902 and a planning module 903, wherein:

[0100] An acquisition module 901 is used to acquire multiple order tasks in a target account, and determine item location identifiers corresponding to multiple items to be picked according to each of the order tasks, wherein the order tasks include at least one of a real-time order task and an accumulated order task;

[0101] A division module 902, configured to determine a logical zone including at least one of the item location identifiers according to the item location identifiers;

[0102] The planning module 903 is used to obtain the seed item location identifier, and perform path planning according to the seed item location identifier, each item location identifier and each logical area to obtain a target picking path.

[0103] In one embodiment, the planning module 903 includes:

[0104] An intra-region planning unit is used to perform path planning for each of the logical areas according to the seed item location identifier and the target item location identifier included in each of the logical areas, so as to obtain an intra-region path corresponding to each of the logical areas;

[0105] An out-of-region planning unit, used to perform path planning according to the distance between the logic area and the packaging station, and obtain an out-of-region path corresponding to the logic area;

[0106] The target planning unit is used to determine the target picking path according to the in-area path and the out-area path corresponding to each of the logical areas.

[0107] In one embodiment, the intra-region planning unit is specifically configured to perform:

[0108] If the logical area does not include the seed item location identifier, the target item location identifiers are sorted in descending order to obtain the intra-region path corresponding to the logical area.

[0109] In one embodiment, the regional planning unit is further configured to execute:

[0110] If the logic area includes the seed item location identifier, sorting the target item location identifiers that are larger than the seed item location identifier in ascending order to obtain a path in the first area;

[0111] Sort the target item location identifiers that are smaller than the seed item location identifier in descending order to obtain a path within the second area;

[0112] The first intra-region path and the second intra-region path are merged to obtain the intra-region path corresponding to the logical area.

[0113] In one embodiment, the target planning unit is specifically used to execute:

[0114] Determine an initial picking path according to the paths within each area and the paths outside the area;

[0115] Determine whether there are two parallel target logical areas in each of the logical areas according to the logical area identifiers corresponding to each of the logical areas;

[0116] If there are no two parallel target logical areas, the initial picking path is determined to be the target picking path.

[0117] In one embodiment, the item location identifier includes a sequence number, and the parity of the sequence number is related to the relative position relationship between the position corresponding to the item location identifier and the target logical area. The target planning unit is further configured to execute:

[0118] If there are two parallel target logical areas, then obtaining the sequence numbers corresponding to the item location identifiers included in each of the target logical areas;

[0119] The initial picking path is optimized according to the parity of the sequence number to obtain the target picking path.

[0120] Each module in the above-mentioned path planning device can be implemented in whole or in part by software, hardware or a combination thereof. Each of the above-mentioned modules can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each of the above modules.

[0121] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Fig.10As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store path planning data. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a path planning method is implemented.

[0122] Those skilled in the art will understand that Fig.10 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0123] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:

[0124] Acquire multiple order tasks in the target account, and determine item location identifiers corresponding to multiple items to be picked according to each of the order tasks, wherein the order tasks include at least one of real-time order tasks and accumulated order tasks;

[0125] Determining, according to each of the item location identifiers, a logical area including at least one of the item location identifiers;

[0126] The seed item location identifier is obtained, and path planning is performed according to the seed item location identifier, each item location identifier and each logical area to obtain a target picking path.

[0127] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0128] For each of the logical areas, path planning is performed according to the seed item location identifier and the target item location identifier included in each of the logical areas to obtain an intra-area path corresponding to each of the logical areas;

[0129] Perform path planning according to the distance between the logic area and the packaging station to obtain an out-of-area path corresponding to the logic area;

[0130] The target picking path is determined according to the in-area path and the out-of-area path corresponding to each of the logical areas.

[0131] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0132] If the logical area does not include the seed item location identifier, the target item location identifiers are sorted in descending order to obtain the intra-region path corresponding to the logical area.

[0133] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0134] If the logic area includes the seed item location identifier, sorting the target item location identifiers that are larger than the seed item location identifier in ascending order to obtain a path in the first area;

[0135] Sort the target item location identifiers that are smaller than the seed item location identifier in descending order to obtain a path within the second area;

[0136] The first intra-region path and the second intra-region path are merged to obtain the intra-region path corresponding to the logical area.

[0137] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0138] Determine an initial picking path according to the paths within each area and the paths outside the area;

[0139] Determine whether there are two parallel target logical areas in each of the logical areas according to the logical area identifiers corresponding to each of the logical areas;

[0140] If there are no two parallel target logical areas, the initial picking path is determined to be the target picking path.

[0141] In one embodiment, the item location identifier includes a sequence number, and the parity of the sequence number is related to the relative position relationship between the position corresponding to the item location identifier and the target logical area. When the processor executes the computer program, the following steps are also implemented:

[0142] If there are two parallel target logical areas, then obtaining the sequence numbers corresponding to the item location identifiers included in each of the target logical areas;

[0143] The initial picking path is optimized according to the parity of the sequence number to obtain the target picking path.

[0144] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0145] Acquire multiple order tasks in the target account, and determine item location identifiers corresponding to multiple items to be picked according to each of the order tasks, wherein the order tasks include at least one of real-time order tasks and accumulated order tasks;

[0146] Determining, according to each of the item location identifiers, a logical area including at least one of the item location identifiers;

[0147] The seed item location identifier is obtained, and path planning is performed according to the seed item location identifier, each item location identifier and each logical area to obtain a target picking path.

[0148] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0149] For each of the logical areas, path planning is performed according to the seed item location identifier and the target item location identifier included in each of the logical areas to obtain an intra-area path corresponding to each of the logical areas;

[0150] Perform path planning according to the distance between the logic area and the packaging station to obtain an out-of-area path corresponding to the logic area;

[0151] The target picking path is determined according to the in-area path and the out-of-area path corresponding to each of the logical areas.

[0152] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0153] If the logical area does not include the seed item location identifier, the target item location identifiers are sorted in descending order to obtain the intra-region path corresponding to the logical area.

[0154] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0155] If the logic area includes the seed item location identifier, sorting the target item location identifiers that are larger than the seed item location identifier in ascending order to obtain a path in the first area;

[0156] Sort the target item location identifiers that are smaller than the seed item location identifier in descending order to obtain a path within the second area;

[0157] The first intra-region path and the second intra-region path are merged to obtain the intra-region path corresponding to the logical area.

[0158] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0159] Determine an initial picking path according to the paths within each area and the paths outside the area;

[0160] Determine whether there are two parallel target logical areas in each of the logical areas according to the logical area identifiers corresponding to each of the logical areas;

[0161] If there are no two parallel target logical areas, the initial picking path is determined to be the target picking path.

[0162] In one embodiment, the item location identifier includes a sequence number, and the parity of the sequence number is related to the relative position relationship between the position corresponding to the item location identifier and the target logical area. When the computer program is executed by the processor, the following steps are also implemented:

[0163] If there are two parallel target logical areas, then obtaining the sequence numbers corresponding to the item location identifiers included in each of the target logical areas;

[0164] The initial picking path is optimized according to the parity of the sequence number to obtain the target picking path.

[0165] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps:

[0166] Acquire multiple order tasks in the target account, and determine item location identifiers corresponding to multiple items to be picked according to each of the order tasks, wherein the order tasks include at least one of real-time order tasks and accumulated order tasks;

[0167] Determining, according to each of the item location identifiers, a logical area including at least one of the item location identifiers;

[0168] The seed item location identifier is obtained, and path planning is performed according to the seed item location identifier, each item location identifier and each logical area to obtain a target picking path.

[0169] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0170] For each of the logical areas, path planning is performed according to the seed item location identifier and the target item location identifier included in each of the logical areas to obtain an intra-area path corresponding to each of the logical areas;

[0171] Perform path planning according to the distance between the logic area and the packaging station to obtain an out-of-area path corresponding to the logic area;

[0172] The target picking path is determined according to the in-area path and the out-of-area path corresponding to each of the logical areas.

[0173] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0174] If the logical area does not include the seed item location identifier, the target item location identifiers are sorted in descending order to obtain the intra-region path corresponding to the logical area.

[0175] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0176] If the logic area includes the seed item location identifier, sorting the target item location identifiers that are larger than the seed item location identifier in ascending order to obtain a path in the first area;

[0177] Sort the target item location identifiers that are smaller than the seed item location identifier in descending order to obtain a path within the second area;

[0178] The first intra-region path and the second intra-region path are merged to obtain the intra-region path corresponding to the logical area.

[0179] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0180] Determine an initial picking path according to the paths within each area and the paths outside the area;

[0181] Determine whether there are two parallel target logical areas in each of the logical areas according to the logical area identifiers corresponding to each of the logical areas;

[0182] If there are no two parallel target logical areas, the initial picking path is determined to be the target picking path.

[0183] In one embodiment, the item location identifier includes a sequence number, and the parity of the sequence number is related to the relative position relationship between the position corresponding to the item location identifier and the target logical area. When the computer program is executed by the processor, the following steps are also implemented:

[0184] If there are two parallel target logical areas, then obtaining the sequence numbers corresponding to the item location identifiers included in each of the target logical areas;

[0185] The initial picking path is optimized according to the parity of the sequence number to obtain the target picking path.

[0186] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0187] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0188] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0189] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A path planning method, characterized in that: The method comprises: Acquire multiple order tasks in the target account, and determine item location identifiers corresponding to multiple items to be picked according to each of the order tasks, wherein the order tasks include at least one of real-time order tasks and accumulated order tasks; Determining, according to each of the item location identifiers, a logical area including at least one of the item location identifiers; The seed item location identifier is obtained, and path planning is performed according to the seed item location identifier, each item location identifier and each logical area to obtain a target picking path.

2. The method according to claim 1, characterized in that: The step of performing path planning according to the seed item location identifier, each item location identifier, and each logical area to obtain a target picking path includes: For each of the logical areas, path planning is performed according to the seed item location identifier and the target item location identifier included in each of the logical areas to obtain an intra-area path corresponding to each of the logical areas; Perform path planning according to the distance between the logic area and the packaging station to obtain an out-of-area path corresponding to the logic area; The target picking path is determined according to the in-area path and the out-of-area path corresponding to each of the logical areas.

3. The method according to claim 2, characterized in that The path planning is performed according to the seed item location identifier and the target item location identifier included in each of the logical areas to obtain the path within the area corresponding to each of the logical areas, including: If the logical area does not include the seed item location identifier, the target item location identifiers are sorted in descending order to obtain the intra-region path corresponding to the logical area.

4. The method according to claim 3, characterized in that The performing of path planning according to the seed item location identifier and the target item location identifier included in each of the logical areas to obtain the intra-area path corresponding to each of the logical areas also includes: If the logic area includes the seed item location identifier, sorting the target item location identifiers that are larger than the seed item location identifier in ascending order to obtain a path in the first area; Sort the target item location identifiers that are smaller than the seed item location identifier in descending order to obtain a path within the second area; The first intra-region path and the second intra-region path are merged to obtain the intra-region path corresponding to the logical area.

5. The method according to claim 2, characterized in that: The determining the target picking path according to the in-area path and the out-area path corresponding to each of the logical areas comprises: Determine an initial picking path according to the paths within each area and the paths outside the area; Determine whether there are two parallel target logical areas in each of the logical areas according to the logical area identifiers corresponding to each of the logical areas; If there are no two parallel target logical areas, the initial picking path is determined to be the target picking path.

6. The method according to claim 5, characterized in that The item location identifier includes a sequence number, and the parity of the sequence number is related to the relative position relationship between the position corresponding to the item location identifier and the target logical area. The method further includes: If there are two parallel target logical areas, then obtaining the sequence numbers corresponding to the item location identifiers included in each of the target logical areas; The initial picking path is optimized according to the parity of the sequence number to obtain the target picking path.

7. A path planning device, characterized in that: The device comprises: An acquisition module, used to acquire multiple order tasks in a target account, and determine item location identifiers corresponding to multiple items to be picked according to each of the order tasks, wherein the order tasks include at least one of real-time order tasks and accumulated order tasks; A partitioning module, configured to determine a logical area including at least one of the item location identifiers according to each of the item location identifiers; The planning module is used to obtain the seed item location identifier, and perform path planning according to the seed item location identifier, each item location identifier and each logical area to obtain a target picking path.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: 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.

10. A computer program product, comprising a computer program, characterized in that 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