Picking task processing method, apparatus, device, medium and program product

Abstract

This disclosure provides a picking task processing method, apparatus, equipment, medium, and program product, relating to the field of warehousing and logistics technology. The method includes: binding goods to corresponding storage locations, establishing a mapping relationship, obtaining the current location information of the picking personnel, and based on the current location information and the mapping relationship, querying the target storage location closest to the current location from all storage locations of at least one picking task, starting from the current location information; and generating a target picking task based on the location information of the target storage location. Using storage locations as the basis for picking, supplemented by closer location information, makes it easier for inexperienced picking personnel to find storage locations, resulting in higher picking efficiency and lower picking difficulty.

Description

Technical Field

[0001] This disclosure relates to the field of warehousing and logistics technology, and in particular to a picking task processing method, apparatus, equipment, medium and program product. Background Technology

[0002] During the picking process in the warehouse, the task is very complex due to the large area and numerous shelves.

[0003] In related technologies, logical zones are often defined, and the current task assigned to a picker is based on these zones. However, subsequent tasks are generally random. Furthermore, the division of logical zones within a warehouse is often quite complex; some zones may not be continuous, and the area of ​​a single logical zone can be enormous. Even for skilled pickers, handling picking tasks is very difficult, resulting in high labor costs and low picking efficiency.

[0004] It should be noted that the information disclosed in the background section above is only used to enhance the understanding of the background of this disclosure, and therefore may include information that does not constitute prior art known to those skilled in the art. Summary of the Invention

[0005] The purpose of this disclosure is to provide a solution that at least partially addresses the problem of low picking efficiency in the prior art and reduces the difficulty for picking personnel in handling picking tasks.

[0006] Other features and advantages of this disclosure will become apparent from the following detailed description, or may be learned in part from practice of this disclosure.

[0007] According to a first aspect of this disclosure, a method for processing picking tasks is provided, the method comprising:

[0008] Bind the goods to their corresponding storage locations to establish a mapping relationship;

[0009] Obtain the current location information of the picking personnel;

[0010] Based on the current location information and mapping relationship, starting from the current location information, query the target storage location from all storage locations of at least one pending picking task; the target storage location is the storage location that is closest to the current location information among all storage locations.

[0011] Generate a target picking task based on the target storage location.

[0012] In one possible embodiment, binding goods to corresponding storage locations to establish a mapping relationship includes:

[0013] Locate the storage location of each product to obtain the storage location corresponding to each product;

[0014] By binding storage locations with goods, a binding relationship is established;

[0015] Based on the binding relationship, the storage positions are sorted to obtain the mapping relationship.

[0016] In one possible embodiment, the method further includes:

[0017] Obtain information on at least one item to be grouped;

[0018] Based on the mapping relationship and the product information of each order to be grouped, tasks are grouped according to the maximum number of orders to be grouped, and picking tasks corresponding to the product information of each order to be grouped are generated.

[0019] In one possible embodiment, the current location information includes the current storage location;

[0020] Based on the current location information and mapping relationship, starting from the current location, query the target storage location from all storage locations of at least one pending picking task, including:

[0021] Obtain the first item corresponding to at least one picking task;

[0022] Obtain the storage location of each item in the first category, and use the first storage location as all storage locations;

[0023] Starting from the current storage location, the target storage location is determined by recursively querying upwards and downwards according to the mapping relationship among all storage locations.

[0024] In one possible embodiment, the current location information includes the current storage location and the current logical area; the method further includes:

[0025] Retrieve the second item corresponding to at least one pending picking task in the current logical area;

[0026] Obtain the storage location of each item in the second category, and use it as all storage locations;

[0027] In the current logical area, based on the current storage location and mapping relationship, starting from the current storage location, query the target storage location from all storage locations;

[0028] If no target storage location is matched in the current logical area, then query the nearest logical area with a pending picking task.

[0029] From the nearest logical area, query the target storage location that is closest to the current storage location.

[0030] In one possible embodiment, generating a target picking task based on the target storage location includes:

[0031] From at least one pending picking task, determine the first pending picking task corresponding to the target storage location;

[0032] Retrieve other goods in the first picking task, excluding the target goods corresponding to the target storage location;

[0033] Based on the mapping relationship, determine the other storage locations corresponding to other commodities;

[0034] Based on the location information of other storage locations and the target storage location, as well as the distance between each storage location, determine the shortest picking path for the first picking task;

[0035] The target picking task is generated based on the shortest picking path and the product information corresponding to each storage location.

[0036] In one possible embodiment, the method further includes:

[0037] If there are multiple shortest picking paths, then generate a corresponding target picking task for any one of the shortest picking paths.

