Elevator energy dispatching method, device and equipment, storage medium and computer program product

Abstract

The invention discloses an elevator energy dispatching method, device and equipment, a storage medium and a computer program product, and relates to the technical field of elevator control, and the method comprises the steps that an energy complementation degree score between each ascending elevator and each descending elevator is determined based on multi-dimensional operation state information of each elevator in an elevator group; determining an optimal matching elevator pair between each ascending elevator and each descending elevator based on the energy complementation degree score; constructing a temporary energy coupling channel of the optimal matching elevator pair; and the elevator energy in the optimal matching elevator pair is dispatched through the temporary energy coupling channel. The optimal matching elevator pair can be determined on the basis of the energy complementation degree score between the ascending elevators and the descending elevators in the elevator group, and the temporary energy coupling channel of the optimal matching elevator pair is constructed to perform elevator energy scheduling, so that the problem that in the prior art, each elevator in a multi-elevator system operates independently, and the elevator energy scheduling efficiency is high is solved. And intelligent energy coordination cannot be realized, so that energy waste is caused.

Description

Technical Field

[0001] This application relates to the field of elevator control technology, and in particular to elevator energy scheduling methods, devices, equipment, storage media, and computer program products. Background Technology

[0002] With the rapid development of urban construction and the continuous increase in the number of high-rise buildings, elevators have become one of the most important vertical transportation devices in modern buildings. In order to improve transportation efficiency and alleviate passenger flow pressure, large commercial complexes, office buildings, residential communities and other places generally adopt multi-elevator group control systems.

[0003] Currently, in traditional multi-elevator systems, the operating direction, load status, and start / stop frequency of each elevator differ significantly. Typically, a building contains both heavily loaded upward-moving elevators and heavily loaded downward-moving elevators. The upward-moving elevator consumes a large amount of electrical energy to overcome gravity, while the downward-moving elevator can dissipate its gravitational potential energy or partially regenerate it into electricity through braking mechanisms. Due to the lack of an energy coordination mechanism within the system, the gravitational potential energy generated by the downward-moving elevator often cannot be directly used for the operation of other elevators, resulting in energy waste. Summary of the Invention

[0004] The main purpose of this application is to provide an elevator energy scheduling method, device, equipment, storage medium and computer program product, which aims to solve the technical problem in the prior art of multi-elevator systems where each elevator operates independently, making it impossible to achieve intelligent energy coordination and causing energy waste.

[0005] To achieve the above objectives, this application proposes an elevator energy scheduling method, the method comprising: Based on the multi-dimensional operating status information of each elevator in the elevator group, the energy complementarity score between each upward elevator and each downward elevator in the elevator group is determined. Based on the energy complementarity score, the optimal matching elevator pair between each upward elevator and each downward elevator is determined; Construct a temporary energy coupling channel for the optimally matched elevator pair; The elevator energy in the optimally matched elevator pair is scheduled through the temporary energy coupling channel.

[0006] In one embodiment, the step of determining the energy complementarity score between each upward elevator and each downward elevator in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group includes: The set of upward elevators and the set of downward elevators in the elevator group are determined based on the multi-dimensional operating status information of each elevator in the elevator group. Based on the multi-dimensional operating status information, the power supply and demand matching degree, operating time synchronization, and vertical path spatial overlap degree between each upward elevator in the upward elevator set and each downward elevator in the downward elevator set are determined. The energy complementarity score between each upward elevator and each downward elevator is determined based on the power supply and demand matching degree, the operating time synchronization degree, and the vertical path spatial overlap degree.

[0007] In one embodiment, the step of determining the power supply and demand matching degree, operating time synchronization, and vertical path spatial overlap between each upward elevator in the upward elevator set and each downward elevator in the downward elevator set based on the multi-dimensional operating status information includes: Based on the multi-dimensional operating status information, determine the net power and end time of each upward elevator in the upward elevator set, the net power and end time of each downward elevator in the downward elevator set, and the number of floors with overlapping operating paths between each upward elevator and each downward elevator. The power supply and demand matching degree between each upward elevator and each downward elevator is determined based on the net power of upward operation and the net power of downward operation. The synchronization of the running time between each upward elevator and each downward elevator is determined based on the end time of the upward operation and the end time of the downward operation. The vertical path spatial overlap between each upward elevator and each downward elevator is determined based on the number of overlapping floors in the operating path and the total number of floors in operation.

[0008] In one embodiment, the step of determining the optimal matching elevator pair between each upward elevator and each downward elevator based on the energy complementarity score includes: Construct the spatial and temporal feasibility constraints, operational safety constraints, and operational service constraints corresponding to the elevator matching bipartite graph; An elevator matching bipartite graph is constructed based on the set of upward elevators, the set of downward elevators, the energy complementarity score, and the spatial and temporal feasibility constraints. Based on the operational safety constraints and the operational service constraints, generate the elevator matching result corresponding to the elevator matching bipartite graph; Based on the elevator matching results, the optimal matching elevator pair between each upward elevator and each downward elevator is determined.

[0009] In one embodiment, the step of constructing an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, the energy complementarity score, and the spatial and temporal feasibility constraints includes: Determine whether each upward elevator in the set of upward elevators and each downward elevator in the set of downward elevators satisfy the spatial and temporal feasibility constraints; If the conditions are met, then an initial matching edge is constructed between each upward elevator and each downward elevator; The weight of the matching edge corresponding to the initial matching edge is determined based on the energy complementarity score. A feasible edge set is generated based on the initial matching edge and the matching edge weight; Construct an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, and the set of feasible edges.

[0010] In one embodiment, the step of constructing the spatial and temporal feasibility constraints corresponding to the elevator matching bipartite graph includes: The first current operating floor corresponding to each upward elevator and the second current operating floor corresponding to each downward elevator are determined based on the multi-dimensional operating status information. Based on the first currently operating floor and the second currently operating floor, construct the operational space feasibility constraints corresponding to the elevator matching bipartite graph; The upward start time of each upward elevator and the downward start time of each downward elevator are determined based on the multi-dimensional operating status information. Based on the start time of the upward operation, the start time of the downward operation, the end time of the upward operation, and the end time of the downward operation, the operation time feasibility constraints corresponding to the elevator matching bipartite graph are constructed. Based on the operational space feasibility constraints and the operational time feasibility constraints, the spatial and temporal feasibility constraints corresponding to the elevator matching bipartite graph are generated.

[0011] In one embodiment, the step of constructing the operational safety constraints corresponding to the matching bipartite graph of the elevator includes: The first real-time operating height of each upward elevator and the second real-time operating height of each downward elevator are determined based on the multi-dimensional operating status information. Determine the safe energy transfer distance between each upward elevator and each downward elevator; Based on the first real-time operating height, the second real-time operating height, and the energy transmission safety distance, the elevator matching bipartite graph is constructed to correspond to the operating safety constraints.

[0012] In one embodiment, the step of generating the elevator matching result corresponding to the elevator matching bipartite graph based on the operational safety constraints and the operational service constraints includes: Construct the edge weight matrix corresponding to the feasible edge set; Based on the edge weight matrix and the improved Hungarian algorithm, the target matching edge is determined from the feasible edge set; The target matching edge is verified based on the operational safety constraints and the operational service constraints, and the elevator matching result corresponding to the elevator matching bipartite graph is generated.

[0013] In one embodiment, the step of determining the target matching edge from the feasible edge set based on the edge weight matrix and the improved Hungarian algorithm includes: A feasible subgraph is constructed based on the feasible edge set, the feasible upward elevators and feasible downward elevators corresponding to each feasible edge in the feasible edge set; Based on the improved Hungarian algorithm, the left and right node indices in the feasible subgraph are initialized; Construct an equal subgraph based on the initialized left and right node top indices; A preset path search algorithm is used to perform a path search on the equality subgraph to obtain the path search results; The target matching edge is determined from the set of feasible edges based on the path search results.

[0014] In one embodiment, the step of determining the target matching edge from the feasible edge set based on the path search result includes: If no optimal path is found in the path search results, the top label adjustment amount is determined based on the initialized left node top label, the initialized right node top label, and the edge weight matrix. The initialized left node top label and the initialized right node top label are updated according to the top label adjustment amount; Once the update is complete, return to the step of performing a path search on the equal subgraph using a preset path search algorithm to obtain the path search results.

