Transportation path planning method and system based on weighted directed graph

Abstract

The invention discloses a transportation path planning method and system based on a weighted directed graph. The method comprises the steps of querying a process path bound with a to-be-transmitted object to determine a target interaction platform; an interaction platform where the to-be-transmitted object is located currently is obtained; according to the target interaction station and an interaction station where the to-be-transmitted object is currently located, in a pre-created weighted directed graph, a transportation path of the to-be-transmitted object is dynamically calculated and transmitted by using a shortest path algorithm until the to-be-transmitted object reaches a target station; and when the to-be-conveyed object arrives at the target station, the to-be-conveyed object is conveyed into the process equipment. By implementing the method provided by the invention, a system capable of dynamically planning the logistics path according to the actual production condition can be realized, and the path can be adjusted in real time to cope with the change of the process sequence, so that the flexibility, response speed and efficiency of the production process are improved.

Description

Technical Field

[0001] The present invention relates to a logistics path planning method, and more specifically to a transportation path planning method and system based on a weighted directed graph. Background Art

[0002] In a lithium battery production workshop, especially in the production process of the formation and grading section, semi-finished batteries need to go through multiple process steps to be converted into finished batteries. These process steps include normal temperature standing, high temperature standing, nail insertion, nail extraction, formation, grading, OCV (Open Circuit Voltage Test), DCIR (Direct Current Internal Resistance Test), and final sorting, etc. Each process step has its corresponding dedicated equipment and logistics line. Pallets are used to transport batteries between these different process links. In order to achieve the automation of the production process, the pallet transportation needs to carry out path planning according to different production links and process requirements.

[0003] The current production technology mainly relies on a pre-set fixed process sequence and enters all the logistics paths into the system. In this way, the pallet transports from one process link to the next according to these pre-set paths, and the whole process is automatically controlled and coordinated by the system. However, some unpredictable situations often occur during the production process, such as rework, unqualified testing, process change, etc., which will cause the change of the process sequence. In this case, the traditional logistics path planning method cannot cope with these changes, resulting in the inflexibility of the logistics path not meeting the actual production requirements, thereby affecting production efficiency and flexibility.

[0004] In short, the existing fixed path planning cannot cope with the process changes in the dynamic production process. Future technologies need to be able to achieve the dynamic adjustment of the process sequence and the automatic planning of the logistics path, so as to improve production efficiency and reduce manual intervention.

[0005] Therefore, it is necessary to design a new method to implement a system that can dynamically plan the logistics path according to the actual production situation, and can adjust the path in real time to cope with the change of the process sequence, so as to improve the flexibility, response speed and efficiency of the production process. Summary of the Invention

[0006] The purpose of the present invention is to overcome the defects of the prior art and provide a transportation path planning method and system based on a weighted directed graph.

[0007] To achieve the above purpose, the present invention adopts the following technical solutions: A transportation path planning method based on a weighted directed graph, including: Query the process path bound to the object to be transmitted to determine the target interaction platform; Obtain the interaction platform where the object to be transported is currently located; According to the target interaction station and the interaction platform where the object to be transported is currently located, in the pre-created weighted directed graph, use the shortest path algorithm to dynamically calculate and transfer the transportation path of the object to be transported until the object to be transported reaches the target platform; When the object to be transported reaches the target platform, send the object to be transported into the process equipment.

[0008] A further technical solution thereof is that before querying the process path bound to the object to be transported to determine the target interaction platform, it further includes: Construct a weighted directed graph according to the logistics line and platform relationship; Obtain the process path; Bind the process path to the corresponding interaction platform to obtain the target platform.

[0009] A further technical solution thereof is that the constructing a weighted directed graph according to the logistics line and platform relationship includes: Use the numbers of all interaction platforms on the logistics line as the vertices of the directed graph; Establish the connection relationship between each of the interaction platforms according to the transportation direction of the transmission line and use it as the edge of the directed graph; Record the number of interaction platforms passed between each pair of the interaction platforms as the weight of the edge; Construct a weighted directed graph according to the vertices, edges, and the weights of the edges.

[0010] A further technical solution thereof is that the binding the process path to the corresponding interaction platform to obtain the target platform includes: Bind the process path to the last interaction platform passed before entering the process path to obtain the target platform.

[0011] A further technical solution thereof is that the according to the target interaction station and the interaction platform where the object to be transported is currently located, in the pre-created weighted directed graph, using the shortest path algorithm to dynamically calculate and transfer the transportation path of the object to be transported until the object to be transported reaches the target platform includes: Taking the interaction platform where the object to be transported is currently located as the starting point and the target interaction platform as the end point, calculate the shortest path in the weighted directed graph using the shortest path algorithm; Sequentially send each interaction platform on the shortest path to the logistics line so that the logistics line transports the object to be transported to the next interaction platform according to the issued interaction platform number until the object to be transported reaches the target platform.

[0012] A further technical solution thereof is as follows: Taking the current interaction platform where the object to be transported is located as the starting point and the target interaction platform as the ending point, calculating the shortest path in the weighted directed graph by using the shortest path algorithm, including: Taking the current interaction platform where the object to be transported is located as the starting point and the target interaction platform as the ending point, gradually searching for the reachable interaction platforms of each interaction platform and recording the corresponding weights to obtain a recording result; Selecting the path with the minimum weight from the recording result through sorting to obtain the shortest path.

[0013] A further technical solution thereof is as follows: According to the target interaction station and the current interaction platform where the object to be transported is located, dynamically calculating and transmitting the transportation path of the object to be transported by using the shortest path algorithm in the pre-created weighted directed graph until the object to be transported reaches the target platform, further including: When the process corresponding to the object to be transported changes, dynamically changing the process path according to the current process, calculating the shortest path and reissuing the target interaction platform according to the process change.