[0038] According to another aspect of this disclosure, a picking task processing apparatus is provided, comprising:

[0039] The binding unit is used to bind goods to corresponding storage locations and establish a mapping relationship;

[0040] The acquisition unit is used to acquire the current location information of the picking personnel;

[0041] The query unit is used to query the target storage location from all storage locations of at least one picking task, based on the current location information and mapping relationship, starting from the current location information; the target storage location is the storage location that is closest to the current location information among all storage locations.

[0042] The generation unit is used to generate target picking tasks based on the target storage location.

[0043] In one possible embodiment, the picking task processing device further includes:

[0044] The picking task generation unit is used to obtain at least one product information to be grouped into an order; according to the mapping relationship and each product information to be grouped into an order, it groups tasks according to the maximum number of orders to be grouped, and generates picking tasks corresponding to each product information to be grouped into an order.

[0045] According to another aspect of this disclosure, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the method of any one of the first aspects by executing the executable instructions.

[0046] According to another aspect of this disclosure, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the method of any one of the first aspects.

[0047] According to another aspect of this disclosure, a computer program product or computer program is also provided, comprising computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the method described in the first aspect above.

[0048] This disclosure provides a picking task processing method, apparatus, device, medium, and program product. The method includes: binding goods to corresponding storage locations, establishing a mapping relationship, obtaining the current location information of the picking personnel, and, based on the current location information and the mapping relationship, querying a target storage location from all storage locations of at least one picking task, with the current location information as the starting position. The target storage location is the storage location closest to the current location information among all storage locations. Based on the target storage location, a target picking task is generated. By binding storage locations to goods, querying the nearest target storage location and generating a target picking task based on the picking personnel's current location information, even inexperienced picking personnel can pick goods based on the location information of a relatively nearby target storage location. Closer storage locations are easier for picking personnel to find, resulting in higher efficiency and lower picking difficulty.

[0049] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and are not intended to limit this disclosure. Attached Figure Description

[0050] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this disclosure. It is obvious that the drawings described below are merely some embodiments of this disclosure, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.

[0051] Figure 1 This diagram illustrates the structure of a picking task processing system according to an embodiment of the present disclosure.

[0052] Figure 2 A flowchart of a picking task processing method according to an embodiment of this disclosure is shown;

[0053] Figure 3 This diagram illustrates a flowchart of a method for querying a target storage location according to an embodiment of the present disclosure;

[0054] Figure 4 This illustrates another flowchart for querying a target storage location in an embodiment of this disclosure;

[0055] Figure 5 This diagram illustrates a flowchart of generating a target picking task according to an embodiment of the present disclosure;

[0056] Figure 6 This diagram illustrates a flowchart of generating a picking task according to an embodiment of the present disclosure;

[0057] Figure 7 This diagram illustrates a flowchart of issuing a target picking task according to an embodiment of the present disclosure;

[0058] Figure 8 This diagram shows a structural schematic of a picking task processing device according to an embodiment of the present disclosure;

[0059] Figure 9 A schematic diagram of the structure of an electronic device according to an embodiment of the present disclosure is shown. Detailed Implementation

[0060] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, they are provided so that this disclosure will be more comprehensive and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0061] Furthermore, the accompanying drawings are merely illustrative of this disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted. Some block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0062] In related technologies, during the warehouse picking process, due to the large area and numerous shelves in the warehouse, on-site personnel often divide a warehouse into multiple logical zones and number the storage locations in each zone. When entering the picking node, the system will sort the picking tasks according to the logical zones, and then the picker will randomly pick up the picking tasks.

[0063] Since the picking area occupies a large proportion of the entire warehouse, even if tasks are sorted according to logical areas, it can only guarantee that the picking task currently received by the picker is within a certain logical area. However, the area within a logical area is also very large, and it is not easy for the picker to find and pick the goods within this area. At the same time, the next picking task may be in another logical area.

[0064] Therefore, simply sorting by logical area is no longer sufficient to improve warehouse picking efficiency. The following problems may arise during the actual picking process:

[0065] The division of logical zones within a warehouse is often complex, and some zones may not be sequential. Only long-term pickers, familiar with the area, can quickly locate the different picking positions. During peak sales periods, temporary pickers are often needed. However, their temporary nature can lead to unfamiliarity with the logical zone layouts, significantly impacting picking efficiency. This results in low overall picking efficiency and increased difficulty in handling picking tasks.

[0066] The picking task processing method disclosed herein can be applied to electronic devices or servers.

[0067] Figure 1 A schematic diagram of the architecture of the picking task processing system in an embodiment of this disclosure is shown.

