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

Abstract

The application relates to a path planning method, device, equipment, readable storage medium and program product. The method comprises the following steps: obtaining a plurality of order tasks in a target account, determining a plurality of to-be-picked article position identifiers corresponding to a plurality of to-be-picked articles according to the order tasks, determining a logical area comprising at least one article position identifier according to the article position identifiers, obtaining a seed article position identifier, and performing path planning according to the seed article position identifier, the article position identifiers and the logical areas to obtain a target picking path, wherein the order tasks comprise at least one of real-time order tasks and accumulated order tasks. The method can improve picking efficiency.

Description

TECHNICAL FIELD

[0001] The present application relates to the warehouse technical field, in particular to a path planning method and device, equipment, readable storage medium and program product. BACKGROUND

[0002] The modern warehouse management usually involves logistics business, and picking is the core link of logistics business, which is to pick out the goods in the order task from the storage area. However, the goods in an order task may be of multiple types. In the related art, the staff usually picks the goods included in each order task according to the picking path corresponding to the order task.

[0003] However, the picking path planned by the traditional path planning method has the problem of low picking efficiency. SUMMARY

[0004] Therefore, it is necessary to provide a path planning method, device, equipment, readable storage medium and program product capable of improving picking efficiency to solve the above technical problems.

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

[0006] Obtaining a plurality of order tasks in a target account, and determining a plurality of article location identifiers corresponding to articles to be picked according to the order tasks, wherein the order tasks include at least one of real-time order tasks and accumulated order tasks;

[0007] According to the article location identifiers, determining a logical area including at least one article location identifier;

[0008] Obtaining a seed article location identifier, and performing path planning according to the seed article location identifier, the article location identifiers and the logical areas to obtain a target picking path.

[0009] In one embodiment, performing path planning according to the seed article location identifier, the article location identifiers and the logical areas to obtain a target picking path, comprises:

[0010] For each logical area, performing path planning according to the seed article location identifier and the target article location identifiers included in the logical area to obtain an intra-area path corresponding to the logical area;

[0011] Performing path planning according to the distance between the logical area and the packing table to obtain an extra-area path corresponding to the logical area;

[0012] Determining the target picking path according to the intra-area path and the extra-area path corresponding to each logical area.

[0013] In one of the embodiments, the path planning is performed according to the seed article location identifier and the target article location identifiers included in each logical area to obtain an intra-area path corresponding to each logical area, including:

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

[0015] In one of the embodiments, the path planning is performed according to the seed article location identifier and the target article location identifiers included in each logical area to obtain an intra-area path corresponding to each logical area, further including:

[0016] If the logical area includes the seed article location identifier, the target article location identifiers greater than the seed article location identifier are sorted in ascending order to obtain a first intra-area path;

[0017] The target article location identifiers less than the seed article location identifier are sorted in descending order to obtain a second intra-area path;

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

[0019] In one of the embodiments, the target picking path is determined according to the intra-area paths corresponding to each logical area and the inter-area path, including:

[0020] An initial picking path is determined according to the intra-area paths and the inter-area path;

[0021] It is determined whether there are two target logical areas in parallel in each logical area according to the logical area identifiers corresponding to each logical area;

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

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

[0024] If there are two target logical areas in parallel, the sequence numbers corresponding to the article location 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 application provides a path planning device, including:

[0027] The acquisition module is configured to acquire a plurality of order tasks in a target account, and determine, according to each order task, a plurality of article location identifiers corresponding to a plurality of to-be-picked articles, the order tasks including at least one of real-time order tasks and accumulated order tasks;

[0028] The division module is configured to determine, according to each article location identifier, a logical area including at least one article location identifier;

[0029] The planning module is configured to acquire a seed article location identifier, and perform path planning according to the seed article location identifier, each article location identifier, 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, the memory stores a computer program, and the processor implements the steps of the method in 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, which stores a computer program, and the computer program implements the steps of the method in the first aspect when executed by a processor.

[0032] In a fifth aspect, the present application further provides a computer program product. The computer program product includes a computer program, and the computer program implements the steps of the method in the first aspect when executed by a processor.