[0015] Furthermore, to achieve the above objectives, this application also proposes an elevator energy scheduling device, the device comprising: An energy complementarity assessment module is used to determine the energy complementarity score between each upward elevator and each downward elevator in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group. An elevator matching module is used to determine the optimal matching elevator pair between each upward elevator and each downward elevator based on the energy complementarity score. The channel construction module is used to construct a temporary energy coupling channel for the best-matched elevator pair; An energy scheduling module is used to schedule the elevator energy in the best-matched elevator pair through the temporary energy coupling channel.

[0016] In one embodiment, the energy complementarity assessment module is further configured to determine the set of upward elevators and the set of downward elevators in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group. The energy complementarity assessment module is also used to determine the power supply and demand matching degree, operating time synchronization and vertical path spatial overlap between each upward elevator in the upward elevator set and each downward elevator in the downward elevator set based on the multi-dimensional operating status information. The energy complementarity assessment module is also used to determine the energy complementarity score between each upward elevator and each downward elevator based on the power supply and demand matching degree, the operating time synchronization degree, and the vertical path spatial overlap degree.

[0017] In one embodiment, the energy complementarity assessment module is further configured to determine, based on the multi-dimensional operating status information, the net power and end time of each upward elevator in the upward elevator set, the net power and end time of each downward elevator in the downward elevator set, and the number of floors with overlapping operating paths between each upward elevator and each downward elevator. The energy complementarity assessment module is also used to determine the power supply and demand matching degree between each upward elevator and each downward elevator based on the net power of upward operation and the net power of downward operation; The energy complementarity assessment module is also used to determine the synchronization of the running time between each upward elevator and each downward elevator based on the upward running end time and the downward running end time; The energy complementarity assessment module is also used to determine the vertical path spatial overlap between each upward elevator and each downward elevator based on the number of overlapping floors in the operating path and the total number of floors in operation.

[0018] In one embodiment, the elevator matching module is further configured to construct the spatial and temporal feasibility constraints, operational safety constraints, and operational service constraints corresponding to the elevator matching bipartite graph; The elevator matching module is also used to construct an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, the energy complementarity score, and the spatial and temporal feasibility constraints. The elevator matching module is also used to generate elevator matching results corresponding to the elevator matching bipartite graph based on the operation safety constraints and the operation service constraints; The elevator matching module is further configured to determine the optimal matching elevator pair between each upward elevator and each downward elevator based on the elevator matching result.

[0019] In one embodiment, the elevator matching module is further configured to determine whether each upward elevator in the upward elevator set and each downward elevator in the downward elevator set satisfy the spatial and temporal feasibility constraints; The elevator matching module is further configured to construct an initial matching edge between each upward elevator and each downward elevator if the conditions are met. The elevator matching module is also used to determine the matching edge weight corresponding to the initial matching edge based on the energy complementarity score; The elevator matching module is also used to generate a feasible edge set based on the initial matching edge and the matching edge weight; The elevator matching module is also used to construct an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, and the set of feasible edges.

[0020] In one embodiment, the elevator matching module is further configured to construct an edge weight matrix corresponding to the feasible edge set; The elevator matching module is also used to determine the target matching edge from the feasible edge set based on the edge weight matrix and the improved Hungarian algorithm; The elevator matching module is also used to verify the target matching edge based on the operation safety constraints and the operation service constraints, and generate the elevator matching result corresponding to the elevator matching bipartite graph.

[0021] In one embodiment, the elevator matching module is further configured to construct a feasible subgraph based on the feasible edge set and the feasible up elevators and feasible down elevators corresponding to each feasible edge in the feasible edge set; The elevator matching module is also used to initialize the left node top label and right node top label in the feasible subgraph based on the improved Hungarian algorithm; The elevator matching module is also used to construct an equal subgraph based on the initialized left node top label and the initialized right node top label; The elevator matching module is also used to perform path search on the equal subgraph using a preset path search algorithm to obtain path search results; The elevator matching module is further configured to determine a target matching edge from the set of feasible edges based on the path search results.

[0022] In addition, to achieve the above objectives, this application also proposes an elevator energy scheduling device, the device comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program being configured to implement the steps of the elevator energy scheduling method as described above.

[0023] In addition, to achieve the above objectives, this application also proposes a storage medium, which is a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, it implements the steps of the elevator energy scheduling method described above.

[0024] In addition, to achieve the above objectives, this application also provides a computer program product, which includes a computer program that, when executed by a processor, implements the steps of the elevator energy scheduling method described above.

[0025] This application provides an elevator energy scheduling method. The method discloses determining the energy complementarity score between each upward and downward elevator in an elevator group based on multi-dimensional operating status information of each elevator; determining the optimal matching elevator pair between each upward and downward elevator based on the energy complementarity score; constructing a temporary energy coupling channel for the optimal matching elevator pair; and scheduling the elevator energy in the optimal matching elevator pair through the temporary energy coupling channel. Because this invention can determine the optimal matching elevator pair based on the energy complementarity score between upward and downward elevators in an elevator group and construct a temporary energy coupling channel for the optimal matching elevator pair to perform elevator energy scheduling, it solves the technical problem in existing multi-elevator systems where each elevator operates independently, making intelligent energy coordination impossible and resulting in energy waste. Attached Figure Description

[0026] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0027] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0028] Figure 1 This is a flowchart illustrating an embodiment of the elevator energy scheduling method of this application. Figure 2 This is a structural block diagram of elevator energy sharing in the elevator energy scheduling method of this application; Figure 3 This is a flowchart illustrating Embodiment 2 of the elevator energy scheduling method of this application; Figure 4 This is a flowchart illustrating Embodiment 3 of the elevator energy scheduling method of this application; Figure 5 This is a schematic diagram of the modular structure of the elevator energy dispatching device according to an embodiment of this application; Figure 6 This is a schematic diagram of the equipment structure of the hardware operating environment involved in the elevator energy scheduling method in this application embodiment.

[0029] The purpose, features, and advantages of this application will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0030] It should be understood that the specific embodiments described herein are merely illustrative of the technical solutions of this application and are not intended to limit this application.

[0031] To better understand the technical solution of this application, a detailed description will be provided below in conjunction with the accompanying drawings and specific implementation methods.

[0032] The main solution of this application embodiment is: determining the energy complementarity score between each upward elevator and each downward elevator in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group; determining the best matching elevator pair between each upward elevator and each downward elevator based on the energy complementarity score; constructing a temporary energy coupling channel for the best matching elevator pair; and scheduling the elevator energy in the best matching elevator pair through the temporary energy coupling channel.

[0033] Because each elevator in a multi-elevator system operates independently, the lack of an energy coordination mechanism means that the gravitational potential energy generated by the descending elevator cannot be directly used for the operation of other elevators, resulting in energy waste.

[0034] This application provides a solution that can determine the best matching elevator pair based on the energy complementarity score between the up and down elevators in an elevator group, and construct a temporary energy coupling channel for the best matching elevator pair to perform elevator energy scheduling. This solves the technical problem in the prior art where each elevator in a multi-elevator system operates independently, making it impossible to achieve intelligent energy coordination and causing energy waste.

[0035] It should be noted that the executing entity in this embodiment can be a computing service device with data processing, network communication, and program execution functions, such as a tablet computer, personal computer, or mobile phone; or an electronic device capable of performing the above functions, an elevator energy dispatching device, or an elevator energy dispatching system including an elevator energy dispatching device. The following description uses an elevator energy dispatching system as an example (hereinafter referred to as the system) to illustrate this embodiment and the subsequent embodiments.

[0036] Based on this, the embodiments of this application provide an elevator energy scheduling method, referring to... Figure 1 , Figure 1 This is a flowchart illustrating an embodiment of the elevator energy scheduling method of this application.

[0037] In this embodiment, the elevator energy scheduling method includes steps S10 to S40: Step S10: Determine the energy complementarity score between each upward elevator and each downward elevator in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group.

[0038] It is understood that the aforementioned elevator group can be multiple elevator systems under centralized management. In this embodiment, all elevators in the elevator group share the same scheduling platform. Each elevator has independent operating capabilities, but can achieve coordinated operation through a group control system.

[0039] It should be noted that the aforementioned multi-dimensional operating status information can refer to various parameters generated by each elevator in the elevator group during operation, such as running direction, speed, acceleration, car load, inverter net power, current position, target floor, etc. Among them, car load can be the load weight inside the elevator car, which can be collected by a weighing sensor; inverter net power can be the real-time power of the elevator inverter, used to indicate the elevator's energy consumption or power generation; current floor can be the floor where the elevator is currently located; and target floor can be the elevator's target operating floor.

