Multi-floor multi-AGV intelligent scheduling and logistics management method and system
By adopting graph theory path planning, priority elevator scheduling and intelligent charging management systems in multi-story factory buildings, combined with IoT technology, the problems of low efficiency and high cost of AGV transportation are solved, and efficient, stable and flexible logistics management is achieved.
Patent Information
- Application Number
- CN202410986008.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-23
- Publication Date
- 2024-11-12
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
The prior art uses AGV to transport goods through elevators in multi-story factories, such as low efficiency, environmental impact, and high cost. The lack of unified standards leads to increased system integration difficulty and cost.
Adopting a graph theory-based path planning algorithm, an elevator scheduling method based on priority and time window, and an intelligent charging management system, combined with IoT technology, real-time monitoring and optimization of AGV paths, elevator resource allocation and charging management to ensure the efficient operation of AGV and the system is stable.
It improves the transportation efficiency and positioning accuracy of AGV, reduces operating costs, enhances the stability and reliability of the system, adapts to different factory environments and reduces the overall cost of the system.
Smart Images

Figure CN118938824A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to logistics transportation, and in particular to a multi-floor multi-AGV intelligent scheduling and logistics management method and system. Background Art
[0002] When solving the problem of using fully automated robots (AGVs) to transport goods through elevators in multi-story factories, the methods commonly used in the prior art mainly include the following:
[0003] (1) Fixed path and scheduling system: AGV moves along a preset fixed path, and the central scheduling system manages the task allocation and path selection of AGV. The scheduling system arranges the transportation tasks of AGV based on the cargo demand, AGV status (such as power, location) and elevator status.
[0004] (2) RFID or QR code navigation: RFID tags are laid on the factory floor or QR codes are printed. The AGV determines its own position and navigates by reading these tags or QR codes. This method is simple and reliable, but it requires the factory floor to be renovated and the maintenance cost may be high.
[0005] (3) Laser or visual navigation: AGV uses laser scanners or cameras to identify the surrounding environment and uses SLAM (simultaneous localization and mapping) technology to achieve autonomous navigation. This method is highly flexible and adaptable, but the technology is relatively complex and the cost is relatively high.
[0006] (4) Elevator control system integration: AGV is integrated with the elevator control system. When the AGV needs to take the elevator, it sends a request to the elevator control system through the communication protocol. The elevator control system schedules the operation of the elevator based on the AGV's request and the needs of other passengers.
[0007] (5) Charging station and automatic charging technology: A charging station is set up in the factory. When the AGV is low on power, it automatically plans a route to the charging station for charging. Wireless charging or wired charging technology is used to realize the automatic charging function of the AGV.
[0008] (6) Host computer management system: The host computer management system can centrally monitor and manage multiple AGVs and display the location, status, and task information of the AGVs in real time. The management system can also provide data analysis functions to help optimize the operating efficiency and path planning of the AGVs.
[0009] It should be noted that although these methods are commonly used in existing technologies, they often have their own limitations and challenges. For example, fixed path methods may lack flexibility and have difficulty responding to temporary changes in demand; while laser or visual navigation methods, although flexible, may be affected by environmental factors such as light changes, obstacles, etc. Therefore, in practical applications, it is necessary to select a suitable method or combine multiple methods for comprehensive application according to the specific conditions and needs of the factory.
[0010] Although the existing technology has achieved certain results in solving the problem of using fully automated robots (AGVs) to transport goods through elevators in multi-story factories, it still has some shortcomings. These shortcomings are mainly reflected in the following aspects:
[0011] (1) Efficiency issues: The AGV path planning in existing technologies may not be optimized enough, resulting in low transportation efficiency. This may be due to the high algorithm complexity, long calculation time, or lack of a global optimal solution. The elevator scheduling is not smart enough, which may cause the AGV to wait too long at the elevator entrance, affecting the overall transportation efficiency.
[0012] (2) Quality issues: The positioning and navigation accuracy of AGVs may be affected by environmental factors, such as light changes and uneven ground, leading to positioning errors and path deviations during transportation. There may also be accuracy issues in the docking of AGVs and elevators. If the docking is inaccurate, it may cause damage to the goods or AGV failure.
[0013] (3) Cost issues: The implementation costs of existing technologies may be high, including the purchase of hardware equipment, the development of software systems, and subsequent maintenance costs. This may result in a longer return on investment period for the entire system, which is not conducive to promotion and application.
[0014] The main reasons for these deficiencies include the following:
[0015] (1) Insufficient technological maturity: Current technologies may have deficiencies in algorithm optimization, navigation positioning, and equipment integration, and require further research and development and improvement.
[0016] (2) Application scenario limitations: The environment, layout and requirements of different factories vary. Existing technologies may not be able to fully adapt to all scenarios and require customized development and adjustment.
[0017] (3) Economic constraints: In some application scenarios, due to budget constraints, it may not be possible to adopt the most advanced and expensive technical solutions, resulting in limited system performance.
[0018] (4) Lack of unified standards: Currently, AGVs, elevators and other related equipment lack unified standards and specifications. Products from different manufacturers may have compatibility issues, which increases the difficulty and cost of system integration. Summary of the invention
[0019] In order to solve the defects of the above-mentioned prior art, the present invention provides a multi-floor and multi-AGV intelligent scheduling and logistics management method and system, which can comprehensively consider various factors of floors, elevators and AGVs to achieve global optimal path planning, and effectively solve the conflict and waiting problems when multiple AGVs share an elevator through priority and time window management. It realizes an intelligent charging management system, which can automatically plan the charging path and time according to the power status and transportation requirements of the AGV to ensure the continuous operation of the AGV.
[0020] To achieve the above technical objectives, the present invention adopts the following technical solutions: a multi-floor multi-AGV intelligent scheduling and logistics management method, based on a multi-floor, multi-AGV scenario, including:
[0021] Establish a path planning algorithm based on graph theory to obtain the current optimal path of the AGV from the starting point to the end point, where the current optimal path is used as the path for the AGV to transport goods;
[0022] Establish a priority and time window-based elevator scheduling method, and obtain the elevator scheduling strategy according to the transportation demand of the AGV, the current optimal path, and the current state of the elevator, wherein the transportation demand includes at least one of the following: destination floor, cargo weight, and urgency, and the scheduling strategy is used to dynamically allocate elevator resources to the AGV when the AGV executes the current optimal path;
[0023] An intelligent charging management method is established to monitor the power status of AGV in real time. When the power is lower than the set threshold, the optimal charging path of the AGV is obtained. The optimal charging path is the optimal path for the AGV to reach the nearest charging station from the current node, and the AGV is controlled to execute the optimal charging path to the nearest charging station for charging, and return to the transportation task after charging is completed.
[0024] A graph-theory based path planning algorithm includes the following sub-steps:
[0025] Construct a plant topology diagram, where floors are nodes and elevator connections between floors are edges;
[0026] Initialize the path weight, where the path weight represents the cost of the AGV from the starting point to the target point;
[0027] Calculate the shortest path from the starting point to all other nodes, and calculate the optimal path from the starting point to the end point based on the shortest path;
[0028] Dynamically adjust path weights based on real-time data;
[0029] Repeatedly calculate the shortest path and the optimal path to obtain the current optimal path.
[0030] Computing the shortest path from the starting point to all other nodes consists of the following substeps:
[0031] Initialize the shortest path estimation values of all nodes, set the starting point to 0, and other nodes to infinity, where the shortest path estimation value represents the upper bound of the shortest path weight from the starting point to a certain target point or the currently known minimum possible weight;
[0032] Create a priority queue of unvisited nodes, sorted by shortest path estimate;
[0033] Take the node with the smallest current shortest path estimate from the priority queue and mark it as visited;
[0034] For all adjacent nodes of the current node, if there is a shorter path to the adjacent node through the current node, update the shortest path estimate and the preceding node of the adjacent node, where the preceding node represents the node that the AGV passes through before reaching the current node;
[0035] Until all nodes are visited or the priority queue is empty;
[0036] Calculating the optimal path from the starting point to the end point based on the shortest path includes the following sub-steps:
[0037] Initialize the starting point to the current node and calculate the evaluation function value, which refers to the actual cost from the starting point to the current point n and the estimated cost from the current point n to the target point;
[0038] Create a first open list for storing nodes to be visited and sort them according to evaluation function values;
[0039] Take the node with the smallest evaluation function value from the first open list as the current node, and check whether it has reached the end point;
[0040] If the end point is reached, the path is backtracked and the result is returned; otherwise, the current node is marked as visited and added to the closed list;
[0041] For all neighboring nodes of the current node, if they have not been visited and can be reached through the current node with a smaller cost, calculate their evaluation function values and add them to the first open list;
[0042] Until the end is found or the first open list is empty.
[0043] An elevator scheduling method based on priority and time window includes the following sub-steps:
[0044] Real-time monitoring of elevator data, wherein the elevator data includes at least one of the following: elevator load rate, elevator operation cycle;
[0045] Receive the transportation demand of the AGV in real time, wherein the transportation demand includes at least one of the following: cargo weight and urgency;
[0046] Calculate AGV priority value based on elevator load rate, cargo weight, and urgency;
[0047] Plan idle time windows based on the elevator operation cycle and AGV arrival time;
[0048] The scheduling strategy of the elevator is obtained based on the priority value and the idle time window, and the elevator is allocated to the AGV according to the scheduling strategy.
[0049] Calculating the AGV priority value includes the following sub-steps:
[0050] Determine the priority factors: set the transport urgency weight value according to the transport urgency of the AGV; set the cargo weight weight value according to the weight of the cargo; set the elevator load weight value according to the load rate of the elevator;
[0051] Calculate the priority value: add the transport urgency weight value, weight weight value, and elevator load weight value to obtain the AGV priority value, where priority value = transport urgency weight value * transport urgency factor + cargo weight weight value * cargo weight factor + elevator load weight value * elevator current load factor;
[0052] Planning the time window based on the elevator operation cycle and AGV arrival time includes the following sub-steps:
[0053] Collect elevator operation cycle data and AGV arrival time data. The elevator operation cycle data includes the average operation time of the elevator from one floor to another, the time required for the elevator to stop between floors and the time required for the door to open and close; the AGV arrival time data includes the time when the AGV enters the elevator waiting area and the estimated elevator ride time;
[0054] Calculate the elevator idle time window: According to the elevator operation cycle data, based on the elevator's current position and running speed, predict the time it takes for the elevator to arrive at each floor; according to the elevator's arrival time at each floor and the AGV arrival time data, determine the elevator's idle time window between each floor;
[0055] The scheduling strategy for elevators based on priority values and time windows includes the following sub-steps:
[0056] The priority values of the AGVs are sorted; according to the order results, the idle time windows of the elevators are allocated to the AGVs, wherein the AGVs ranked first will have priority in obtaining the idle time windows.
[0057] An elevator scheduling method based on priority and time window also includes: updating the elevator status and AGV status;
[0058] Updating the elevator status specifically includes the following sub-steps:
[0059] Determine whether the elevator has received an elevator request from the AGV or the passenger. If not, update the elevator status to waiting;
[0060] If an AGV or passenger issues an elevator request, the elevator status is updated to in use or in operation;
[0061] Among them, "in use" means that the elevator has received an elevator request from an AGV or a passenger, is preparing for or executing the elevator task, and records the elevator's current target floor and estimated arrival time information; if the elevator receives a new elevator request while on the way to the target floor, it is scheduled according to the priority value and idle time window;
[0062] Running means the elevator is heading to the target floor according to instructions; if the elevator encounters a fault or abnormal situation during operation, an alarm will be issued immediately and the emergency plan will be activated;
[0063] Updating the AGV status specifically includes the following sub-steps:
[0064] Determine whether the AGV has issued an elevator request. If the elevator request has been issued but it is detected that the elevator has not arrived or is not ready, the AGV status is updated to waiting for the elevator;
[0065] If a request for taking the elevator has been issued and it is detected that the elevator is ready, the AGV state is updated to enter the elevator, where entering the elevator means that the AGV begins to enter the elevator according to the current optimal path and specified speed;
[0066] Determine whether the AGV has completely entered the elevator and remains stable. If so, update the AGV status to "in elevator operation", where "in elevator operation" means that the AGV is already inside the elevator and the elevator is heading to the target floor.
[0067] Determine whether the AGV has left the elevator. If so, update the AGV status to complete the elevator ride.
[0068] An intelligent charging management method includes the following sub-steps:
[0069] Monitor the AGV power status in real time to determine whether the AGV power is lower than the set threshold;
[0070] If the AGV power level is lower than the set threshold, the optimal charging path for the AGV is calculated, and the AGV is controlled to go to the nearest charging station for charging according to the optimal charging path; after charging is completed, the AGV is controlled to return to the transportation task;
[0071] If the AGV power level is not lower than the set threshold, the AGV is controlled to continue the transportation task.
[0072] Calculating the optimal charging path for an AGV includes the following sub-steps:
[0073] Define the search area: Divide the working environment into a two-dimensional array or grid, where each grid represents a small area or node; determine the starting node and the target node, where the starting node represents the current location of the AGV and the target node represents the location of the nearest charging station;
[0074] Initialization: Create a second open list to store the nodes to be detected; create a closed list to store the nodes that have been detected; initialize the G value of the starting node to 0, and add the starting node to the second open list, where the G value represents the actual cost from the starting node to the target node;
[0075] Path search: select the node with the smallest F value from the second open list as the current node, remove it from the second open list, and add it to the closed list, where the F value represents the evaluation function value from the starting point to the end point;
[0076] Perform the following operations on all adjacent nodes of the current node: If the adjacent node is in the closed list, ignore the node; otherwise, calculate the G value from the start node to the adjacent node by adding the G value of the current node to the cost from the current node to the adjacent node; if the adjacent node is not in the second open list or the G value of the current path is less than the G value of the known path, update the parent node of the adjacent node to the current node, and update its G value and F value; if the adjacent node is not yet in the second open list, add it to the second open list; repeat this process until the target node is found or the second open list is empty;
[0077] Backtracking path: When the target node is found, start from the target node and backtrack to the starting node through the parent node pointer to form a complete path.
[0078] It also includes an integrated monitoring and management method for real-time monitoring and intelligent scheduling of AGV, elevator, and charging station equipment, which specifically includes the following steps:
[0079] IoT technology integration: connecting AGVs, elevators, and charging stations to achieve real-time data exchange between devices;
[0080] Monitoring equipment: real-time monitoring of equipment status, including monitoring of AGV location, status, power information, elevator operation status, and charging station usage;
[0081] Data analysis and visualization: collect and process real-time data, display key indicators and statistics, and provide data-driven decision support;
[0082] Alarm and fault handling mechanism: real-time monitoring of equipment failures or abnormal conditions, triggering alarms to notify relevant personnel, and executing preset fault handling measures;
[0083] Collaborative operation and intelligent scheduling: coordinate the operation of AGV, elevators, and charging stations to optimize system performance;
[0084] Repeat the monitoring, analysis and scheduling process: If a system shutdown instruction is received or an abnormal situation is detected, shut down the system integration and monitoring management system.
[0085] A multi-floor multi-AGV intelligent dispatching and logistics management system, including
[0086] A path planning module is used to execute a path planning algorithm based on graph theory to obtain the current optimal path of the AGV from the starting point to the end point, wherein the current optimal path is used as the path for the AGV to transport goods;
[0087] An elevator scheduling module, used to execute an elevator scheduling method based on priority and time window, and obtain the elevator scheduling strategy according to the transportation demand of the AGV, the current optimal path, and the current state of the elevator, wherein the transportation demand includes at least one of the following: destination floor, cargo weight, and urgency, and the scheduling strategy is used to dynamically allocate elevator resources to the AGV when the AGV executes the current optimal path;
[0088] The charging management module is used to execute an intelligent charging management method, monitor the power status of the AGV in real time, and obtain the optimal charging path of the AGV when the power is lower than the set threshold. The optimal charging path is the optimal path for the AGV to reach the nearest charging station from the current node, and the AGV is controlled to execute the optimal charging path to the nearest charging station for charging, and return to the transportation task after charging is completed;
[0089] The integrated monitoring and management module is used to execute an integrated monitoring and management method for real-time monitoring and intelligent scheduling of AGV, elevators, and charging station equipment.
[0090] In summary, the present invention has achieved the following technical effects:
[0091] The present invention aims at the path planning problem: considering the multi-layer structure of the factory building and the transportation requirements of the AGV, a path planning algorithm based on graph theory is designed, which can calculate the optimal path of the AGV from the starting point to the end point in real time; the algorithm also takes into account the waiting time of the elevator and the charging requirements of the AGV to ensure the efficiency of the entire transportation process;
[0092] The present invention aims at the elevator scheduling problem: in order to solve the conflicts and waiting problems that may occur when multiple AGVs share an elevator, an elevator scheduling strategy based on priority and time window is proposed; this strategy dynamically allocates elevator resources according to the transportation needs of AGVs and the current status of the elevators, ensuring that AGVs can enter and exit the elevators quickly and orderly;
[0093] The present invention aims at the charging management problem: in order to ensure the continuous operation of AGV, an intelligent charging management system is designed; the system can monitor the power status of AGV in real time, and when the power is lower than the set threshold, the AGV is automatically planned to go to the nearest charging station for charging; at the same time, the system can also optimize the layout and number of charging stations according to the transportation tasks and charging needs of AGV;
[0094] The present invention is highly practical and has broad application prospects; it can not only meet the needs of automated logistics in super-large multi-storey factories, but can also be applied to other similar scenarios, such as warehouses, logistics centers, airports, etc.; by implementing the solution of this patent, it can significantly improve logistics efficiency, reduce operating costs, and enhance the stability and reliability of the entire system;
[0095] The path planning efficiency of the present invention is significantly improved: the path planning algorithm in the prior art may be relatively complex and require a large amount of calculation, which limits the transportation efficiency of AGVs. The present invention achieves faster and more accurate path planning by introducing advanced algorithms and optimization technologies, significantly reducing the transportation time and waiting time of AGVs.
[0096] The elevator dispatching of the present invention is more intelligent: the existing elevator dispatching system may lack sufficient intelligence, resulting in the AGV waiting time at the elevator entrance for too long; the present invention introduces intelligent dispatching algorithms and real-time data monitoring, and can dynamically adjust the elevator dispatching strategy according to factors such as the transportation demand of the AGV, the elevator status, and the floor layout, thereby reducing the waiting time of the AGV and improving the overall transportation efficiency;
[0097] The positioning and navigation accuracy of the present invention is improved: the positioning and navigation accuracy of AGV in the prior art may be affected by environmental factors, resulting in errors during transportation; the present invention improves the positioning accuracy and stability of AGV by optimizing the navigation system and sensor technology, reduces the error rate during transportation, and ensures the safety of goods;
[0098] The system cost of the present invention is reduced: the existing technology has a high implementation cost, which may hinder its wide application; the present invention reduces the manufacturing cost and maintenance cost of the system by optimizing the hardware design and software algorithm, making the present invention more competitive in the market and conducive to promotion and application;
[0099] The present invention is green and environmentally friendly: the present invention focuses on environmental protection and encourages the use of clean energy as the power source of AGV, thereby indirectly reducing environmental pollution;
[0100] Reasons for the superiority of the present invention: Technological innovation: The present invention introduces a series of innovative algorithms and technologies, solves the bottleneck problems in the prior art, and improves the overall performance of the system; System optimization: Through comprehensive optimization of the entire system, including hardware design, software algorithms, scheduling strategies, etc., a more efficient and stable transportation process is achieved; Demand orientation: The present invention is closely combined with actual needs, conducts in-depth research on efficiency, cost, quality and other issues that customers are concerned about, and proposes practical solutions;
[0101] Through technological innovation and system optimization, the present invention overcomes the shortcomings of the existing technologies and shows significant advantages in path planning, elevator scheduling, positioning navigation, cost reduction, etc. These advantages will make the present invention have broad application prospects and market competitiveness in the field of multi-story factory automation logistics. BRIEF DESCRIPTION OF THE DRAWINGS
[0102] Figure 1 It is a system block diagram provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0103] The present invention is further described in detail below in conjunction with the accompanying drawings.
[0104] This specific embodiment is merely an explanation of the present invention and is not a limitation of the present invention. After reading this specification, those skilled in the art may make non-creative modifications to the present embodiment as needed. However, as long as they are within the scope of the claims of the present invention, they are protected by the patent law.
[0105] In the description of the present invention, it should be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside", "clockwise", "counterclockwise", "axial", "radial", "circumferential" and the like indicate orientations or positional relationships based on the orientations or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the referred device or element must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as limiting the present invention.
[0106] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of the present invention, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.
[0107] In the present invention, unless otherwise clearly specified and limited, the terms "installed", "connected", "connected", "fixed" and the like should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, it can be the internal connection of two elements or the interaction relationship between two elements. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.
[0108] In the present invention, unless otherwise clearly specified and limited, a first feature being "above" or "below" a second feature may mean that the first and second features are in direct contact, or the first and second features are in indirect contact through an intermediate medium. Moreover, a first feature being "above", "above" or "above" a second feature may mean that the first feature is directly above or obliquely above the second feature, or simply means that the first feature is higher in level than the second feature. A first feature being "below", "below" or "below" a second feature may mean that the first feature is directly below or obliquely below the second feature, or simply means that the first feature is lower in level than the second feature.
[0109] Example:
[0110] A multi-floor multi-AGV intelligent scheduling and logistics management method solves the problem of automated logistics in a super-large multi-storey factory building based on a multi-floor, multi-AGV scenario. It uses fully automated robots to take the elevator to accurately and efficiently transport goods from a designated location on the fourth floor to a designated location on the second floor. This requirement not only involves the transportation method of a single AGV on a single floor or multiple AGVs on a single floor, but also comprehensively considers complex issues such as AGV charging management, path planning, elevator scheduling, and collaborative operations between multiple floors, improving logistics efficiency, reducing operating costs, and ensuring the stable and reliable operation of the entire system.
[0111] include,
[0112] S100, establishing a path planning algorithm based on graph theory to obtain the current optimal path of the AGV from the starting point to the end point, wherein the current optimal path is used as the path for the AGV to perform cargo transportation;
[0113] S200, establishing an elevator scheduling method based on priority and time window, obtaining an elevator scheduling strategy according to the transportation demand of the AGV, the current optimal path, and the current state of the elevator, wherein the transportation demand includes at least one of the following: destination floor, cargo weight, and urgency, and the scheduling strategy is used to dynamically allocate elevator resources to the AGV when the AGV executes the current optimal path;
[0114] S300. Establish an intelligent charging management method to monitor the power status of the AGV in real time. When the power is lower than the set threshold, obtain the optimal charging path of the AGV, where the optimal charging path is the optimal path for the AGV to reach the nearest charging station from the current node, and control the AGV to execute the optimal charging path to the nearest charging station for charging, and return to the transportation task after charging is completed.
[0115] The present invention develops a more intelligent path planning algorithm to improve the operating efficiency of AGV; optimizes the elevator scheduling strategy to reduce the waiting time of AGV; improves the charging management technology to extend the working time of AGV, etc.
[0116] The present invention combines a path planning algorithm based on graph theory, an elevator scheduling method based on priority and time window, and an intelligent charging management method. The elevator factor, transportation factor, and charging factor are considered when calculating the optimal path, and the optimal path, transportation factor, and charging factor are considered when allocating elevators. They assist each other and help improve the performance and reliability of the entire system to meet the actual needs of customers.
[0117] In S100, a path planning algorithm based on graph theory includes the following sub-steps:
[0118] A100. Input data such as plant structure, elevator location, number of AGVs, and cargo transportation demand to construct a plant topology diagram, where floors are nodes and elevator connections between floors are edges.
[0119] A200. Initialize the path weight, where the path weight represents the cost of the AGV from the starting point to the target point. The cost is not just the geographical straight-line distance, but a comprehensive evaluation value after comprehensive consideration of multiple factors, including but not limited to floor layout, elevator location and waiting time, number of AGVs (automatic guided vehicles), cargo transportation demand, road conditions, traffic conditions, etc.
[0120] Among them, the initial weight is set for each edge according to factors such as the distance between floors, elevator waiting time, and AGV charging requirements. An example is given;
[0121] A300, calculate the shortest path from the starting point to all other nodes, and calculate the optimal path from the starting point to the end point based on the shortest path;
[0122] A400, dynamically adjust path weights based on real-time data;
[0123] A500. Repeat step A300 to obtain the current optimal path.
[0124] Also includes:
[0125] A600, collect historical data and real-time feedback;
[0126] A700, self-learning and optimized path planning algorithm;
[0127] A800, repeat the path planning process to adapt to new needs and conditions.
[0128] In a graph model with floors as nodes and elevators as edges, path weights are related to both nodes and edges. Specifically:
[0129] Node related:
[0130] When discussing a path from a starting point (a floor node) to an end point (another floor node), some floor nodes themselves may have characteristics that affect the weight of the path through that node. For example, if a floor node is a busy floor with a lot of AGV or human activity, the cost of passing through that floor (i.e., the path weight) may be higher.
[0131] In addition, if a floor node has a charging station, then for an AGV that needs to be charged, the path weight to reach that floor may be reduced (or at least not increased) because it can be charged.
[0132] Related to the edge:
[0133] In this model, the elevator is the edge. The weight of the edge represents the cost of passing through this edge (i.e. taking the elevator). This cost may include the waiting time of the elevator, the running time of the elevator (if different elevators have different speeds), the crowdedness of the elevator, etc.
[0134] For example, if an elevator is waiting for maintenance or is temporarily unavailable for some reason, the weight associated with this elevator edge will be very high (or even infinite, indicating that the AGV cannot pass through this edge).
[0135] Therefore, when calculating the optimal path from the starting point to the end point, the path weight is the result of comprehensive consideration of the characteristics of the nodes and edges. The algorithm will select the best combination of nodes and edges based on these weights to form the optimal path from the starting point to the end point. A node can refer to a specific point or a process point.
[0136] In the path planning algorithm based on graph theory, when floors are regarded as nodes and the way elevators connect these floors is regarded as edges, each edge (that is, each elevator connection) needs to be assigned an initial weight. This initial weight represents the initial "price" or "cost" of passing through the edge (using a specific elevator).
[0137] When setting the initial weight of each edge, the following factors are usually considered:
[0138] Elevator running time: The elevator running time between different floors may be different, depending on factors such as the height difference between the floors, the speed of the elevator, etc. The elevator running time can be directly converted into the edge weight, because longer running time usually means higher cost.
[0139] Elevator waiting time: During peak hours, elevators may be very busy, causing the AGV to wait before using the elevator. The elevator waiting time should also be included in the edge weight because it also increases the total time for the AGV to travel from the starting point to the end point.
[0140] Elevator capacity and crowding: If the elevator is full or very crowded, the AGV may need to wait for the next elevator. This crowding can be reflected by increasing the weight of the edge.
[0141] Faulty or maintenance status of elevators: If an elevator is under maintenance or broken, it may not be available. In this case, the weight of the edge associated with that elevator can be set to infinity to ensure that the routing algorithm does not choose that elevator.
[0142] Other factors: Other factors may also be considered, such as the energy consumption of the elevator, the noise level, the battery status of the AGV (if the use of the elevator has a significant impact on battery consumption), etc.
[0143] Once the factors to be considered are determined, a weight or cost can be assigned to each factor and combined to form the initial weight of each edge. This initial weight can be a linear combination of the weights of these factors or a nonlinear one, depending on the specific application scenario and requirements.
[0144] In the path planning algorithm, these initial weights will be used to calculate the shortest or optimal path from the starting point to the end point. Then, based on real-time data (such as the real-time status of the elevator, the power level of the AGV, etc.), the algorithm can dynamically adjust these weights to reflect the current operating status of the system.
[0145] Furthermore, calculating the shortest path from the starting point to all other nodes includes the following sub-steps:
[0146] A311. Initialize the shortest path estimates of all nodes, set the starting point to 0, and other nodes to infinity, where the shortest path estimate represents the upper bound of the shortest path weight from the starting point to a target point or the currently known minimum possible weight, specifically, the upper bound of the shortest path weight from the source vertex s (starting point) to a vertex v in the graph or the currently known minimum possible weight. In other words, it is the possible length of the shortest path from s to v that we know based on the current information;
[0147] A312. Create a priority queue of unvisited nodes, sorted by shortest path estimate;
[0148] A313. Take the node with the smallest current shortest path estimate from the priority queue and mark it as visited;
[0149] A314. For all the adjacent nodes of the current node, if there is a shorter path to the adjacent node through the current node, update the shortest path estimate and the predecessor node of the adjacent node, where the predecessor node represents the node that the AGV passed before reaching the current node, specifically, the node that the AGV passed before reaching the current node on the shortest path found. In the process of constructing the shortest path tree or graph, in order to track and reconstruct the complete path from the starting point to any node, the predecessor node information of each node will be recorded;
[0150] A315. Repeat steps A313 and A314 until all nodes are visited or the priority queue is empty.
[0151] as well as,
[0152] Calculating the optimal path from the starting point to the end point based on the shortest path includes the following sub-steps:
[0153] A321. Initialize the starting point as the current node, and calculate the evaluation function value according to the evaluation function, where the evaluation function is f(n)=g(n)+h(n), where g(n) is the actual cost from the starting point to the current node n, h(n) is the estimated cost of the shortest path from the current node n to the end point, and f(n) is the evaluation function value from the starting point to the end point;
[0154] A322. Create a first open list for storing nodes to be visited and sort them according to evaluation function values;
[0155] A323, taking the node with the smallest evaluation function value from the first open list as the current node, and checking whether the end point has been reached;
[0156] A324. If the end point is reached, the path is backtracked and the result is returned; otherwise, the current node is marked as visited and added to the closed list;
[0157] A325. For all neighboring nodes of the current node, if they have not been visited and can be reached through the current node with a smaller cost, calculate their evaluation function values and add them to the first open list;
[0158] A326. Repeat steps A323 to A325 until the end point is found or the first open list is empty.
[0159] Specifically, the evaluation function value (usually expressed as f(n) or f^(n)) is an estimate of the expected cost of going from the initial state (or node) to the target state (or node) through a specific state (or node) n in the path search algorithm. It combines the actual cost of reaching the current state n and the estimated cost from the current state n to the target state.
[0160] The evaluation function value f(n) can generally be decomposed into two parts:
[0161] g(n): The actual cost from the initial state (or node) to the current state (or node) n. This value is known and represents the cost or expense spent so far. In the Dijkstra algorithm, g(n) usually represents the shortest known distance from the starting point to the current node; in the A* algorithm, g(n) also represents the actual cost from the starting point to the current node.
[0162] h(n): The estimated cost from the current state (or node) n to the target state (or node), usually called a heuristic function. This value is an estimate used to guide the direction of the search. A good heuristic function should be able to estimate the cost from the current node to the target node as accurately as possible so that the search algorithm can find the optimal solution faster. In the A algorithm, h(n) must satisfy the condition h(n)≤h(n), where h*(n) is the actual minimum cost from node n to the target node.
[0163] Therefore, the valuation function value f(n) can be expressed as:
[0164] f(n)=g(n)+h(n)
[0165] This formula reflects the two main components of the valuation function: the actual cost g(n) and the estimated cost h(n). The smaller the valuation function value f(n), it usually means that the expected cost of the path from the initial state to the target state through state n is lower, so these states will be given priority in the search process.
[0166] In the search algorithm, whenever a new state is reached, the evaluation function value f(n) of the state is calculated. Among all the states to be processed, the algorithm will select the state with the smallest f(n) value to expand in order to find the optimal path from the initial state to the target state as quickly as possible. If the f(n) values of multiple states are the same, a selection can be made based on g(n) or other heuristic information.
[0167] In path search algorithms, such as Dijkstra algorithm, A* algorithm, etc., when the algorithm finds the shortest path or the best path from the starting point to the end point, it usually needs to go through a process to "backtrack" or "rebuild" the path. This process is called "path backtracing".
[0168] The backtracking path is to start from the found end point and gradually return to the starting point based on the previous node information stored in each node, so as to build a complete path. In this process, we keep checking the previous nodes of the current node until we reach the starting point.
[0169] During the execution of the algorithm, each node usually stores a pointer or reference to its predecessor node. When the algorithm finds the end point, it can start from the end point and trace back to the starting point step by step by looking at the predecessor node information of each node, thus constructing a complete path from the starting point to the end point.
[0170] The specific steps are as follows:
[0171] Start from the end.
[0172] Check the predecessor node information of the destination to determine the node passed before reaching the destination on the shortest path or optimal path found (i.e., the predecessor node).
[0173] Add the predecessor node to the path.
[0174] Repeat steps 2 and 3, continuing to look at the predecessor node of the predecessor node until you reach the starting point.
[0175] At this point, a complete path from the start point to the end point has been constructed.
[0176] This process utilizes the previous node information saved by the algorithm during the search process, so that the shortest path or the optimal path can be reconstructed efficiently. In the path search algorithm, backtracking the path is an important step, which enables the algorithm to output or display the found path.
[0177] In this embodiment, the shortest path algorithm (Dijkstra algorithm) is used to calculate the shortest path from the starting point to all other nodes, and the heuristic search algorithm (A* algorithm) is used to calculate the optimal path from the starting point to the end point based on the shortest path. After that, the shortest path algorithm and the heuristic search algorithm are integrated. In practical applications, the Dijkstra algorithm and the A* algorithm can be used in combination. First, the Dijkstra algorithm is used to calculate the shortest path from the starting point to all other nodes as the initial evaluation function value of the A* algorithm, especially the initial estimate of h(n). Subsequently, the heuristic search capability of the A* algorithm is used to dynamically adjust the path weight in real-time data and find the current optimal path.
[0178] Dynamically adjusting path weights based on real-time data in the A400 is a multi-step process that is often used to achieve flexibility in path planning algorithms to adapt to real-time changing conditions. The following is a basic step-by-step description:
[0179] Define the weight factors:
[0180] First, determine which real-time data will affect the path selection and define the weight for each factor. For example, factors such as elevator waiting time, AGV battery level, and cargo transportation priority can all be part of the weight.
[0181] Data Collection:
[0182] Design and deploy systems to collect this data in real time, for example, elevator waiting time from the elevator control system, power consumption from the AGV management system, and cargo transportation priority from the task management system.
[0183] Normalize data:
[0184] Since different data may have different ranges and units, they need to be normalized to a uniform range (e.g. 0 to 1). This helps maintain fairness when comparing different factors.
[0185] Dynamic weight calculation:
[0186] Based on the real-time data collected, dynamic weights are calculated for each factor. This can be achieved through simple mathematical formulas or more complex algorithms. For example, the longer the elevator wait time, the higher its weight may be; the lower the AGV battery, the higher its weight may also be.
[0187] Combination weight:
[0188] Combine the weights of all factors to form a total weighted value. This can be achieved by a simple weighted average, weighted sum, or other algorithms. Note that the weights should be combined in a way that reflects the relative importance of different factors.
[0189] Path planning:
[0190] Use path planning algorithms combined with real-time weights (such as Dijkstra, A*, Floyd-Warshall, etc.) to calculate the best path. These algorithms take into account the weights of the nodes to choose the shortest or optimal path.
[0191] Real-time updates:
[0192] The path planning algorithm should be able to update in real time to reflect the changes in real-time data. When new real-time data arrives, the weights are recalculated and the path is updated.
[0193] Monitoring and Feedback:
[0194] Monitor the performance of the path planning algorithm and adjust the weight calculation method and path planning strategy as needed. Collect user feedback and system performance data to optimize the algorithm and improve its adaptability and efficiency.
[0195] Exception handling:
[0196] In some cases, real-time data may be abnormal or not as expected. In these cases, an exception handling mechanism needs to be designed to ensure the stability and reliability of the path planning algorithm. For example, when the AGV power data is abnormal, a default power value can be set or other paths that do not depend on power can be selected.
[0197] Scalability:
[0198] The path weight adjustment system should be designed to be scalable, taking into account the possibility of adding new factors or changing requirements in the future. This can be achieved by using modular design, configurable weight calculation methods, and other flexible strategies.
[0199] Real-time data refers to information that changes over time and directly affects the quality and efficiency of path planning. These real-time data include but are not limited to the following aspects:
[0200] (1) Elevator status: the real-time location of the elevator, the waiting time of the elevator (i.e., the time required from the request to the elevator arriving at the specified floor), the current load of the elevator (whether it is fully loaded or idle), and the maintenance or fault status of the elevator;
[0201] (2) AGV status: the real-time location of the AGV, the remaining power of the AGV, whether the current task load of the AGV is transporting goods, and the maintenance or fault status of the AGV;
[0202] (3) Cargo transportation requirements: the origin and destination of the cargo, the priority of the cargo, and the size and weight of the cargo; the size and weight of the cargo will affect the selection of AGVs and the transportation path;
[0203] (4) Floor traffic conditions: real-time passenger flow and cargo volume on each floor; high passenger flow may affect the AGV's travel speed, and real-time cargo volume may affect the elevator's waiting time;
[0204] (5) Environmental information: real-time distance between floors, which may change due to temporary obstacles or maintenance work; obstacles on the AGV's path, such as other vehicles, maintenance tools, and temporarily stacked goods.
[0205] The collection of real-time data can be achieved in many ways, such as using sensors, RFID (radio frequency identification) technology, GPS (global positioning system) positioning, video surveillance, IoT devices, and real-time feedback from AGV and elevator control systems. These real-time data provide dynamic and real-time inputs for the path planning algorithm, enabling the algorithm to adjust and optimize the path planning according to actual conditions, thereby achieving more efficient and safer cargo transportation.
[0206] In A600's collection of historical data and real-time feedback, historical data and real-time feedback are key information for optimizing algorithms and improving system performance. Historical data refers to data collected and stored over a period of time in the past, which records the system's past performance and status.
[0207] Historical data includes:
[0208] (1) Path planning results: the path planning results executed in the past, including the starting point, destination, planned path, path length, required time, etc.;
[0209] (2) Execution efficiency: the execution efficiency of path planning, such as the average time for AGV to complete a task, the average waiting time for an elevator, etc.
[0210] (3) Resource usage: such as AGV power consumption, elevator usage frequency, etc.
[0211] (4) Abnormal conditions: abnormal conditions that occur during system operation, such as AGV failure, elevator maintenance, etc.
[0212] (5) Environmental factors: such as the flow of people on a floor, the amount of goods, traffic conditions, etc. The changes in these data over time can also be used as historical data for analysis.
[0213] By analyzing historical data, we can understand the operating rules and potential problems of the system and provide a basis for optimizing algorithms and strategies. For example, if we find that the waiting time for elevators is long during a certain period of time, we can consider increasing the number of elevators or adjusting the elevator dispatching strategy.
[0214] Real-time feedback refers to the information generated by the system in real time during operation, which can be used immediately to adjust and optimize the current path planning.
[0215] Real-time feedback includes:
[0216] (1) Real-time status of AGV and elevator: such as position, speed, power, load, etc.
[0217] (2) Real-time traffic conditions: such as the flow of people, cargo, obstacles, etc. on each floor;
[0218] (3) Real-time task requirements: such as new cargo transportation requests, changes in task priorities, etc.
[0219] (4) Abnormal situations: such as AGV failure, elevator failure or maintenance, etc.
[0220] Real-time feedback is critical to intelligent path planning algorithms because it allows the algorithm to dynamically adjust the path planning based on the current actual situation to adapt to the changing environment and task requirements. For example, if an elevator fails, the algorithm can immediately adjust the path planning and use other available elevators to transport goods. Similarly, if the flow of people on a certain floor suddenly increases, the algorithm can adjust the AGV's travel speed and path to avoid congestion and delays.
[0221] This paper proposes an intelligent path planning algorithm based on a multi-story plant structure. The algorithm comprehensively considers multiple factors such as floor layout, elevator location, number of AGVs, and cargo transportation demand, and calculates the optimal transportation path through an optimization algorithm. The algorithm not only considers the shortest distance of the path, but also considers the waiting time of the elevator and the charging demand of the AGV, thereby achieving global optimal path planning.
[0222] In terms of specific implementation, the algorithm uses the shortest path algorithm and heuristic search algorithm in graph theory, constructs a topological structure diagram of the plant, and dynamically adjusts the path weight according to real-time data to finally obtain the optimal path. In addition, the algorithm also has the ability of self-learning and optimization, and can continuously optimize path planning based on historical data and real-time feedback to improve the system's adaptability and robustness.
[0223] S200 A method for elevator scheduling based on priority and time window includes the following sub-steps:
[0224] B100, initialize the elevator dispatching system;
[0225] B200, real-time monitoring of elevator data, wherein the elevator data includes at least one of the following: elevator load rate, elevator operation cycle; the elevator data also includes elevator status, including idle, running, and fully loaded;
[0226] B300, receiving the transportation demand of the AGV in real time, wherein the transportation demand includes at least one of the following: cargo weight and urgency;
[0227] B400, calculate the AGV priority value based on the elevator load rate, cargo weight, and urgency;
[0228] B500, plan idle time windows according to the elevator operation cycle and AGV arrival time to avoid elevator congestion and long waiting time;
[0229] B600, based on the priority value and the idle time window, obtain the elevator scheduling strategy, and allocate the elevator to the AGV according to the scheduling strategy, so as to realize the dynamic allocation of elevator resources to the AGV.
[0230] In the intelligent elevator dispatching system, calculating the priority for AGV is a key step, which directly determines the allocation efficiency of elevator resources and the smoothness of logistics transportation.
[0231] B400 calculates the AGV priority value including the following sub-steps:
[0232] B401. Determine the priority factor: set the transport urgency weight value according to the transport urgency of the AGV; set the cargo weight weight value according to the weight of the cargo; set the elevator load weight value according to the load rate of the elevator;
[0233] Among them, transportation urgency: According to the nature and requirements of the task, the transportation urgency of AGV is divided into different levels, such as urgent, general, non-urgent, etc. A weight value can be set for each level, for example, 3 for urgent tasks, 2 for general tasks, and 1 for non-urgent tasks.
[0234] Cargo weight: Cargo weight has a direct impact on the load capacity and operating efficiency of the elevator. Different weight values can be set according to the weight of the cargo, for example, cargo with a weight exceeding a certain threshold is given a higher weight.
[0235] Elevator load rate: The current load of the elevator reflects the remaining carrying capacity and operating efficiency of the elevator. The weight value can be set according to the elevator load rate (current load / maximum load). For example, the higher the load rate, the lower the weight value.
[0236] B402. Calculate the priority value: add the weighted sum of the transport urgency weight value, weight weight value, and elevator load weight value to obtain the AGV priority value, where priority value = transport urgency weight value * transport urgency factor + cargo weight value * cargo weight factor + elevator load weight value * elevator current load factor. Factors specifically refer to various parameters or variables that affect scheduling decisions. These factors can be quantified and used to calculate priority values, thereby determining the scheduling order of AGVs.
[0237] Assume that the transportation urgency of AGV1 is urgent, the weight value is 3, and the cargo weight is 500kg. Assume that the weight value of cargo above 500kg is 2, and the current load rate of the elevator is 30%, the weight value can be set to 0.7 because the load rate is low. For example, the priority value of AGV1 = 3*1+2*1+0.7*1 = 5.7. Among them, the factor is selected as 1. In actual applications, these values will be set according to actual conditions.
[0238] Specifically:
[0239] Transport urgency factor (assumed to be 1): This is usually set according to the nature and requirements of the task, such as urgent, general, non-urgent, etc., and each level corresponds to a different value.
[0240] Cargo weight factor (assumed to be 1): This is usually set based on the weight of the cargo, and cargo above a certain threshold may receive a higher weight.
[0241] Elevator load factor (assumed to be 1): This is usually set based on the current load factor of the elevator. The higher the load factor, the lower the factor value may be.
[0242] B403, Sorting and Scheduling: Sort the priority values of all AGVs. Sort by priority value from high to low. AGVs with higher priority values will receive higher scheduling priority. Elevator resources are allocated and scheduled according to the priority order. The AGV with the highest priority will obtain elevator resources first and be transported according to its planned time window. Other AGVs are scheduled in order of priority.
[0243] In practical applications, the setting of the priority factor and the calculation method of the weight value can be adjusted according to the specific situation. If there are multiple AGVs with the same priority value, other factors such as the waiting time of the AGV, the completion status of historical tasks, etc. can be considered for further sorting.
[0244] The dispatching system needs to update the status information of elevators and AGVs in real time to ensure the accuracy and real-time performance of priority calculation.
[0245] Through the above steps, the priority of AGV can be calculated according to factors such as transportation urgency, cargo weight, and current elevator load, and elevator resources can be dynamically allocated and scheduled according to the priority order, thereby improving the efficiency and smoothness of logistics transportation.
[0246] In the intelligent elevator dispatching system, planning the time window according to the elevator operation cycle and AGV arrival time to avoid elevator congestion and long waiting is a key step to ensure the efficient operation of the elevator.
[0247] B500 plans the time window according to the elevator operation cycle and AGV arrival time, including the following sub-steps:
[0248] B501. Collect elevator operation cycle data and AGV arrival time data. The elevator operation cycle data includes the average operation time of the elevator from one floor to another, the time required for the elevator to stop between floors and the time required for the door to open and close; the AGV arrival time data includes the time when the AGV enters the elevator waiting area and the estimated elevator ride time;
[0249] B502. Calculate the elevator idle time window: According to the elevator operation cycle data, and based on the elevator's current position and operating speed, predict the time it takes for the elevator to arrive at each floor; according to the elevator's arrival time at each floor and the AGV arrival time data, determine the elevator's idle time window between each floor; these time windows should be long enough to accommodate the entry, parking and departure of AGVs.
[0250] B600 obtains the elevator dispatching strategy based on the priority value and time window, including the following sub-steps:
[0251] The priority values of the AGVs are sorted; according to the order results, the idle time windows of the elevators are allocated to the AGVs, wherein the AGVs ranked first will have priority in obtaining the idle time windows.
[0252] To assign time windows to AGVs, first prioritize them: Sort them according to their priorities, such as transportation urgency, cargo weight, etc. Then assign time windows: assign elevator idle time windows to AGVs in order of their priorities. AGVs with higher priorities will get time windows first.
[0253] Avoid conflicts: Ensure that the assigned time window does not conflict with the scheduled times of other AGVs or elevators.
[0254] In addition, real-time adjustment and optimization are also required: Real-time monitoring: The system monitors the status of elevators and AGVs in real time, including the location of the elevator, the operating status, and the arrival time of the AGV. Dynamic adjustment: According to real-time data, the idle time window of the elevator and the allocation plan of the AGV are dynamically adjusted. For example, if the transportation task of an AGV is canceled or delayed, its time window can be reallocated to other AGVs. Optimization strategy: Adopt intelligent scheduling algorithms, such as shortest waiting time priority, minimum number of moves, etc., to optimize the operation of the elevator and the scheduling plan of the AGV to reduce waiting time and improve operation efficiency.
[0255] At the same time, data accuracy must be ensured: Ensure the accuracy of the collected elevator operation cycle and AGV arrival time data, which is the basis for planning the time window. Real-time: The system needs to update the status information of the elevator and AGV in real time to adjust and optimize the allocation of the time window in time. Flexibility: The allocation of the time window should be flexible to adapt to the uncertain factors in the operation of elevators and AGVs, such as elevator failures, AGV delays, etc.
[0256] Through the above steps, the time window can be effectively planned according to the elevator operation cycle and AGV arrival time, avoiding elevator congestion and long waiting, and improving the operation efficiency of the elevator and the smoothness of logistics transportation.
[0257] Dynamic allocation of elevator resources to AGVs can be further understood as:
[0258] (1) Collect and update data: including elevator status data, real-time monitoring of the elevator's current position, operating status such as up, down, and docking, current load, etc. AGV status data: record each AGV's current position, destination, estimated time to arrive at the elevator, cargo weight, transportation urgency, and other information.
[0259] (2) Calculate AGV priority: Set priority factors: Set different priority factors based on factors such as the urgency of AGV transportation and cargo weight. For example, the urgency of transportation can be set to high, medium, and low, corresponding to 3, 2, and 1; a higher weight can be set if the cargo weight exceeds a certain threshold.
[0260] (3) Calculate the priority value: Based on the urgency of the AGV's transportation and the weight of the cargo, the priority value of each AGV is calculated according to a certain algorithm, such as weighted summation.
[0261] (4) Plan the time window and predict the elevator arrival time: Based on the current position and operating status of the elevator, predict the time when the elevator will arrive at each floor. Determine the elevator idle time window: Based on the elevator arrival time and the expected stop time, determine the elevator idle time window between each floor.
[0262] (5) Resource allocation based on priority and time window. Sorting: Sort AGVs from high to low according to their priority values. Allocate time windows: Traverse the sorted AGV list and assign a suitable time window to each AGV. Prioritize AGVs with high priority and assign them the nearest, idle time window. If there are multiple AGVs that need to be allocated within a time window, they are allocated according to their priority.
[0263] During the allocation process, check whether there is a time window conflict, such as two AGVs being assigned to the same time window. If a conflict is found, adjust the priority of the conflicting AGV or re-plan the time window until all AGVs are successfully allocated without conflict.
[0264] (6) Real-time update and adjustment, real-time monitoring: Continuously monitor the status of elevators and AGVs, including the real-time location and operating status of elevators, and the arrival time of AGVs. Dynamic adjustment: If the transportation task of an AGV changes, such as cancellation or delay, its priority is recalculated and the time window allocation is adjusted. If an elevator fails or operates abnormally, the time window allocation of the affected AGV is suspended or replanned.
[0265] (7) Feedback and optimization, record historical data: record the results of each elevator resource allocation and the transportation status of AGV, including waiting time, transportation time, etc. Performance analysis: regularly analyze historical data to evaluate the performance and efficiency of the elevator resource allocation strategy. Strategy optimization: based on the analysis results, optimize the priority calculation algorithm, time window planning strategy, etc. to improve the utilization of elevator resources and the transportation efficiency of AGV.
[0266] Through the above steps, elevator resources can be dynamically allocated to AGVs based on priority and time windows, achieving efficient use of elevator resources and smooth logistics transportation.
[0267] Also includes: updating elevator status and AGV status;
[0268] Updating the elevator status specifically includes the following sub-steps:
[0269] Determine whether the elevator has received an elevator request from the AGV or the passenger. If not, update the elevator status to waiting;
[0270] If an AGV or passenger issues an elevator request, the elevator status is updated to in use or in operation;
[0271] Among them, "in use" means that the elevator has received an elevator request from an AGV or a passenger, is preparing for or executing the elevator task, and records the elevator's current target floor and estimated arrival time information; if the elevator receives a new elevator request while on the way to the target floor, it is scheduled according to the priority value and idle time window;
[0272] Running means that the elevator is heading to the target floor according to instructions; if the elevator encounters a fault or abnormal situation during operation, an alarm will be immediately issued and the emergency plan will be activated.
[0273] During the entire process, the system monitors the elevator's idle state, position, speed and other operating conditions in real time through sensors or Internet of Things technology.
[0274] If the elevator encounters a malfunction or abnormal situation during operation, the system will immediately sound an alarm and activate the emergency plan.
[0275] Updating the AGV status specifically includes the following sub-steps:
[0276] Determine whether the AGV has issued an elevator request. If the elevator request has been issued but it is detected that the elevator has not arrived or is not ready, the AGV status is updated to waiting for the elevator. The AGV detects the status of the elevator through built-in sensors such as infrared sensors and cameras, including whether the elevator door is open and whether the elevator is stopped.
[0277] If a request to take the elevator has been issued and the elevator is detected to be fully ready, the AGV state is updated to enter the elevator, where entering the elevator means that the AGV begins to enter the elevator according to the current optimal path and specified speed; while entering the elevator, the AGV continues to maintain awareness of the surrounding environment to ensure safety;
[0278] Determine whether the AGV has completely entered the elevator and remains stable. If so, update the AGV status to "in elevator operation", where "in elevator operation" means that the AGV is already inside the elevator and the elevator is heading to the target floor. The AGV may remain stationary or make fine adjustments as needed to ensure stability. During this period, the AGV maintains real-time communication with the elevator control system to ensure that both parties can accurately understand each other's instructions and status.
[0279] Determine whether the AGV has left the elevator. If so, update the AGV status to complete the elevator ride. After the AGV detects through the sensor that the elevator door is open and the environment is safe, it will leave the elevator along the preset path.
[0280] Through the above steps, the status of elevators and AGVs can be updated in real time and accurately, ensuring the rational allocation and efficient use of elevator resources, while improving the efficiency and safety of logistics transportation.
[0281] Aiming at the problem of limited elevator resources in multi-storey factories, the present invention designs an intelligent elevator dispatching system. The system dynamically allocates elevator resources by real-time monitoring of the elevator status and AGV transportation requirements to ensure that AGVs can enter and exit the elevator quickly and orderly.
[0282] In order to achieve intelligent scheduling, this system adopts the scheduling strategy of priority and time window. Specifically, different priorities are assigned to each AGV according to factors such as the urgency of AGV transportation, cargo weight, and current elevator load. At the same time, according to the operation cycle of the elevator and the arrival time of the AGV, a suitable time window is planned for each AGV to avoid elevator congestion and long waiting time.
[0283] S300 A smart charging management method includes the following sub-steps:
[0284] C100, real-time monitoring of AGV power status, to determine whether the AGV power is lower than the set threshold;
[0285] C200: If the AGV power level is lower than the set threshold, the optimal charging path for the AGV is calculated, and the AGV is controlled to go to the nearest charging station for charging according to the optimal charging path; after charging is completed, the AGV is controlled to return to the transportation task;
[0286] C300: If the AGV power level is not lower than the set threshold, the AGV is controlled to continue the transportation task.
[0287] When planning the AGV to go to the nearest charging station, we need to consider multiple factors such as the location and number of charging stations and the transportation needs of the AGV. The following is a detailed description of these factors:
[0288] (1) Charging station location:
[0289] Work area: Give priority to charging stations in or near the work area to ensure that the AGV can be charged in time after completing the task and avoid reduced efficiency due to long-distance travel.
[0290] Convenient transportation: The charging station should be located in a convenient location to facilitate AGV to quickly arrive, reduce the travel time before charging, and also facilitate the maintenance and replacement of charging equipment.
[0291] Safe area: The location of the charging station should be away from dangerous areas such as flammable and explosive areas to ensure the safety of the charging process.
[0292] (2) Number of charging stations:
[0293] According to the number of AGV intelligent transport vehicles and transportation needs, the number of required charging piles should be reasonably calculated. Ensure that there are enough charging stations available when the AGV needs to be charged to avoid long waiting time caused by insufficient number of charging stations.
[0294] At the same time, the distribution and layout of charging stations should also be considered to avoid situations where charging stations are too dense or too sparse in some areas, so as to ensure the operating efficiency of the entire system.
[0295] (3) AGV transportation requirements:
[0296] Real-time status: Consider the real-time power, location, and transportation tasks of the AGV, and plan its charging path and time reasonably. When the AGV has sufficient power and the task is urgent, it can be given priority to complete the transportation task before charging.
[0297] Priority: According to the priority and urgency of the AGV's transportation tasks, the charging order is reasonably scheduled to ensure that high-priority and urgent AGVs can get charging services first.
[0298] Transportation distance and path: Combine the transportation distance and path planning of the AGV to select the nearest and appropriate charging station for charging. At the same time, the distance and distribution between charging stations should also be considered to avoid excessive movement of the AGV during charging.
[0299] Taking all the above factors into consideration, we can use optimization algorithms and path planning technology to plan the best charging path and solution for AGV. This can not only improve the transportation efficiency of AGV and reduce its idle time, but also optimize the operating efficiency and cost of the entire logistics system. At the same time, with the continuous development of technology, we can also explore more advanced charging technologies and solutions, such as wireless charging and fast charging, to further improve the charging efficiency and convenience of AGV.
[0300] C200 calculates the optimal charging path for AGVs, which includes the following sub-steps:
[0301] C201. Define the search area: Divide the working environment into a two-dimensional array or grid, where each grid represents a small area or node; determine the starting node and the target node, where the starting node represents the current location of the AGV and the target node represents the location of the nearest charging station;
[0302] C202, initialization: create a second open list for storing nodes to be detected; create a closed list for storing nodes that have been detected; F(n) = G(n) + H(n), G value represents the actual cost from the starting node to the target node, H value represents the estimated cost from the starting node to the target node, and F value represents the evaluation function value from the starting point to the end point; initialize the G value of the starting node to 0, and add the starting node to the second open list;
[0303] C203, path search: select the node with the smallest F value from the second open list as the current node, remove it from the second open list, and add it to the closed list;
[0304] C204. Perform the following operations on all adjacent nodes of the current node: if the adjacent node is in the closed list, ignore the node; otherwise, calculate the G value from the start node to the adjacent node by adding the cost from the current node to the adjacent node through the G value of the current node; if the adjacent node is not in the second open list or the G value of the current path is less than the G value of the known path, update the parent node of the adjacent node to the current node, and update its G value and F value; if the adjacent node is not in the second open list, add it to the second open list; repeat this process until the target node is found or the second open list is empty;
[0305] C205, backtracking path: When the target node is found, start from the target node and backtrack to the starting node through the parent node pointer to form a complete path.
[0306] The parent node is a specific concept used to indicate how the current node is reached from the starting node during the path construction process. Specifically, when searching from the starting node and traversing its adjacent nodes, a node is selected as the current node based on some criteria (such as G value and F value). After a node is selected as the current node, for each adjacent node of the current node, if the adjacent node has not been visited (that is, it is not in the closed list), and the path cost (G value) from the starting node to the adjacent node is smaller than the known one, or the adjacent node is not in the open list, then the adjacent node will be added to the open list and the current node will be marked as the "parent node" of the adjacent node. Simply put, the "parent node" is the previous node used to indicate how to reach the current node from the starting node during the path search process.
[0307] "Parent node pointer backtracking" means that when the algorithm successfully finds the target node, it does not stop immediately, but starts from the target node and traces back to the starting node step by step according to the previously stored parent node pointer information. This process is like returning along the road you have traveled before, but in the opposite direction. Specifically, each node in the algorithm will save a pointer (or reference) to its parent node. When starting from the starting node and moving step by step along the optimal path to the target node, each visited node will save the information of its previous node (that is, the parent node). Once you reach the target node, you can start from the target node and find the node before it by looking at its parent node pointer, and then look at the parent node pointer of that node, and so on, until you trace back to the starting node. In this way, you get a complete path from the starting node to the target node.
[0308] In actual applications, you may encounter dynamic situations such as obstacles or terrain changes. At this time, the algorithm can be iterated and optimized, such as re-evaluating the F value of the path, adding new nodes to the open list, or updating the G value and H value of the node.
[0309] The present invention uses the A algorithm to evaluate the quality of the path by comprehensively considering the actual cost (G value) from the starting node to the current node and the estimated cost (H value) from the current node to the target node. It can quickly find the optimal path when the map information is known, and is applicable to situations with obstacles and various terrains. By continuously updating the G value and F value of the node, the A algorithm can flexibly handle dynamically changing environments and provide an efficient and accurate solution for AGV path planning.
[0310] In order to ensure the continuous operation of AGV, the present invention designs an intelligent charging management system. The system can monitor the power status of AGV in real time, and automatically plan the AGV to go to the nearest charging station for charging when the power is lower than the set threshold.
[0311] In the process of charging management, the system takes into account multiple factors such as the location and number of charging stations and the transportation needs of AGVs. Through the optimization algorithm, the system can reasonably plan the layout and number of charging stations, ensure that AGVs can quickly find charging stations when they need to charge, and minimize the impact of charging on transportation efficiency.
[0312] In order to realize the collaborative operation and intelligent management of the whole system, the present invention also designs an integrated monitoring and management system. The system realizes real-time monitoring and intelligent scheduling of AGV, elevators, charging stations and other equipment through the Internet of Things technology.
[0313] An integrated monitoring and management method is used for real-time monitoring and intelligent scheduling of AGV, elevator, and charging station equipment, specifically comprising the following steps:
[0314] IoT technology integration: connecting AGVs, elevators, and charging stations to achieve real-time data exchange between devices;
[0315] Monitoring equipment: real-time monitoring of equipment status, including monitoring of AGV location, status, power information, elevator operation status, and charging station usage;
[0316] Data analysis and visualization: collect and process real-time data, display key indicators and statistics, and provide data-driven decision support;
[0317] Alarm and fault handling mechanism: real-time monitoring of equipment failures or abnormal conditions, triggering alarms to notify relevant personnel, and executing preset fault handling measures;
[0318] Collaborative operation and intelligent scheduling: coordinate the operation of AGV, elevators, and charging stations to optimize system performance;
[0319] Repeat the monitoring, analysis and scheduling process: If a system shutdown instruction is received or an abnormal situation is detected, shut down the system integration and monitoring management system.
[0320] The monitoring and management system has rich data analysis and visualization functions, and can display key indicators such as the location, status, power information of AGVs, and the operating status of elevators in real time. At the same time, the system also provides an alarm and fault handling mechanism, which can promptly issue an alarm and take corresponding handling measures when equipment fails or abnormal conditions occur.
[0321] A multi-floor multi-AGV intelligent dispatching and logistics management system, including
[0322] A path planning module is used to execute a path planning algorithm based on graph theory to obtain the current optimal path of the AGV from the starting point to the end point, wherein the current optimal path is used as the path for the AGV to transport goods;
[0323] An elevator scheduling module, used to execute an elevator scheduling method based on priority and time window, and obtain the elevator scheduling strategy according to the transportation demand of the AGV, the current optimal path, and the current state of the elevator, wherein the transportation demand includes at least one of the following: destination floor, cargo weight, and urgency, and the scheduling strategy is used to dynamically allocate elevator resources to the AGV when the AGV executes the current optimal path;
[0324] The charging management module is used to execute an intelligent charging management method, monitor the power status of the AGV in real time, and obtain the optimal charging path of the AGV when the power is lower than the set threshold. The optimal charging path is the optimal path for the AGV to reach the nearest charging station from the current node, and the AGV is controlled to execute the optimal charging path to the nearest charging station for charging, and return to the transportation task after charging is completed;
[0325] The integrated monitoring and management module is used to execute an integrated monitoring and management method for real-time monitoring and intelligent scheduling of AGV, elevators, and charging station equipment.
[0326] In summary, the present invention realizes the efficient, stable and intelligent operation of the multi-storey factory building automated logistics system through technical innovations in intelligent path planning algorithms, intelligent elevator dispatching systems, AGV intelligent charging management systems, and system integration and monitoring management. These technological innovations not only improve the overall performance of the system, but also reduce operating and maintenance costs, providing strong technical support for the automated logistics of multi-storey factories.
[0327] One of the key technologies of the present invention is the development of an intelligent path planning algorithm for multi-story plant structures. The algorithm can comprehensively consider multiple factors such as floor layout, elevator location, number of AGVs, and cargo transportation requirements, and calculate the optimal transportation path through advanced optimization algorithms. This technical point is the core of ensuring the efficient and orderly operation of AGVs in multi-story plants. Another key technical point is the intelligent elevator dispatching system. The system realizes the dynamic allocation and scheduling of elevators by real-time monitoring of the status of elevators and the transportation requirements of AGVs. Through the scheduling strategy of priority and time window, it ensures that AGVs can enter and exit elevators quickly and orderly, thereby improving the transportation efficiency of the entire system. The present invention also pays attention to the endurance of AGVs and designs a set of intelligent charging management systems. The system can monitor the power status of AGVs in real time and automatically plan the charging path when the power is lower than the set threshold. This technical point ensures the continuous operation of AGVs and reduces transportation interruptions caused by insufficient power. The technical key points of the present invention also include system integration and monitoring management. Through the Internet of Things technology, real-time monitoring and intelligent scheduling of equipment such as AGVs, elevators, and charging stations are realized. This not only improves the collaborative operation capability of the system, but also enables managers to grasp the system operation status in real time and respond to possible problems in a timely manner.
[0328] During the implementation process, the present invention uses Python language to write the core control program of the AGV system, including the path planning module, elevator scheduling module and charging management module. These modules realize the automated transportation and intelligent management of AGV by working in collaboration with other hardware devices and the host computer system. At the same time, the present invention also considers the scalability and maintainability of the system, designs a clear code structure and good interface documentation, and facilitates subsequent development and maintenance work.
[0329] The innovation of this invention is not only reflected in the technical level, but also in the deep understanding and comprehensive optimization of the entire automated logistics system. It not only focuses on the path planning of AGV and elevator scheduling, but also strives to achieve collaborative operation and intelligent management of the entire system. By introducing advanced algorithms and Internet of Things technologies, real-time monitoring and intelligent scheduling of AGV, elevators, charging stations and other equipment can be achieved to ensure the efficient operation of the entire system.
[0330] The present invention also has significant advantages in terms of practicality. The complex environment and various practical needs of multi-story factories are fully considered, and flexible configuration options and scalable system architecture are designed. Whether it is the transportation demand of a single AGV on a single floor or multiple AGVs on multiple floors, whether it is the type, size or transportation time requirements of the goods, the present invention can provide a tailor-made solution to meet the personalized needs of customers.
[0331] The present invention also focuses on compatibility and integration with existing technologies. We cooperate with elevator manufacturers, AGV suppliers and other related manufacturers to jointly formulate unified standards and specifications to ensure that the system of the present invention can be seamlessly connected with existing equipment and systems, reducing customers' investment and maintenance costs.
[0332] The goal of this invention is not only to solve the current problems, but also to promote the development and innovation of automated logistics technology. Our company will continue to invest in research and development, continuously improve and optimize system performance, explore more application scenarios and market opportunities, and contribute to the progress and development of the industry.
[0333] The beneficial technical effects brought by the technical solution of the present invention are mainly reflected in the following aspects:
[0334] (1) Significantly improved efficiency: Through the intelligent path planning algorithm and elevator dispatching system, the present invention optimizes the AGV transportation path and elevator usage, significantly reduces the AGV transportation time and waiting time, and improves the transportation efficiency of the entire logistics system. This efficiency improvement is not only reflected in the operation of a single AGV, but also in the collaborative operation of the entire system, making the logistics transportation of multi-story factories more efficient and smooth.
[0335] (2) Effective cost reduction: The present invention reduces the energy consumption and raw material consumption of AGV by optimizing system design and algorithms, prolongs the service life of the equipment, and thus reduces the operating and maintenance costs of the system. In addition, by improving transportation efficiency and reducing failure rates, it also indirectly reduces the additional costs caused by human intervention and downtime maintenance.
[0336] (3) Enhanced stability and reliability: This invention improves the positioning accuracy and stability of AGV by introducing advanced navigation and positioning technology and sensor technology, and reduces the error rate during transportation. At the same time, the intelligent charging management system and fault handling mechanism ensure the continuous operation and timely response of AGV, improving the reliability and stability of the system.
[0337] (4) Improved environmental performance: This invention focuses on environmental performance and encourages the use of clean energy as the power source of AGV, reducing environmental pollution. At the same time, by optimizing transportation routes and reducing ineffective transportation, it also indirectly reduces energy consumption and carbon emissions, contributing to the development of green logistics.
[0338] (5) Expansion of application scope: The present invention has strong versatility and scalability, and can adapt to multi-storey factories of different sizes and layouts to meet the personalized needs of different customers. In addition, the present invention can also be integrated with other automation equipment and systems to achieve a wider range of automated logistics applications and promote the progress and development of the entire industry.
[0339] To sum up, the beneficial technical effects brought about by the technical solution of the present invention are significant. It not only improves the efficiency and stability of the multi-story factory automation logistics system and reduces costs, but also improves the environmental protection performance and application scope, making important contributions to the development and progress of the industry.
[0340] The above description is only a preferred embodiment of the present invention and does not limit the present invention in any form. Any simple modification, equivalent changes and modifications made to the above embodiments based on the technical essence of the present invention are within the scope of the technical solution of the present invention.
Claims
1. A multi-floor multi-AGV intelligent scheduling and logistics management method, characterized by: Based on multi-floor, multi-AGV scenarios, including: Establish a path planning algorithm based on graph theory to obtain the current optimal path of the AGV from the starting point to the end point, where the current optimal path is used as the path for the AGV to transport goods; Establish a priority and time window-based elevator scheduling method, and obtain the elevator scheduling strategy according to the transportation demand of the AGV, the current optimal path, and the current state of the elevator, wherein the transportation demand includes at least one of the following: destination floor, cargo weight, and urgency, and the scheduling strategy is used to dynamically allocate elevator resources to the AGV when the AGV executes the current optimal path; An intelligent charging management method is established to monitor the power status of AGV in real time. When the power is lower than the set threshold, the optimal charging path of the AGV is obtained. The optimal charging path is the optimal path for the AGV to reach the nearest charging station from the current node, and the AGV is controlled to execute the optimal charging path to the nearest charging station for charging, and return to the transportation task after charging is completed.
2. The multi-floor multi-AGV intelligent scheduling and logistics management method according to claim 1 is characterized by: A graph-based path planning algorithm includes the following sub-steps: Calculate the shortest path from the starting point to all other nodes, and calculate the optimal path from the starting point to the end point based on the shortest path.
3. The multi-floor multi-AGV intelligent scheduling and logistics management method according to claim 2 is characterized by: Computing the shortest path from the starting point to all other nodes consists of the following substeps: Initialize the shortest path estimation values of all nodes, set the starting point to 0, and other nodes to infinity, where the shortest path estimation value represents the upper bound of the shortest path weight from the starting point to a certain target point or the currently known minimum possible weight; the path weight represents the cost of the AGV from the starting point to the target point; Create a priority queue of unvisited nodes, sorted by shortest path estimate; Take the node with the smallest current shortest path estimate from the priority queue and mark it as visited; For all adjacent nodes of the current node, if there is a shorter path to the adjacent node through the current node, update the shortest path estimate and the preceding node of the adjacent node, where the preceding node represents the node that the AGV passes through before reaching the current node; Until all nodes are visited or the priority queue is empty; Calculating the optimal path from the starting point to the end point based on the shortest path includes the following sub-steps: Initialize the starting point as the current node and calculate the evaluation function value, which refers to the actual cost from the starting point to the current point n and the estimated cost from the current point n to the target point; Create a first open list for storing nodes to be visited and sort them according to evaluation function values; Take the node with the smallest evaluation function value from the first open list as the current node, and check whether it has reached the end point; If the end point is reached, the path is backtracked and the result is returned; otherwise, the current node is marked as visited and added to the closed list; For all neighboring nodes of the current node, if they have not been visited and can be reached through the current node with a smaller cost, calculate their evaluation function values and add them to the first open list; Until the end is found or the first open list is empty.
4. The multi-floor multi-AGV intelligent scheduling and logistics management method according to claim 1 is characterized by: An elevator scheduling method based on priority and time window includes the following sub-steps: Real-time monitoring of elevator data, wherein the elevator data includes at least one of the following: elevator load rate, elevator operation cycle; Receive the transportation demand of the AGV in real time, wherein the transportation demand includes at least one of the following: cargo weight and urgency; Calculate AGV priority value based on elevator load rate, cargo weight, and urgency; Plan idle time windows based on the elevator operation cycle and AGV arrival time; The scheduling strategy of the elevator is obtained based on the priority value and the idle time window, and the elevator is allocated to the AGV according to the scheduling strategy.
5. The multi-floor multi-AGV intelligent scheduling and logistics management method according to claim 4 is characterized by: Calculating the AGV priority value includes the following sub-steps: Determine the priority factors: set the transport urgency weight value according to the transport urgency of the AGV; set the cargo weight weight value according to the weight of the cargo; set the elevator load weight value according to the load rate of the elevator; Calculate the priority value: add the transport urgency weight value, weight weight value, and elevator load weight value to obtain the AGV priority value, where priority value = transport urgency weight value * transport urgency factor + cargo weight weight value * cargo weight factor + elevator load weight value * elevator current load factor; Planning the time window based on the elevator operation cycle and AGV arrival time includes the following sub-steps: Collect elevator operation cycle data and AGV arrival time data. The elevator operation cycle data includes the average operation time of the elevator from one floor to another, the time required for the elevator to stop between floors and the time required for the door to open and close; the AGV arrival time data includes the time when the AGV enters the elevator waiting area and the estimated elevator ride time; Calculate the elevator idle time window: According to the elevator operation cycle data, based on the elevator's current position and running speed, predict the time it takes for the elevator to arrive at each floor; according to the elevator's arrival time at each floor and the AGV arrival time data, determine the elevator's idle time window between each floor; The scheduling strategy for elevators based on priority values and time windows includes the following sub-steps: The priority values of the AGVs are sorted; according to the order results, the idle time windows of the elevators are allocated to the AGVs, wherein the AGVs ranked first will have priority in obtaining the idle time windows.
6. The multi-floor multi-AGV intelligent scheduling and logistics management method according to claim 5 is characterized by: An elevator scheduling method based on priority and time window also includes: updating the elevator status and AGV status; Updating the elevator status specifically includes the following sub-steps: Determine whether the elevator has received an elevator request from the AGV or the passenger. If not, update the elevator status to waiting; If an AGV or passenger issues an elevator request, the elevator status is updated to in use or in operation; Among them, "in use" means that the elevator has received an elevator request from an AGV or a passenger, is preparing for or executing the elevator task, and records the elevator's current target floor and estimated arrival time information; if the elevator receives a new elevator request while on the way to the target floor, it is scheduled according to the priority value and idle time window; Running means the elevator is heading to the target floor according to instructions; if the elevator encounters a fault or abnormal situation during operation, an alarm will be issued immediately and the emergency plan will be activated; Updating the AGV status specifically includes the following sub-steps: Determine whether the AGV has issued an elevator request. If the elevator request has been issued but it is detected that the elevator has not arrived or is not ready, the AGV status is updated to waiting for the elevator; If a request for taking the elevator has been issued and it is detected that the elevator is ready, the AGV state is updated to enter the elevator, where entering the elevator means that the AGV begins to enter the elevator according to the current optimal path and specified speed; Determine whether the AGV has completely entered the elevator and remains stable. If so, update the AGV status to "in elevator operation", where "in elevator operation" means that the AGV is already inside the elevator and the elevator is heading to the target floor. Determine whether the AGV has left the elevator. If so, update the AGV status to complete the elevator ride.
7. The multi-floor multi-AGV intelligent scheduling and logistics management method according to claim 1 is characterized by: An intelligent charging management method includes the following sub-steps: Monitor the AGV power status in real time to determine whether the AGV power is lower than the set threshold; If the AGV power level is lower than the set threshold, the optimal charging path for the AGV is calculated, and the AGV is controlled to go to the nearest charging station for charging according to the optimal charging path; after charging is completed, the AGV is controlled to return to the transportation task; If the AGV power level is not lower than the set threshold, the AGV is controlled to continue the transportation task.
8. The multi-floor multi-AGV intelligent scheduling and logistics management method according to claim 7 is characterized by: Calculating the optimal charging path for an AGV includes the following sub-steps: Define the search area: Divide the working environment into a two-dimensional array or grid, where each grid represents a small area or node; determine the starting node and the target node, where the starting node represents the current location of the AGV and the target node represents the location of the nearest charging station; Initialization: Create a second open list to store the nodes to be detected; create a closed list to store the nodes that have been detected; initialize the G value of the starting node to 0, and add the starting node to the second open list, where the G value represents the actual cost from the starting node to the target node; Path search: select the node with the smallest F value from the second open list as the current node, remove it from the second open list, and add it to the closed list, where the F value represents the evaluation function value from the starting point to the end point; Perform the following operations on all adjacent nodes of the current node: If the adjacent node is in the closed list, ignore the node; otherwise, calculate the G value from the start node to the adjacent node by adding the G value of the current node to the cost from the current node to the adjacent node; if the adjacent node is not in the second open list or the G value of the current path is less than the G value of the known path, update the parent node of the adjacent node to the current node, and update its G value and F value; if the adjacent node is not yet in the second open list, add it to the second open list; repeat this process until the target node is found or the second open list is empty; Backtracking path: When the target node is found, start from the target node and backtrack to the starting node through the parent node pointer to form a complete path.
9. The multi-floor multi-AGV intelligent scheduling and logistics management method according to claim 1 is characterized by: It also includes an integrated monitoring and management method for real-time monitoring and intelligent scheduling of AGV, elevator, and charging station equipment, which specifically includes the following steps: IoT technology integration: connecting AGVs, elevators, and charging stations to achieve real-time data exchange between devices; Monitoring equipment: real-time monitoring of equipment status, including monitoring of AGV location, status, power information, elevator operation status, and charging station usage; Data analysis and visualization: collect and process real-time data, display key indicators and statistics, and provide data-driven decision support; Alarm and fault handling mechanism: real-time monitoring of equipment failures or abnormal conditions, triggering alarms to notify relevant personnel, and executing preset fault handling measures; Collaborative operation and intelligent scheduling: coordinate the operation of AGV, elevators, and charging stations to optimize system performance; Repeat the monitoring, analysis and scheduling process: If a system shutdown instruction is received or an abnormal situation is detected, shut down the system integration and monitoring management system.
10. A multi-floor multi-AGV intelligent dispatching and logistics management system, characterized by: A multi-floor multi-AGV intelligent scheduling and logistics management method as described in any one of claims 1 to 9, comprising: A path planning module is used to execute a path planning algorithm based on graph theory to obtain the current optimal path of the AGV from the starting point to the end point, wherein the current optimal path is used as the path for the AGV to transport goods; An elevator scheduling module, used to execute an elevator scheduling method based on priority and time window, and obtain the elevator scheduling strategy according to the transportation demand of the AGV, the current optimal path, and the current state of the elevator, wherein the transportation demand includes at least one of the following: destination floor, cargo weight, and urgency, and the scheduling strategy is used to dynamically allocate elevator resources to the AGV when the AGV executes the current optimal path; The charging management module is used to execute an intelligent charging management method, monitor the power status of the AGV in real time, and obtain the optimal charging path of the AGV when the power is lower than the set threshold. The optimal charging path is the optimal path for the AGV to reach the nearest charging station from the current node, and the AGV is controlled to execute the optimal charging path to the nearest charging station for charging, and return to the transportation task after charging is completed; The integrated monitoring and management module is used to execute an integrated monitoring and management method for real-time monitoring and intelligent scheduling of AGV, elevators, and charging station equipment.
Citation Information
Patent Citations
Path planning method and device
CN107479557A
Method and system for predicting elevator taking duration of robot
CN112897263A
Elevator taking scheduling method of robot, robot scheduler and robot scheduling system
CN113359554A
Moving path planning method, system and equipment of mobile robot and medium
CN117234205A
Vehicle dispatching device, vehicle dispatching system, and vehicle dispatching program
JP7294500B1
Cited By
Multi-underwater-robot cooperative path planning method and system and storage medium
CN119313004A
Multi-AGV multi-elevator dynamic scheduling method and system, storage medium and product
CN119389894A
Logistics elevator cluster comprehensive scheduling method and device based on Plant Simulation
CN119409035A
AGV task allocation method and system
CN119647918A
Elevator AED intelligent scheduling method and system in complex scene, equipment and medium
CN119809280A
