Warehousing shelf management method and system based on logistics intelligent search

Abstract

The invention discloses a storage shelf management method and system based on logistics intelligent search, and relates to the technical field of storage management, and the method comprises the steps: 1, state perception, 2, goods passing path screening, 3, path decision, capturing the load state of each communication slide way of a fluent shelf and the logistics order dynamic state through an Internet of Things sensor, and carrying out path decision. Positioning each goods shelf corresponding to each goods in the logistics order by means of a storage three-dimensional entity model, screening to obtain a first warehouse-out node, calculating a congestion index of each communication slideway corresponding to each goods shelf, removing the communication slideways exceeding the standard, generating each passage path of the logistics order, and classifying each passage path into three types of parallel, crossed and composite; the total time length required for sorting of all passing paths after classification is accurately evaluated, the passing paths influencing the next logistics order are removed, the optimal sorting passing path is screened in combination with the health indexes of the communication slideways, and efficient, safe and accurate intelligent management of storage shelves is achieved.

Description

Technical Field

[0001] This invention relates to the field of warehouse management technology, specifically to a warehouse racking management method and system based on intelligent logistics search. Background Technology

[0002] With the accelerated digital transformation of the supply chain, warehousing, as a core hub for the flow of goods, directly impacts order fulfillment and operating costs through its management efficiency. Diversified market demands are driving continuous growth in product categories and order volume. Traditional warehouse racking management relies on manual searching and experience-based location allocation, resulting in pain points such as inefficient searching, inaccurate inventory, and delayed response, making it difficult to meet the demands of high-efficiency operations. The deep penetration of technologies such as the Internet of Things and artificial intelligence provides support for the intelligent upgrading of warehousing. The application of intelligent logistics search technology has become key to breaking through traditional dilemmas. There is an urgent need for a precise and efficient warehouse racking management method to optimize goods positioning and inventory control, meeting the core demands of modern logistics for rapid response and accurate fulfillment.

[0003] Existing technologies, such as the invention patent application with announcement number CN120031482A, disclose a real-time inventory monitoring and management method and system for intelligent shelves. The method includes: real-time acquisition and preprocessing of shelf point cloud and inventory data; prediction of location and anomaly detection using DBSCAN clustering and scene flow estimation; and defining an objective function based on the rolling time domain of inventory to improve positioning accuracy and monitoring efficiency. Existing technologies, such as the invention patent application with announcement number CN118365250B, disclose a system and method for identifying the status of goods in storage locations based on LiDAR. The system includes: monitoring by installing IoT devices in the storage area; defining the storage area, shelves, and storage locations and dividing them according to the type of goods; allocating goods to the warehouse using ant colony algorithm; and querying the status of goods based on the fingerprint location of each goods to improve identification efficiency and accuracy.

[0004] As can be seen from the above solutions, current warehouse racking management solutions based on intelligent logistics search have significant shortcomings in the management of flow racks. They generally lack real-time dynamic monitoring of the load status of each connecting slide, and fail to eliminate connecting slides exceeding the limit through scientific calculation of congestion indices. This makes path planning susceptible to the impact of connecting slide congestion. Furthermore, existing solutions do not rationally prioritize logistics orders based on their remaining time, resulting in a lack of targeted path planning. The classification of logistics order paths in existing solutions is not scientific enough, failing to distinguish between parallel, intersecting, and composite path types. The assessment of total picking time does not take into account the movement time of warehouse personnel and the safe buffer time for coordinated passage of connecting slides, nor does it incorporate the health status parameters of connecting slides. This leads to a lack of comprehensiveness in path decision-making, easily resulting in problems such as connecting slide overload and subsequent logistics order delays. These solutions fail to fully leverage the flow advantages of flow racks and cannot meet the core demands of modern logistics for rapid response and accurate fulfillment. Summary of the Invention

[0005] To address the aforementioned technical shortcomings, the present invention aims to provide a warehouse racking management method and system based on intelligent logistics search.

[0006] To solve the above technical problems, the present invention adopts the following technical solution: The first aspect of the present invention provides a warehouse racking management method based on intelligent logistics search, including step 1. Status perception: monitoring and updating the load status and logistics orders of each connecting slide of the warehouse flow rack, wherein the load status refers to the maximum number of goods that the connecting slide itself can carry.

[0007] Step 2. Goods passage path filtering: Combine the logistics order picking list and the load status of the flow rack connecting slides to obtain the passage paths of the logistics orders.

[0008] Preferably, the specific method for filtering the logistics orders to obtain each passage path is as follows: sort each logistics order in ascending order according to the remaining time, and obtain a sorted logistics order picking list. For the logistics order ranked first in the logistics order picking list, obtain the identification code of each item in the logistics order, locate each shelf corresponding to each item identification code in the constructed warehouse 3D entity model, and obtain the distance between each shelf corresponding to each item identification code in the logistics order and the warehouse center point.

[0009] Each shelf corresponding to each product identification code is sorted in ascending order according to its distance from the warehouse center point, and this is used as the first outbound node for each product in the logistics order.

[0010] The system uses a 3D physical model of the warehouse to locate the connecting slides of each shelf corresponding to each product identification code in the logistics order, and calculates the congestion index of each connecting slide of each shelf corresponding to each product identification code in the logistics order. When the congestion index of a certain connecting slide is greater than the preset warning congestion index threshold, the connecting slide is removed, and the remaining connecting slides are used as the second outbound node.

[0011] Based on the first and second outbound nodes of each item in the selected logistics orders, and combined with the 3D physical model of the warehouse, the target outbound points of the warehouse racks are obtained. Global path planning is then performed in the 3D physical model of the warehouse to obtain the passage paths of the logistics orders.

[0012] Preferably, the method for calculating the congestion index of each connecting slide of each shelf corresponding to each product identification code in the logistics order is as follows: the quantity of existing products on each connecting slide of each shelf corresponding to each product identification code in the logistics order is obtained by using a weighing sensor installed on each connecting slide, and the quantity of products in the logistics order is used as the current expected quantity of products to be transported on each connecting slide. The quantity of existing products on each connecting slide of each shelf corresponding to each product identification code in the logistics order is added to the current expected quantity of products to be transported and divided by the load status of the connecting slide to obtain the congestion index of each connecting slide of each shelf corresponding to each product identification code in the logistics order.

[0013] Step 3. Route Decision: Classify the various routes of the logistics order and evaluate the total time required to complete the picking for each route after classification. If the total time required to complete the picking for a certain route after classification affects the next logistics order to be picked, then remove that route. If the total time required to complete the picking for a certain route after classification does not affect the next logistics order to be picked, then the optimal picking route for the logistics order is obtained.