[0040] It should be understood that the aforementioned upward elevator can be an elevator in the elevator group that runs upwards, which is usually in a power-consuming state and needs to consume electrical energy to overcome gravity during operation; the aforementioned downward elevator can be an elevator in the elevator group that runs downwards, which is usually in a power-generating state and can generate regenerative electrical energy during operation due to gravity.

[0041] It should be noted that the aforementioned energy complementarity score can be used as an indicator to assess the potential for energy sharing between upward and downward elevators. In this embodiment, the energy complementarity score can comprehensively consider three key dimensions: power supply and demand matching degree, operating time synchronization, and vertical path spatial overlap between the upward and downward elevators.

[0042] Further, step S10 includes: Step S101: Determine the set of upward elevators and the set of downward elevators in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group.

[0043] It is understandable that the aforementioned set of upward-moving elevators can be the set of elevators in the elevator group that are moving upwards and consuming electricity; the aforementioned set of downward-moving elevators can be the set of elevators in the elevator group that are moving downwards and generating electricity.

[0044] Step S102: Based on the multi-dimensional operating status information, determine the power supply and demand matching degree, operating time synchronization, and vertical path spatial overlap between each upward elevator in the upward elevator set and each downward elevator in the downward elevator set.

[0045] It should be noted that the aforementioned power supply and demand matching degree can be used as an indicator to assess the degree of matching between the energy consumption demand of the upward elevator and the power generation capacity of the downward elevator; the aforementioned operating time synchronization can be used as an indicator to assess whether energy transfer between two elevators is feasible in time, which can be achieved by judging whether the operating time windows of the two elevators overlap; the aforementioned vertical path spatial overlap can be used as an indicator to assess whether energy transfer between two elevators is feasible in space, which can be achieved by judging whether the operating paths of the two elevators have sufficient vertical overlap.

[0046] Specifically, step S102 includes: determining the net power and end time of each upward elevator in the upward elevator set, the net power and end time of each downward elevator in the downward elevator set, and the number of overlapping floors in the operating paths between each upward elevator and each downward elevator based on the multi-dimensional operating status information; determining the power supply and demand matching degree between each upward elevator and each downward elevator based on the net power and net power of the upward and downward elevators; determining the operating time synchronization between each upward elevator and each downward elevator based on the end time of the upward and downward elevators; and determining the vertical path spatial overlap between each upward elevator and each downward elevator based on the number of overlapping floors in the operating paths and the total number of floors in operation.

[0047] It is understood that the aforementioned net power consumption during upward operation can be the actual power consumed by the upward elevator during operation; the aforementioned upward operation completion time can be the estimated time required for the upward elevator to complete its current task (i.e., reach the target floor). Similarly, the aforementioned net power consumption during downward operation can be the actual power consumed by the downward elevator during operation; the aforementioned downward operation completion time can be the estimated time required for the downward elevator to complete its current task (i.e., reach the target floor).

[0048] It should be understood that the number of overlapping floors in the above-mentioned operating path can be the number of floors overlapping in the operating paths of the upward elevator and the downward elevator; the total number of floors in the above-mentioned operating path can be the total number of floors in the elevator operating path.

[0049] In this embodiment, for an upward elevator and downward elevator The formula for calculating the power supply and demand matching degree between the two can be:

[0050] In the formula, For upward elevator The net power, i.e., the net power of uplink operation; For downward elevator The net power, i.e., the net power of downlink operation; It is a constant (such as 0.01) used to prevent calculation errors caused by a zero denominator.

[0051] For upward elevators and downward elevator The formula for calculating the runtime synchronization between the two can be:

[0052] In the formula, For upward elevator The estimated completion time of the current task, i.e., the uplink operation completion time; For downward elevator The estimated end time for completing the current task, i.e., the end time of the downlink operation; This is the attenuation coefficient, used to control the intensity of the effect of time difference on the score.

[0053] For upward elevators and downward elevator The formula for calculating the vertical path spatial overlap between the two can be:

[0054] In the formula, For upward elevator and downward elevator The number of floors where the running paths overlap is 1. To operate the total number of floors.

[0055] Step S103: Determine the energy complementarity score between each upward elevator and each downward elevator based on the power supply and demand matching degree, the running time synchronization degree, and the vertical path spatial overlap degree.

[0056] In this embodiment, the energy complementarity score comprehensively considers three dimensions: power supply and demand matching degree, operating time synchronization, and vertical path spatial overlap between the ascending and descending elevators, to assess the energy sharing potential between them. In this embodiment, the energy complementarity score can be obtained by weighted summation of the three indicators: power supply and demand matching degree, operating time synchronization, and vertical path spatial overlap. The specific calculation formula is as follows:

[0057] In the formula, For upward elevator and downward elevator Energy complementarity score between them; , and These are all weighted coefficients, representing the importance of power supply and demand matching, operating time synchronization, and vertical path spatial overlap in the energy complementarity score, respectively. .

[0058] In practical applications, the system can collect real-time operating parameters of each elevator in the elevator group through the state sensing unit, including: direction of travel, speed, acceleration, car load, inverter net power, current floor, target floor, etc. In this embodiment, the state sensing unit can poll all elevators at a period of 10~50ms and construct the corresponding state vector of the elevator based on the collected operating parameters. For example, it can poll the state vector of the elevator for the 1st elevator. Elevator state vector construction:

[0059] In the formula, Elevator The direction of movement, and They represent elevators The running speed and acceleration, The load on the car can be obtained from a weighing sensor. This refers to the net power of the frequency converter. Indicates the current floor. Indicates the target floor.

[0060] After that, the system can traverse the operating status information of each elevator in the elevator group. The system obtains the running direction and net power status of each elevator, and classifies all elevators in the elevator group into either the upward elevator set U or the downward elevator set D based on their running direction and net power status. For each pair of upward elevators in the upward elevator set U or the downward elevator set D... and downward elevator The system can calculate the power supply and demand matching degree, running time synchronization, and vertical path spatial overlap between the two according to the above formulas, and then sum these three indicators with weights to obtain the energy complementarity score between each pair of elevators in the elevator group. .

[0061] Step S20: Determine the optimal matching elevator pair between each upward elevator and each downward elevator based on the energy complementarity score.

[0062] It should be noted that the optimal matching elevator pair mentioned above can be the pair with the highest energy complementarity score among all possible up and down elevator pairings in the elevator group. In this embodiment, the system can formalize the elevator matching problem into a bipartite graph maximum weight matching problem with multiple engineering constraints, and find a pairing from the bipartite graph through the maximum weight matching algorithm such that the total energy complementarity score of these pairings is maximized, thereby determining the optimal matching elevator pair.

[0063] In practical applications, the system can construct a bipartite graph G=(U, D, E) based on upward elevators, downward elevators, and energy complementarity scores, where U represents the set of upward elevators, D represents the set of downward elevators, and the weight of edge E is the energy complementarity score. Then, the system can apply an improved Hungarian algorithm, combined with dynamic constraints (such as spatial-temporal feasibility, safety constraints, and service constraints), to solve the maximum weight matching problem. Finally, it outputs the matching result, i.e., the matching edge with the maximum weight sum, and determines the optimal matching elevator pair based on this result. The Hungarian algorithm is a multinomial-time algorithm for solving the maximum weight matching problem in a bipartite graph. It can gradually optimize the matching result by constructing augmenting paths, ultimately finding the matching with the maximum weight sum. However, the standard Hungarian algorithm cannot directly handle dynamic constraints. Therefore, this application can optimize the traditional Hungarian algorithm by incorporating dynamic constraints, enabling it to efficiently solve the maximum weight matching problem in elevator groups while ensuring the feasibility and safety of the matching result in actual operation. In this embodiment, dynamic constraints are key factors in ensuring the feasibility and safety of the matching result in actual operation. These constraints can be dynamically verified during the matching process to ensure that the matching result is not only complementary in energy but also feasible in terms of safety and service.

[0064] Step S30: Construct a temporary energy coupling channel for the optimally matched elevator pair.

[0065] It should be noted that the aforementioned temporary energy coupling channel can be an electrical connection established between optimally matched elevator pairs to achieve direct energy transmission and sharing. In this embodiment, the temporary energy coupling channel for the optimally matched elevator pair can be established between the matched ascending and descending elevators using a controllable power conversion device (such as a bidirectional DC / DC converter or a bidirectional inverter). Through this channel, the regenerative power generated by the descending elevator can be directly transmitted to the ascending elevator, thereby achieving instant energy sharing. In practical applications, the temporary energy coupling channel is dynamically established and dismantled. This channel is only activated when there is an energy complementarity requirement between the matched elevator pairs to ensure efficient energy utilization and system flexibility.