[0068] like Figure 1 As shown, the picking task processing system 100 may include a terminal device 101, a network 102, and a server 103.

[0069] Network 102 is a medium used to provide a communication link between terminal device 101 and server 103, and can be a wired network or a wireless network.

[0070] Optionally, the aforementioned wireless or wired networks use standard communication technologies and / or protocols. The network is typically the Internet, but can also be any network, including but not limited to Local Area Networks (LANs), Metropolitan Area Networks (MANs), Wide Area Networks (WANs), mobile, wired or wireless networks, private networks, or any combination of virtual private networks. In some embodiments, technologies and / or formats including Hyper Text Markup Language (HTML), Extensible Markup Language (XML), etc., are used to represent data exchanged over the network. Furthermore, conventional encryption technologies such as Secure Socket Layer (SSL), Transport Layer Security (TLS), Virtual Private Networks (VPNs), and Internet Protocol Security (IPsec) can be used to encrypt all or some links. In other embodiments, custom and / or dedicated data communication technologies can be used to replace or supplement the aforementioned data communication technologies.

[0071] Terminal device 101 can be various electronic devices, including but not limited to smartphones, tablets, laptops, desktop computers, wearable devices, augmented reality devices, virtual reality devices, etc.

[0072] Optionally, the client of the application installed on different terminal devices 101 may be the same, or the client of the same type of application based on different operating systems. Depending on the terminal platform, the specific form of the application client may also be different; for example, the application client may be a mobile client, a PC client, etc.

[0073] For example, terminal device 101 may be a personal digital assistant (PDA) device.

[0074] Server 103 can be a server that provides various services, such as a backend management server that supports the device operated by the user using terminal device 101. The backend management server can analyze and process received requests and other data, and feed the processing results back to the terminal device.

[0075] Optionally, the server can be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms. The terminal can be a smartphone, tablet, laptop, desktop computer, smart speaker, smartwatch, etc., but is not limited to these. The terminal and server can be directly or indirectly connected via wired or wireless communication, and this disclosure does not impose any restrictions.

[0076] Those skilled in the art will know that Figure 1 The number of terminal devices, networks, and servers shown is merely illustrative; any number of terminal devices, networks, and servers can be included depending on actual needs. This disclosure does not limit the scope of the embodiments.

[0077] This disclosure describes the method through the following embodiments.

[0078] Figure 2 A flowchart illustrating a picking task processing method according to an embodiment of this disclosure is shown. Figure 2 As shown, the steps include:

[0079] S202: Bind the goods to the corresponding storage locations to establish a mapping relationship.

[0080] In one possible embodiment, the planning of storage locations within the warehouse is still carried out in the existing manner. After the goods are placed in the storage locations, the storage locations within the warehouse are located based on the specific information of the goods, and the goods are bound to the corresponding storage locations to establish a mapping relationship.

[0081] The process of establishing a mapping relationship can be either after the goods are placed in the storage location, or after obtaining the information of the goods to be grouped, binding the goods with the storage location and using it to generate the picking task.

[0082] In one possible embodiment, when constructing the mapping relationship, the distance relationship between storage locations can be preserved in the mapping relationship, that is, the binding relationship is sorted according to the storage location order. Specifically, the distance between any two storage locations is equal, and the interval of the storage location order represents the distance between the storage locations.

[0083] The construction method may include: sorting the binding relationships according to the storage location order, locating the storage location where the product is located, obtaining the storage location corresponding to each product, binding the storage location with the product to obtain the binding relationship, and sorting the storage locations according to the binding relationship to obtain the mapping relationship. The interval of the storage location order represents the distance between storage locations. The distance between storage locations can be further clarified by binding the storage location number with the distance, so that subsequent queries can be performed directly based on the storage location number in the mapping relationship.

[0084] For example, starting with storage location 1, the storage location number closest to storage location 1 is first determined as storage location 2, and so on. Generally, for storage location number 5, the distances between storage locations 4 and 6 and storage location 5 are the same, that is, the storage location distribution is normal. If they are different, it indicates that the storage location distribution is not normal, and such storage locations can be specially marked.

[0085] S204: Obtain the current location information of the picking personnel.

[0086] In one possible embodiment, picking personnel can log in to their personal accounts on a terminal device. Within the picking area, each shelf and its different storage location has its own unique storage location code. This code information can be used to represent storage location information, which may include the location information of the storage location. It can also be used to represent the storage location information and the logical area where the storage location is located.