[0014] Preferably, the method for classifying the various routes of a logistics order is as follows: if a certain route in a logistics order has each item that directly reaches the target shipping point through an independent connecting slide and there is no intersection between the connecting slides, then the route is classified as a parallel route.

[0015] If every item in a certain path in a logistics order has a connecting chute that is directly connected to each other, forming a fully connected chute that reaches the target shipping point, and no item reaches the target shipping point directly through an independent connecting chute, then the path is classified as an intersecting path.

[0016] If, in a logistics order, at least one item in a certain route reaches the target shipping point directly via an independent connecting chute, and at least two items are connected by a direct connecting chute to reach the target shipping point, then the route is classified as a composite route.

[0017] Preferably, the method for evaluating the total time required for each passageway to complete picking after classification is as follows: by obtaining the baseline movement time and safe movement time of each item from the corresponding shelf to the entrance of the connecting slide in each passageway, and adding them together as the predicted movement time, the maximum predicted movement time among all items is taken as the first time of each passageway after classification.

[0018] For the classified parallel paths, intersecting paths, and composite paths, calculate the second duration of the parallel path, the second duration of the intersecting path, and the second duration of the composite path, respectively.

[0019] The real-time coordinates of warehouse personnel are obtained by using the UWB positioning system integrated into the 3D physical model of the warehouse. The path topology analysis algorithm built into the 3D physical model of the warehouse is used to obtain the length of all feasible paths from the current location of the warehouse personnel to each target shipping point. When there are multiple feasible paths from the current location of the warehouse personnel to each target shipping point, the longest path is selected as the calculation benchmark and divided by the average speed of the warehouse personnel calculated based on historical operation data to obtain the travel time of the warehouse personnel to each target shipping point.

[0020] Based on the target shipping point corresponding to each categorized path, the movement time of warehouse personnel to reach the target shipping point is associated, and this time is defined as the third time of each path. The first time, second time and third time of each path in the logistics order are added together to obtain the total time required for each categorized path to complete picking.

[0021] Preferably, the second duration of the parallel path is specifically defined as follows: In the parallel path, each item in the logistics order directly reaches the target shipping point via an independent connecting chute. The spatial trajectory coordinates of the independent connecting chute for each item are obtained through a 3D physical model of the warehouse. Based on this, the actual physical length of the independent connecting chute for each item is obtained through a geometric calculation algorithm. The rated transmission speed of the independent connecting chute is obtained from the local database. Based on the congestion index of the independent connecting chute, the actual transmission speed of the independent connecting chute is obtained as rated transmission speed * (1 - congestion index). The actual physical length of the independent connecting chute for each item is divided by the actual transmission speed of the independent connecting chute to obtain the duration for each item in the logistics order to reach the target shipping point from the connecting chute. The durations are then sorted in descending order to generate a numerical sequence of the durations of all items in the logistics order. The maximum value in this sequence is taken as the duration for the connecting chute to reach the target shipping point in the parallel path.

[0022] Preferably, the second duration of the cross path is specifically defined as follows: In the cross path, the connecting channels of each item in the logistics order are directly connected in pairs to form a fully connected channel reaching the target shipping point. The full topology data of the connecting channel network is obtained through the 3D solid model of the warehouse. Based on graph theory algorithms, the critical path of each item in the logistics order from the entrance of the connecting channel network to the target shipping point is identified. The critical path refers to the fully connected channel with the longest geometric length in the connecting channel network. The actual physical length of the critical path is obtained through geometric calculation algorithms. The rated transmission speed of each connecting channel in the critical path is obtained from the local database. The actual transmission speed of each connecting channel is obtained based on the congestion index of each connecting channel. The actual physical length of the critical path is divided by the average actual transmission speed of each connecting channel in the critical path to obtain the duration of the fully connected channel in the cross path reaching the target shipping point.

[0023] Preferably, the second duration of the composite path is specifically defined as follows: In the composite path, at least one item in the logistics order directly reaches the target shipping point via an independent connecting chute, and at least two items are directly connected via connecting chutes to reach the target shipping point. For items that directly reach the target shipping point via independent connecting chutes, the duration set of their independent connecting chute to reach the target shipping point is obtained according to the parallel path calculation method. For items that reach the target shipping point via interconnected connecting chutes, the duration of their connecting chute to reach the target shipping point is obtained according to the cross path calculation method. The duration set of independent items reaching the target shipping point via their independent connecting chutes and the duration of collaborative items reaching the target shipping point via their connecting chutes are combined to generate a mixed duration numerical sequence. The maximum value in this sequence is taken as the duration of the connecting chute to reach the target shipping point in the composite path.

[0024] Preferably, if the total time required to complete picking on a certain route after classification does not affect the next logistics order to be picked, the optimal picking route for the logistics order is obtained by filtering. The specific filtering method is as follows: within the set time window, all routes are traversed from the first route. If there is a route that satisfies all constraints within the time window, the traversal is stopped and the route is directly output and taken as the optimal picking route. If there is no route that satisfies all constraints within the time window, all remaining routes are traversed from the set time window until a route that satisfies all constraints is found.

[0025] If the total time required to complete picking on a certain route after classification is less than the preset completion time, then the logistics order is determined not to affect the next logistics order to be picked.

[0026] If the total time required to complete picking on a certain route after classification is greater than or equal to the preset completion time, then it is determined that the logistics order affects the next logistics order to be picked, and the route is removed. The remaining routes after classification are marked as a candidate route set.

[0027] The real-time congestion coefficient, maintenance status parameters, and basic usage intensity of all connected slides in the candidate path set are weighted and summed to obtain the health index score of all connected slides. If the health index score of any connected slide of a candidate path in the candidate path set is less than the preset safety and health index score, the candidate path is removed.

[0028] The health index score of each connected slide in the candidate path set is adjusted based on the number of interconnected slides in parallel paths, intersecting paths, and composite paths. Parallel paths without interconnected slides have a health index of 1. Intersecting paths have their health index score adjusted by multiplying the initial health index score by the reciprocal of the number of interconnected slides in the intersecting path. Composite paths have their health index score for connected slides without interconnected slides as 1, and the health index score for interconnected slides is adjusted by multiplying the initial health index score by the reciprocal of the number of interconnected slides in the intersecting path. This yields the adjusted health index score for each connected slide in the composite path. If the health index score of any connected slide in a candidate path after adjustment is less than the preset safety health index score, that candidate path is removed.

[0029] A second aspect of the present invention provides a management system for a warehouse racking management method based on intelligent logistics search, including a status perception module: used to monitor and update the load status and logistics orders of each connecting slide of the warehouse flow rack, wherein the load status refers to the maximum number of goods that the connecting slide itself can carry.

[0030] Goods passage path filtering module: It is used to filter out each passage path of the logistics order by combining the logistics order picking list and the load status of the flow rack connecting slide.