[0014] The present invention also provides a transportation path planning system based on a weighted directed graph, including: A process path query unit, configured to query the process path bound to the object to be transported to determine the target interaction platform; An acquisition unit, configured to acquire the current interaction platform where the object to be transported is located; A shortest path calculation unit, configured to dynamically calculate and transmit the transportation path of the object to be transported by using the shortest path algorithm in the pre-created weighted directed graph according to the target interaction station and the current interaction platform where the object to be transported is located until the object to be transported reaches the target platform; A feeding unit, configured to feed the object to be transported into the process equipment when the object to be transported reaches the target platform.

[0015] A further technical solution thereof is as follows: Further including: A weighted directed graph construction unit, configured to construct a weighted directed graph according to the logistics line and the platform relationship; A path acquisition unit, configured to acquire the process path; A binding unit, configured to bind the process path with the corresponding interaction platform to obtain the target platform.

[0016] A further technical solution thereof is as follows: The weighted directed graph construction unit includes: A vertex determination subunit, configured to use the numbers of all interaction platforms on the logistics line as the vertices of the directed graph; An edge determination subunit, configured to establish a connection relationship between each of the interaction platforms according to the transportation direction of the transmission line, and serve as an edge of a directed graph; A weight determination subunit, configured to record the number of interaction platforms passed between each pair of the interaction platforms as the weight of the edge; A construction subunit, configured to construct a weighted directed graph according to the vertices, edges, and weights of the edges.

[0017] The beneficial effects of the present invention compared with the prior art are as follows: By querying the process path bound to the object to be transmitted, the present invention determines the target interaction platform and obtains the interaction platform where the object is currently located; using the pre-created weighted directed graph, the system dynamically calculates the transportation path using the shortest path algorithm, and adjusts the logistics route in real time according to the process sequence and actual situation to ensure that the object can reach the target platform smoothly and enter the process equipment; in this way, the system can flexibly respond to process changes, improving the flexibility, response speed, and efficiency of the production process.

[0018] The present invention will be further described below with reference to the accompanying drawings and specific embodiments. Description of the Drawings

[0019] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings in the following description are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0020] Figure 1 It is a flowchart of a transportation path planning method based on a weighted directed graph provided by an embodiment of the present invention; Figure 2 It is a sub-flowchart of a transportation path planning method based on a weighted directed graph provided by an embodiment of the present invention; Figure 3 It is a sub-flowchart of a transportation path planning method based on a weighted directed graph provided by an embodiment of the present invention; Figure 4 It is a flowchart of a transportation path planning method based on a weighted directed graph provided by another embodiment of the present invention; Figure 5 It is a schematic diagram of a weighted directed graph provided by another embodiment of the present invention; Figure 6 It is a sub-flowchart of a transportation path planning method based on a weighted directed graph provided by another embodiment of the present invention; Figure 7 It is a schematic block diagram of a transportation path planning system based on a weighted directed graph provided by an embodiment of the present invention; Figure 8Schematic block diagram of a transportation path planning system based on a weighted directed graph provided by another embodiment of the present invention; Figure 9 Schematic block diagram of a computer device provided by an embodiment of the present invention. Detailed implementation manners

[0021] The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0022] It should be understood that when used in this specification and the appended claims, the terms "comprises" and "comprising" indicate the presence of the described features, wholes, steps, operations, elements, and / or components, but do not preclude the presence or addition of one or more other features, wholes, steps, operations, elements, components, and / or their combinations.

[0023] It should also be understood that the terms used in this specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. As used in this specification of the present invention and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an", and "the" are intended to include the plural forms.

[0024] It should be further understood that the term " / and" as used in this specification of the present invention and the appended claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0025] Please refer to Figure 1 , Figure 1 Schematic flowchart of a transportation path planning method based on a weighted directed graph provided by an embodiment of the present invention. This transportation path planning method based on a weighted directed graph is applied to the production scenario of semi-finished batteries in the formation and formation section of a lithium battery production workshop in the new energy industry. By combining the shortest path algorithm and the dynamic adjustment of the process path, it can plan and optimize the logistics transportation path in real time according to the actual production situation. First, by querying the process path bound to the object to be transported, the target interaction platform is determined, and a weighted directed graph is constructed based on the relationship between the logistics line and the platform. During the transportation of the object, the system dynamically calculates the shortest path and adjusts the path in real time to cope with the influence of process sequence or process changes. This method ensures that the logistics path in the production process can flexibly respond to changes, improving the response speed and efficiency of production.

[0026] In this embodiment, the process refers to the process of manufacturing a finished battery from a semi-finished battery through processes such as normal temperature standing, high temperature standing, nail insertion, nail extraction, formation, grading, OCV, DCIR, and sorting.

[0027] The process path refers to the set of sequences for a semi-finished battery to execute processes. The paths may vary for different battery types, normal, and repair situations.

[0028] A tray refers to a container for loading semi-finished batteries. The tray is used to transport semi-finished batteries on the logistics line and manufacture batteries in process equipment. Each tray has an independent tray barcode for tracking and management.

[0029] A station refers to the basic unit of the logistics line, usually composed of sections of rollers, and each section of roller corresponds to an independent station number.

[0030] Station 1000 refers to a specific station, and the last four digits of the number are the station number.

[0031] An interactive station refers to a station on the logistics line where the electric control initiates an interaction. It is usually composed of a section of roller and a barcode scanner installed on the roller. When the tray is transported to the roller, the barcode scanner will scan the tray barcode and initiate a request to the upper system.