[0033] The path planning method, device, equipment, readable storage medium and program product can obtain a plurality of order tasks in a target account, determine a plurality of to-be-picked items corresponding to item location identifiers according to each order task, determine a logical area including at least one item location identifier according to each item location identifier, obtain a 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, wherein the order task includes at least one of a real-time order task and an accumulated order task. In the above embodiment, by counting the item location identifiers corresponding to the to-be-picked items included in the plurality of order tasks, the final target picking path can be obtained by performing path planning according to the item location identifiers corresponding to each to-be-picked item, the logical areas corresponding to each item location identifier, and the seed item location identifier at which the worker starts picking. These order tasks can be order tasks obtained in real time when the worker is in a picking state, or accumulated order tasks in the target account corresponding to the worker when the worker is in a non-picking state. The above technical solution can avoid the problem of low picking efficiency caused by the fact that the worker can only complete one order task at a time when planning a picking path in the traditional technology. The technical solution provided in the present application can count the to-be-picked items in the plurality of real-time order tasks and accumulated order tasks, and the planned picking path is for the plurality of order tasks, so that the worker can execute the plurality of order tasks at the same time, thereby improving the picking efficiency. BRIEF DESCRIPTION OF DRAWINGS

[0034] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the related art, the drawings needed to be used in the description of the embodiments of the present application or the related art will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other related drawings can be obtained by those skilled in the art without creative labor.

[0035] Figure 1 An application environment diagram of the path planning method in one embodiment;

[0036] Figure 2 A flowchart of the path planning method in one embodiment;

[0037] Figure 3 A continuous encoding example diagram in another embodiment;

[0038] Figure 4 A newly formulated encoding rule example diagram in another embodiment;

[0039] Figure 5 A flowchart of the step 203 in another embodiment;

[0040] Figure 6 Warehouse structure diagram for another embodiment;

[0041] Figure 7 Process diagram for path planning in another embodiment;

[0042] Figure 8 Flow diagram for an exemplary path planning method in an embodiment;

[0043] Figure 9 Block diagram of a path planning device in an embodiment;

[0044] Figure 10 Internal structure diagram of a computer device in an embodiment. DETAILED DESCRIPTION

[0045] In order to make the purposes, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and do not limit the present application.

[0046] In modern warehouse management, logistics business is usually involved, and picking is the core link of logistics business, which is to pick out the goods in an order task from a storage area. However, the goods in an order task can be of multiple types. In related technologies, a worker usually picks the goods included in each order task according to the picking path corresponding to the order task, and the picking path is usually obtained by path planning according to the codes of the positions corresponding to the goods included in the order task.

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

[0048] In view of this, the application provides a path planning method, device, equipment, readable storage medium and program product. The method comprises the following steps: obtaining a plurality of order tasks in a target account, determining a plurality of article location identifiers corresponding to a plurality of goods to be picked according to each order task, determining a logical area comprising at least one article location identifier according to each article location identifier, obtaining a seed article location identifier, and performing path planning according to the seed article location identifier, each article location identifier and each logical area to obtain a target picking path, wherein the order task comprises at least one of a real-time order task and an accumulated order task. In the above embodiment, by counting the article location identifiers corresponding to the goods to be picked included in the plurality of order tasks, path planning can be performed according to the article location identifiers corresponding to each good to be picked, the logical area corresponding to each article location identifier and the seed article location identifier at which the worker starts picking to obtain the final target picking path. These order tasks can be order tasks obtained in real time when the worker is in a picking state, or accumulated order tasks in the target account corresponding to the worker when the worker is in a non-picking state. The application avoids the problem of low picking efficiency caused by the fact that the worker can only complete one order task at a time when planning a picking path in the traditional technology. The technical solution provided by the application can count the goods to be picked in a plurality of real-time order tasks and accumulated order tasks, and the planned picking path is for a plurality of order tasks, so that the worker can execute a plurality of order tasks at the same time, thereby improving the picking efficiency.

[0049] The path planning method provided by the embodiments of the application can be applied to an application environment as shown in Figure 1 . The data storage system can store data required to be processed by the server 101. The data storage system can be integrated on the server 101, or placed on a cloud or other network server. The server 101 can be a stand-alone physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server providing cloud computing services.

[0050] In an exemplary embodiment, as shown in Figure 2 , a path planning method is provided. The method is applied to the server 101 in Figure 1 for example. It can be understood that the method can also be applied to a server, and can also be applied to a system comprising a terminal and a server, and can be realized through the interaction of the terminal and the server. The method comprises the following steps 201 to 203. Wherein:

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

[0052] The target account, i.e., the account of the worker in the picking system, can receive multiple order tasks in the embodiments of the present application.

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

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