[0031] Route Decision Module: This module categorizes the various routes for a logistics order and evaluates the total time required to complete picking for each route after categorization. If the total time required to complete picking for a certain route after categorization affects the next logistics order to be picked, then that route is removed. If the total time required to complete picking for a certain route after categorization does not affect the next logistics order to be picked, then the optimal picking route for the logistics order is selected.

[0032] The beneficial effects of the present invention are as follows: (1) The first part of the present invention: realizes dynamic monitoring and real-time updating of the load status and logistics orders of each connecting slide of the flow rack, can accurately capture the load status of the connecting slide and the dynamic changes of logistics orders, and provide core basic data for subsequent congestion index calculation and path selection. It eliminates the lag and error of manual statistics, realizes automatic data collection and synchronization through IoT sensors, ensures the authenticity and timeliness of load status data, avoids the problem of overloading of goods due to the unknown maximum load capacity of the connecting slide from the source, and provides data guarantee for the safety and efficiency of warehousing operations.

[0033] (2) The second part of the present invention: Based on the load status of the connecting slide, the goods and shelves are accurately positioned by means of the three-dimensional physical model of the warehouse. By scientifically calculating the congestion index of the connecting slide, the connecting slides that exceed the standard are accurately eliminated to avoid congestion affecting the passage efficiency. At the same time, the shelves that are closer to the warehouse center point are selected as the outbound nodes, which greatly shortens the initial transportation distance and reduces redundant calculations. This design fully considers the upper limit of the connecting slide and the spatial layout, and generates a set of paths including independent passage, collaborative merging and other schemes, which improves the scientificity and flexibility of path selection and provides high-quality options for optimal path decision-making.

[0034] (3) The third part of the present invention: By scientifically classifying the passage paths into three categories, namely parallel, intersecting and compound, the total picking time is comprehensively evaluated, the impact of the congestion index on the actual transmission speed of the connecting slide is fully incorporated, and the personnel movement time and the safety buffer of collaborative passage are also included to ensure that the time evaluation is accurate and comprehensive. By eliminating the paths that affect subsequent orders, and combining the congestion coefficient, maintenance status and usage intensity to construct a health index to screen the optimal path, the current orders are not only fulfilled efficiently, but the connecting slides are also prevented from being damaged due to congestion or overload. This balances operational efficiency and long-term use of equipment, and significantly improves the overall scheduling rationality and robustness of warehouse rack management. Attached Figure Description

[0035] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0036] Figure 1 This is a schematic diagram of the method flow of the present invention.

[0037] Figure 2 This is a schematic diagram of the system modules of the present invention. Detailed Implementation

[0038] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0039] Reference Figure 1As shown, the present invention provides a warehouse racking management method based on intelligent logistics search, including step 1. Status perception: monitoring and updating the load status and logistics orders of each connecting slide of the warehouse flow rack, wherein the load status refers to the maximum number of goods that the connecting slide itself can carry.

[0040] Step 2. Goods passage path filtering: Combine the logistics order picking list and the load status of the flow rack connecting slides to obtain the passage paths of the logistics orders.

[0041] In a specific embodiment of the present invention, the method for filtering and obtaining the various passage paths of logistics orders is as follows: sorting each logistics order in ascending order according to the remaining time of each logistics order to obtain a sorted logistics order picking list; for the logistics order ranked first in the logistics order picking list, obtaining the identification code of each item in the logistics order; locating each shelf corresponding to each item identification code in the constructed warehouse three-dimensional entity model; and obtaining the distance between each shelf corresponding to each item identification code in the logistics order and the warehouse center point.

[0042] Each shelf corresponding to each product identification code is sorted in ascending order according to its distance from the warehouse center point, and this is used as the first outbound node for each product in the logistics order.

[0043] The system uses a 3D physical model of the warehouse to locate the connecting slides of each shelf corresponding to each product identification code in the logistics order, and calculates the congestion index of each connecting slide of each shelf corresponding to each product identification code in the logistics order. When the congestion index of a certain connecting slide is greater than the preset warning congestion index threshold, the connecting slide is removed, and the remaining connecting slides are used as the second outbound node.

[0044] Based on the first and second outbound nodes of each item in the selected logistics orders, and combined with the 3D physical model of the warehouse, the target outbound points of the warehouse racks are obtained. Global path planning is then performed in the 3D physical model of the warehouse to obtain the passage paths of the logistics orders.

[0045] For example, the logistics orders are sorted in ascending order based on their remaining time to obtain a sorted logistics order picking table. For instance, if order A has an initial receiving time of 10:00 and a closing time of 14:00, order B has an initial receiving time of 10:00 and a closing time of 12:00, and order C has an initial receiving time of 10:00 and a closing time of 15:00, then order A has 235 minutes remaining, order B has 116 minutes remaining, and order C has 296 minutes remaining. Sort all logistics orders in ascending order based on their remaining time as order B > order A > order C. Therefore, in the logistics order picking table, order B is ranked first, order A is ranked second, and order C is ranked third.

[0046] In one specific embodiment, the method for constructing the warehouse 3D entity model is as follows: a global coordinate system is established based on the fixed reference points of the warehouse building, and point cloud data of each entity component inside the warehouse is collected by a laser scanner under this coordinate system to construct a 3D entity model of the warehouse. The load status of each connecting slide is used as attribute information and associated with the corresponding connecting slide coordinate identifier in the 3D entity model by an Internet of Things sensor. The real-time coordinates of picking personnel in the warehouse in the global coordinate system are integrated into the 3D entity model based on the UWB positioning system, and finally a warehouse 3D entity model containing geometric information and real-time status data is generated.

[0047] The fixed reference point of the warehouse building refers to a physical feature point that is permanently present in the warehouse building structure, has a fixed position, and is easy to measure accurately, such as the center point of the regularly arranged load-bearing columns in the warehouse, or the intersection point at the corner of the warehouse's outer wall.

[0048] Each physical component refers to a physical entity object in warehousing that has an independent geometric shape and clear functional attributes, such as: flow racks, the connecting slides of flow racks, target shipping points, etc.

[0049] It should be noted that the warehouse global coordinate system provides a unified positioning benchmark for all objects in the warehouse, and the three-dimensional solid model is the result of digitally reconstructing the precise geometric shape of each physical component in the warehouse.

[0050] It should be noted that this 3D solid model can dynamically reflect the panoramic 3D scene of each item's storage location and the real-time location of personnel, providing an accurate spatial calculation basis for the efficiency of logistics order picking paths.