[0032] A weighted directed graph refers to a graph composed of a set of vertices and directed edges, where each edge has a weight. The characteristic of the graph is that the edges have directionality, that is, an edge points from one vertex to another vertex, and each edge has a related weight, usually representing the cost or distance from one point to another point.

[0033] The path algorithm refers to calculating the shortest path from one vertex to other vertices in the graph, and solving the shortest path problem in a weighted directed graph.

[0034] Figure 1 It is a schematic flow chart of the transportation path planning method based on a weighted directed graph provided by an embodiment of the present invention. As Figure 1 shown, the method includes the following steps S110 to S140.

[0035] S110. Query the process path bound to the object to be transmitted to determine the target interactive station.

[0036] In this embodiment, in a production manufacturing system, especially in highly automated industries such as battery production and automobile manufacturing, pallets undertake important logistics and process tasks. Pallets are not only transportation tools but also carry process path information of products to a certain extent. This process path describes each step of the product's processing flow during production, including all process steps it should go through and the specific interaction stations for each step. To ensure that pallets smoothly and efficiently complete the entire production process, it is necessary to accurately query and determine the process path bound to the pallet and determine the target interaction station based on the path information.

[0037] Specifically, the corresponding process path and the corresponding target interaction station can be determined by scanning the QR code on the object to be transported, i.e., the pallet.

[0038] Pallets are carriers for carrying objects (such as batteries, components, etc.) during production. The objects carried by each pallet may be bound to different process paths according to the product type and process requirements. Each process path represents a set of one or more process steps, and these steps are carried out in a specific order.

[0039] The selection of the process path is based on the production requirements of the object. For example, during battery production, the battery may need to go through a series of process steps such as high-temperature treatment, charge-discharge testing, grading, etc., and different paths correspond to different operation stations.

[0040] In the production management system, objects are bound to the specified process path before being put into production. This binding relationship not only describes which production links the object needs to go through but may also include the target stations or equipment corresponding to each process link. For example, the process path that a battery needs to go through during production may be: Pallet A - High-temperature standing - Grading - Testing; Pallet B - Grading - Charging - Testing; The process steps listed on each process path determine which interaction stations the pallet needs to go through, and the target interaction station is the final destination station of this path.

[0041] Once the pallet is loaded into the production process, the system needs to query the process path bound to the pallet in real time to ensure that the subsequent transfer meets the requirements.

[0042] The system will receive a query request, usually initiated by the scheduling or management system, to query the process path of a specific pallet or object. The system retrieves the process path bound to the object from the database or production management system based on the unique identifier of the object (such as pallet ID or object serial number). This information may include: Process path name (such as: High-temperature standing, Grading); The target interaction station for each process step; The time requirements, equipment requirements, etc. for each process step.

[0043] The system analyzes the process step in which the object to be transmitted is currently located based on the queried process path information, and determines which target interaction station the current object should go to according to the process path.

[0044] The target interaction station refers to the specific location or equipment that the object needs to reach in each process step. The core purpose of determining the target interaction station is to accurately distribute and process materials during the production process.

[0045] The process path of each object consists of a series of process steps. Each process step corresponds to one or more target interaction stations. For example, if there is a "high-temperature standing" step in the process path of a certain battery, the system will search for and determine the target interaction station corresponding to the high-temperature standing.

[0046] If there is a "formation" step in the process path, the system needs to determine the station corresponding to the formation step.

[0047] According to the process step, the system will select the target interaction station corresponding to the current step. That is to say, each step of the process path will have a clear station as the target, indicating where the tray should move. For example: High-temperature standing will correspond to station 1001; The formation step corresponds to station 1002.

[0048] S120. Obtain the interaction station where the object to be transmitted is currently located.

[0049] In this embodiment, by querying the current location of the object to be transmitted in real time, the interaction station where it is located in the production process is determined. The system scans the unique identifier or location marker of the object to obtain the current interaction station information of the object, and uses it for subsequent path planning and transportation task allocation to ensure that the object can flow smoothly to the next process step or target station according to the predetermined process.

[0050] S130. According to the target interaction station and the interaction station where the object to be transmitted is currently located, in the pre-created weighted directed graph, use the shortest path algorithm to dynamically calculate and transmit the transportation path of the object to be transmitted until the object to be transmitted reaches the target station.

[0051] In this embodiment, the weighted directed graph is used to dynamically calculate the logistics path, and the path is gradually sent to the logistics line to complete the transportation of the object.

[0052] In one embodiment, please refer to Figure 2, the above step S130 may include steps S131 to S132.

[0053] S131. Starting from the current interaction platform where the object to be transmitted is located and ending at the target interaction platform, calculate the shortest path in the weighted directed graph using the shortest path algorithm.

[0054] In this embodiment, the shortest path refers to the path with the minimum total transportation cost or distance among the paths from the current interaction platform where the object to be transmitted is located to the target interaction platform. Specifically, the shortest path takes into account the transportation cost or distance between each platform, which is represented by the weight of the edge in the weighted directed graph.