[0055] In the embodiments of the present application, the order task includes at least one item location identifier corresponding to the to-be-picked item. The item location identifier is used to indicate the location of the to-be-picked task. When the server plans the path for the multiple order tasks, the number of to-be-picked items corresponding to the item location identifier in each order task can be counted to obtain the final item location identifier used for path planning. For example, the A order task includes a milk location identifier and an apple location identifier, and the B order task includes an apple location identifier and a potato chip location identifier. The final item location identifier used for path planning is the milk location identifier, the apple location identifier, and the potato chip location identifier.

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

[0057] However, these item locations can be on different shelves or on different layers of the same shelf. This encoding manner cannot reflect the specific position of each item location, and the worker can hardly quickly find the item location of the to-be-picked item according to the continuously encoded item location identifier, which leads to low picking efficiency. Therefore, in another possible implementation, in order to facilitate the worker to quickly find the item location according to the item location identifier, a new encoding rule can be formulated. For example, the new encoding rule is: logical area-shelf number-sequence number-layer number. Referring to Figure 4The whole warehouse can be divided into multiple logical areas, different logical areas correspond to different identifiers, the head and tail of the shelves in a logical area are visited, different shelves correspond to different shelf numbers, a shelf includes multiple layers, and different layers correspond to different layer numbers. In the embodiment of the application, since a shelf is divided into left and right sides, the left and right sides store different articles. In order to distinguish between left and right, a sequence number is set. If the article position is located on the left side of the shelf, the sequence number is odd. If the article position is located on the right side of the shelf, the sequence number is even. Exemplarily, the article position identifier is A-S1-2-1, and the article position corresponding to the article position identifier is in the A logical area and the first layer on the right side of the S1 shelf.

[0058] In step 202, a logical area including at least one article position identifier is determined according to each article position identifier.

[0059] In the embodiment of the application, the warehouse is divided into multiple logical areas, and the article positions corresponding to different article position identifiers can be in the same logical area or in different logical areas. Therefore, the article position identifier further includes an identifier corresponding to a logical area. In the embodiment of the application, the server can determine at least one logical area according to the identifier corresponding to the logical area in each article position identifier.

[0060] In step 203, a seed article position identifier is obtained, and path planning is performed according to the seed article position identifier, each article position identifier, and each logical area to obtain a target picking path.

[0061] The seed article position identifier is an identifier corresponding to an article position at the start of the target picking path. Optionally, if the worker is in a picking state, the server can take the article position identifier corresponding to the last picked article of the worker as the seed article position identifier. Optionally, the server can receive an instruction input by the worker, and the instruction includes the seed article position identifier.

[0062] In the embodiment of the application, the server can take the seed article position identifier as the starting point of the target picking path, then perform regional path planning on the article position identifiers included in each logical area, and finally combine the paths corresponding to each logical area to obtain the target picking path. Regarding the combination method, optionally, the server can sort each logical area according to the identifier corresponding to each logical area, and combine the paths corresponding to each logical area in sequence to obtain the target picking path. Optionally, the server can sort each logical area according to the distance between each logical area and the packing table (a place where an order is confirmed to be completed), and combine the paths corresponding to each logical area in sequence to obtain the target picking path.

[0063] In the above embodiment, by counting the article location identifiers corresponding to the to-be-picked articles included in the multiple order tasks, the target picking path can be obtained according to the article location identifiers corresponding to the to-be-picked articles, the logical areas corresponding to the article location identifiers, and the seed article location identifier at which the worker starts picking. These order tasks can be order tasks that are acquired in real time when the worker is in a picking state, or can be order tasks accumulated in the target account corresponding to the worker when the worker is in a non-picking state. The present application avoids the problem of low picking efficiency caused by the fact that the worker can only complete one order task at a time when the picking path is planned in the traditional technology. The technical solution provided by the present application can count the to-be-picked articles in multiple real-time order tasks and accumulated order tasks, and the planned picking path is for multiple order tasks, so that the worker can execute multiple order tasks at the same time, thereby improving the picking efficiency.

[0064] In one embodiment, based on the above Figure 2 As shown in the embodiment, referring to Figure 5 The present embodiment relates to a process of obtaining a target picking path according to a seed article location identifier, article location identifiers, and logical areas. As shown in Figure 5 Step 203 can include steps 501 to 503.

[0065] Step 501: For each logical area, a path is planned according to the seed article location identifier and the target article location identifiers included in the logical area, to obtain an intra-area path corresponding to the logical area.