[0051] For example, global path planning is performed in the 3D model of the warehouse to obtain the various paths for logistics orders. For instance, for the logistics order ranked first in the picking list, which includes goods A, B, and C, the warehouse center point is O, and the warehouse target shipping points are P, Q, and S. Assuming that the target shipping point for each goods is P, the corresponding shelf is located in the 3D physical model of the warehouse according to the identification code of each goods in the logistics order. Goods A correspond to shelves 1 and 2, goods B correspond to shelf 3, and goods C correspond to shelves 4 and 5. The distance between each shelf and the warehouse center point O is calculated. If the calculated distance between shelf 1 and the warehouse center point O is 10 meters, the distance between shelf 2 and the warehouse center point O is 15 meters, and the distance between shelf 3 and the warehouse center point O is 15 meters, then the distance between shelf 1 and the warehouse center point O is 15 meters. The distance from center point O is 12 meters, the distance from shelf 4 to warehouse center point O is 8 meters, and the distance from shelf 5 to warehouse center point O is 11 meters. Based on these distances, the first outbound node for each item is determined in ascending order. The distance between shelf 1 and warehouse center point O is less than that between shelf 2 and warehouse center point O, so shelf 1 is placed before shelf 2. Item A is prioritized for shelf 1, and item B is prioritized for shelf 3. The distance between shelf 4 and warehouse center point O is less than that between shelf 5 and warehouse center point O, so shelf 4 is placed before shelf 5. Item C is prioritized for shelf 4. The connecting slides of each shelf are located using the 3D solid model of the warehouse. For example, shelf 1 has connecting slides 1-1 and 1-2, shelf 3 has connecting slide 3-1, and shelf 4... There are connecting tracks 4-1 and 4-2. The congestion index of each connecting track is calculated, with a preset warning congestion index threshold of 85%. The congestion index of connecting track 1-1 is 70%, connecting track 1-2 is 90%, connecting track 3-1 is 60%, connecting track 4-1 is 80%, and connecting track 4-2 is 88%. Therefore, connecting tracks 1-2 and 4-2, which exceed the congestion index threshold, are removed. The remaining connecting tracks 1-1, 3-1, and 4-1 are designated as the second outbound node. Based on the first and second outbound nodes and the target shipping point P, global path planning is performed in the 3D warehouse model to generate multiple paths for this logistics order. The travel paths are as follows: In path 1, the path for product A is: shelf 1 -> connecting slide 1-1 -> P; the path for product B is: shelf 3 -> connecting slide 3-1 -> P; and the path for product C is: shelf 4 -> connecting slide 4-1 -> P. In path 2, the connecting slides for products A and B are directly connected, and they travel together to the target shipping point P. Product C travels independently. The paths for products A and B are: product A enters connecting slide 1-1 from shelf 1, and product B enters connecting slide 3-1 from shelf 3. Connecting slide 1-1 and connecting slide 3-1 are directly connected, so products A and B travel from connecting slide 1-1 -> connecting slide 3-1 -> P. The path for product C is: shelf 4 -> connecting slide 4-1 -> P.

[0052] It should be noted that the core purpose of setting the first outbound node is to prioritize the shelf closest to the warehouse center as the starting point during global path planning. This reduces the overall picking time by shortening the initial transportation distance and reduces redundant calculations for long-distance paths, thereby improving system response speed and resource scheduling efficiency.

[0053] The global planning refers to performing global path planning in the 3D physical model of the warehouse based on the first and second outbound nodes determined for each item. The goal is not to generate a single path, but to output a set of paths containing multiple feasible solutions. This set of paths will fully consider the interconnectivity of the connecting chute network. The solutions include independent passage solutions: each item can independently reach the outbound point through its own available connecting chute; and collaborative merging solutions: the connecting chute of some items is connected in the connecting chute network, and they can reach the target outbound point together in the connected connecting chute, while other items pass through independently.

[0054] In a specific embodiment of the present invention, the method for calculating the congestion index of each connecting slide of each shelf corresponding to each product identification code in the logistics order is as follows: the quantity of existing products on each connecting slide of each shelf corresponding to each product identification code in the logistics order is obtained by using a weighing sensor installed on each connecting slide, and the quantity of products in the logistics order is used as the current expected quantity of products to be transported on each connecting slide. The quantity of existing products on each connecting slide of each shelf corresponding to each product identification code in the logistics order is added to the current expected quantity of products to be transported and divided by the load state of the connecting slide to obtain the congestion index of each connecting slide of each shelf corresponding to each product identification code in the logistics order.

[0055] Step 3. Route Decision: Classify the various routes of the logistics order and evaluate the total time required to complete the picking for each route after classification. If the total time required to complete the picking for a certain route after classification affects the next logistics order to be picked, then remove that route. If the total time required to complete the picking for a certain route after classification does not affect the next logistics order to be picked, then the optimal picking route for the logistics order is obtained.

[0056] In a specific embodiment of the present invention, the method for classifying the various routes of a logistics order is as follows: if a certain route in a logistics order has each item that directly reaches the target shipping point through an independent connecting slide and there is no intersection between the connecting slides, then the route is classified as a parallel route.

[0057] If every item in a certain path in a logistics order has a connecting chute that is directly connected to each other, forming a fully connected chute that reaches the target shipping point, and no item reaches the target shipping point directly through an independent connecting chute, then the path is classified as an intersecting path.

[0058] If, in a logistics order, at least one item in a certain route reaches the target shipping point directly via an independent connecting chute, and at least two items are connected by a direct connecting chute to reach the target shipping point, then the route is classified as a composite route.

[0059] The term "fully connected slide" refers to a network topology in which any two connected slide nodes have a direct connection path.

[0060] The direct connection refers to the seamless flow of goods between connected slides through physical interfaces or transmission devices, without the need for intermediate converging nodes.

[0061] For example, a parallel path could be as follows: a logistics order contains goods A, goods B, and goods C. Goods A are stored on shelf 1 and directly reach the target shipping point P via an independent connecting chute A1. Goods B are stored on shelf 2 and directly reach the target shipping point P via an independent connecting chute B1. Goods C are stored on shelf 3 and directly reach the target shipping point P via an independent connecting chute C1. In this path, connecting chutes A1, B1, and C1 are independent of each other and have no intersection points. All goods reach the shipping point directly via independent connecting chutes.

[0062] For example, a cross path could be as follows: a logistics order contains goods A, goods B, and goods C. Goods A enters connecting chute A1 from shelf 1, goods B enters connecting chute B1 from shelf 2, and goods C enters connecting chute C1 from shelf 3. Connecting chute A1, B1, and C1 are directly connected to each other. Each good in the logistics order can flow in this fully connected chute and eventually arrive at the target shipping point P.