[0066] Step S40: Schedule the elevator energy in the best-matched elevator pair through the temporary energy coupling channel.

[0067] In the specific implementation, refer to Figure 2 , Figure 2 This is a structural block diagram of elevator energy sharing in the elevator energy scheduling method of this application. Figure 2 As shown, the central controller in the system can be integrated with the underlying upward elevators, downward elevators, and electrical coupling execution layer. During elevator operation, the central controller can monitor the operating status of the elevator group in real time and determine the optimal matching elevator pairs and the coupling duration of each pair through intelligent scheduling algorithms. Then, the central controller can send a command to the bidirectional converter to close the electrical connection between the corresponding optimal matching elevator pairs, thereby establishing a temporary energy coupling channel for the optimal matching elevator pairs. At this time, the regenerative electrical energy generated by the downward elevator can be directly transmitted to the upward elevator through the bidirectional converter (i.e., the temporary energy coupling channel). During the energy transmission process, the bidirectional converter can dynamically adjust the transmission power according to real-time monitoring data, thereby ensuring the efficiency and stability of energy transmission. During the coupling duration, the regenerative electrical energy generated by the downward elevator can be transmitted to the upward elevator for use, thereby achieving direct energy sharing. Subsequently, when the coupling duration ends or conditions change (such as a change in elevator operating status), the central controller in the system can issue a command to disconnect the bidirectional converter, thereby deactivating the temporary energy coupling channel.

[0068] This embodiment provides an elevator energy scheduling method. The method discloses determining the energy complementarity score between each upward and downward elevator in an elevator group based on multi-dimensional operating status information of each elevator; determining the optimal matching elevator pair between each upward and downward elevator based on the energy complementarity score; constructing a temporary energy coupling channel for the optimal matching elevator pair; and scheduling the elevator energy in the optimal matching elevator pair through the temporary energy coupling channel. Because this embodiment can determine the optimal matching elevator pair based on the energy complementarity score between upward and downward elevators in an elevator group and construct a temporary energy coupling channel for the optimal matching elevator pair to perform elevator energy scheduling, it solves the technical problem in existing multi-elevator systems where each elevator operates independently, making intelligent energy coordination impossible and resulting in energy waste.

[0069] Based on the first embodiment of this application, in the second embodiment of this application, the content that is the same as or similar to that in Embodiment 1 above can be referred to the above description, and will not be repeated hereafter. Based on this, please refer to... Figure 3 , Figure 3 This is a flowchart illustrating Embodiment 2 of the elevator energy scheduling method of this application.

[0070] In this embodiment, step S20 includes steps S21 to S24: Step S21: Construct the spatial and temporal feasibility constraints, operational safety constraints, and operational service constraints corresponding to the elevator matching bipartite graph.

[0071] It should be noted that the aforementioned spatial and temporal feasibility constraints can be used to ensure that the matched elevator pairs can actually transmit energy in space and time, and can specifically include spatial feasibility constraints and temporal feasibility constraints.

[0072] Further, the step of constructing spatial and temporal feasibility constraints includes: determining the first current operating floor corresponding to each upward elevator and the second current operating floor corresponding to each downward elevator based on the multi-dimensional operating status information; constructing the operating spatial feasibility constraints corresponding to the elevator matching bipartite graph based on the first current operating floor and the second current operating floor; determining the upward operating start time of each upward elevator and the downward operating start time of each downward elevator based on the multi-dimensional operating status information; constructing the operating time feasibility constraints corresponding to the elevator matching bipartite graph based on the upward operating start time, the downward operating start time, the upward operating end time, and the downward operating end time; and generating the spatial and temporal feasibility constraints corresponding to the elevator matching bipartite graph based on the operating spatial feasibility constraints and the operating time feasibility constraints.

[0073] It should be understood that the first currently operating floor mentioned above can be the floor currently occupied by the upward elevator; the second currently operating floor mentioned above can be the floor currently occupied by the downward elevator. In this embodiment, the system can obtain the current floor of the elevator in real time through the elevator's floor sensor.

[0074] It should be noted that the above-mentioned operational space feasibility constraints can be used to ensure sufficient path overlap between the upward and downward elevators in the vertical direction. That is, the distance between the floors where the two elevators are located does not exceed the maximum allowable floor difference, which can be specifically expressed as:

[0075] In the formula, and They represent elevator and elevator respectively. and elevator The current floor, i.e., the first currently operating floor and the second currently operating floor. This indicates the maximum permissible floor difference.

[0076] It is understandable that the above-mentioned upward operation start time can be the time when the upward elevator starts running; the above-mentioned downward operation start time can be the time when the downward elevator starts running; correspondingly, the above-mentioned upward operation end time can be the estimated time for the upward elevator to complete its current task (i.e., reach the target floor); the above-mentioned downward operation end time can be the estimated time for the downward elevator to complete its current task (i.e., reach the target floor).

[0077] It should be noted that the aforementioned operational time feasibility constraint can be used to ensure that the operational time windows of the upward and downward elevators have sufficient overlap. This constraint ensures that energy sharing has sufficient time to proceed, and can be specifically expressed as follows:

[0078] In the formula, and They represent elevator and elevator respectively. and elevator The task start time, i.e., the start time of uplink operation and the start time of downlink operation; and They represent elevator and elevator respectively. and elevator The task completion time refers to both the uplink completion time and the downlink completion time.

[0079] Furthermore, the step of constructing operational safety constraints includes: determining the first real-time operating height of each upward elevator and the second real-time operating height of each downward elevator based on the multi-dimensional operational status information; determining the energy transmission safety distance between each upward elevator and each downward elevator; and constructing operational safety constraints corresponding to the elevator matching bipartite graph based on the first real-time operating height, the second real-time operating height, and the energy transmission safety distance.

[0080] It should be understood that the aforementioned first real-time operating height can be the actual height of the upward elevator at the current moment; the aforementioned second real-time operating height can be the actual height of the downward elevator at the current moment.

[0081] It is understandable that the aforementioned energy transmission safety distance can be the minimum vertical distance that two elevators must maintain during energy transmission, which can be determined based on the elevator's operating speed, braking distance, and safety standards.

[0082] It should be noted that the above-mentioned operational safety constraints can be used to ensure that the real-time height difference between the ascending and descending elevators is always greater than or equal to the safe energy transmission distance during energy transmission, and can be expressed as:

[0083] In the formula, and They represent elevators and elevator The real-time altitude, namely the first real-time operating altitude and the second real-time operating altitude. This indicates the safe distance for energy transmission.

[0084] In this embodiment, the aforementioned operational service constraint can be a constraint used to ensure that energy sharing of elevators does not negatively impact the passenger's riding experience. In this embodiment, the specific constraint condition of the operational service constraint can be the increase in waiting time; that is, if an elevator participates in energy sharing, the increase in the passenger's expected waiting time cannot exceed a threshold (e.g., 10 seconds). If it does, the elevator is prohibited from participating in matching. This can be expressed as:

[0085] In the formula, This indicates the increase in passenger waiting time for elevators. This indicates the maximum allowed increase in waiting time.

[0086] Step S22: Construct an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, the energy complementarity score, and the spatial and temporal feasibility constraints.

[0087] It should be noted that the aforementioned elevator matching bipartite graph can be a graph theory model used to represent the energy complementarity relationship between upward and downward elevators. This model can consist of nodes, edges, and edge weights. In this embodiment, the nodes of the elevator matching bipartite graph are divided into two disjoint sets: an upward elevator set U (containing all upward elevator nodes) and a downward elevator set D (containing all downward elevator nodes). For each pair of upward elevators... and downward elevator If they meet spatial and temporal feasibility constraints (such as complementary directions, sufficiently close floor distances, etc.), then in and Establish an edge between them Used to indicate an upward elevator and downward elevator The potential for complementary energy between them. Each edge The weighting is based on the energy complementarity score. Used to evaluate upward elevators and downward elevator The potential for energy sharing between them.

[0088] Further, step S21 includes: determining whether each upward elevator in the upward elevator set and each downward elevator in the downward elevator set satisfy the spatial and temporal feasibility constraints; if so, constructing initial matching edges between each upward elevator and each downward elevator; determining the matching edge weight corresponding to the initial matching edge based on the energy complementarity score; generating a feasible edge set based on the initial matching edge and the matching edge weight; and constructing an elevator matching bipartite graph based on the upward elevator set, the downward elevator set, and the feasible edge set.