[0055] The shortest path algorithm (such as Dijkstra's algorithm or A* algorithm) calculates the path with the minimum transportation cost based on the weight values to ensure that the object can reach the target interaction platform at the minimum transportation cost or time.

[0056] In this embodiment, the system uses the shortest path algorithm to calculate the transportation path of the object based on the current interaction platform where the object to be transmitted is located and the target interaction platform.

[0057] In one embodiment, please refer to Figure 3 , the above step S131 may include steps S1311 to S1312.

[0058] S1311. Starting from the current interaction platform where the object to be transmitted is located and ending at the target interaction platform, gradually find the reachable interaction platforms of each interaction platform and record the corresponding weights to obtain a record result.

[0059] In this embodiment, the record result refers to that when calculating the shortest path, the system records the reachable paths of each interaction platform and their corresponding weight information for subsequent selection of the shortest path. The recorded results include: Path information: For each interaction platform, the system records the path information from the current interaction platform to other reachable interaction platforms. For example, from platform A, it can reach platform B, platform C, etc., and record these paths; Weight information: Each path has a corresponding weight value, which represents the transportation cost, distance, or time, etc. of the path. These weight values will be recorded and used for comparison when calculating the shortest path later. For example, the weight of the path from platform A to platform B may be 5, and the weight of the path from platform A to platform C may be 8, and the system will record these weight information; Basis for shortest path selection: After recording the weights of all reachable paths, the system compares these weights and selects the path with the smallest weight, i.e., the shortest path. The recorded result is the information of these paths, including the starting point, the ending point, and the weight of each path, which is used to dynamically adjust the transportation path of the logistics object.

[0060] In summary, the recorded result is to record the reachable paths and their weights of each interaction platform, providing a basis for the subsequent shortest path algorithm to select the optimal path.

[0061] Specifically, in a weighted directed graph, each interaction platform is a vertex, and each edge has a weight, representing the "transportation cost" or "distance" from one platform to another.

[0062] Starting from the current interaction platform where the object to be transmitted is located, the system searches for all other reachable interaction platforms, and records these paths and their corresponding weights.

[0063] For example, if starting from platform 1000, it can reach platform 1001, platform 1002, etc., and record the weight of each path (for example, the weight from platform 1000 to platform 1001 is 1, and the weight from platform 1000 to platform 1002 is 2).

[0064] S1312. Select the path with the smallest weight from the recorded result through sorting to obtain the shortest path.

[0065] In this embodiment, based on S1311, the system sorts all the found paths by weight and selects the path with the smallest weight as the shortest path.

[0066] The shortest path refers to the path with the smallest transportation cost or distance from the current interaction platform to the target interaction platform.

[0067] S132. Sequentially send each interaction platform on the shortest path to the logistics line, so that the logistics line transports the object to be transmitted to the next interaction platform according to the sent interaction platform numbers until the object to be transmitted reaches the target platform.

[0068] In this embodiment, once the shortest path is calculated, the system sequentially sends each interaction platform on this path to the logistics line. The logistics line will transport the object to be transmitted to the next interaction platform in sequence according to the sent interaction platform numbers until the target platform.

[0069] The system will pass the number of the next platform to the logistics line to ensure that the object can move forward along the shortest path.

[0070] This process will continue to be executed until the object to be transmitted finally reaches the target platform.

[0071] The purpose of this entire process is to efficiently complete the transportation of pallets on the logistics line by dynamically calculating the shortest path. By combining a weighted directed graph and a shortest path algorithm, the system can automatically generate a logistics path according to the process and process changes, and adjust the logistics process in real time, thereby improving production efficiency and flexibility. Specifically, when the target station of the object changes (such as during a process change), the system will recalculate the shortest path to ensure that the pallet can be accurately delivered to the target station according to the new process path.

[0072] In this embodiment, during the entire logistics transportation process, the pallet will first pass through an interaction station, which plays a crucial role in the logistics line. The interaction station is not only a key node for pallet identification but also the starting point for path planning. Whenever the pallet arrives at the interaction station, the barcode scanner on the logistics line will scan the barcode on the pallet to obtain relevant information. At this time, the electric control system will combine the pallet barcode with the code of the current station and obtain the next operation instruction by requesting the upper-level system.

[0073] After receiving the request, the upper-level system will search for the corresponding process information according to the pallet barcode. This process information includes each process step that the pallet should go through and finally determines the target interaction station of the pallet. According to the specific process path of the pallet, the upper-level system will assign the pallet to the corresponding target interaction station.

[0074] The system will then determine whether the number of the interaction station where the current pallet is located is the same as the number of the target interaction station. If they are the same, the pallet will directly enter the next process; if not, the system needs to calculate the shortest path from the current station to the target station. Through the shortest path algorithm, the system will calculate the optimal path from the current station to the target station.

[0075] Once the shortest path is calculated, the system will send the information of the next interaction station in the path to the logistics line control system. According to the instructions of the upper-level system, the logistics line system will start transporting the pallet to the next interaction station. The pallet will be accurately guided at each station on the way to ensure that it reaches the target station according to the predetermined route.

[0076] Finally, when the pallet arrives at the target interaction station, the logistics line will send it into the corresponding process equipment for further processing or treatment. The entire process ensures that the logistics system efficiently and accurately completes each link through real-time path planning and precise control, guaranteeing the smooth progress of the production process.

[0077] S140. When the object to be transported reaches the target station, send the object to be transported into the process equipment.

[0078] In this embodiment, when the object reaches the target interaction station, the system first confirms that the object has reached the designated station. This is usually accomplished through sensors, identification systems, or automatic monitoring devices. For example, RFID (Radio Frequency Identification) technology or barcode scanning can be used to verify whether the object has reached the target station.

[0079] The system will confirm the position where the object reaches the target station through real-time monitoring and mark it at the target station or trigger subsequent actions.

[0080] Once the object to be transferred reaches the target station, it is necessary to confirm and prepare the object through automated equipment (such as conveyor belts, robotic arms, AGV automatic guided vehicles, etc.). The automated system will detect the status of the object to ensure that it is not damaged or abnormal.

[0081] The system will check whether the object meets the conditions for entering the process equipment. For example, whether the object is in the correct placement position and whether it meets the process requirements (such as size, weight, material type, etc.).

[0082] After confirming that the object meets the conditions, the system will send the object into the process equipment through a predetermined transfer path. For example: Robotic arm or automated conveyor belt: At the target station, the object may be picked up by a robotic arm or an automated conveyor belt and placed into the process equipment. The process equipment may be a production line, assembly equipment, inspection equipment, or other types of processing equipment.

[0083] AGV (Automated Guided Vehicle): If an AGV system is used, the object to be transferred will be moved from the target station to the process equipment by an AGV and accurately placed.

[0084] This process requires high-precision control to ensure that the object can smoothly enter the process equipment without any damage or delay.

[0085] Once the object enters the process equipment, the next step is usually for the automated system to start the process handling program. For example, this may be welding, assembly, processing, testing, or other production processes.

[0086] The process equipment will automatically process the object according to the preset process flow to ensure that the object proceeds to the next step of production or processing according to the set process.

[0087] Throughout the process, the system will record the status changes of the object in real time and feedback the current process status to the central control system or monitoring platform. This includes: The time and status when the object reaches the target station; The time and status when the object enters the process equipment; The progress of the process handling and whether it proceeds smoothly.

[0088] If any abnormalities occur during the process of the object reaching the target station or entering the process equipment (such as equipment failure, object damage, etc.), the system will issue an alarm and execute a predetermined emergency handling plan. For example, the system may automatically stop the transmission, start the standby equipment, or notify the operator to intervene.

[0089] The monitoring function of the system ensures that these abnormal situations are responded to in a timely manner to avoid affecting the overall production process.

[0090] The main function of S140 is to send the object to be transported from the target station into the process equipment. The whole process relies on automation control and monitoring technologies to ensure that the object can be successfully transported without manual intervention and accurately enter the process equipment to start the subsequent production or processing process. This not only improves the efficiency but also reduces human errors and enhances the automation level and accuracy of production.

[0091] In addition, when the process corresponding to the object to be transported changes, the process path is dynamically changed according to the current process. By calculating the shortest path and reissuing the target interaction station according to the process change.

[0092] Specifically, during the tray transportation process, the process may change. Suppose the current process of the tray is OCV, and the target interaction station it is bound to is station 1005, while the target interaction station bound to the normal temperature static process is station 1003. When the tray passes through station 1000, the logistics line calculates the shortest path from the tray's process OCV to station 1005 and issues the instruction of the next node station 1001 to the logistics line. During the process of the tray being transported to station 1001, the process of the tray is manually changed to normal temperature static. When the tray reaches station 1001, the logistics line will recalculate the shortest path from station 1001 to station 1003 and issue the new target station 1003 to the logistics line. This enables the transportation path of the tray to be dynamically adjusted to adapt to the process change.

[0093] The above-mentioned transportation path planning method based on the weighted directed graph determines the target interaction station by querying the process path bound to the object to be transported and obtains the interaction station where the object is currently located; using the pre-created weighted directed graph, the system dynamically calculates the transportation path using the shortest path algorithm, and adjusts the logistics route in real time according to the process sequence and actual situation to ensure that the object can reach the target station smoothly and enter the process equipment; in this way, the system can flexibly respond to process changes and improve the flexibility, response speed and efficiency of the production process.

[0094] Figure 4 It is a schematic flow chart of a transportation path planning method based on a weighted directed graph provided by another embodiment of the present invention. As Figure 4As shown in the figure, the transportation route planning method based on a weighted directed graph in this embodiment includes steps S210 - S270. Among them, steps S240 - S270 are similar to steps S110 - S140 in the above - mentioned embodiment, and will not be elaborated here. The following will detail steps S210 - S230 added in this embodiment.

[0095] S210. Construct a weighted directed graph according to the relationship between logistics lines and platforms.

[0096] In one embodiment, please refer to Figure 6 , the above - mentioned step S210 may include steps S211~S214.

[0097] S211. Use the numbers of all interactive platforms on the logistics line as the vertices of the directed graph.

[0098] In this embodiment, first, identify all interactive platforms on the logistics line and use their numbers as the vertices in the graph. For example, platform 1000, platform 1001, platform 1002, etc. will be entered into the system as vertices of the graph. The role of each platform in the graph is similar to a "node", and subsequent path calculations will be based on these nodes.

[0099] S212. According to the transportation direction of the transmission line, establish the connection relationship between each of the interactive platforms, and use it as the edge of the directed graph.

[0100] In this embodiment, the system needs to establish the connection relationship between platforms according to the actual transportation direction of the logistics line. For example, if a pallet can directly reach platform 1001 from platform 1000, then in the weighted directed graph, there will be an edge pointing from platform 1000 to platform 1001. The directionality of this edge indicates the direction of logistics transmission.

[0101] S213. Record the number of interactive platforms passed between each pair of the interactive platforms as the weight of the edge.

[0102] In this embodiment, the system will calculate the number of other platforms that need to be passed between each pair of interactive platforms and use this number as the weight of the edge. This weight represents the "cost" or "distance" from one platform to another. For example, if there is 1 intermediate platform between platform 1000 and platform 1001, then the weight of this edge is 1. If there are 2 intermediate platforms between platform 1001 and platform 1004, the weight of the edge is 2.

[0103] S214. Construct a weighted directed graph according to the vertices, edges, and the weights of the edges.

[0104] In this embodiment, after recording the station numbers, connection relationships, and weights, the system aggregates this information and constructs a weighted directed graph of the entire logistics route. This graph will serve as the basis for subsequent path calculations and help determine the shortest path from one station to another.

[0105] S220. Obtain the process route.

[0106] In step S220, the system needs to obtain specific production process flows from the process route. For example, the normal production path of a battery may include "high-temperature standing - formation - grading - normal-temperature standing - OCV - DCIR - sorting", while the repair path may be "grading - normal-temperature standing - OCV - DCIR - sorting". These paths are predefined in the system and are used to determine the transportation destinations of the trays.

[0107] S230. Bind the process route to the corresponding interactive station to obtain the target station.

[0108] In this embodiment, the process route is bound to the last interactive station passed before entering the process route to obtain the target station.

[0109] In step S230, the process route will be bound to the last passed interactive station to determine the target station. For example, for the "normal-temperature standing" process, the target station may be station 1000; for the "grading" process, the target station may be station 1005. By binding the process route to the interactive station, the system can know which target station the tray should be transported to after completing a certain process step.

[0110] Based on these steps, the system can dynamically calculate the shortest path of the tray from the current station to the target station and adjust the logistics path in real time during actual production to ensure that the battery can be transported to each process equipment in the correct process sequence.

[0111] Through these steps, it can be ensured that the logistics system of the entire production line is both efficient and flexible, and can dynamically adjust and optimize the path according to real-time requirements.

[0112] In this embodiment, please refer to Figure 5, enter the numbers of each interaction platform on the logistics line as the vertices of the graph into the system. For example: platform 1000, platform 1001, platform 1002, etc., and establish a directed connection relationship between these platforms according to the transportation direction of the roller line, which is represented as the edges of the graph. The weight of each edge is the number of other platforms passed between the two platforms. For example, the edge weight from platform 1000 to platform 1001 is 1, and the edge weight from platform 1001 to platform 1004 is 2. In this way, by establishing the connection relationship and weights between all interaction platforms, a weighted directed graph of the entire logistics line can be obtained.

[0113] Enter the technological sequence of battery production into the system. For example, the normal production path is: high-temperature standing - formation - grading - normal-temperature standing - OCV - DCIR - sorting, and the repair path is: grading - normal-temperature standing - OCV - DCIR - sorting.

[0114] Each process is bound to the last interaction platform passed before entering the process, and these bound platforms are the target platforms of the process. For example, the target platform bound to the normal-temperature standing process is platform 1000, and the target platform bound to the grading process is platform 1005. The trays are bound accordingly according to the bound technological path and process. For example, tray A is bound to the normal path and enters the normal-temperature standing process, and tray B is bound to the repair path and enters the grading process. After each process is completed, the tray will continue to be transported to the platform bound to the next process according to the current technological path.

[0115] Suppose it is necessary to start from platform 1000 and calculate the shortest path to platform 1005. First, starting from platform 1000, find all reachable nodes and record the weight of each edge. As shown in Table 1; Table 1. All reachable nodes from platform 1000 and the weights of the edges

[0116] Next, sequentially find all reachable nodes of platform 1004, platform 1003, and platform 1001, and record their weights in the table. As shown in Tables 2 to 6: Table 2. All reachable nodes from platform 1001 and platform 1002 and the corresponding weights Table 3. All reachable nodes from platform 1004, platform 1003, and platform 1001 and the corresponding weights Table 4. All reachable nodes from platform 1004 and platform 1003 and the corresponding weights Table 5. All reachable nodes of platform 1004 and their corresponding weights Table 6. All paths from platform 1000 to platform 1005

[0117] If the target platform 1005 has been reached, no further calculation is required. Finally, all paths from platform 1000 to platform 1005 are obtained, sorted by the weights of the edges, and the shortest path is selected: platform 1000 - platform 1001 - platform 1004 - platform 1005.

[0118] On the logistics line, the pallet will be transported according to the target platform bound by the current process. When the pallet passes through the interaction platform, the bound target platform will be queried according to the current process of the pallet. For example, assume that the target platform bound by the current process of the pallet is platform 1005. When the pallet passes through platform 1000, the pallet can choose to be transported to platform 1001 or platform 1002. Query the target platform according to the process bound by the pallet, and use the shortest path algorithm to calculate the shortest path from platform 1000 to platform 1005. Through calculation, the shortest path is obtained as platform 1000 - platform 1001 - platform 1004 - platform 1005, and then the next platform, that is, platform 1001, is commanded to the logistics line. The logistics line transports the pallet to platform 1001, and repeats this process until the pallet reaches the target platform 1005 and is sent to the process equipment.

[0119] The method of this embodiment implements a path algorithm for solving the shortest path between any two vertices in a weighted directed graph. This algorithm can calculate based on the weights of each edge in the graph (i.e., transportation cost or time) to obtain the optimal path from one vertex to another.

[0120] According to the different production requirements of semi-finished batteries, different process paths are selected. The process paths may include various process flows such as normal production, repair, and testing, and are also affected by the battery type. In the logistics system, the system should dynamically generate suitable logistics paths according to these process types and the actual position of the battery for the transportation of pallets.

[0121] During the production process of semi-finished batteries, the process of the battery may be changed due to manual intervention. The system should be able to automatically identify the process change and regenerate and adjust the logistics path of the pallet according to the new process requirements to ensure that the pallet is accurately transported to the target position according to the latest process flow.

[0122] Figure 7 It is a schematic block diagram of a transportation path planning system 300 based on a weighted directed graph provided by an embodiment of the present invention. As Figure 7As shown in the figure, corresponding to the above transportation path planning method based on a weighted directed graph, the present invention also provides a transportation path planning system 300 based on a weighted directed graph. The transportation path planning system 300 based on a weighted directed graph includes units for executing the above transportation path planning method based on a weighted directed graph, and this system can be configured in a server. Specifically, please refer to Figure 7 , the transportation path planning system 300 based on a weighted directed graph includes a process path query unit 304, an acquisition unit 305, a shortest path calculation unit 306, and a feeding unit 307.

[0123] The process path query unit 304 is used to query the process path bound to the object to be transported to determine the target interaction platform; the acquisition unit 305 is used to acquire the interaction platform where the object to be transported is currently located; the shortest path calculation unit 306 is used to dynamically calculate and transmit the transportation path of the object to be transported in the pre-created weighted directed graph according to the target interaction site and the interaction platform where the object to be transported is currently located until the object to be transported reaches the target platform; the feeding unit 307 is used to, when the object to be transported reaches the target platform, feed the object to be transported into the process equipment.

[0124] In one embodiment, the shortest path calculation unit 306 includes: A calculation subunit, which is used to calculate the shortest path in the weighted directed graph with the interaction platform where the object to be transported is currently located as the starting point and the target interaction platform as the ending point using the shortest path algorithm; A transmission subunit, which is used to sequentially send each interaction platform on the shortest path to the logistics line so that the logistics line transports the object to be transported to the next interaction platform according to the sent interaction platform number until the object to be transported reaches the target platform.

[0125] In one embodiment, the calculation subunit includes: A recording module, which is used to start from the interaction platform where the object to be transported is currently located and the target interaction platform as the ending point, gradually find the reachable interaction platforms of each interaction platform and record the corresponding weights to obtain a recording result; A selection module, which is used to select the path with the smallest weight from the recording result through sorting to obtain the shortest path.

[0126] In one embodiment, the shortest path calculation unit 306 is further used to, when the process corresponding to the object to be transported changes, dynamically change the process path according to the current process, calculate the shortest path, and re-send the target interaction platform according to the process change.

[0127] Figure 8It is a schematic block diagram of a transportation path planning system 300 based on a weighted directed graph provided by another embodiment of the present invention. As Figure 8 shown, the transportation path planning system 300 based on a weighted directed graph in this embodiment adds a weighted directed graph construction unit 301, a path acquisition unit 302, and a binding unit 303 on the basis of the above embodiment.

[0128] The weighted directed graph construction unit 301 is used to construct a weighted directed graph according to the logistics line and the platform relationship; the path acquisition unit 302 is used to acquire the process path; the binding unit 303 is used to bind the process path with the corresponding interaction platform to obtain the target platform.

[0129] In one embodiment, the weighted directed graph construction unit 301 includes: A vertex determination subunit, which is used to use the numbers of all interaction platforms on the logistics line as the vertices of the directed graph; an edge determination subunit, which is used to establish the connection relationship between each of the interaction platforms according to the transportation direction of the transmission line and use it as the edge of the directed graph; a weight determination subunit, which is used to record the number of interaction platforms passed between each pair of the interaction platforms as the weight of the edge; a construction subunit, which is used to construct a weighted directed graph according to the vertices, edges, and the weights of the edges.

[0130] In one embodiment, the binding unit 303 is used to bind the process path with the last interaction platform passed before entering the process path to obtain the target platform.

[0131] It should be noted that those skilled in the art can clearly understand that the specific implementation processes of the above transportation path planning system 300 based on a weighted directed graph and each unit can refer to the corresponding descriptions in the foregoing method embodiments. For the sake of convenience and brevity of description, they will not be elaborated here.

[0132] The above transportation path planning system 300 based on a weighted directed graph can be implemented in the form of a computer program, and this computer program can run on a computer device as Figure 9 shown.

[0133] Please refer to Figure 9 , Figure 9 which is a schematic block diagram of a computer device provided by an embodiment of the present application. This computer device 500 can be a server. Among them, the server can be an independent server or a server cluster composed of multiple servers.

[0134] Refer to Figure 9, the computer device 500 includes a processor 502, a memory, and a network interface 505 connected via a system bus 501. Among them, the memory may include a non-volatile storage medium 503 and an internal memory 504.

[0135] The non-volatile storage medium 503 can store an operating system 5031 and a computer program 5032. The computer program 5032 includes program instructions that, when executed, can cause the processor 502 to execute a transportation path planning method based on a weighted directed graph.

[0136] The processor 502 is used to provide computing and control capabilities to support the operation of the entire computer device 500.

[0137] The internal memory 504 provides an environment for the operation of the computer program 5032 in the non-volatile storage medium 503. When the computer program 5032 is executed by the processor 502, it can cause the processor 502 to execute a transportation path planning method based on a weighted directed graph.

[0138] The network interface 505 is used for network communication with other devices. Those skilled in the art can understand that Figure 9 the structure shown in is only a block diagram of some structures related to the solution of this application, and does not constitute a limitation on the computer device 500 to which the solution of this application is applied. The specific computer device 500 may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0139] Among them, the processor 502 is used to run the computer program 5032 stored in the memory to implement all the steps corresponding to the transportation path planning method based on the weighted directed graph.