[0063] For example, a composite path might be as follows: A logistics order includes goods A, goods B, and goods C. Goods A are stored on shelf 1 and directly reach the target shipping point P via an independent connecting chute A1. Goods B's path starts at shelf 2 and is transported via connecting chute B1. Goods C's path starts at shelf 3 and is transported via connecting chute C1. Since there is a direct connection between connecting chute B1 and connecting chute C1, the two goods' paths are merged at the connecting chute level. Finally, they are transported collaboratively to the target shipping point P through a shared channel to complete the outbound process. In this path, there is both the independent passage of goods A and the collaborative convergence of goods B and goods C.

[0064] In a specific embodiment of the present invention, the method for evaluating the total time required for each passageway to complete picking after classification is as follows: by obtaining the baseline movement time and safe movement time of each item from the corresponding shelf to the entrance of the connecting slide in each passageway, and adding them together as the predicted movement time, the maximum predicted movement time among all items is taken as the first time of each passageway after classification.

[0065] For the classified parallel paths, intersecting paths, and composite paths, calculate the second duration of the parallel path, the second duration of the intersecting path, and the second duration of the composite path, respectively.

[0066] The real-time coordinates of warehouse personnel are obtained by using the UWB positioning system integrated into the 3D physical model of the warehouse. The path topology analysis algorithm built into the 3D physical model of the warehouse is used to obtain the length of all feasible paths from the current location of the warehouse personnel to each target shipping point. When there are multiple feasible paths from the current location of the warehouse personnel to each target shipping point, the longest path is selected as the calculation benchmark and divided by the average speed of the warehouse personnel calculated based on historical operation data to obtain the travel time of the warehouse personnel to each target shipping point.

[0067] Based on the target shipping point corresponding to each categorized path, the movement time of warehouse personnel to reach the target shipping point is associated, and this time is defined as the third time of each path. The first time, second time and third time of each path in the logistics order are added together to obtain the total time required for each categorized path to complete picking.

[0068] The baseline movement time refers to the actual time taken for all goods to move from a specific shelf location to the corresponding connecting slide entrance, continuously recorded by IoT sensors installed at the junction of the shelf and the connecting slide, and the average value of these times is taken as the baseline movement time.

[0069] The safe movement time refers to the estimated time for goods to move from the current connecting slide entrance to the next connecting slide junction point in a collaborative passage section of an intersecting or composite path. Through the warehouse 3D entity model, the spatial trajectory length between the junction points of any two interconnected connecting slides is directly read. The actual operating speed under similar working conditions in recent historical data is analyzed from the equipment management system, and its average value is calculated as the movement speed between the junction points of any two interconnected connecting slides. The spatial trajectory length is divided by the movement speed to obtain the safe movement time for goods to move from the current connecting slide entrance to the next connecting slide junction point.

[0070] It should be noted that the average speed of warehouse personnel is calculated by continuously recording the movement trajectory of personnel in the warehouse through the UWB positioning system, removing abnormal stops and non-operational periods, and then using this value as the average speed of warehouse personnel.

[0071] It should be noted that selecting the longest path is a proactive fault-tolerant design. By selecting the longest feasible path as the calculation benchmark, a safety buffer is proactively built in the time estimation. This can effectively absorb time deviations caused by uncertain factors such as temporary path congestion, equipment performance fluctuations, or personnel operation delays, thereby significantly enhancing the robustness and execution reliability of the overall scheduling scheme.

[0072] In a specific embodiment of the present invention, the second duration of the parallel path is specifically determined as follows: In the parallel path, each item in the logistics order directly reaches the target shipping point via an independent connecting chute. The spatial trajectory coordinates of the independent connecting chute for each item are obtained through a three-dimensional physical model of the warehouse. Based on this, the actual physical length of the independent connecting chute for each item is obtained through a geometric calculation algorithm. The rated transmission speed of the independent connecting chute is obtained from the local database. Based on the congestion index of the independent connecting chute, the actual transmission speed of the independent connecting chute is obtained as rated transmission speed * (1 - congestion index). The actual physical length of the independent connecting chute for each item is divided by the actual transmission speed of the independent connecting chute to obtain the duration of each item in the logistics order from the connecting chute to the target shipping point. The duration is then sorted in descending order to generate a numerical sequence of the durations of all items in the logistics order. The maximum value in this sequence is taken as the duration of the connecting chute in the parallel path to the target shipping point.

[0073] It should be noted that the higher the congestion index of the connecting slide, the lower the actual transmission speed. This is because the transmission efficiency decreases due to the increased congestion of the connecting slide, in order to prevent the connecting slide from being overloaded and avoid equipment damage.

[0074] For example, the total time required to complete picking along a parallel path: The logistics order includes goods A, B, and C. The baseline running times for each goods from the shelf to its corresponding connecting chute are as follows: Goods A: Shelf 1 -> Connecting Chute 1-1 takes 0.5 minutes; Goods B: Shelf 3 -> Connecting Chute 3-1 takes 0.6 minutes; Goods C: Shelf 4 -> Connecting Chute 4-1 takes 0.55 minutes. Since there are no interconnected chutes along the parallel path, the safe movement time is 0 minutes. Therefore, the maximum predicted movement time among all goods is taken as the first time of this path, i.e., the first time of this path is 0.6 minutes. In a certain parallel path, Each item travels directly to the target shipping point P via an independent connecting chute. The calculated travel times for each item on the connecting chute are as follows: Item A: Connecting chute 1-1 -> P takes 2.0 minutes; Item B: Connecting chute 3-1 -> P takes 2.5 minutes; Item C: Connecting chute 4-1 -> P takes 1.8 minutes. The maximum value of 2.5 minutes is taken as the travel time from the connecting chute to the shipping point. Simultaneously, based on the longest feasible path from the warehouse personnel's current location to the target shipping point and the average speed of the warehouse personnel, the travel time for the warehouse personnel to reach the target shipping point P is 0.8 minutes. Therefore, the total travel time for the parallel paths is 0.6 + 2.5 + 0.8 = 3.9 minutes.

[0075] In a specific embodiment of the present invention, the second duration of the cross path is specifically determined as follows: In the cross path, the connecting channels of each item in the logistics order are directly connected in pairs to form a fully connected channel reaching the target shipping point. The full topology data of the connecting channel network is obtained through the three-dimensional solid model of the warehouse. Based on graph theory algorithms, the critical path of each item in the logistics order from the entrance of the connecting channel network to the target shipping point is identified. The critical path refers to the fully connected channel with the longest geometric length in the connecting channel network. The actual physical length of the critical path is obtained through geometric calculation algorithms. The rated transmission speed of each connecting channel in the critical path is obtained from the local database. The actual transmission speed of each connecting channel is obtained based on the congestion index of each connecting channel. The actual physical length of the critical path is divided by the average actual transmission speed of each connecting channel in the critical path to obtain the duration of the fully connected channel in the cross path reaching the target shipping point.