[0087] Pickers can use a terminal device to scan the storage location code on the storage location. After successfully scanning the code, they upload the information to the server. The server parses the uploaded code to obtain the current location information. This information may include at least the current storage location and may also include the current logical area.

[0088] It will also obtain the picker's account information to determine which picker it is.

[0089] S206: Based on the current location information and mapping relationship, starting from the current location information, query the target storage location from all storage locations of at least one picking task. The target storage location is the storage location that is closest to the current location information among all storage locations.

[0090] In one possible embodiment, the generation of picking tasks may include: obtaining at least one product information to be grouped into an order; grouping tasks according to the mapping relationship and each product information to be grouped into an order, based on the maximum number of orders to be grouped; and generating a picking task corresponding to each product information to be grouped into an order. A picking task includes at least: product information of the product to be picked and the storage location corresponding to the product to be picked.

[0091] There are no restrictions on the order in which the steps to generate the picking task and the order in which the current location information is obtained.

[0092] The picking task includes multiple items to be picked and their corresponding storage locations. Picking tasks need to be issued to pickers to execute. To pick the items to be picked, the target storage location can be selected by the distance between the storage location corresponding to the item to be picked and the current location information. The distance between each storage location and the current storage location can be calculated directly from all storage locations to determine the target storage location.

[0093] S208: Generate a target picking task based on the target storage location.

[0094] In one possible embodiment, after determining the target storage location, it can be determined which picking task the target storage location belongs to. Taking the first picking task as an example, the first picking task is designated as the target picking task, and the target picking task is sent to the terminal device of the picking personnel so that the picking personnel can start picking.

[0095] In another possible embodiment, only the storage location number of the target storage location may be issued. Alternatively, storage location within the warehouse can be located, and the location information of the target storage location can be issued simultaneously. This creates a picking path from the current location information to the target storage location information on the picking personnel's terminal device, facilitating the picking personnel in handling picking tasks. This also allows picking personnel unfamiliar with the warehouse to handle picking tasks effectively.

[0096] The methods for querying the target storage location in step S206 may also include the following methods. Figure 3 A flowchart illustrating a method for querying a target storage location according to an embodiment of this disclosure is shown, such as... Figure 3 As shown, it includes the following steps:

[0097] S302: Obtain the first item corresponding to at least one picking task.

[0098] S304: Obtain the storage location of each item in the first item, and use the first storage location as all storage locations.

[0099] S306: Starting from the current storage location, recursively query upwards and downwards among all storage locations according to the mapping relationship to determine the target storage location.

[0100] By constructing a mapping relationship that can represent the distance between storage locations, the target storage location can be queried. By using the current storage location as the center point, the query can be recursively performed upwards and downwards, which can find the target storage location in the fastest way.

[0101] For example, taking the current storage location as 63 as an example, the nearest neighboring storage locations are marked as to whether they have goods to be picked.

[0102] ..., Storage location 59 (to be picked), Storage location 60, Storage location 61 (to be picked), Storage location 62, Storage location 63, Storage location 64 (current location), Storage location 65 (to be picked), Storage location 66, Storage location 67 (to be picked), ...

[0103] The ellipses before and after indicate that there are other storage locations, which are not all described here.

[0104] Looking up and down simultaneously from the current storage location is more efficient than calculating and comparing the distances between the current storage location and every other storage location. Figure 3 The method shown not only eliminates the need to calculate distances but also offers faster query speeds. If the nearest storage location is found to be 65, then the target storage location is determined to be 65.

[0105] In one possible implementation, when querying a target storage location, if the storage location number contains a specially marked storage location, then a specific distance calculation is performed.

[0106] In one possible embodiment, during the process of determining the target storage location, if a special marker is detected between the current location information and the storage location corresponding to the goods to be picked, then the first distance between the current storage location in the current location information and the storage location of the goods to be picked before the current storage location, and the second distance between the current storage location in the current location information and the storage location of the goods to be picked after the current storage location, are determined. The minimum distance between the first distance and the second distance is selected, and the storage location of the goods to be picked corresponding to the minimum distance is taken as the target storage location.

[0107] For example, during the process of determining the target storage location, storage location 59 (to be picked), storage location 60, storage location 61 (to be picked), storage location 62, storage location 63 (current location), storage location 64 (special mark), storage location 65 (to be picked), storage location 66, and storage location 67 (to be picked).

[0108] Special markings are special cases. For example, if the storage location is in another row, and the distance between storage location 64 and storage location 63 is different from the distance between storage location 62 and storage location 63, then calculate the first distance of the path between storage location 63 and storage location 65 on the navigation, and calculate the second distance between storage location 61 and storage location 63 to determine which is closer. If storage location 65 is closer, then storage location 65 is the target storage location.