[0140] It should be understood that in the embodiment of this application, the processor 502 may be a central processing unit (CPU), and the processor 502 may also be other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0141] Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be completed by instructing relevant hardware through a computer program. The computer program includes program instructions, and the computer program can be stored in a storage medium, which is a computer-readable storage medium. The program instructions are executed by at least one processor in the computer system to implement the process steps of the embodiments of the above methods.

[0142] Therefore, the present invention also provides a storage medium. The storage medium can be a computer-readable storage medium. The storage medium stores a computer program, wherein when the computer program is executed by a processor, the processor executes all the steps corresponding to the transportation path planning method based on a weighted directed graph.

[0143] The storage medium can be a variety of computer-readable storage media such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a magnetic disk, or an optical disc, etc., which can store program codes.

[0144] Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be implemented by electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described according to functions in the above description. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present invention.

[0145] In several embodiments provided by the present invention, it should be understood that the disclosed systems and methods can be implemented in other ways. For example, the system embodiments described above are merely illustrative. For example, the division of each unit is only a logical function division, and there can be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed.

[0146] The steps in the methods of the embodiments of the present invention can be adjusted, combined, and deleted according to actual needs. The units in the systems of the embodiments of the present invention can be combined, divided, and deleted according to actual needs. In addition, the functional units in each embodiment of the present invention can be integrated into one processing unit, or each unit can exist physically alone, or two or more units can be integrated into one unit.