[0076] For example, the total time required to complete picking via cross-path: A logistics order includes goods A, B, and C. The connecting chutes of the goods are connected in pairs to form a fully connected chute. The baseline running time for each goods from the shelf to its corresponding connecting chute is obtained: Goods A: Shelf 1 -> Connecting Chute 1-1 takes 0.5 minutes, Goods B: Shelf 3 -> Connecting Chute 3-1 takes 0.6 minutes, Goods C: Shelf 4 -> Connecting Chute 4-1 takes 0.55 minutes, and the safe movement time is obtained as 0.1 minutes. Then, the maximum predicted movement time among all goods is taken as the first time for this path. The duration, i.e., the first duration of the passage path, is 0.7 minutes. Through the 3D model and graph theory algorithm, the actual physical length of the critical path of the connected slide network is identified as 45 meters. The average actual transmission speed of each connected slide segment on the critical path is 0.5 meters / second. Therefore, the overall passage time of the goods in the connected slide network is 45 / 0.5 = 90 seconds, or 1.5 minutes. This 1.5 minutes is the time from the connected slide to the delivery point under the cross path. The movement time for warehouse personnel to reach the target delivery point P is 0.8 minutes. Therefore, the total duration of the cross path is 0.7 + 1.5 + 0.8 = 3.0 minutes.

[0077] It should be noted that, apart from the core application logic, the geometric calculation algorithm, path topology analysis algorithm, and graph theory algorithm involved in this invention all adopt standard implementation methods in the prior art for their basic parameter settings. These algorithms are well-known methods in the fields of computer graphics, network topology optimization, and discrete mathematics. Those skilled in the art can set them according to actual scenarios. For example, the basic parameter settings of the geometric calculation algorithm include, but are not limited to: numerical calculation accuracy tolerance, geometric feature extraction threshold, surface fitting smoothness coefficient, etc. These parameters have standardized value ranges in the field of computer-aided geometric design. The standard parameter configuration of the path topology analysis algorithm mainly involves: network node connectivity determination threshold, path search depth limit, topology similarity tolerance, etc. These parameters have mature reference standards in the fields of graph theory and network analysis. The classic parameter settings of graph theory algorithms cover: network flow computation capacity constraints, subgraph partitioning size limit parameters, etc. These parameters all have standard implementation specifications in discrete mathematics algorithm libraries. Those skilled in the art can make conventional configurations based on specific path planning needs. The setting details of the above algorithm parameters are all public knowledge in the prior art. Those skilled in the art can flexibly configure them based on conventional experience and specific scenarios without affecting the implementation and reproduction of the technical solution of this invention.

[0078] In a specific embodiment of the present invention, the second duration of the composite path is specifically determined as follows: In the composite path, at least one item in the logistics order directly reaches the target shipping point via an independent connecting chute, and at least two items simultaneously have directly connected connecting chutes that reach the target shipping point. For items that directly reach the target shipping point via independent connecting chutes, the duration set of their independent connecting chute to the target shipping point is obtained according to the parallel path calculation method. For items that reach the target shipping point via interconnected connecting chutes, the duration of their connecting chute to the target shipping point is obtained according to the cross path calculation method. The duration set of independent items reaching the target shipping point via their independent connecting chutes and the duration of collaborative items reaching the target shipping point via their connecting chutes are combined to generate a mixed duration numerical sequence. The maximum value in this sequence is taken as the duration of the connecting chute to the target shipping point in the composite path.

[0079] For example, the total time required to complete picking via a composite path: In this logistics order, item A reaches point P directly via an independent connecting chute A1. Items B and C are directly connected via connecting chute B1 and C1. The baseline travel time from the shelf to their corresponding connecting chute for each item is obtained: item A requires 0.5 minutes, item B requires 0.65 minutes, and item C requires 0.7 minutes. The safe movement time is 0.1 minutes. Therefore, the maximum predicted movement time among all items is taken as the first time of this path, i.e., the first time of this path is 0.8 minutes. For item A traveling independently, the time from connecting chute A1 to P is 2.2 minutes. For items B and C traveling collaboratively, the critical path travel time of their connecting chute network is 2.0 minutes. The maximum of these two values, 2.2 minutes, is taken as the time from the connecting chute to the shipping point under the composite path. The personnel movement time is 0.8 minutes. Therefore, the total duration of the composite route is 0.8 + 2.2 + 0.8 = 3.8 minutes.

[0080] In a specific embodiment of the present invention, if the total time required to complete picking on a certain route after classification does not affect the next logistics order to be picked, the optimal picking route for the logistics order is obtained by filtering. The specific filtering method is as follows: within a set time window, all routes are traversed from the first route. If there is a route that satisfies all constraints within the time window, the traversal is stopped and the route is directly output and taken as the optimal picking route. If there is no route that satisfies all constraints within the time window, all remaining routes are traversed from the set time window until a route that satisfies all constraints is found.

[0081] If the total time required to complete picking on a certain route after classification is less than the preset completion time, then the logistics order is determined not to affect the next logistics order to be picked.

[0082] If the total time required to complete picking on a certain route after classification is greater than or equal to the preset completion time, then it is determined that the logistics order affects the next logistics order to be picked, and the route is removed. The remaining routes after classification are marked as a candidate route set.

[0083] The real-time congestion coefficient, maintenance status parameters, and basic usage intensity of all connected slides in the candidate path set are weighted and summed to obtain the health index score of all connected slides. If the health index score of any connected slide of a candidate path in the candidate path set is less than the preset safety and health index score, the candidate path is removed.

[0084] The health index score of each connected slide in the candidate path set is adjusted based on the number of interconnected slides in parallel paths, intersecting paths, and composite paths. Parallel paths without interconnected slides have a health index of 1. Intersecting paths have their health index score adjusted by multiplying the initial health index score by the reciprocal of the number of interconnected slides in the intersecting path. Composite paths have their health index score for connected slides without interconnected slides as 1, and the health index score for interconnected slides is adjusted by multiplying the initial health index score by the reciprocal of the number of interconnected slides in the intersecting path. This yields the adjusted health index score for each connected slide in the composite path. If the health index score of any connected slide in a candidate path after adjustment is less than the preset safety health index score, that candidate path is removed.

[0085] It should be noted that the constraint condition is that the total required time for each passage path after classification does not affect the next pending logistics order, and the initial health index score and adjusted health index score of any connecting chute in each passage path that does not affect the next pending logistics order are both less than the preset safety and health index score.

[0086] For example, the time window is set to 5 routes or 10 routes.

[0087] It should be noted that when the time window is set to traverse all remaining routes, it means that all 5 routes set in the previous time window have been traversed and there are no routes that meet all constraints. In this case, 5 more routes will be traversed based on all routes minus the 5 routes traversed in the previous time window.