[0066] In the embodiment of the present application, the server plans a path for each article location identifier included in each logical area to obtain an intra-area path corresponding to each logical area.

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

[0068] When the logical area does not include the seed article location identifier, the server can directly sort the target article location identifiers in descending order. In the present embodiment, the larger the article location identifier, the farther the target article location is from the packing table. Sorting the target article location identifiers in descending order can make the worker start picking from the place farthest from the packing table and finish picking at the place closest to the packing table.

[0069] In another possible implementation, if the logical area includes a seed item position identifier, the server can sort each target item position identifier greater than the seed item position identifier in ascending order to obtain a first intra-area path, sort each target item position identifier less than the seed item position identifier in descending order to obtain a second intra-area path, and combine the first intra-area path and the second intra-area path to obtain the intra-area path corresponding to the logical area.

[0070] In the embodiment, the seed item position identifier is in the logical area, and the server needs to arrange the seed item position identifier in the first order, compare the seed item position identifier with other item position identifiers included in the logical area in size, sort each target item position identifier greater than the seed item position identifier in ascending order to obtain a first intra-area path, then sort each target item position identifier less than the seed item position identifier in descending order to obtain a second intra-area path, and finally combine the first intra-area path and the second intra-area path to obtain the intra-area path corresponding to the logical area.

[0071] For example, the item position identifiers in the logical area include 003, 008, 019, and 020, and the seed item position identifier is 015. Each target item position identifier greater than the seed item position identifier is sorted in ascending order to obtain a first intra-area path, which is 015->019->020. At this time, the remaining item position identifiers less than the seed item position identifier 015 are 003 and 008, and the second intra-area path is 008->003. The first intra-area path and the second intra-area path are combined to obtain the intra-area path corresponding to the logical area, which is 015->019->020->008->003.

[0072] In step 502, the path is planned according to the distance between the logical area and the packing table to obtain the extra-area path corresponding to the logical area.

[0073] Since the distances between the logical areas and the packing table are different, in order to avoid unnecessary path walking of the staff, in the embodiment, the server can obtain the distances between the logical areas and the packing table, and sort the logical areas according to the distances. In the embodiment, the server sorts the distances between the logical areas and the packing table in descending order to obtain the extra-area path corresponding to each logical area. For example, referring to Figure 6 There are logical areas A, B, C, and D. The distances between the logical areas and the packing table are sorted in descending order, and the order is D, C, B, and A. Therefore, the extra-area path is D->C->B->A.

[0074] In step 503, the target picking path is determined according to the intra-area path and the extra-area path corresponding to each logical area.

[0075] After obtaining the intra-area path and the extra-area path corresponding to each logical area, in a possible implementation, the server can combine the intra-area path corresponding to each logical area according to the extra-area path, thereby obtaining the target picking path. For example, the extra-area path is C->B->A, the intra-area path corresponding to A is A8->A5->A3, the intra-area path corresponding to B is B8->B9->B11->B6->B1, and the intra-area 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 arranged side by side, and the left and right sides of the shelves in the logical areas are different goods. At this time, if the intra-area path corresponding to each logical area is simply combined according to the extra-area path, the worker may repeatedly perform unnecessary picking paths. Therefore, the server can determine an initial picking path according to the intra-area path and the extra-area path. The initial picking path is obtained by combining the intra-area path corresponding to each logical area according to the extra-area path.

[0077] Then, the server can determine whether there are two target logical areas arranged side by side in each logical area according to the logical area identifier corresponding to each logical area. For example, the server can obtain the arrangement relationship between each logical area, which includes parallel relationship and non-parallel relationship. The server can filter the arrangement relationship according to the logical area identifier corresponding to each logical area, thereby determining whether there are two target logical areas arranged side by side.

[0078] Optionally, if there are not two target logical areas arranged side by side, the initial picking path is determined as the target picking path.

[0079] Optionally, the article 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 article position identifier and the target logical area. In this embodiment, if there are two target logical areas arranged side by side, the server obtains the sequence number corresponding to the article position identifier included in each target logical area, and optimizes the initial picking path according to the parity of the sequence number, thereby obtaining the target picking path.