[0089] It should be noted that the initial matching edge mentioned above can be an edge consisting of an upward elevator and a downward elevator that satisfy the spatial and temporal feasibility constraints, which can represent the potential energy sharing possibility between the two elevators.

[0090] It should be understood that the aforementioned feasible edge set can be the set of all edges in the elevator matching bipartite graph that satisfy the spatial and temporal feasibility constraints. These edges connect elevator pairs in the set of upward elevators U and the set of downward elevators D, indicating that these elevator pairs may share energy spatially and temporally. In this embodiment, for each pair of upward and downward elevators in the set of upward and downward elevators, it can be checked whether they satisfy the spatial and temporal feasibility constraints, that is, check each pair of upward elevators. and downward elevator Whether the floor difference between them is less than or equal to the maximum allowed floor difference, and for each pair of upward elevators and downward elevator Does the running time window have sufficient time overlap? If a pair of elevators ( If both conditions are met, then the elevator will move upwards. and downward elevator Establish an edge between them to obtain the initial matching edge. And the elevator will go up. and downward elevator Energy complementarity score As an edge The weights are determined accordingly. Based on this, the system can assign weights to all initial matching edges that meet the conditions. Collect feasible edge sets In the end, it is based on the upward elevator set Downward elevator collection and feasible edge set Constructing a matching bipartite graph of elevators .

[0091] Step S23: Generate elevator matching results corresponding to the elevator matching bipartite graph based on the operational safety constraints and the operational service constraints.

[0092] It should be understood that the above elevator matching result can be the set of optimal matching edges found in the bipartite graph under the premise of satisfying all constraints (spatial and temporal feasibility constraints, operational safety constraints, operational service constraints, etc.), where each matching edge represents the energy sharing relationship between a pair of upward elevators and downward elevators.

[0093] Step S24: Determine the optimal matching elevator pair between each upward elevator and each downward elevator based on the elevator matching results.

[0094] In practical applications, after constructing spatial and temporal feasibility constraints, operational safety constraints, and operational service constraints, the system can determine whether elevators in the up elevator set and down elevator set satisfy the spatial and temporal feasibility constraints, and establish edges between elevator pairs that satisfy the spatial and temporal feasibility constraints. Then, the system can apply the improved Hungarian algorithm to determine the maximum weighted matching in the elevator matching bipartite graph, that is, the matching edge with the largest weight sum in the elevator matching bipartite graph. It then determines whether each pair of up and down elevators in the maximum weighted matching satisfies the operational safety constraints and operational service constraints. If it violates the operational safety constraints and operational service constraints, the corresponding edge is removed. Remove and continue searching for a perfect match in the elevator matching bipartite graph. Otherwise, output the final elevator matching result in the elevator matching bipartite graph, which can be used to determine the best matching elevator pair.

[0095] This embodiment discloses the construction of spatial and temporal feasibility constraints, operational safety constraints, and operational service constraints corresponding to the elevator matching bipartite graph; the construction of the elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, the energy complementarity score, and the spatial and temporal feasibility constraints; the generation of elevator matching results corresponding to the elevator matching bipartite graph based on the operational safety constraints and operational service constraints; and the determination of the optimal matching elevator pair between each upward elevator and each downward elevator based on the elevator matching results. Since this embodiment can model the elevator matching problem as a constrained maximum weight bipartite graph matching problem and introduce spatial and temporal feasibility constraints, safety constraints, and service constraints, it can accurately match the optimal upward and downward elevators for energy sharing while ensuring operational safety and passenger service quality, thereby improving the energy utilization rate of the elevator system.

[0096] Based on the first and / or second embodiments of this application, in the third embodiment of this application, the content that is the same as or similar to the above embodiments can be referred to the above description, and will not be repeated hereafter. Based on this, please refer to... Figure 4 , Figure 4 This is a flowchart illustrating Embodiment 3 of the elevator energy scheduling method of this application.

[0097] In this embodiment, step S23 includes steps S231 to S233: Step S231: Construct the edge weight matrix corresponding to the feasible edge set.

[0098] It should be noted that the aforementioned edge weight matrix can be a two-dimensional array used to store the weights of each edge in the feasible edge set. In this embodiment, the system can first initialize the edge weight matrix W, whose size is... ,in and These are the sizes of the sets of upward-moving elevators and the sets of downward-moving elevators, respectively. For each pair of upward-moving elevators... and downward elevator ,if Satisfying spatial and temporal feasibility constraints, that is In the feasible edge set E, its energy complementarity score is calculated. And assign it to the corresponding position in matrix W; if If it is not in the feasible edge set E, then the corresponding position in matrix W can be set to an invalid value (e.g., (or other values ​​indicating unmatchable values), in which case the edge weight matrix It can be represented as:

[0099] Step S232: Determine the target matching edge from the feasible edge set based on the edge weight matrix and the improved Hungarian algorithm.

[0100] It should be noted that the improved Hungarian algorithm described above is an algorithm obtained by adding a dynamic constraint processing mechanism to the standard Hungarian algorithm.

[0101] It should be understood that the aforementioned target matching edge can be the optimal matching edge set determined from the feasible edge set, and the elevator pairs represented by these edges can achieve the maximum energy sharing potential under the premise of satisfying the current constraints.

[0102] Further, step S232 includes: Step S232a: Construct a feasible subgraph based on the feasible edge set and the feasible upward elevators and feasible downward elevators corresponding to each feasible edge in the feasible edge set.

[0103] It is understood that the aforementioned feasible upward elevator can be an upward elevator that satisfies the spatial and temporal feasibility constraints in the elevator matching bipartite graph; the feasible downward elevator can be a downward elevator that satisfies the spatial and temporal feasibility constraints in the elevator matching bipartite graph. In this embodiment, the system can determine the upward elevator in the elevator pair that satisfies the spatial and temporal feasibility constraints (that is, the elevator pair pointed to by the feasible edge in the feasible edge set) as a feasible upward elevator, and determine the downward elevator in it as a feasible downward elevator.

[0104] It should be noted that the aforementioned feasible subgraph can be extracted from the original elevator matching bipartite graph, containing only nodes that satisfy spatial and temporal feasibility constraints (i.e., feasible upward elevators and feasible downward elevators) and the edges between them (feasible edge set E). In this embodiment, the system can initialize an empty bipartite graph. ,in and Let these represent the sets of feasible upward elevators and the sets of feasible downward elevators, respectively. Let E represent the feasible edge set. Then, the system can iterate through the feasible edge set E and add the upward and downward elevators to it respectively. and In the middle, add the edge at the same time In this way, a feasible subgraph can be obtained. .

[0105] Step S232b: Based on the improved Hungarian algorithm, initialize the left and right node top labels in the feasible subgraph.

[0106] It should be noted that the aforementioned left node top label can be the top label of each upward elevator node i in the feasible subgraph; the aforementioned right node top label can be the top label of each downward elevator node j in the feasible subgraph. In this embodiment, the left and right node top labels can be used to assist in finding the maximum weight matching in the Hungarian algorithm.

[0107] Step S232c: Construct an equal subgraph based on the initialized left node top indices and the initialized right node top indices.

[0108] In this embodiment, for each upward elevator node in the feasible subgraph, its top label can be set to the maximum weight of all edges connected to that node; for each downward elevator node in the feasible subgraph, its top label can be set to 0, specifically represented as follows:

[0109]

[0110] In the formula, The top label of the left node, The top label of the right node. It represents the maximum weight of all edges connected to the left node (the upward elevator node).

[0111] It should be noted that the above equality subgraph can be extracted from the feasible subgraph, and only includes those that satisfy... The system can traverse each edge in the feasible subgraph. ,like Then the edge Add to the equality subgraph.

[0112] Step S232d: Use a preset path search algorithm to perform a path search on the equal subgraph to obtain the path search results.

[0113] It should be understood that the aforementioned preset path search algorithm can be an algorithm used to find augmenting paths in an equality subgraph, such as Breadth-First Search (BFS) or Depth-First Search (DFS). Correspondingly, the aforementioned path search results can be a set of augmenting paths found from the equality subgraph, where each augmenting path represents a possible matching path. In practical applications, the system can use the BFS algorithm to start from each unmatched left node (upward elevator) and search for a path to an unmatched right node (downward elevator). If an augmenting path is found, it is recorded, and the matching results are updated by adjusting the matching relationships, ultimately obtaining the path search results.

[0114] Step S232e: Determine the target matching edge from the feasible edge set based on the path search results.

[0115] It is understood that the aforementioned target matching edge can be the set of optimal matching edges determined after path search and constraint verification. In this embodiment, the target matching edge can represent the elevator pair that can achieve the maximum energy sharing potential under all constraint conditions.

[0116] Specifically, step S232e includes: if there is no optimal path in the path search results, determining the top label adjustment amount based on the initialized left node top label, the initialized right node top label, and the edge weight matrix; updating the initialized left node top label and the initialized right node top label according to the top label adjustment amount; and, if the update is complete, returning to the step of using a preset path search algorithm to perform path search on the equal subgraph to obtain the path search results.

[0117] It should be understood that the optimal path described above can be a path that starts from the unmatched left node (upward elevator) and reaches the unmatched right node (downward elevator) through an alternating path (matched edges and unmatched edges appearing alternately), which is an augmenting path. In practical applications, if no augmenting path is found in the equality subgraph, it means that the current top label settings cannot further optimize the matching results. In this case, the top labels need to be adjusted to expand the equality subgraph.

[0118] It should be noted that the above-mentioned top-index adjustment amount can be the amount by which the top-indexes of the left and right nodes need to be adjusted to expand the equality subgraph. In this embodiment, adjusting the top-indexes can introduce new edges into the equality subgraph, which may generate new augmenting paths.

[0119] In practical applications, if no augmenting path is found, the minimum vertex adjustment amount can be calculated to ensure that at least one new edge can enter the equal subgraph. Specifically, assume the set of currently uncovered left-hand nodes is... The set of uncovered nodes on the right is Then we can combine the top label of the left node. Right node top label and edge weight matrix Calculate the minimum top label adjustment amount :

[0120] For all Update the top label: For all Update the top label: This continues until a perfect match is found in the equality subgraph.

[0121] After updating the top labels, the system can reconstruct the equal subgraph and use the preset path search algorithm again to find an augmenting path. If an augmenting path is found, the matching result is updated; otherwise, the top label adjustment is recalculated and the above process is repeated.

[0122] Step S233: Verify the target matching edge based on the operational safety constraints and the operational service constraints, and generate the elevator matching result corresponding to the elevator matching bipartite graph.

[0123] In practical applications, for each target matching edge The system can simulate the operation of elevators i and j, and detect the height difference between the two elevators in real time when they share energy, and check whether the height difference is greater than or equal to the safe energy transmission distance. If this condition is not met at any time, the matching edge is considered unsafe and can be removed from the target matching edge set. Meanwhile, for each target matching edge... The system can simulate the operation of elevators i and j, and calculate the response time of elevators i and j to the current call task under energy sharing conditions. Then, it compares the increase in passenger waiting time before and after energy sharing, determining whether this increase is less than or equal to the maximum allowed increase in waiting time. If this condition is not met, the matching edge is considered to not meet the service requirements, and it can be removed from the target matching edge set. After verifying the operational safety constraints and operational service constraints of the target matching edges, they can be added to the target matching edge set. Remove all matching edges that do not satisfy the operational safety constraints and service constraints to obtain the final elevator matching result. And include the coupling duration of each pair of matched edges. The matching edges in this matching result represent the optimal elevator pair that can achieve energy sharing under the premise of satisfying all constraints.

[0124] In this embodiment, the method of constructing an edge weight matrix corresponding to a feasible edge set is disclosed; the target matching edge is determined from the feasible edge set based on the edge weight matrix and the improved Hungarian algorithm; the target matching edge is verified based on operational safety constraints and operational service constraints to generate elevator matching results corresponding to the elevator matching bipartite graph; by verifying the target matching edge with operational safety constraints and operational service constraints, this embodiment can ensure that the operation of elevators will not interfere with each other or collide during energy sharing, and that the waiting time for passengers will not increase significantly, thereby ensuring the safety of passengers and equipment and the passenger riding experience.

[0125] It should be noted that the above examples are only for understanding this application and do not constitute a limitation on the elevator energy scheduling method of this application. Any simple modifications based on this technical concept are within the protection scope of this application.

[0126] This application also provides an elevator energy dispatching device, please refer to... Figure 5 The elevator energy scheduling device includes: The energy complementarity assessment module 10 is used to determine the energy complementarity score between each upward elevator and each downward elevator in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group. Elevator matching module 20 is used to determine the best matching elevator pair between each upward elevator and each downward elevator based on the energy complementarity score; Channel construction module 30 is used to construct a temporary energy coupling channel for the best-matched elevator pair; The energy scheduling module 40 is used to schedule the elevator energy in the best-matched elevator pair through the temporary energy coupling channel.

[0127] The elevator energy scheduling device provided in this application, employing the elevator energy scheduling method described in the above embodiments, can solve the technical problem in existing multi-elevator systems where each elevator operates independently, making intelligent energy coordination impossible and resulting in energy waste. Compared with the prior art, the beneficial effects of the elevator energy scheduling device provided in this application are the same as those of the elevator energy scheduling method provided in the above embodiments, and other technical features of the elevator energy scheduling device are the same as those disclosed in the methods of the above embodiments, and will not be repeated here.

[0128] This application provides an elevator energy scheduling device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the elevator energy scheduling method in the first embodiment described above.

[0129] The following is for reference. Figure 6 The diagram illustrates a structural schematic suitable for implementing the elevator energy dispatching device in the embodiments of this application. The elevator energy dispatching device in the embodiments of this application may include, but is not limited to, mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Description), PMPs (Portable Media Players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and fixed terminals such as digital TVs and desktop computers. Figure 6 The elevator energy dispatching device shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of this application.

[0130] like Figure 6As shown, the elevator energy dispatching device may include a processing unit 1001 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory 1002 or a program loaded from a storage device 1003 into a random access memory 1004. The random access memory 1004 also stores various programs and data required for the operation of the elevator energy dispatching device. The processing unit 1001, the read-only memory 1002, and the random access memory 1004 are interconnected via a bus 1005. An input / output interface 1006 is also connected to the bus. Typically, the following systems can be connected to the input / output interface 1006: input devices 1007 including, for example, a touch screen, touchpad, keyboard, mouse, image sensor, microphone, accelerometer, gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), speaker, vibrator, etc.; storage devices 1003 including, for example, magnetic tape, hard disk, etc.; and communication devices 1009. Communication device 1009 allows the elevator energy dispatching equipment to communicate wirelessly or wiredly with other devices to exchange data. Although the figure shows elevator energy dispatching equipment with various systems, it should be understood that it is not required to implement or have all of the systems shown. More or fewer systems may be implemented alternatively.

[0131] Specifically, according to the embodiments disclosed in this application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments disclosed in this application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device, or installed from storage device 1003, or installed from read-only memory 1002. When the computer program is executed by processing device 1001, it performs the functions defined in the methods of the embodiments disclosed in this application.

[0132] The elevator energy scheduling device provided in this application, employing the elevator energy scheduling method in the above embodiments, can solve the technical problem of elevator energy scheduling. Compared with the prior art, the beneficial effects of the elevator energy scheduling device provided in this application are the same as those of the elevator energy scheduling method provided in the above embodiments, and other technical features of the elevator energy scheduling device are the same as those disclosed in the previous embodiment method, and will not be repeated here.

[0133] It should be understood that the various parts disclosed in this application can be implemented using hardware, software, firmware, or a combination thereof. In the description of the above embodiments, specific features, structures, materials, or characteristics can be combined in any suitable manner in one or more embodiments or examples.

[0134] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

[0135] This application provides a computer-readable storage medium having computer-readable program instructions (i.e., a computer program) stored thereon, the computer-readable program instructions being used to execute the elevator energy scheduling method in the above embodiments.

[0136] The computer-readable storage medium provided in this application may be, for example, a USB flash drive, but is not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems or devices, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system or device. The program code contained on the computer-readable storage medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination thereof.

[0137] The aforementioned computer-readable storage medium may be included in the elevator energy dispatching equipment; or it may exist independently and not be installed in the elevator energy dispatching equipment.

[0138] The aforementioned computer-readable storage medium carries one or more programs. When the aforementioned one or more programs are executed by the elevator energy scheduling device, the elevator energy scheduling device: determines the energy complementarity score between each upward elevator and each downward elevator in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group; determines the best matching elevator pair between each upward elevator and each downward elevator based on the energy complementarity score; constructs a temporary energy coupling channel for the best matching elevator pair; and schedules the elevator energy in the best matching elevator pair through the temporary energy coupling channel.

[0139] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, and conventional procedural programming languages ​​such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a Local Area Network (LAN) or a Wide Area Network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0140] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0141] The modules described in the embodiments of this application can be implemented in software or hardware. The names of the modules do not necessarily limit the functionality of the unit itself.