[0088] The basic usage intensity refers to the ratio of the cumulative usage time of the connecting slide to the designed usage limit when the connecting slide was designed. The cumulative usage time of the connecting slide is obtained by monitoring the IoT sensors of the warehouse 3D physical model.

[0089] The maintenance status parameter refers to the ratio of the time interval between the last maintenance and the maintenance cycle of the connecting slide. The time interval between the last maintenance and the maintenance cycle of the connecting slide are obtained by recording data in the warehousing system.

[0090] After normalizing the feature values ​​of each health feature parameter in the health index score data of each passage path, a weighted sum is performed to obtain the health feature parameter of each passage path. Specifically, the weighted sum is performed by accumulating the feature values ​​of each health feature parameter with their corresponding weight coefficients and then adding them together. The weight coefficients of each health feature parameter are obtained from the data warehouse. The weight coefficients of each health feature parameter reflect the degree and direction of influence of the health feature parameter on the connected slide, and the direction of influence includes positive and negative influence.

[0091] For example, taking the health index score data of the connecting slide corresponding to a certain passage path as the real-time congestion coefficient K1, maintenance status parameter K2, and basic usage intensity K3, the real-time congestion coefficient has the greatest impact on the connecting slide and the direction of the impact is negative. The maintenance status parameter is the next most influential and its direction of impact is also negative. The greater the basic usage intensity, the more serious the equipment wear and tear, and the direction of the impact is also negative. Therefore, the weight coefficients corresponding to the real-time congestion coefficient, maintenance status parameter, and basic usage intensity can be set to -0.5, -0.35, and 0.15, respectively. Then, the health feature parameter of the connecting slide corresponding to this passage path is Q'=-0.5*K1-0.35*K2-0.15*K3.

[0092] Reference Figure 2 As shown, the present invention provides a management system for a warehouse racking management method based on intelligent logistics search, including a status perception module: used to monitor and update the load status and logistics orders of each connecting slide of the warehouse flow rack, wherein the load status refers to the maximum number of goods that the connecting slide itself can carry.

[0093] Goods passage path filtering module: It is used to filter out each passage path of the logistics order by combining the logistics order picking list and the load status of the flow rack connecting slide.

[0094] Route Decision Module: This module categorizes the various routes for a logistics order and evaluates the total time required to complete picking for each route after categorization. If the total time required to complete picking for a certain route after categorization affects the next logistics order to be picked, then that route is removed. If the total time required to complete picking for a certain route after categorization does not affect the next logistics order to be picked, then the optimal picking route for the logistics order is selected.

[0095] The examples described in this invention are not limited to the specific embodiments listed above. The examples are merely illustrative to facilitate understanding of the invention and do not constitute a limitation on the scope of protection of this invention. Any modifications, equivalent substitutions, etc., made within the spirit and principles of this invention should be included within the scope of protection.

[0096] The above description is merely an example and illustration of the concept of the present invention. Those skilled in the art can make various modifications or additions to the specific embodiments described or use similar methods to replace them, as long as they do not deviate from the concept of the invention or exceed the scope defined in this specification, they should all fall within the protection scope of the present invention.

Claims