[0147] When the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a storage medium. Based on such understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a terminal, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention.

[0148] As described above, the above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present invention can easily think of various equivalent modifications or substitutions, and these modifications or substitutions should be covered within the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. A transportation path planning method based on a weighted directed graph, characterized in that: include: Query the process path bound to the object to be transferred to determine the target interactive station; Acquire the interactive station where the object to be transmitted is currently located; According to the target interactive site and the interactive station where the object to be transported is currently located, in a pre-created weighted directed graph, a transportation path of the object to be transported is dynamically calculated and transmitted using a shortest path algorithm until the object to be transported arrives at the target station; When the object to be transported arrives at the target station, the object to be transported is sent into a process device.

2. The method for transport path planning based on weighted directed graph according to claim 1, characterized in that: Before querying the process path bound to the object to be transferred to determine the target interactive station, the method further includes: Construct a weighted directed graph based on the logistics routes and platform relationships; Get the process path; The process path is bound to the corresponding interactive station to obtain a target station.

3. The method for transport path planning based on weighted directed graph according to claim 2, characterized in that: The weighted directed graph is constructed according to the logistics routes and platform relationships, including: The numbers of all interactive stations on the logistics route are used as vertices of the directed graph; According to the transportation direction of the transmission line, a connection relationship between each of the interactive stations is established and used as an edge of a directed graph; Record the number of interaction stations passed between each pair of interaction stations as the weight of the edge; A weighted directed graph is constructed according to the vertices, edges and edge weights.