[0142] The readable storage medium provided in this application is a computer-readable storage medium that stores computer-readable program instructions (i.e., a computer program) for executing the above-described elevator energy scheduling method. This solves the technical problem in existing multi-elevator systems where each elevator operates independently, making intelligent energy coordination impossible and resulting in energy waste. Compared to the prior art, the beneficial effects of the computer-readable storage medium provided in this application are the same as those of the elevator energy scheduling method provided in the above embodiments, and will not be elaborated upon here.

[0143] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the elevator energy scheduling method described above.

[0144] The computer program product provided in this application can solve the technical problem in existing multi-elevator systems where each elevator operates independently, making intelligent energy coordination impossible and resulting in energy waste. Compared with the prior art, the beneficial effects of the computer program product provided in this application are the same as those of the elevator energy scheduling method provided in the above embodiments, and will not be repeated here.

[0145] The above description is only a part of the embodiments of this application and does not limit the patent scope of this application. All equivalent structural transformations made under the technical concept of this application and using the contents of the specification and drawings of this application, or direct / indirect applications in other related technical fields, are included in the patent protection scope of this application.

[0146] This invention discloses A1, an elevator energy scheduling method, the method comprising: Based on the multi-dimensional operating status information of each elevator in the elevator group, the energy complementarity score between each upward elevator and each downward elevator in the elevator group is determined. Based on the energy complementarity score, the optimal matching elevator pair between each upward elevator and each downward elevator is determined; Construct a temporary energy coupling channel for the optimally matched elevator pair; The elevator energy in the optimally matched elevator pair is scheduled through the temporary energy coupling channel.