1. A warehouse shelf management method based on logistics intelligent search, characterized in that, The method comprises the following steps: Step 1. State awareness: monitoring and updating the load state of each connected slide of the warehouse fluent shelf and the logistics order, wherein the load state refers to the maximum number of goods that the connected slide can carry itself; Step 2. Goods passage path screening: screening each passage path of the logistics order in combination with the logistics order picking list and the load state of the connected slide of the fluent shelf; Step 3. Path decision: classifying each passage path of the logistics order, and evaluating the total time required for completing the picking of each passage path after classification, if the total time required for completing the picking of a passage path after classification affects the next logistics order to be picked, the passage path is excluded, if the total time required for completing the picking of a passage path after classification does not affect the next logistics order to be picked, the optimal picking passage path of the logistics order is screened. 2.The warehouse rack management method based on logistics intelligent searching according to claim 1, characterized in that, The specific method for screening each passage path of the logistics order is as follows: sequentially sorting each logistics order according to the remaining time in ascending order to obtain a sorted logistics order picking list, obtaining each goods identification code in the logistics order, positioning each shelf corresponding to each goods identification code in combination with the constructed warehouse three-dimensional entity model, and obtaining the distance between each shelf corresponding to each goods identification code in the logistics order and the warehouse center point; sequentially sorting each shelf corresponding to each goods identification code according to the distance between the shelf and the warehouse center point in ascending order, and taking the shelf as the first outbound node of each goods in the logistics order; positioning each connected slide of each shelf corresponding to each goods identification code in the logistics order through the warehouse three-dimensional entity model, and calculating the congestion index of each connected slide of each shelf corresponding to each goods identification code in the logistics order, if the congestion index of a certain connected slide is greater than a preset warning congestion index threshold, the connected slide is excluded, and the remaining connected slides are taken as the second outbound node; obtaining each target delivery point of the warehouse shelf in combination with the warehouse three-dimensional entity model according to the first outbound node and the second outbound node of each goods in the logistics order screened, and performing global path planning in the warehouse three-dimensional entity model to obtain each passage path of the logistics order. 3.The warehouse rack management method based on logistics intelligence search of claim 2, wherein, The specific method for calculating the congestion index of each connected slide of each shelf corresponding to each goods identification code in the logistics order is as follows: obtaining the existing number of goods on each connected slide of each shelf corresponding to each goods identification code in the logistics order through the weighing sensor installed on each connected slide, taking the number of goods in the logistics order as the current expected number of goods transported on each connected slide, and adding the existing number of goods on each connected slide of each shelf corresponding to each goods identification code in the logistics order to the current expected number of goods transported and dividing by the load state of the connected slide to obtain the congestion index of each connected slide of each shelf corresponding to each goods identification code in the logistics order. 4.The warehouse rack management method based on logistics intelligence search of claim 2, wherein, The specific method for classifying each passage path of the logistics order is as follows: if each goods in a passage path of the logistics order directly reaches the target delivery point through an independent connected slide without any intersection point between the connected slides, the passage path is classified as a parallel path. If each of the goods in a certain passing path in the logistics order is directly connected to each other through the connected slide, a full connected slide to the target delivery point is formed, and there is no independent connected slide for any of the goods to directly reach the target delivery point, the passing path is classified as a cross path; If at least one of the goods in a certain passing path in the logistics order reaches the target delivery point through an independent connected slide, and at the same time, the connected slide between at least two goods is directly connected to reach the target delivery point, the passing path is classified as a composite path. 5.The warehouse rack management method based on logistics intelligence search of claim 4, wherein, The total time required for each passing path to complete the sorting after classification is evaluated, and the specific method is: The reference movement time and the safety movement time of each good in each passing path from the corresponding shelf to the entrance of the connected slide are obtained, and the sum thereof is added as the predicted movement time, and the maximum predicted movement time in all goods is taken as the first time of each passing path after classification; For the parallel path, the cross path and the composite path after classification, the second time of the parallel path, the second time of the cross path and the second time of the composite path are calculated respectively; The real-time coordinates of the warehouse personnel are obtained based on the UWB positioning system integrated in the warehouse three-dimensional entity model, and the length of all feasible paths from the current position of the warehouse personnel to each target delivery point is obtained through the path topological analysis algorithm built in the warehouse three-dimensional model. When there are multiple feasible paths from the current position of the warehouse personnel to each target delivery point, the longest path is selected as the calculation reference, and the average speed of the warehouse personnel is obtained based on the historical operation data, and the movement time of the warehouse personnel to reach each target delivery point is obtained. According to the target delivery point corresponding to each passing path after classification, the movement time of the warehouse personnel to reach the target delivery point is associated, and the time is defined as the third time of each passing path. The first time, the second time and the third time of each passing path in the logistics order are added to obtain the total time required for each passing path to complete the sorting after classification. 6.The warehouse rack management method based on logistics intelligence search of claim 5, wherein, The second time of the parallel path, the specific method is: In the parallel path, each good in the logistics order reaches the target delivery point through an independent connected slide. The spatial trajectory coordinates of each independent connected slide of the goods are obtained through the warehouse three-dimensional entity model, and the actual physical length of each independent connected slide of the goods is obtained based on this through a geometric calculation algorithm. The rated transmission speed of the independent connected slide is obtained from the local database, and the actual transmission speed of the independent connected slide is obtained based on the congestion index of the independent connected slide, which is the rated transmission speed*(1-congestion index). The actual physical length of each independent connected slide of the goods is divided by the actual transmission speed of the independent connected slide to obtain the time of each good in the logistics order from the connected slide to reach the target delivery point, and the time is sorted in descending order to generate a numerical sequence of the time of all goods in the logistics order. The maximum value in the sequence is taken as the time of the connected slide to reach the target delivery point in the parallel path. 7.The warehouse shelf management method based on logistics intelligence search of claim 5, wherein, The second time of the cross path, the specific method is: In the cross path, the communication slide of each goods in the logistics order is directly connected with each other, and a full communication slide to the target delivery point is constructed. The full topology structure data of the communication slide network is obtained through the three-dimensional entity model of the warehouse. The key path of each goods from the entrance of the communication slide network to the target delivery point is identified based on the graph theory algorithm. The key path refers to the full communication slide with the longest geometric length in the communication slide network. The actual physical length of the key path is obtained through the geometric calculation algorithm. The rated transmission speed of each communication slide in the key path is obtained from the local database. The actual transmission speed of each communication slide is obtained based on the congestion index of each communication slide. The time length of the full communication slide in the cross path to reach the target delivery point is obtained by dividing the actual physical length of the key path by the average value of the actual transmission speed of each communication slide in the key path. 8.The warehouse shelf management method based on logistics intelligence search of claim 5, wherein, The second time length of the composite path, and the specific method is: In the composite path, at least one goods in the logistics order reaches the target delivery point through an independent communication slide, and at least two goods reach the target delivery point through directly connected communication slides. The time length set of the independent communication slide of the independent goods to reach the target delivery point is obtained according to the parallel path calculation method. The time length of the communication slide of the collaborative goods to reach the target delivery point is obtained according to the cross path calculation method. The time length set of the independent goods from the independent communication slide to reach the target delivery point is combined with the time length of the collaborative goods from the communication slide to reach the target delivery point to generate a mixed time length sequence. The maximum value in the sequence is taken as the time length of the communication slide to reach the target delivery point in the composite path. 9.The warehouse rack management method based on logistics intelligence search of claim 5, wherein, The total time length required for completing the picking of a certain passing path after classification does not affect the next logistics order to be picked, and the optimal picking passing path of the logistics order is screened out. The specific screening method is: All passing paths are traversed from the first passing path within the set time window. If there is a passing path that meets all the constraint conditions within the time window, the traversal is stopped and the passing path is directly output as the optimal picking path. If there is no passing path that meets all the constraint conditions within the time window, all remaining passing paths are traversed within the set time window until a passing path that meets all the constraint conditions is found. If the total time length required for completing the picking of a certain passing path after classification is less than the predetermined specified completion time length, it is determined that the logistics order does not affect the next logistics order to be picked. If the total time length required for completing the picking of a certain passing path after classification is greater than or equal to the predetermined specified completion time length, it is determined that the logistics order affects the next logistics order to be picked, and the passing path is removed. The remaining passing paths after classification are marked as a candidate path set. The real-time congestion coefficient, the maintenance state parameter and the basic use intensity of all the connected slides in the candidate path set are weighted and summed to obtain a health index score of all the connected slides, and if the health index score of any connected slide of a candidate path in the candidate path set is less than a preset safe health index score, the candidate path is removed; The health index scores of the connected slides of the candidate path set are adjusted according to the number of the connected slides of the parallel path, the cross path and the composite path, no connected slide of the parallel path is connected to each other, and the health index score of the connected slide corresponding to the parallel path is 1, the health index score of the connected slide in the cross path is adjusted to the initial health index score multiplied by the reciprocal of the number of the connected slides connected to each other in the cross path, no connected slide of the composite path is connected to each other, and the health index score of the connected slide corresponding to the composite path is 1, the health index score of the connected slide connected to each other in the composite path is adjusted to the initial health index score multiplied by the reciprocal of the number of the connected slides connected to each other in the cross path, to obtain the adjusted health index score of each connected slide in the composite path, and if the health index score of any connected slide of a candidate path in the adjusted candidate path set is less than the preset safe health index score, the candidate path is removed.

10. A management system for performing the warehouse shelf management method based on logistics intelligence search according to any one of claims 1 to 9, characterized in that, Comprise: A state sensing module for monitoring and updating the load state of each connected slide of the warehouse fluent type shelf and the logistics order, the load state refers to the maximum number of goods that the connected slide can carry; A goods passing path screening module for screening each passing path of the logistics order by combining the logistics order picking table and the load state of the connected slide of the fluent type shelf; A path decision module for classifying each passing path of the logistics order and evaluating the total time required for picking of each passing path after classification, if the total time required for picking of a passing path after classification affects the next logistics order to be picked, the passing path is removed, if the total time required for picking of a passing path after classification does not affect the next logistics order to be picked, the optimal picking passing path of the logistics order is screened.

Images