[0109] Typically, a logical area includes multiple storage locations. The current location information can include the current logical area and the current storage location. If the current storage location and the target storage location are not in the same logical area, when querying the target storage location, you may encounter a situation where you search upwards and downwards from storage location 63 to 3 or 130 and still cannot find the storage location corresponding to the picking task. In this case, the following method can be used to handle the situation.

[0110] Figure 4A flowchart illustrating another method for querying a target storage location in an embodiment of this disclosure is shown, such as... Figure 4 As shown, it includes the following steps:

[0111] S402: Obtain the second item corresponding to at least one picking task in the current logical area.

[0112] S404: Obtain the storage location of each item in the second item as the total storage location.

[0113] S406: In the current logical area, based on the current storage location and mapping relationship, starting from the current storage location, query the target storage location from all storage locations.

[0114] S408: If no target storage location is matched in the current logical area, query the nearest logical area with a pending picking task.

[0115] S410: From the nearest logical area, query the target storage location that is closest to the current storage location.

[0116] Using the above method, when obtaining the goods corresponding to the picking task, only the second goods and the corresponding storage location of the second goods in the logical area to which the current storage location belongs are obtained as all storage locations. The target storage location is then queried among these storage locations. If it is not found, the nearest logical area with the picking task is directly queried. Instead of recursively querying storage locations, the query is not performed continuously. After finding the nearest logical area, the target storage location is queried based on the current storage location and the nearest logical area. By specifying the logical area, the scope of the recursive query for the target storage location can be narrowed, and the situation where the target storage location is not found in the current logical area can be avoided.

[0117] The nearest logical area can be queried by directly calculating the distance, or by recursively querying upwards and downwards along the logical area dimension. The specific methods are similar to those for querying storage locations and will not be elaborated here.

[0118] In one possible embodiment, the current location information includes the current logical area and the current storage location. If no target storage location is found in the current logical area, the system recursively queries upwards and downwards based on the current logical area to determine the target logical area with the picking task. Then, the system recursively queries upwards and downwards to the storage locations in the target logical area based on the current storage location to determine the target storage location.

[0119] For example, if each logical area contains 30 storage locations, and the current logical area is 3.

[0120] Then, storage location 3 (to be picked), storage location 4, ..., storage location 61, storage location 62, storage location 63 (current position), storage location 64, ..., storage location 181, storage location 182 (to be picked).

[0121] If there is no target storage location in logic area 3, recursively query logic area 3 to determine that there is a picking task in logic area 2. Then, based on the current storage location 63, recursively query logic area 2 to determine storage location 59 as the target storage location.

[0122] In another possible embodiment, if the logical region is recursively queried, the following situation applies:

[0123] Then, storage location 3 (to be picked), storage location 4, ..., storage location 182, storage location 183 (current position), storage location 184, ..., storage location 365, storage location 366 (to be picked).

[0124] In the above cases, based on the current position, the query is recursively performed upwards and downwards. The query time is relatively long, but it can determine the distance between the storage location with the goods to be picked in the logical area and the current storage location, and determine the target storage location.

[0125] For example, the boundary storage location of logic area 1 is obtained as storage location 3, the boundary storage location of logic area 13 is 366, the distance between 183 and 3 is determined, and the distance between 183 and 366 is determined. The storage location with the smaller distance from 183 is determined as the target storage location.

[0126] In another possible embodiment, after determining the first picking task to which the target storage location belongs, the total picking distance of the picking personnel can be further shortened and the picking difficulty reduced by means of the following method.

[0127] Figure 5 A flowchart illustrating the generation of a target picking task in an embodiment of this disclosure is shown, such as... Figure 5 As shown, it includes the following steps:

[0128] S502: From at least one picking task, determine the first picking task corresponding to the target storage location.

[0129] S504: Retrieve other goods in the first picking task besides the target goods corresponding to the target storage location.

[0130] S506: Based on the mapping relationship, determine the other storage locations corresponding to other commodities.

[0131] S508: Determine the shortest picking path for the first picking task based on the location information of other storage locations and the target storage location, as well as the distance between each storage location.

[0132] The shortest picking path can be determined by sorting all the picking locations in the current location and the first picking task from nearest to farthest to obtain the picking order for a target picking task.

[0133] S510: Generate the target picking task based on the shortest picking path and the product information corresponding to each storage location.

[0134] After obtaining the first picking task through the above method, since the first picking task also includes many other items to be picked, a shortest picking path can be planned for the other storage locations corresponding to the other items to be picked in the first picking task. A navigation path can be generated on the terminal device through the location information of each storage location to prompt the picking personnel to pick the items according to the shortest picking path, reducing the picking difficulty. Even picking personnel who are not familiar with the warehouse can handle the picking task well.