[0080] For example, referring to FIG. 1, the article position identifier included in the target logical area A is 1, the article position identifier included in the target logical area B is 2, and the article position identifier included in the target logical area C is 3. The sequence number corresponding to the article position identifier included in the target logical area A is odd, the sequence number corresponding to the article position identifier included in the target logical area B is even, and the sequence number corresponding to the article position identifier included in the target logical area C is odd. Therefore, the initial picking path is optimized according to the parity of the sequence number, thereby obtaining the target picking path. Figure 7, the logical area A and the logical area C are parallel, the encoding rule is logical area-serial number, the parity of the serial number is related to the relative position relationship between the position corresponding to the article position identifier and the target logical area, for example, even number represents right side and odd number represents left side, the physical position identifiers included in the A area are A2, A4 and A10, the physical position identifiers included in the C area are C1, C7 and C15, the initial picking path corresponding thereto is A10->A4->A2->C15->C7->C1, the server determines that the A area and the C area are two target logical areas in parallel, so that it is determined that the right side of the A area is adjacent to the left side of the C area, that is, at this time, the server can optimize the initial picking path according to the parity of each serial number, and the target picking path is C15->A10->C7->A4->C1->A1 by interleaving and sorting the physical position identifiers included in the logical area C and the logical area A in the order from large to small.

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

[0082] In one embodiment, referring to Figure 8 , an exemplary path planning method is provided, which can be applied to Figure 1 the implementation environment shown in the figure.

[0083] Step 801, obtaining a plurality of order tasks in a target account, and determining a plurality of article position identifiers corresponding to articles to be picked according to each order task.

[0084] Among them, the order task includes at least one of the real-time order task and the cumulative order task.

[0085] Step 802, determining a logical area including at least one article position identifier according to each article position identifier.

[0086] Step 803, for each logical area, if the logical area does not include a seed article position identifier, sorting each target article position identifier in the order from large to small to obtain an intra-regional path corresponding to the logical area.

[0087] Step 804, if the logical area includes a seed article position identifier, sorting each target article position identifier greater than the seed article position identifier in the order from small to large to obtain a first intra-regional path.

[0088] Step 805, sorting each target article position identifier smaller than the seed article position identifier in the order from large to small to obtain a second intra-regional path.

[0089] Step 806, merging the first intra-regional path and the second intra-regional path to obtain an intra-regional path corresponding to the logical area.

[0090] Step 807, performing path planning according to the distance between the logical area and the packing table to obtain an extra-regional path corresponding to the logical area.

[0091] Step 808, determining the initial picking path according to the intra-regional paths and the extra-regional path.

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

[0093] Step 810, if there are no two target logical areas in parallel, determining that the initial picking path is the target picking path.

[0094] Step 811, if there are two target logical areas in parallel, obtaining the sequence number corresponding to the article position identifier included in each target logical area.

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

[0096] Wherein, the article position identifier includes the sequence number, and the parity of the sequence number is related to the relative positional relationship between the position corresponding to the article position identifier and the target logical area.

[0097] It should be understood that, although each step in the flowchart involved in each of the above-described embodiments is displayed in sequence according to the arrow, these steps are not necessarily executed in sequence according to the arrow. Unless otherwise stated herein, there is no strict order limitation for the execution of these steps, and these steps can be executed in other orders. Moreover, at least part of the steps in the flowchart involved in each of the above-described embodiments can include multiple steps or stages, which 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 sequential, but can be executed in rotation or alternation with at least part of other steps or steps or stages in other steps.

[0098] Based on the same inventive concept, the embodiments of the present application also provide a path planning device for implementing the above-mentioned path planning method. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme described 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 in the above text, which will not be repeated here.

[0099] In one exemplary embodiment, as Figure 9As shown, a path planning apparatus is provided, comprising: an acquisition module 901, a division module 902 and a planning module 903, wherein:

[0100] The acquisition module 901 is configured to acquire a plurality of order tasks in a target account, and determine a plurality of article location identifiers corresponding to to-be-picked articles according to each order task, wherein the order task comprises at least one of a real-time order task and a cumulative order task.

[0101] The division module 902 is configured to determine a logical area comprising at least one article location identifier according to each article location identifier.

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

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

[0104] An intra-area planning unit is configured to, for each logical area, perform path planning according to the seed article location identifier and target article location identifiers comprised in the logical area to obtain an intra-area path corresponding to the logical area.

[0105] An extra-area planning unit is configured to perform path planning according to a distance between the logical area and a packing table to obtain an extra-area path corresponding to the logical area.

[0106] A target planning unit is configured to determine the target picking path according to the intra-area path and the extra-area path corresponding to each logical area.

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

[0108] If the logical area does not comprise the seed article location identifier, each target article location identifier is sorted in descending order to obtain the intra-area path corresponding to the logical area.

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