[0147] A2. As described in A1, the step of determining the energy complementarity score between each upward-moving elevator and each downward-moving elevator in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group includes: The set of upward elevators and the set of downward elevators in the elevator group are determined based on the multi-dimensional operating status information of each elevator in the elevator group. Based on the multi-dimensional operating status information, the power supply and demand matching degree, operating time synchronization, and vertical path spatial overlap degree between each upward elevator in the upward elevator set and each downward elevator in the downward elevator set are determined. The energy complementarity score between each upward elevator and each downward elevator is determined based on the power supply and demand matching degree, the operating time synchronization degree, and the vertical path spatial overlap degree.

[0148] A3. As described in A2, the step of determining the power supply and demand matching degree, operating time synchronization, and vertical path spatial overlap between each upward elevator in the upward elevator set and each downward elevator in the downward elevator set based on the multi-dimensional operating status information includes: Based on the multi-dimensional operating status information, determine the net power and end time of each upward elevator in the upward elevator set, the net power and end time of each downward elevator in the downward elevator set, and the number of floors with overlapping operating paths between each upward elevator and each downward elevator. The power supply and demand matching degree between each upward elevator and each downward elevator is determined based on the net power of upward operation and the net power of downward operation. The synchronization of the running time between each upward elevator and each downward elevator is determined based on the end time of the upward operation and the end time of the downward operation. The vertical path spatial overlap between each upward elevator and each downward elevator is determined based on the number of overlapping floors in the operating path and the total number of floors in operation.

[0149] A4. The method as described in A3, wherein the step of determining the optimal matching elevator pair between each upward elevator and each downward elevator based on the energy complementarity score includes: Construct the spatial and temporal feasibility constraints, operational safety constraints, and operational service constraints corresponding to the elevator matching bipartite graph; An elevator matching bipartite graph is constructed based on the set of upward elevators, the set of downward elevators, the energy complementarity score, and the spatial and temporal feasibility constraints. Based on the operational safety constraints and the operational service constraints, generate the elevator matching result corresponding to the elevator matching bipartite graph; Based on the elevator matching results, the optimal matching elevator pair between each upward elevator and each downward elevator is determined.

[0150] A5. As described in A4, the step of constructing an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, the energy complementarity score, and the spatial and temporal feasibility constraints includes: Determine whether each upward elevator in the set of upward elevators and each downward elevator in the set of downward elevators satisfy the spatial and temporal feasibility constraints; If the conditions are met, then an initial matching edge is constructed between each upward elevator and each downward elevator; The weight of the matching edge corresponding to the initial matching edge is determined based on the energy complementarity score. A feasible edge set is generated based on the initial matching edge and the matching edge weight; Construct an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, and the set of feasible edges.

[0151] A6. As described in A4, the step of constructing the spatial and temporal feasibility constraints corresponding to the elevator matching bipartite graph includes: The first current operating floor corresponding to each upward elevator and the second current operating floor corresponding to each downward elevator are determined based on the multi-dimensional operating status information. Based on the first currently operating floor and the second currently operating floor, construct the operational space feasibility constraints corresponding to the elevator matching bipartite graph; The upward start time of each upward elevator and the downward start time of each downward elevator are determined based on the multi-dimensional operating status information. Based on the start time of the upward operation, the start time of the downward operation, the end time of the upward operation, and the end time of the downward operation, the operation time feasibility constraints corresponding to the elevator matching bipartite graph are constructed. Based on the operational space feasibility constraints and the operational time feasibility constraints, the spatial and temporal feasibility constraints corresponding to the elevator matching bipartite graph are generated.

[0152] A7. As described in A4, the step of constructing the operational safety constraints corresponding to the elevator matching bipartite graph includes: The first real-time operating height of each upward elevator and the second real-time operating height of each downward elevator are determined based on the multi-dimensional operating status information. Determine the safe energy transfer distance between each upward elevator and each downward elevator; Based on the first real-time operating height, the second real-time operating height, and the energy transmission safety distance, the elevator matching bipartite graph is constructed to correspond to the operating safety constraints.

[0153] A8. As described in A5, the step of generating the elevator matching result corresponding to the elevator matching bipartite graph based on the operational safety constraints and the operational service constraints includes: Construct the edge weight matrix corresponding to the feasible edge set; Based on the edge weight matrix and the improved Hungarian algorithm, the target matching edge is determined from the feasible edge set; The target matching edge is verified based on the operational safety constraints and the operational service constraints, and the elevator matching result corresponding to the elevator matching bipartite graph is generated.

[0154] A9. As described in A8, the step of determining the target matching edge from the feasible edge set based on the edge weight matrix and the improved Hungarian algorithm includes: A feasible subgraph is constructed based on the feasible edge set, the feasible upward elevators and feasible downward elevators corresponding to each feasible edge in the feasible edge set; Based on the improved Hungarian algorithm, the left and right node indices in the feasible subgraph are initialized; Construct an equal subgraph based on the initialized left and right node top indices; A preset path search algorithm is used to perform a path search on the equality subgraph to obtain the path search results; The target matching edge is determined from the set of feasible edges based on the path search results.

[0155] A10. As described in A9, the step of determining the target matching edge from the feasible edge set based on the path search result includes: If no optimal path is found in the path search results, the top label adjustment amount is determined based on the initialized left node top label, the initialized right node top label, and the edge weight matrix. The initialized left node top label and the initialized right node top label are updated according to the top label adjustment amount; Once the update is complete, return to the step of performing a path search on the equal subgraph using a preset path search algorithm to obtain the path search results.

[0156] The present invention also discloses B11, an elevator energy scheduling device, the device comprising: An energy complementarity assessment module is used to determine the energy complementarity score between each upward elevator and each downward elevator in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group. An elevator matching module is used to determine the optimal matching elevator pair between each upward elevator and each downward elevator based on the energy complementarity score. The channel construction module is used to construct a temporary energy coupling channel for the best-matched elevator pair; An energy scheduling module is used to schedule the elevator energy in the best-matched elevator pair through the temporary energy coupling channel.

[0157] B12. The device as described in B11, wherein the energy complementarity assessment module is further configured to determine the set of upward elevators and the set of downward elevators in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group. The energy complementarity assessment module is also used to determine the power supply and demand matching degree, operating time synchronization and vertical path spatial overlap between each upward elevator in the upward elevator set and each downward elevator in the downward elevator set based on the multi-dimensional operating status information. The energy complementarity assessment module is also used to determine the energy complementarity score between each upward elevator and each downward elevator based on the power supply and demand matching degree, the operating time synchronization degree, and the vertical path spatial overlap degree.