4. The method for transport path planning based on weighted directed graph according to claim 2, characterized in that: The binding of the process path and the corresponding interactive station to obtain the target station includes: The process path is bound to the last interactive station passed before entering the process path to obtain a target station.

5. The method for transport path planning based on weighted directed graph according to claim 1, characterized in that: The method of dynamically calculating and transmitting the transportation path of the object to be transmitted by using the shortest path algorithm in a pre-created weighted directed graph according to the target interactive site and the interactive station where the object to be transmitted is currently located, until the object to be transmitted arrives at the target station, includes: Taking the interactive station where the object to be transmitted is currently located as the starting point and the target interactive station as the end point, the shortest path is calculated in the weighted directed graph using the shortest path algorithm; Each interactive station on the shortest path is sequentially issued to the logistics line, so that the logistics line transports the object to be transported to the next interactive station according to the issued interactive station number until the object to be transported reaches the target station.

6. The method for transport path planning based on weighted directed graph according to claim 5, characterized in that: The method of using the shortest path algorithm to calculate the shortest path in the weighted directed graph with the interactive station where the object to be transmitted is currently located as the starting point and the target interactive station as the end point includes: Taking the interactive station where the object to be transmitted is currently located as the starting point and the target interactive station as the end point, gradually searching for the reachable interactive stations of each interactive station, and recording the corresponding weights to obtain the recording results; The path with the minimum weight is selected from the record results by sorting to obtain the shortest path.