[0110] If the logical area comprises the seed article location identifier, each target article location identifier greater than the seed article location identifier is sorted in ascending order to obtain a first intra-area path.

[0111] Each target article location identifier less than the seed article location identifier is sorted in descending order to obtain a second intra-area path.

[0112] merge the first intra-regional path and the second intra-regional path to obtain the intra-regional path corresponding to the logical area.

[0113] In one embodiment, the target planning unit is specifically configured to perform:

[0114] determine an initial picking path according to the intra-regional paths and the inter-regional path;

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

[0116] if there are no two target logical areas in parallel, determine that the initial picking path is the target picking path.

[0117] In one embodiment, the article position identifier comprises a sequence number, the parity of the sequence number is related to the relative positional relationship between the position corresponding to the article position identifier and the target logical area, and the target planning unit is specifically further configured to perform:

[0118] if there are two target logical areas in parallel, obtain the sequence number corresponding to the article position identifier included in each of the target logical areas;

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

[0120] Each of the above modules in the path planning device can be realized by software, hardware and a combination thereof in whole or in part. Each of the above modules can be embedded in or independent of the processor in the computer device in hardware form, or can be stored in the memory in the computer device in software form, so as to be called and executed by the processor to perform the operation corresponding to each of the above modules.

[0121] In one exemplary embodiment, a computer device is provided, which can be a server, and an internal structure diagram of the computer device can be as shown in Figure 10As shown in the figure. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. Among them, the processor, the memory and the input / output interface are connected through the system bus, and the communication interface is connected to the system bus through the input / output interface. Among them, the processor of the computer device is used to provide computing and control capability. 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 external devices. The communication interface of the computer device is used to communicate with the terminal outside through the network connection. The computer program is executed by the processor to realize a path planning method.

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

[0123] In one exemplary embodiment, a computer device is provided, including a memory and a processor, the memory storing a computer program, and the processor executing the computer program to realize the following steps:

[0124] Obtain a plurality of order tasks in a target account, and determine a plurality of article location identifiers corresponding to the articles to be picked according to each order task, wherein the order task includes at least one of a real-time order task and a cumulative order task;

[0125] According to each of the article location identifiers, determine a logical area including at least one of the article location identifiers;

[0126] Obtain a seed article location identifier, and perform path planning according to the seed article location identifier, each of the article location identifiers, and each of the logical areas to obtain a target picking path.

[0127] In one embodiment, the processor executing the computer program further realizes the following steps:

[0128] For each of the logical areas, perform path planning according to the seed article location identifier and the target article location identifier included in each of the logical areas to obtain an intra-regional path corresponding to each of the logical areas;

[0129] The path planning is performed according to the distance between the logical area and the packing table, and an area-outside-path corresponding to the logical area is obtained.

[0130] The target picking path is determined according to the area-inside-path and the area-outside-path corresponding to each logical area.

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

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

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

[0134] If the logical area includes the seed article location identifier, the target article location identifiers greater than the seed article location identifier are sorted in ascending order to obtain a first area-inside-path;

[0135] The target article location identifiers less than the seed article location identifier are sorted in descending order to obtain a second area-inside-path;

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

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

[0138] An initial picking path is determined according to the area-inside-path and the area-outside-path;

[0139] It is determined whether there are two target logical areas in parallel in each logical area according to the logical area identifier corresponding to each logical area.

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

[0141] In one embodiment, the article location identifier includes a sequence number, the parity of the sequence number is related to the relative positional relationship between the position corresponding to the article location identifier and the target logical area, and the processor, when executing the computer program, further implements the following steps:

[0142] If there are two target logical areas in parallel, the sequence numbers corresponding to the article location identifiers included in each target logical area are obtained.

[0143] Optimize the initial picking path 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, having stored thereon a computer program which, when executed by a processor, implements the following steps:

[0145] Obtain a plurality of order tasks in a target account, and determine a plurality of article location identifiers corresponding to articles to be picked according to each of the order tasks, the order tasks including at least one of real-time order tasks and cumulative order tasks;

[0146] According to each of the article location identifiers, determine a logical area including at least one of the article location identifiers;

[0147] Obtain a seed article location identifier, and perform path planning according to the seed article location identifier, each of the article location identifiers, and each of the logical areas to obtain a target picking path.

[0148] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

[0149] For each of the logical areas, perform path planning according to the seed article location identifier and target article location identifiers 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 logical areas and the packing table to obtain an extra-area path corresponding to the logical areas;