[0135] In step S508, the method for planning the shortest picking route is based on the distance between each storage location. This embodiment of the disclosure illustrates an exemplary method, but is not limited to this method. It includes: using the target storage location as the initial position; determining the first storage location closest to the initial position from among the other storage locations; repeating the process using the first storage location as the initial position until all other storage locations are empty; sorting the storage locations according to the time they were queried; and obtaining the shortest picking route based on the location information of the other storage locations and the target storage location.

[0136] For example, storage location 59 (to be picked), storage location 60, storage location 61 (to be picked), storage location 62, storage location 63, storage location 64 (current location), storage location 65 (to be picked), storage location 66, and storage location 67 (to be picked).

[0137] Taking the first picking task with storage locations 59, 61, 65, and 67 as an example, based on storage location 64, the target storage location is 65, and the shortest picking path is planned as: 65->67->61->59.

[0138] In one possible implementation, if there are multiple shortest picking paths, a corresponding target picking task is generated for any one of the shortest picking paths.

[0139] For example, when the current storage location is exactly in the middle of all the storage locations to be picked, and all the storage locations to be picked are evenly distributed on both sides, such as: storage location 59 (to be picked), storage location 60, storage location 61 (to be picked), storage location 62, storage location 63 (current location), storage location 64, storage location 65 (to be picked), storage location 66, storage location 67 (to be picked).

[0140] At this point, a target picking task corresponding to any shortest picking path can be generated, that is, push 61->59->65->67 or 65->67->61->59 to the picking personnel.

[0141] In one possible implementation, during the process of determining the target storage location, if a special mark is detected between the initial position and the storage location corresponding to the goods to be picked, then the first distance between the initial position and the storage location of the goods to be picked before the initial position, and the second distance between the initial position and the storage location of the goods to be picked after the initial position are determined. The minimum distance between the first distance and the second distance is selected, and the storage location of the goods to be picked corresponding to the minimum distance is taken as the first storage location in the shortest picking path, and the next location is queried in the loop.

[0142] For example, during the process of determining the shortest picking path, storage location 59 (to be picked), storage location 60, storage location 61 (to be picked), storage location 62, storage location 63, storage location 64 (current location), storage location 65 (to be picked), storage location 66 (special mark), and storage location 67 (to be picked).

[0143] The target storage location is storage location 65. When selecting the next storage location for the item to be picked in the shortest picking path, whether to select 67 or 61 is determined by the method given in the above embodiment, based on the minimum distance, and then further selection is made.

[0144] In this embodiment of the disclosure, after obtaining the current location information of the picking personnel, the rule parser on the server side executes specific matching logic to obtain the target picking task and send it to the picking personnel's terminal device.

[0145] In one possible embodiment, after planning warehouse storage locations and obtaining the product information for the order to be grouped, the method for generating the picking task can be as follows: Figure 6 As shown, Figure 6 A flowchart illustrating the generation of a picking task according to an embodiment of this disclosure is shown, including the following steps:

[0146] S602: Obtain information on the products to be grouped.

[0147] S604: Locate the storage location of the goods to obtain the storage location corresponding to each goods.

[0148] S606: Bind the storage location to the product to obtain the binding relationship.

[0149] S608: Classify the products within the same logical area and sort them according to the storage location order based on the binding relationship to obtain the mapping relationship.

[0150] S610: Based on the mapping relationship and the product information of each order to be grouped, group tasks according to the maximum number of orders to be grouped, and generate picking tasks corresponding to the product information of each order to be grouped.

[0151] After receiving the picking task, specific target picking tasks are assigned to the picking staff. Figure 7 A flowchart illustrating the issuance of a target picking task in an embodiment of this disclosure is shown, such as... Figure 7 As shown, it includes the following steps:

[0152] S702: Obtain the current location information of the picking personnel.

[0153] The current location information may include the current logical area and the current storage location.

[0154] S704: Based on the current location information and mapping relationship, starting from the current location information, query the target storage location from all storage locations of at least one picking task. The target storage location is the storage location that is closest to the current location information among all storage locations.

[0155] S706: From at least one picking task, determine the first picking task corresponding to the target storage location.

[0156] S708: Retrieve other goods in the first picking task besides the target goods corresponding to the target storage location.

[0157] S710: Based on the mapping relationship, determine the other storage locations corresponding to other commodities.

[0158] S712: Determine the shortest picking path for the first picking task based on the location information of other storage locations and the target storage location, as well as the distance between each storage location.