7. The method for transport path planning based on weighted directed graph according to claim 1, characterized in that: The method further comprises: dynamically calculating and transmitting the transportation path of the object to be transmitted by using the shortest path algorithm in a pre-created weighted directed graph according to the target interactive site and the interactive station where the object to be transmitted is currently located, until the object to be transmitted arrives at the target station; When the process corresponding to the object to be transmitted changes, the process path is dynamically changed according to the current process, and the target interactive station is re-issued by calculating the shortest path according to the process change.

8. A transportation path planning system based on a weighted directed graph, characterized in that: include: A process path query unit, used to query the process path bound to the object to be transferred, so as to determine the target interactive station; An acquisition unit, used for acquiring the interactive station where the object to be transmitted is currently located; a shortest path calculation unit, configured to dynamically calculate and transmit a transportation path of the object to be transmitted using a shortest path algorithm in a pre-created weighted directed graph according to the target interactive site and the interactive station where the object to be transmitted is currently located, until the object to be transmitted arrives at the target station; The feeding unit is used to feed the object to be transported into the process equipment when the object to be transported arrives at the target station.

9. The transportation path planning system based on weighted directed graph according to claim 8, characterized in that: Also includes: A weighted directed graph construction unit, used to construct a weighted directed graph based on logistics routes and platform relationships; A path acquisition unit, used for acquiring a process path; The binding unit is used to bind the process path and the corresponding interactive station to obtain a target station.

10. The transportation path planning system based on weighted directed graph according to claim 9, characterized in that: The weighted directed graph construction unit comprises: A vertex determination subunit, used for taking the numbers of all interactive stations on the logistics route as vertices of a directed graph; An edge determination subunit, used to establish connection relationships between the interactive stations according to the transportation direction of the transmission line, and use them as edges of the directed graph; A weight determination subunit, used for recording the number of interaction stations passed between each pair of interaction stations as the weight of the edge; The construction subunit is used to construct a weighted directed graph according to the vertices, edges and edge weights.

Images