[0151] Determine the target picking path according to the intra-area path and the extra-area path corresponding to each of the logical areas.

[0152] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

[0153] If the logical area does not include the seed article location identifier, sort each of the target article location identifiers in descending order to obtain the intra-area path corresponding to the logical area.

[0154] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

[0155] If the logical area includes the seed article location identifier, sort each of the target article location identifiers greater than the seed article location identifier in ascending order to obtain a first intra-area path;

[0156] Sort each of the target article location identifiers less than the seed article location identifier in descending order to obtain a second intra-area path;

[0157] merge the first intra-regional path and the second intra-regional path to obtain the intra-regional path corresponding to the logical area.

[0158] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

[0159] determine an initial picking path according to the intra-regional paths and the inter-regional path;

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

[0161] If there are no two target logical areas in parallel, determine that the initial picking path is the target picking path.

[0162] In one embodiment, the article location identifier includes a sequence number, the parity of the sequence number is related to the relative positional relationship between the position corresponding to the article location identifier and the target logical area, and the computer program, when executed by the processor, further implements the following steps:

[0163] If there are two target logical areas in parallel, obtain the sequence number corresponding to the article location identifier included in each of the target logical areas;

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

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

[0166] obtain a plurality of order tasks in a target account, and determine article location identifiers corresponding to a plurality of articles to be picked according to each of the order tasks, the order tasks including at least one of real-time order tasks and cumulative order tasks;

[0167] determine a logical area including at least one of the article location identifiers according to each of the article location identifiers;

[0168] obtain a seed article location identifier, and perform path planning according to the seed article location identifier, each of the article location identifiers, and each of the logical areas to obtain a target picking path.

[0169] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

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

[0171] A path is planned according to a distance between the logical area and the packing table, to obtain an extra-area path corresponding to the logical area;

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

[0173] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

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

[0175] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

[0176] If the logical area includes the seed article location identifier, the target article location identifiers greater than the seed article location identifier are sorted in ascending order, to obtain a first intra-area path;

[0177] The target article location identifiers less than the seed article location identifier are sorted in descending order, to obtain a second intra-area path;

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

[0179] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

[0180] An initial picking path is determined according to the intra-area paths and the extra-area paths;

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

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

[0183] In one embodiment, the article location identifier includes a sequence number, the parity of the sequence number is related to a relative positional relationship between a position corresponding to the article location identifier and the target logical area, and the computer program, when executed by the processor, further implements the following steps:

[0184] If there are two parallel target logical areas, a corresponding sequence number of an article position identification included in each of the target logical areas is acquired;

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

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

[0187] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer readable storage medium, and when executed, can include the processes of the above-mentioned embodiment methods. Any reference to 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. The non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical storage, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. The volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration but not limitation, the RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc. The database involved in the embodiments provided in the present application can include at least one of a relational database and a non-relational database. The non-relational database can include a distributed database based on a block chain, etc., without being limited thereto. The processor involved in the embodiments provided in the present application can be a general-purpose processor, a central processing unit, a graphics processing unit, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., without being limited thereto.

[0188] The technical features of the above embodiments can be combined in any manner. To make the description concise, not all possible combinations of the technical features in the above embodiments are described, but as long as the combinations of the technical features do not exist contradictions, they should be considered as the scope of the present application.

[0189] The above-described embodiments are merely illustrative of several embodiments of the present application, and the description is relatively specific and detailed, but should not be understood as a limitation on the scope of the patent. It should be noted that for those skilled in the art, without departing from the concept of the present application, a number of modifications and improvements can be made, which are all within the scope of the present application. Therefore, the scope of protection of the present application should be subject to the appended claims.

Claims