[0159] The shortest picking path includes the logical area to which each storage location belongs and the location information of the storage location. A shortest picking path can be generated on the terminal device.

[0160] S714: Generate the target picking task based on the shortest picking path and the product information corresponding to each storage location.

[0161] S716: Send target picking task.

[0162] Through the above Figure 6 and Figure 7 The system systematically plans the handling of picking tasks, allowing pickers to directly pick items according to the indicated target storage location or the shortest picking path. The target storage location and shortest picking path are also presented as navigation paths on the terminal device. Pickers simply walk to the storage location and pick the items, with intelligent management of the picking process sequence. It can quickly locate the storage location of the picker and assign the nearest picking task, reducing the need for pickers to search for goods in a large area and run back and forth between different logical zones, improving picking efficiency, and reducing the adaptation period for pickers to warehouse zoning. During peak sales periods when a large number of personnel are needed temporarily, it reduces the requirement for familiarity with the placement of goods, logical zone planning, and storage location distribution, reducing reliance on highly skilled pickers, lowering adaptation time costs, and reducing picking difficulty.

[0163] Based on the same inventive concept as the above-described method embodiments, this application also provides a picking task processing device. Figure 8 A schematic diagram of the structure of a picking task processing device provided in an embodiment of this application is shown.

[0164] The device 80 includes: a binding unit 801 for binding goods to corresponding storage locations and establishing a mapping relationship; an acquisition unit 802 for acquiring the current location information of the picking personnel; a query unit 803 for querying a target storage location from all storage locations of at least one picking task, starting from the current location information and the mapping relationship, wherein the target storage location is the storage location closest to the current location information among all storage locations; and a generation unit 804 for generating a target picking task based on the target storage location.

[0165] Those skilled in the art will understand that various aspects of the present invention can be implemented as systems, methods, or program products. Therefore, various aspects of the present invention can be specifically implemented in the following forms: entirely hardware implementations, entirely software implementations (including firmware, microcode, etc.), or implementations combining hardware and software aspects, collectively referred to herein as “circuits,” “modules,” or “systems.”

[0166] The following reference Figure 9 To describe an electronic device 900 according to this embodiment of the present invention. Figure 9 The electronic device 900 shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of the present invention.

[0167] like Figure 9 As shown, the electronic device 900 is manifested in the form of a general-purpose computing device. The components of the electronic device 900 may include, but are not limited to: at least one processing unit 910, at least one storage unit 920, and a bus 930 connecting different system components (including the storage unit 920 and the processing unit 910).

[0168] The storage unit stores program code, which can be executed by the processing unit 910, causing the processing unit 910 to perform the steps described in the "Exemplary Methods" section of this specification according to various exemplary embodiments of the present invention.

[0169] Storage unit 920 may include readable media in the form of volatile storage units, such as random access memory (RAM) 9201 and / or cache memory 9202, and may further include read-only memory (ROM) 9203.

[0170] Storage unit 920 may also include a program / utility 9204 having a set (at least one) program module 9205, such program module 9205 including but not limited to: operating system, one or more application programs, other program modules and program data, each or some combination of these examples may include an implementation of a network environment.

[0171] Bus 930 can represent one or more of several types of bus structures, including a memory cell bus or memory cell controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local bus using any of the various bus structures.

[0172] Electronic device 900 can also communicate with one or more external devices 940 (e.g., keyboard, pointing device, Bluetooth device, etc.), and with one or more devices that enable a user to interact with electronic device 900, and / or with any device that enables electronic device 900 to communicate with one or more other computing devices (e.g., router, modem, etc.). This communication can be performed via input / output (I / O) interface 950. Furthermore, electronic device 900 can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) via network adapter 960. As shown, network adapter 960 communicates with other modules of electronic device 900 via bus 930. It should be understood that, although not shown in the figures, other hardware and / or software modules can be used in conjunction with electronic device 900, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0173] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, terminal device, or network device, etc.) to execute the methods according to the embodiments of this disclosure.

[0174] In exemplary embodiments of this disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the methods described above is stored. In some possible embodiments, various aspects of the present invention may also be implemented as a program product comprising program code that, when the program product is run on a terminal device, causes the terminal device to perform the steps of the various exemplary embodiments of the present invention described in the "Exemplary Methods" section above.

[0175] A program product for implementing the above-described method according to embodiments of the present invention is described. This product may employ a portable compact disc read-only memory (CD-ROM) and include program code, and may run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto. In this document, the readable storage medium may be any tangible medium containing or storing a program that may be used by or in conjunction with an instruction execution system, apparatus, or device.