[0158] B13. The device as described in B12, wherein the energy complementarity assessment module is further configured to determine, based on the multi-dimensional operating status information, the net power of upward operation and the end time of upward operation of each upward elevator in the upward elevator set, the net power of downward operation and the end time of downward operation of each downward elevator in the downward elevator set, and the number of floors with overlapping operating paths between each upward elevator and each downward elevator. The energy complementarity assessment module is also used to determine the power supply and demand matching degree between each upward elevator and each downward elevator based on the net power of upward operation and the net power of downward operation; The energy complementarity assessment module is also used to determine the synchronization of the running time between each upward elevator and each downward elevator based on the upward running end time and the downward running end time; The energy complementarity assessment module is also used to determine the vertical path spatial overlap between each upward elevator and each downward elevator based on the number of overlapping floors in the operating path and the total number of floors in operation.

[0159] B14. The device as described in B13, wherein the elevator matching module is further configured to construct the spatial and temporal feasibility constraints, operational safety constraints, and operational service constraints corresponding to the elevator matching bipartite graph; The elevator matching module is also used to construct an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, the energy complementarity score, and the spatial and temporal feasibility constraints. The elevator matching module is also used to generate elevator matching results corresponding to the elevator matching bipartite graph based on the operation safety constraints and the operation service constraints; The elevator matching module is further configured to determine the optimal matching elevator pair between each upward elevator and each downward elevator based on the elevator matching result.

[0160] B15. The device as described in B14, wherein the elevator matching module is further configured to determine whether each upward elevator in the upward elevator set and each downward elevator in the downward elevator set satisfy the spatial and temporal feasibility constraints. The elevator matching module is further configured to construct an initial matching edge between each upward elevator and each downward elevator if the conditions are met. The elevator matching module is also used to determine the matching edge weight corresponding to the initial matching edge based on the energy complementarity score; The elevator matching module is also used to generate a feasible edge set based on the initial matching edge and the matching edge weight; The elevator matching module is also used to construct an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, and the set of feasible edges.

[0161] B16. The elevator matching module of the device described in B15 is further configured to construct the edge weight matrix corresponding to the feasible edge set. The elevator matching module is also used to determine the target matching edge from the feasible edge set based on the edge weight matrix and the improved Hungarian algorithm; The elevator matching module is also used to verify the target matching edge based on the operation safety constraints and the operation service constraints, and generate the elevator matching result corresponding to the elevator matching bipartite graph.

[0162] B17. The device as described in B16, wherein the elevator matching module is further configured to construct a feasible subgraph based on the feasible edge set and the feasible upward elevators and feasible downward elevators corresponding to each feasible edge in the feasible edge set; The elevator matching module is also used to initialize the left node top label and right node top label in the feasible subgraph based on the improved Hungarian algorithm; The elevator matching module is also used to construct an equal subgraph based on the initialized left node top label and the initialized right node top label; The elevator matching module is also used to perform path search on the equal subgraph using a preset path search algorithm to obtain path search results; The elevator matching module is further configured to determine a target matching edge from the set of feasible edges based on the path search results.

[0163] The present invention also discloses C18, an elevator energy scheduling device, the device comprising: a memory, a processor, and an elevator energy scheduling program stored in the memory and executable on the processor, the elevator energy scheduling program being configured to implement the steps of the elevator energy scheduling method described above.

[0164] The present invention also discloses D19, a storage medium storing an elevator energy scheduling program, wherein the elevator energy scheduling program, when executed by a processor, implements the steps of the elevator energy scheduling method described above.

[0165] The present invention also discloses E20, a computer program product comprising a computer program that, when executed by a processor, implements the steps of the elevator energy scheduling method described above.

Claims

1. An elevator energy scheduling method, characterized in that, The method includes: Based on the multi-dimensional operating status information of each elevator in the elevator group, the energy complementarity score between each upward elevator and each downward elevator in the elevator group is determined. Based on the energy complementarity score, the optimal matching elevator pair between each upward elevator and each downward elevator is determined; Construct a temporary energy coupling channel for the optimally matched elevator pair; The elevator energy in the optimally matched elevator pair is scheduled through the temporary energy coupling channel.

2. The method as described in claim 1, characterized in that, The step of determining the energy complementarity score between each upward and downward elevator in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group includes: The set of upward elevators and the set of downward elevators in the elevator group are determined based on the multi-dimensional operating status information of each elevator in the elevator group. Based on the multi-dimensional operating status information, the power supply and demand matching degree, operating time synchronization, and vertical path spatial overlap degree between each upward elevator in the upward elevator set and each downward elevator in the downward elevator set are determined. The energy complementarity score between each upward elevator and each downward elevator is determined based on the power supply and demand matching degree, the operating time synchronization degree, and the vertical path spatial overlap degree.

3. The method as described in claim 2, characterized in that, The steps of determining the power supply and demand matching degree, operating time synchronization, and vertical path spatial overlap between each upward elevator in the upward elevator set and each downward elevator in the downward elevator set based on the multi-dimensional operating status information include: Based on the multi-dimensional operating status information, determine the net power and end time of each upward elevator in the upward elevator set, the net power and end time of each downward elevator in the downward elevator set, and the number of floors with overlapping operating paths between each upward elevator and each downward elevator. The power supply and demand matching degree between each upward elevator and each downward elevator is determined based on the net power of upward operation and the net power of downward operation. The synchronization of the running time between each upward elevator and each downward elevator is determined based on the end time of the upward operation and the end time of the downward operation. The vertical path spatial overlap between each upward elevator and each downward elevator is determined based on the number of overlapping floors in the operating path and the total number of floors in operation.

4. The method as described in claim 3, characterized in that, The step of determining the optimal matching elevator pair between each upward elevator and each downward elevator based on the energy complementarity score includes: Construct the spatial and temporal feasibility constraints, operational safety constraints, and operational service constraints corresponding to the elevator matching bipartite graph; An elevator matching bipartite graph is constructed based on the set of upward elevators, the set of downward elevators, the energy complementarity score, and the spatial and temporal feasibility constraints. Based on the operational safety constraints and the operational service constraints, generate the elevator matching result corresponding to the elevator matching bipartite graph; Based on the elevator matching results, the optimal matching elevator pair between each upward elevator and each downward elevator is determined.

5. The method as described in claim 4, characterized in that, The step of constructing an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, the energy complementarity score, and the spatial and temporal feasibility constraints includes: Determine whether each upward elevator in the set of upward elevators and each downward elevator in the set of downward elevators satisfy the spatial and temporal feasibility constraints; If the conditions are met, then an initial matching edge is constructed between each upward elevator and each downward elevator; The weight of the matching edge corresponding to the initial matching edge is determined based on the energy complementarity score. A feasible edge set is generated based on the initial matching edge and the matching edge weight; Construct an elevator matching bipartite graph based on the set of upward elevators, the set of downward elevators, and the set of feasible edges.

6. The method as described in claim 5, characterized in that, The step of generating the elevator matching result corresponding to the elevator matching bipartite graph based on the operational safety constraints and the operational service constraints includes: Construct the edge weight matrix corresponding to the feasible edge set; Based on the edge weight matrix and the improved Hungarian algorithm, the target matching edge is determined from the feasible edge set; The target matching edge is verified based on the operational safety constraints and the operational service constraints, and the elevator matching result corresponding to the elevator matching bipartite graph is generated.

7. An elevator energy dispatching device, characterized in that, The device includes: An energy complementarity assessment module is used to determine the energy complementarity score between each upward elevator and each downward elevator in the elevator group based on the multi-dimensional operating status information of each elevator in the elevator group. An elevator matching module is used to determine the optimal matching elevator pair between each upward elevator and each downward elevator based on the energy complementarity score. The channel construction module is used to construct a temporary energy coupling channel for the best-matched elevator pair; An energy scheduling module is used to schedule the elevator energy in the best-matched elevator pair through the temporary energy coupling channel.

8. An elevator energy dispatching device, characterized in that, The device includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program being configured to implement the steps of the elevator energy scheduling method as described in any one of claims 1 to 6.

9. A storage medium, characterized in that, The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, it implements the steps of the elevator energy scheduling method as described in any one of claims 1 to 6.

10. A computer program product, characterized in that, The computer program product includes a computer program that, when executed by a processor, implements the steps of the elevator energy scheduling method as described in any one of claims 1 to 6.

Images