1. A path planning method characterized by, The method comprises: acquiring a plurality of order tasks in a target account, and determining a plurality of article location identifiers corresponding to articles to be picked according to each of the order tasks, the order tasks comprising at least one of real-time order tasks and accumulated order tasks; the real-time order tasks comprising order tasks received by a worker corresponding to the target account in a picking state; the accumulated order tasks comprising at least one order task accumulated in the target account in a non-picking state; determining a logical area comprising at least one of the article location identifiers according to each of the article location identifiers; acquiring a seed article location identifier, and for each of the logical areas, performing path planning according to the seed article location identifier and target article location identifiers included in each of the logical areas to obtain an intra-area path corresponding to each of the logical areas, performing path planning according to distances between the logical areas and a packing table to obtain an extra-area path corresponding to each of the logical areas, and determining an initial picking path according to the intra-area path and the extra-area path; determining whether two target logical areas exist in each of the logical areas according to logical area identifiers corresponding to each of the logical areas, determining the initial picking path as a target picking path if no two target logical areas exist, and if two target logical areas exist, acquiring sequence numbers corresponding to article location identifiers included in each of the target logical areas, and optimizing the initial picking path according to parity of the sequence numbers to obtain a target picking path; the seed article location identifier is an identifier corresponding to an article location at which the target picking path starts, and if the worker is in a picking state, an article location identifier corresponding to an article picked by the worker last time is taken as the seed article location identifier.

2. The method of claim 1, wherein, The path planning according to the seed article location identifier and the target article location identifiers included in each of the logical areas to obtain an intra-area path corresponding to each of the logical areas comprises: if the logical area does not include the seed article location identifier, sorting each of the target article location identifiers in descending order to obtain the intra-area path corresponding to the logical area.

3. The method of claim 2, wherein, The path planning according to the seed article location identifier and the target article location identifiers included in each of the logical areas to obtain an intra-area path corresponding to each of the logical areas further comprises: if the logical area includes the seed article location identifier, sorting each of the target article location identifiers greater than the seed article location identifier in ascending order to obtain a first intra-area path; sorting each of the target article location identifiers less than the seed article location identifier in descending order to obtain a second intra-area path; merging the first intra-area path and the second intra-area path to obtain the intra-area path corresponding to the logical area.

4. The method of claim 3, wherein, The article location identifier comprises a sequence number, and parity of the sequence number is related to a relative position relationship between a position corresponding to the article location identifier and the target logical area.

5. A route planning apparatus characterized by comprising: The device comprises: The acquisition module is configured to acquire a plurality of order tasks in a target account, and determine a plurality of article location identifiers corresponding to a plurality of to-be-picked articles according to each of the order tasks, wherein the order tasks comprise at least one of a real-time order task and a cumulative order task; the real-time order task comprises an order task received by a worker corresponding to the target account in a picking state; the cumulative order task comprises at least one order task accumulated in the target account in a non-picking state; The division module is configured to determine, according to each of the article location identifiers, a logical area comprising at least one of the article location identifiers; The planning module is configured to acquire a seed article location identifier, for each of the logical areas, perform path planning according to the seed article location identifier and target article location identifiers 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 distances between the logical areas and packing tables, to obtain an extra-area path corresponding to each of the logical areas, and determine an initial picking path according to the intra-area path and the extra-area path; determine, according to logical area identifiers corresponding to each of the logical areas, whether two target logical areas exist in each of the logical areas, if no two target logical areas exist in each of the logical areas, determine that the initial picking path is a target picking path, and if two target logical areas exist in each of the logical areas, acquire sequence numbers corresponding to article location identifiers included in each of the target logical areas, optimize the initial picking path according to oddness and evenness of the sequence numbers, to obtain a target picking path; the seed article location identifier is an identifier corresponding to an article location at which the target picking path starts, and if the worker is in the picking state, an article location identifier corresponding to an article picked by the worker last time is taken as the seed article location identifier.

6. The apparatus of claim 5, wherein, The device comprises an intra-area planning unit; the intra-area planning unit is configured to perform: If the logical area does not include the seed article location identifier, sort each of the target article location identifiers in descending order, to obtain the intra-area path corresponding to the logical area.

7. The apparatus of claim 6, wherein, The intra-area planning unit is further configured to perform: If the logical area includes the seed article location identifier, sort each of the target article location identifiers greater than the seed article location identifier in ascending order, to obtain a first intra-area path; sort each of the target article location identifiers less than the seed article location identifier in descending order, to obtain a second intra-area path; merge the first intra-area path and the second intra-area path, to obtain the intra-area path corresponding to the logical area. 8.A computer device, comprising a memory and a processor, wherein the memory stores a computer program, and the computer device is configured to perform the method according to any one of claims 1-7. The processor implements the steps of the method of any one of claims 1 to 4 when executing the computer program.

9. A computer-readable storage medium having stored thereon a computer program, characterized in that, The computer program, when executed by the processor, implements the steps of the method of any one of claims 1 to 4.

10. A computer program product comprising a computer program, characterized in that, The computer program, when executed by the processor, implements the steps of the method of any one of claims 1 to 4.

Images