[0176] The program product may employ any combination of one or more readable media. A readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (a non-exhaustive list) of readable storage media include: electrical connections having one or more wires, portable disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0177] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium, capable of sending, propagating, or transmitting programs for use by or in conjunction with an instruction execution system, apparatus, or device.

[0178] The program code contained on the readable medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0179] Program code for performing the operations of this invention can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's computing device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0180] It should be noted that although several modules or units for the device used to perform actions have been mentioned in the detailed description above, this division is not mandatory. In fact, according to embodiments of this disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided and embodied by multiple modules or units.

[0181] Furthermore, although the steps of the method in this disclosure are described in a specific order in the accompanying drawings, this does not require or imply that the steps must be performed in that specific order, or that all the steps shown must be performed to achieve the desired result. Additional or alternative steps may be omitted, multiple steps may be combined into one step, and / or a step may be broken down into multiple steps.

[0182] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, mobile terminal, or network device, etc.) to execute the methods according to the embodiments of this disclosure.

[0183] Other embodiments of this disclosure will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this disclosure are indicated by the appended claims.

Claims

1. A method for processing picking tasks, characterized in that, The method includes: Bind the goods to their corresponding storage locations to establish a mapping relationship; Obtain the current location information of the picking personnel; Based on the current location information and the mapping relationship, starting from the current location information, a target storage location is queried from all storage locations of at least one pending picking task; the target storage location is the storage location among all storage locations that is closest to the current location information. Based on the target storage location, a target picking task is generated.

2. The method according to claim 1, characterized in that, The process of binding goods with corresponding storage locations and establishing a mapping relationship includes: Locate the storage location of each product to obtain the storage location corresponding to each product; The storage location is bound to the product to establish a binding relationship; Based on the binding relationship, the storage locations are sorted to obtain the mapping relationship.

3. The method according to claim 1, characterized in that, The method further includes: Obtain information on at least one item to be grouped; Based on the mapping relationship and the product information of each order to be grouped, tasks are grouped according to the maximum number of orders to be grouped, and picking tasks corresponding to each product information of the order to be grouped are generated.

4. The method according to claim 1, characterized in that, The current location information includes the current storage location; The step of querying the target storage location from all storage locations of at least one picking task, using the current location information as the starting position, based on the current location information and the mapping relationship, includes: Obtain the first item corresponding to at least one picking task; Obtain the storage location to which each item belongs in the first product, and use the first storage location as all storage locations; Starting from the current storage location, the target storage location is determined by recursively querying upwards and downwards according to the mapping relationship among all storage locations.

5. The method according to claim 1, characterized in that, The current location information includes the current storage location and the current logical area; The method further includes: Obtain the second item corresponding to at least one picking task in the current logical area; Obtain the storage location to which each item in the second product belongs, as the total number of storage locations; In the current logical area, based on the current storage location and the mapping relationship, starting from the current storage location, the target storage location is queried from all storage locations; If no target storage location is matched in the current logical area, then query the nearest logical area with a pending picking task. From the nearest logical area, query the target storage location that is closest to the current storage location.

6. The method according to claim 1, characterized in that, The step of generating a target picking task based on the target storage location includes: From the at least one picking task, determine the first picking task corresponding to the target storage location; Obtain other goods in the first picking task besides the target goods corresponding to the target storage location; Based on the mapping relationship, determine the other storage locations corresponding to the other commodities; Based on the location information of the other storage locations and the target storage location, as well as the distance between each storage location, the shortest picking path for the first picking task is determined; The target picking task is generated based on the shortest picking path and the product information corresponding to each storage location.

7. The method according to claim 5, characterized in that, The method further includes: If there are multiple shortest picking paths, a corresponding target picking task is generated for any one of the shortest picking paths.

8. A picking task processing device, characterized in that, include: The binding unit is used to bind goods to corresponding storage locations and establish a mapping relationship; The acquisition unit is used to acquire the current location information of the picking personnel; The query unit is configured to query a target storage location from all storage locations of at least one picking task, based on the current location information and the mapping relationship, with the current location information as the starting position; the target storage location is the storage location among all storage locations that is closest to the current location information. The generation unit is used to generate a target picking task based on the target storage location.

9. An electronic device, characterized in that, include: processor; and memory for storing the executable instructions of the processor; The processor is configured to execute the method of any one of claims 1 to 7 by executing the executable instructions.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the method described in any one of claims 1 to 7.

11. A computer program product, comprising: A computer program or instruction, characterized in that, when executed by a processor, the computer program or instruction implements the method described in any one of claims 1 to 7.

Images