Elevator dispatching method

Abstract

This invention discloses an elevator dispatching method, comprising the following steps: Step S1, estimating the destination floors of waiting passengers at the main station and the number of passengers disembarking at each destination floor based on historical data; Step S2, determining the destination floors to which elevators about to arrive at the main station will stop based on the estimation results; Step S3, informing waiting passengers of the destination floors to which the arriving elevators will stop in their next operating cycle. Compared with the prior art, this invention eliminates the need for passengers to register for elevator use, achieving highly efficient elevator dispatching without relying on passengers registering their destination floors.

Description

Technical Field

[0001] This invention relates to the field of elevator technology, and in particular to an elevator dispatching method. Background Technology

[0002] Existing elevator systems typically allocate elevators to respond to passenger calls after the passenger has registered the call signal, thus completing the passenger transport. In other words, elevators only begin to allocate elevators and transport passengers after receiving their call signals. In this case, passengers must complete a call signal registration process in some way (floor registration device, mobile terminal, card swipe, fingerprint or iris scanning recognition, etc.) to register their elevator information and use the elevator.

[0003] However, during morning rush hour in places like office buildings, long queues often form in the main elevator lobby on the first floor. To improve elevator efficiency and maximize capacity, destination registration devices are typically installed on the main floors. These devices require each passenger to register their destination floor for optimal elevator allocation. However, when the lobby is crowded, many passengers assume others with the same destination have already registered, and are reluctant to move to the registration device due to congestion. This leads to inaccurate elevator allocation by the elevator management system, reducing efficiency and exacerbating congestion. In situations where only traditional up-to-the-floor registration buttons are available, the elevator management system lacks destination information, making elevator allocation even more unreliable.

[0004] Therefore, how to achieve efficient elevator allocation when accurate information about the destination floors of waiting passengers is completely unavailable or cannot be obtained has become a problem to be solved. Summary of the Invention

[0005] To solve the above-mentioned technical problems, the present invention provides an elevator dispatching method, comprising the following steps:

[0006] Step S1: Estimate the destination floor of passengers waiting for elevators at the main station and the number of passengers getting off the elevator corresponding to each destination floor based on historical data;

[0007] Step S2: Based on the estimation results, determine the destination floors that the elevators that are about to arrive at the main station will stop at. The destination floors refer to the various destination floors that the elevators that are about to arrive will stop at in their next operating cycle. The estimation results include the destination floors of the passengers waiting for the elevators at the main station and the number of passengers corresponding to each destination floor.

[0008] Step S3: Inform the waiting passengers that the elevator will stop at its destination floor in its next operating cycle.

[0009] Preferably, the estimation method based on historical data in step S1 is as follows: Step S1a1, record historical data during elevator operation in real time, including at least one of the boarding time of the main floor and the arrival time of each destination floor, as well as the number of passengers disembarking at each destination floor; Step S1a2, based on the historical data, calculate the number of passengers going from the main floor to each destination floor in each preset time period of the day; Step S1a3, estimate the number of passengers waiting at the main floor and going to each destination floor based on the current preset time period.

[0010] Preferably, the estimation method based on historical data in step S1 is as follows: based on the first understanding, it is inferred that the number of destination floors and the corresponding number of passengers exiting the elevator in the current preset time period will follow the pattern of the number of destination floors and the corresponding number of passengers exiting the elevator in the previous preset time period; using historical data before the current preset time period, the pattern is extended to the current preset time period to predict the number of destination floors and the corresponding number of passengers exiting the elevator in the current preset time period; the first understanding means that the number of destination floors and the corresponding number of passengers exiting the elevator in the current preset time period will not change abruptly relative to the number of destination floors and the corresponding number of passengers exiting the elevator in at least one time period or at least one operating cycle before the current preset time period.

[0011] Preferably, step S2 further includes the following sub-steps: step S2a1, performing cluster analysis on the destination floor to obtain several clusters; step S2a2, determining at least one selected cluster according to a preset first cluster selection principle; step S2a3, assigning the destination floor contained in the selected cluster to the elevator that is about to arrive.

[0012] Preferably, step S2 further includes the following sub-steps: Step S2b1, performing cluster analysis on the destination floor to obtain several clusters; Step S2b2, calculating the total number of passengers exiting the elevator corresponding to the destination floor in each cluster; Step S2b3, when the difference between the total number of passengers exiting the elevator corresponding to the destination floor in any two adjacent clusters exceeds a threshold, adjusting the destination floors in each cluster according to a preset adjustment method so that the difference between the total number of passengers exiting the elevator corresponding to the destination floor in any two adjacent clusters does not exceed the threshold; Step S2b4, selecting a selected cluster according to a preset first cluster selection principle; Step S2b5, assigning the destination floors contained in the selected cluster to the elevator about to arrive. Preferably, the first cluster selection principle is at least one of the following principles: Principle 1, the distance between the median of the destination floors contained in the cluster and the main floor station is the shortest; Principle 2, the maximum value of the waiting time of the destination floors contained in the cluster is the largest; Principle 3, the cumulative value of the waiting time of the destination floors contained in the cluster is the largest; Principle 4, the number of destination floors contained in the cluster is the smallest; Principle 5, the total number of passengers exiting the elevator corresponding to the destination floors contained in the cluster is closest to the available passenger capacity of the elevator.

[0013] Preferably, step S2 further includes the following sub-steps: step S2c1, searching and determining the target floor corresponding to the largest number of passengers getting off the elevator or the longest waiting time, and adding the target floor to the selected cluster; step S2c2, taking the target floor determined in step S2c1 as the center, gradually adding adjacent target floors to the selected cluster, until the sum of the number of passengers getting off the elevator corresponding to each target floor in the selected cluster first exceeds the rated passenger capacity of the elevator that is about to arrive; step S2c3, assigning the target floors contained in the selected cluster to the first elevator to arrive at the main floor station after the current time.

[0014] Preferably, step S2 further includes the following sub-steps: step S2d1, along the running direction of the elevator about to arrive after leaving the main floor, add the destination floor closest to the main floor to the selected cluster; step S2d2, gradually increase the destination floors arriving later along the running direction to the selected cluster, until the total number of passengers alighting from each destination floor in the selected cluster exceeds the rated passenger capacity of the elevator about to arrive for the first time; step S2d3, assign the destination floors included in the selected cluster to the first elevator to arrive at the main floor after the current time.

[0015] Preferably, step S2 further includes the following sub-steps: Step S2e1, a positive integer parameter α is preset, and all combinations of no more than α destination floors are enumerated and selected from all combinations. The candidate combinations are selected from all combinations where the sum of the number of passengers going down the destination floor and the remaining available passenger capacity of the elevator about to arrive do not exceed a threshold. Step S2e2, among the candidate combinations, the candidate combinations with the fewest number of destination floors or the smallest maximum distance between any two destination floors are further selected. Step S2e3, the destination floors contained in the further selected candidate combinations are assigned to the first elevator about to arrive after the current time.

[0016] Preferably, the elevator dispatching method further includes: step S4, updating historical data; the method for updating historical data in step S4 is as follows: after the elevator about to arrive completes its stop at each destination floor and obtains the data of the number of passengers getting off at that destination floor, the data is added to the historical data; or after the elevator about to arrive completes its transport to all destination floors in this allocation and obtains the data of the number of passengers getting off at each destination floor, the data is added to the historical data.

[0017] Preferably, the elevator dispatching method further includes: step S5, updating the estimation result; the method for updating the estimation result in step S5 is: when the transportation of each destination floor in the selected cluster is completed, if there are stranded passengers in each destination floor of the selected cluster at the main station, the number of stranded passengers is increased to the number of passengers going from the main station to the corresponding destination floor in the next preset time period.

[0018] Compared with existing technologies, the present invention eliminates the need for passengers to register for elevator use, achieving highly efficient elevator allocation without relying on passengers registering their destination floor. Attached Figure Description

[0019] The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments:

[0020] Figure 1 This is a schematic diagram of the elevator dispatching method of the present invention. Detailed Implementation

[0021] The following specific embodiments illustrate the implementation of the present invention. Those skilled in the art can fully understand other advantages and technical effects of the present invention from the content disclosed in this specification. The present invention can also be implemented or applied through different specific embodiments, and the details in this specification can also be applied based on different viewpoints, with various modifications or changes made without departing from the overall design concept of the invention. It should be noted that, unless otherwise specified, the following embodiments and features can be combined with each other. The following exemplary embodiments of the present invention can be implemented in many different forms and should not be construed as being limited to the specific embodiments set forth herein. It should be understood that these embodiments are provided to make the disclosure of the present invention thorough and complete, and to fully convey the technical solutions of these exemplary embodiments to those skilled in the art.

[0022] Example 1

[0023] like Figure 1 As shown, this embodiment provides an elevator dispatching method, including the following steps:

[0024] Step S1: Estimate the destination floor of passengers waiting for elevators at the main station and the number of passengers getting off the elevator corresponding to each destination floor based on historical data;

[0025] Step S2: Based on the estimation results, determine the destination floors that the elevator about to arrive at the main station will stop at. The destination floors refer to the various destination floors that the elevator about to arrive will stop at in its next operating cycle (i.e., after starting from the main station, it moves along the selected operating direction until it reaches the farthest stop floor and then turns back). The estimation results include the destination floors of the passengers waiting for the elevator at the main station and the number of passengers corresponding to each destination floor.

[0026] Step S3: Inform the waiting passengers that the elevator will stop at its destination floor in its next operating cycle.

[0027] There are two ways to inform us here:

[0028] Method 1: Inform only one elevator at a time of its destination floor. The information provided can include only the destination floor or both the elevator sign and the destination floor.

[0029] Method 2: First, identify the first elevator that is about to arrive from all elevators, and inform it of the elevator's name and the destination floor. Then, from the remaining elevators excluding the identified elevator, identify the first elevator that is about to arrive, and inform it of the elevator's name and the destination floor. Continue this process.

[0030] The estimation methods based on historical data in step S1 can be exemplarily categorized into the following two types:

[0031] The first method can be called simultaneous time period estimation, and the specific method is as follows:

[0032] Step S1a1: Record historical data during elevator operation in real time. The historical data includes at least one of the boarding time of the main floor station and the arrival time of each destination floor, as well as the number of passengers disembarking at each destination floor.

[0033] Step S1a2: Based on the historical data, the number of passengers traveling from the main station to each destination station during each preset time period of the day is statistically obtained.

[0034] Step S1a3: Estimate the number of passengers waiting for the elevator at the main station who are going to their respective destination floors based on the current preset time period.

[0035] In layman's terms, it refers to estimating the passenger waiting situation at the current time k (or time period k) using historical data from time k over several days. A prerequisite for this estimation is that passenger waiting patterns at different times of the day on different dates follow the same distribution pattern; for example, the morning rush hour passenger flow during the morning commute for an office building.

[0036] In this embodiment, since passenger call registration is not required, and elevators are allocated and passengers are transported based on an estimate of waiting passengers, passenger data (which typically includes departure floor, destination floor, registration time, etc.) cannot be obtained in the traditional way. Therefore, after a passenger enters the elevator car and the elevator doors close and start, the number of passengers disembarking at each floor is recorded upon arrival at the passenger's destination floor. This data is then stored in association with the destination floor, number of passengers, arrival time, and the passenger's entry time from the main floor into the elevator car. The method for obtaining the number of disembarking passengers is not limited; it can be based on light curtain obstruction, the detection results of the car's weighing device, image recognition results from cameras inside the car and / or at the landings, or the communication connection between the passenger's mobile terminal and the wireless communication device located inside the car and / or at the landings. Here, the passenger's entry time from the main floor into the elevator car can be approximated by the elevator's start time, or it can be the difference between the car's arrival time at the passenger's destination floor and the elevator's travel time from the main floor to that destination floor.

[0037] By using this historical data and conducting statistical analysis, the number of passengers traveling from the main station to each floor at different times of the day can be obtained. Using the current time and destination floor as search elements, the number of passengers in the current waiting hall who are going to that destination floor can be uniquely determined.

[0038] The second method can be called trend estimation, and the specific method is as follows:

[0039] Based on initial perception, it is inferred that the number of passengers exiting the elevator at each destination floor and corresponding destination floor during the current preset time period will follow the pattern of the number of passengers exiting the elevator at each destination floor and corresponding destination floor before the current preset time period.

[0040] By using historical data prior to the current preset time period, the pattern is extended to the current preset time period to predict the destination floors and the corresponding number of passengers exiting the elevator during the current preset time period.

[0041] The first understanding means that the number of destination floors and the corresponding number of passengers disembarking in the current preset time period will not change abruptly compared to the number of destination floors and the corresponding number of passengers disembarking in at least one time period or at least one operating cycle before the current preset time period.

[0042] There are multiple ways to apply historical data and infer patterns; three examples are given below.

[0043] Example 1:

[0044] The historical data refers to the destination floors and the number of passengers exiting the elevator in the previous time period or the previous operating cycle of the current preset time period; the pattern is that the number of destination floors and the number of passengers exiting the elevator in the current preset time period is approximately equal to the number of destination floors and the number of passengers exiting the elevator in the previous time period or the previous operating cycle of the current preset time period; step S1 directly uses the number of destination floors and the number of passengers exiting the elevator in the previous time period or the previous operating cycle of the current preset time period as the number of destination floors and the number of passengers exiting the elevator in the current preset time period.

[0045] In layman's terms: Let the current time be k1. Consider the destination floors and corresponding passenger numbers in the previous time period closest to k1, or the destination floors and corresponding passenger numbers when the elevator just completed a cycle. Simply put, we assume that the destination floors and corresponding passenger numbers of passengers waiting for the elevator at time k1 are the same as those in the previous time period or when the elevator just completed a cycle. For example, if the current time is 8:43, within time period 0 [8:40-8:45], and the previous time period 1 is [8:35-8:40], and the actual destination floors of the waiting passengers within that time period are the 8th, 15th, and 20th floors, with corresponding passenger numbers of 5, 10, and 8 respectively, then we assume that the waiting passengers at time k1 are also going to these three floors, and the corresponding numbers remain unchanged.

[0046] Example 2:

[0047] The historical data refers to the destination floors and the number of passengers exiting the elevator in the two time periods or two operating cycles prior to the current preset time period.

[0048] The rule is that the first change is equal to the second change. The first change refers to the change in the number of destination floors and the number of passengers getting off the elevator in the current preset time period relative to the number of destination floors and the number of passengers getting off the elevator in the previous time period or the previous operating cycle. The second change refers to the change in the number of destination floors and the number of passengers getting off the elevator in the previous time period or the previous operating cycle relative to the number of destination floors and the number of passengers getting off the elevator in the two time periods or the two operating cycles before the current preset time period.

[0049] Step S1 obtains the destination floors and the number of passengers descending the elevator in the current preset time period by adding the second change amount to the number of destination floors and the number of passengers descending the elevator in the previous time period or the previous operating cycle in the current preset time period.

[0050] The difference between Example 2 and Example 1 is that Example 2 contains at least two sets of data. In addition to the destination floors and corresponding passenger numbers in the previous time period closest to time k1, or the destination floors and corresponding passenger numbers of the elevator that just completed a cycle (the first set of data), it also contains corresponding data from time period 2 adjacent to time period 1 (e.g., [8:30-8:35]), or the destination floors and corresponding passenger numbers of the elevator whose completion time is closest to the current time among the elevators excluding the elevator that just completed a cycle (the second set of data). Thus, the difference in passenger numbers at the same destination floors in the two sets of data (the second change) is calculated, and the sum of this difference and the first set of data is used as the data required to execute subsequent steps at the current time. For example, on the same 15th floor, the number of passengers in the first set of data is 10, and the number of passengers in the second set of data is 8. The difference between the first set and the second set is 2(10-8) (where 2 is the second variable). Therefore, it is assumed that the number of passengers waiting for the elevator at the current moment who will get off on the 15th floor is 12(10+2) (where 2 is the first variable, and the first variable equals the second variable).

[0051] Example 3:

[0052] The historical data refers to the destination floors and the corresponding number of passengers disembarking from the elevator in multiple time periods or multiple operating cycles prior to the current preset time period.

[0053] The pattern is a curve representing the number of passengers exiting the elevator for each destination floor. The curve is formed by smoothly connecting multiple points, with the number of passengers exiting the elevator as the vertical axis and the corresponding time or order as the horizontal axis.

[0054] Step S1 involves extending the curve to the current preset time period to obtain the destination floors and the corresponding number of passengers exiting the elevator.

[0055] In this example, the number of data sets is further increased to n sets. Thus, for the same destination floor (e.g., the 15th floor), there are n corresponding numbers of passengers exiting the stairs. These are plotted on a coordinate system with the number of passengers exiting the stairs as the ordinate and the corresponding time or order as the abscissa, representing n discrete points. Connecting these points with a continuous, smooth curve reveals the changing pattern of the number of passengers exiting the stairs. This curve necessarily conforms to past patterns of passenger exiting the stairs. Considering the regularity of these changes, this pattern can be extended appropriately into the future. That is, the change in the number of passengers exiting the stairs in the future, starting from the current moment, should still conform to the pattern shown by this curve. This allows us to use this mathematical model and the change in the number of passengers exiting the stairs in the future, starting from the current moment, for prediction. Using these n data sets, we can perform modeling (e.g., curve fitting, machine learning, neural networks, etc.) to obtain a mathematical model describing the number of passengers exiting the stairs on that destination floor. In the above modeling process, to ensure prediction accuracy, we prioritize historical data from a certain time period closest to the current moment.

[0056] For step 2, since all elevator call data of waiting passengers in the main floor waiting hall are known (albeit estimated) in this embodiment, it is possible to select some or all of the elevator call signals from all the elevator call signals and assign them to the elevator that is about to arrive at the main floor, so that the elevator that is about to arrive can provide transportation services for the passengers with these elevator call signals.

[0057] It should be noted that the historical data required for the second estimation method is obtained through the same means as that required for the first estimation method, and will not be repeated here. More specifically, based on the estimation results to determine the destination floor for an elevator that is about to arrive at the main station, we propose the following new methods:

[0058] Method 1

[0059] Step S2 further includes the following sub-steps:

[0060] Step S2a1: Perform cluster analysis on the destination layer of the docking to obtain several clusters;

[0061] Step S2a2: Determine at least one selected cluster according to the preset first cluster selection principle;

[0062] Step S2a3: Assign the destination layer contained in the selected cluster to the elevator that is about to arrive.

[0063] When the number of passengers alighting from the destination floor included in the selected cluster exceeds the remaining available passenger capacity of the elevator (when there are no passengers in the car after the elevator arrives at the main floor, the remaining available passenger capacity is the rated passenger capacity), the excess is added to the number of passengers alighting from the corresponding destination floor when determining the floor to which the next arriving elevator will stop. At the same time, the waiting time for the corresponding destination floor is updated, and when determining the destination floor to which the next arriving elevator will stop, principle 2 from the subsequent explanation of the selection principles for the first cluster is given priority.

[0064] Multiple clusters can be selected. For example, when the number of passengers exiting the destination floor in the first selected cluster is less than the remaining available passenger capacity of the elevator, a second selected cluster is selected from the remaining clusters according to a preset second cluster selection principle, and at least one destination floor in the second selected cluster is further assigned to the elevator that is about to arrive. In this case, the second cluster selection principle is at least one of the following principles:

[0065] Principle A: Select the cluster containing the target layer that is closest to the target layer in the first selected cluster from the remaining clusters as the second selected cluster;

[0066] Principle B: Select the cluster from the remaining clusters that contains the destination floor with the number of passengers exiting the elevator that is closest to the number of remaining available elevators as the second selected cluster.

[0067] When principle A is adopted, it is preferable to assign the destination floor closest to the destination floor in the first selected cluster to the elevator that is about to arrive; when principle B is adopted, it is preferable to assign the destination floor whose number of passengers exiting the elevator is closest to the number of remaining available elevators to the elevator that is about to arrive.

[0068] When multiple clusters are selected, multiple iterations may be performed when selecting the second selected cluster.

[0069] Method 2

[0070] Method 1 only considers the distribution of destination floors, but does not consider the number of waiting passengers corresponding to each destination floor in the cluster. This will lead to huge differences between the total number of waiting passengers corresponding to each destination floor in each cluster, which obviously needs to be improved.

[0071] In method 2, step S2 further includes the following sub-steps:

[0072] Step S2b1: Perform cluster analysis on the destination layer of the docking to obtain several clusters;

[0073] Step S2b2: Calculate the total number of passengers descending the escalator corresponding to the destination floor in each cluster;

[0074] Step S2b3: When the difference between the total number of passengers going down the stairs corresponding to the destination floor in any two adjacent clusters exceeds the threshold, the destination floors in each cluster are adjusted according to the preset adjustment method so that the difference between the total number of passengers going down the stairs corresponding to the destination floor in any two adjacent clusters does not exceed the threshold.

[0075] Two adjacent clusters can be determined as follows: sort each cluster by the largest target layer, the smallest target layer, and the mean or median of all target layers contained in each cluster, and then determine whether two clusters are adjacent based on the sorted clusters.

[0076] Step S2b4: Select a cluster according to the preset cluster selection principle;

[0077] Step S2b5: Assign the destination layer contained in the selected cluster to the elevator that is about to arrive.

[0078] The preset adjustment method in step S2b3 is as follows:

[0079] Step A1: For two given adjacent clusters, determine the median of the target layer in each cluster;

[0080] Step A2: Determine the specific target layer in each of the two adjacent clusters. The specific target layer refers to the target layer in the cluster that is located between the two medians.

[0081] Step A3: Assign several specific destination layers from the cluster with the larger total number of passengers exiting the escalator to the cluster with the smaller total number of passengers exiting the escalator. This reduces the difference in their total numbers.

[0082] When dividing the target layer of the cluster, a specific target layer that is far from the median target layer of the original cluster is selected for transfer.

[0083] When a cluster with a larger total number of passengers descending the escalator is located between a cluster with a smaller total number of passengers descending the escalator and the main floor station, the threshold is reduced by a preset amount; when a cluster with a smaller total number of passengers descending the escalator is located between a cluster with a larger total number of passengers descending the escalator and the main floor station, the threshold is increased by a preset amount.

[0084] Method 3

[0085] In method 3, step S2 further includes the following sub-steps:

[0086] Step S2c1: Search and determine the destination floor corresponding to the largest number of passengers getting off the elevator or the longest waiting time, and add the destination floor to the selected cluster;

[0087] Step S2c2: Taking the destination floor determined in step S2c1 as the center, gradually increase the number of adjacent destination floors to the selected cluster, until the total number of passengers going down the elevator corresponding to each destination floor in the selected cluster exceeds the rated passenger capacity of the elevator that is about to arrive for the first time.

[0088] Step S2c3: Assign the destination layer contained in the selected cluster to the elevator that is the first to arrive at the main floor station after the current time.

[0089] Method 4

[0090] In method 4, step S2 further includes the following sub-steps:

[0091] Step S2d1: Along the direction of travel of the elevator after it leaves the main station, add the destination floor closest to the main station to the selected cluster;

[0092] Step S2d2: Gradually increase the number of passengers arriving at the destination floor along the running direction to the selected cluster, until the total number of passengers exiting the elevator at each destination floor in the selected cluster exceeds the rated passenger capacity of the elevator that is about to arrive for the first time;

[0093] Step S2d3: Assign the destination layer contained in the selected cluster to the elevator that is the first to arrive at the main floor station after the current time.

[0094] Method 5

[0095] In method 5, step S2 further includes the following sub-steps:

[0096] Step S2e1: Preset a positive integer parameter α, enumerate and select all combinations of no more than α destination floors from all destination floors, and select candidate combinations from all combinations where the sum of the number of passengers going down the elevator on the destination floor and the remaining available passenger capacity of the elevator about to arrive do not exceed the number threshold.

[0097] Step S2e2: Among the candidate combinations, further select the candidate combination that contains the fewest number of target layers or the smallest maximum distance between any two target layers;

[0098] Step S2e3: Assign the destination floor included in the further selected candidate combination to the first elevator that will arrive after the current time.

[0099] Method 6

[0100] In method 6, step S2 further includes the following sub-steps:

[0101] Step S2f1: Search to determine whether there exists a single destination floor where the number of passengers going down the elevator is equal to the remaining available passenger capacity of the elevator that is about to arrive, or the difference between the remaining available passenger capacity of the elevator that is about to arrive and the number of passengers waiting for the elevator at the main station corresponding to that destination floor does not exceed the quantity threshold.

[0102] Step S2f2: If there exists an elevator that will be assigned to the first elevator to arrive at the main floor after the current time, then the destination floor will be assigned according to the sub-steps in Method 4.

[0103] Method 7

[0104] In method 7, step S2 further includes the following sub-steps:

[0105] Step S2g1: Sort the destination floors of passengers waiting for the elevator at the main floor station in order, and take one end of the sorting queue as the starting point; the order can be the destination floor number or the distance from the main floor station;

[0106] Step S2g2: Starting from the starting point, accumulate the number of passengers corresponding to the destination floor. When the difference between the accumulated number and the remaining available passenger capacity of the elevator that is about to arrive is the smallest, the accumulated destination floors are grouped together.

[0107] Step S2g3: Take the target layer in the sorting queue that has not been assigned to a group and is closest to the last target layer that entered the previous accumulation as the starting point, and repeat step S2g2 until all target layers are assigned to a group.

[0108] Step S2g4: Select one group from the various groups and assign the destination floor to the elevator that is about to arrive.

[0109] It should be noted here that the first cluster selection principle mentioned above is at least one of the following principles:

[0110] Principle 1: The distance between the median of the target layer in the cluster and the primary layer station is the shortest.

[0111] Principle 2: The maximum value of the waiting time for the destination layer contained in the cluster is maximized;

[0112] Principle 3: The cluster contains the largest cumulative value of waiting time for the destination layer;

[0113] Principle 4: The cluster contains the smallest possible target layer;

[0114] Principle 5: The sum of the number of passengers exiting the elevator corresponding to the destination floor contained in the cluster is closest to the available passenger capacity of the elevator.

[0115] Example 2

[0116] The elevator dispatching method in this embodiment further includes: step S4, updating historical data;

[0117] The method for updating historical data in step S4 is as follows: after the elevator about to arrive completes its stop at each destination floor and obtains the data on the number of passengers getting off at that destination floor, the data is added to the historical data; or after the elevator about to arrive completes its transport to all destination floors assigned this time and obtains the data on the number of passengers getting off at each destination floor, the data is added to the historical data.

[0118] For methods 1 and 2 in step S2, after completing one transport of all clusters, the passenger transport for that time period is completed. Then, the next time period is estimated, and the process is: estimate-assign-notify-update. That is, the movement of the estimated time period occurs after one transport of all clusters is completed. Similarly, after one transport of all clusters is completed, the newly generated data for that period is added to the historical data, and the time corresponding to the data is the start time of that time period.

[0119] The other methods involve estimating passenger information each time an elevator is about to arrive at a main floor and then dispatching elevators accordingly. To improve accuracy, the estimation data is made using the most up-to-date available data. Therefore, this data is added to the historical data after each elevator stops at a destination floor and the passenger disembarking at that floor is obtained; or, after the elevator has transported passengers to all destination floors in its current allocation and the passenger disembarking data for each destination floor is obtained, the data is added to the historical data.

[0120] Example 3

[0121] The elevator dispatching method in this embodiment further includes: step S5, updating the estimation result;

[0122] For methods 1 and 2 in Embodiment 1, the method for updating the estimation result in step S5 is as follows: when the transportation of each destination layer in the selected cluster is completed, if there are stranded passengers in each destination layer of the selected cluster at the main station, the number of stranded passengers is increased to the number of passengers going from the main station to the corresponding destination layer in the next preset time period.

[0123] The present invention has been described in detail above through specific embodiments and examples, but these are not intended to limit the invention. Many modifications and improvements can be made by those skilled in the art without departing from the principles of the invention, and these should also be considered within the scope of protection of the present invention.

Claims

1. An elevator dispatching method, characterized in that, Includes the following steps: Step S1: Estimate the destination floor of passengers waiting for elevators at the main station and the number of passengers getting off the elevator corresponding to each destination floor based on historical data; Step S2: Based on the estimation results, determine the destination floors that the elevators that are about to arrive at the main station will stop at. The destination floors refer to the various destination floors that the elevators that are about to arrive will stop at in their next operating cycle. The estimation results include the destination floors of the passengers waiting for the elevators at the main station and the number of passengers corresponding to each destination floor. Step S3: Inform the waiting passengers that the elevator will stop at the destination floor in its next operating cycle. The estimation method based on historical data in step S1 is as follows: Based on initial perception, it is inferred that the number of passengers exiting the elevator at each destination floor and corresponding destination during the current preset time period will follow the pattern of the number of passengers exiting the elevator at each destination floor and corresponding destination before the current preset time period. By using historical data prior to the current preset time period, the pattern is extended to the current preset time period to predict the destination floors and the corresponding number of passengers exiting the elevator during the current preset time period. The first understanding means that the number of destination floors and the corresponding number of passengers disembarking in the current preset time period will not change abruptly compared to the number of destination floors and the corresponding number of passengers disembarking in at least one time period or at least one operating cycle before the current preset time period.

2. The elevator dispatching method according to claim 1, characterized in that, The historical data refers to the destination floors and the corresponding number of passengers exiting the elevator in the previous time period or the previous operating cycle of the current preset time period. The pattern is that the number of destination floors and the corresponding number of passengers getting off the elevator in the current preset time period is approximately equal to the number of destination floors and the corresponding number of passengers getting off the elevator in the previous time period or the previous operating cycle. Step S1 directly uses the destination floors and the corresponding number of passengers getting off the elevator in the previous time period or the previous operating cycle of the current preset time period as the destination floors and the corresponding number of passengers getting off the elevator in the current preset time period.

3. The elevator dispatching method according to claim 1, characterized in that, The historical data refers to the destination floors and the number of passengers exiting the elevator in the two time periods or two operating cycles prior to the current preset time period. The rule is that the first change is equal to the second change. The first change refers to the change in the number of destination floors and the number of passengers getting off the elevator in the current preset time period relative to the number of destination floors and the number of passengers getting off the elevator in the previous time period or the previous operating cycle. The second change refers to the change in the number of destination floors and the number of passengers getting off the elevator in the previous time period or the previous operating cycle relative to the number of destination floors and the number of passengers getting off the elevator in the two time periods or the two operating cycles before the current preset time period. Step S1 obtains the destination floors and the number of passengers descending the elevator in the current preset time period by adding the second change amount to the number of destination floors and the number of passengers descending the elevator in the previous time period or the previous operating cycle in the current preset time period.

4. The elevator dispatching method according to claim 1, characterized in that, The historical data refers to the destination floors and the corresponding number of passengers disembarking from the elevator in multiple time periods or multiple operating cycles prior to the current preset time period. The pattern is a curve representing the number of passengers exiting the elevator for each destination floor. The curve is formed by smoothly connecting multiple points, with the number of passengers exiting the elevator as the vertical axis and the corresponding time or order as the horizontal axis. Step S1 involves extending the curve to the current preset time period to obtain the destination floors and the corresponding number of passengers exiting the elevator.

5. The elevator dispatching method according to claim 1, characterized in that, Step S2 further includes the following sub-steps: Step S2a1: Perform cluster analysis on the destination layer of the docking to obtain several clusters; Step S2a2: Determine at least one selected cluster according to the preset first cluster selection principle; Step S2a3: Assign the destination layer contained in the selected cluster to the elevator that is about to arrive.

6. The elevator dispatching method according to claim 5, characterized in that, When the number of passengers exiting the elevator on the destination floor included in the selected cluster exceeds the remaining available passenger capacity of the elevator, the excess portion is added to the number of passengers exiting the elevator on the corresponding destination floor when determining the floor to which the next arriving elevator will stop, and the waiting time for the corresponding destination floor is updated.

7. The elevator dispatching method according to claim 5, characterized in that, When the number of passengers descending to the destination floor in the first selected cluster is less than the remaining available passenger capacity of the elevator, a second selected cluster is selected from the remaining clusters according to a preset second cluster selection principle, and at least one destination floor in the second selected cluster is further assigned to the elevator that is about to arrive.

8. The elevator dispatching method according to claim 7, characterized in that, The second cluster selection principle is at least one of the following principles: Principle A: Select the cluster containing the target layer that is closest to the target layer in the first selected cluster from the remaining clusters as the second selected cluster; Principle B: Select the cluster from the remaining clusters that contains the destination floor with the number of passengers exiting the elevator that is closest to the number of remaining available elevators as the second selected cluster.

9. The elevator dispatching method according to claim 8, characterized in that, When principle A is adopted, the destination layer closest to the destination layer in the first selected cluster is assigned to the elevator that is about to arrive; When principle B is adopted, the destination floor with the number of passengers exiting the elevator closest to the number of remaining available elevators is assigned to the elevator that is about to arrive.

10. The elevator dispatching method according to claim 1, characterized in that, Step S2 further includes the following sub-steps: Step S2b1: Perform cluster analysis on the destination layer of the docking to obtain several clusters; Step S2b2: Calculate the total number of passengers descending the escalator corresponding to the destination floor in each cluster; Step S2b3: When the difference between the total number of passengers going down the stairs corresponding to the destination floor in any two adjacent clusters exceeds the threshold, the destination floors in each cluster are adjusted according to the preset adjustment method so that the difference between the total number of passengers going down the stairs corresponding to the destination floor in any two adjacent clusters does not exceed the threshold. Step S2b4: Select a cluster according to the preset first cluster selection principle; Step S2b5: Assign the destination layer contained in the selected cluster to the elevator that is about to arrive.

11. The elevator dispatching method according to any one of claims 5 and 10, characterized in that, The selection principle for the first cluster is at least one of the following principles: Principle 1: The distance between the median of the target layer in the cluster and the primary layer station is the shortest. Principle 2: The maximum value of the waiting time for the destination layer contained in the cluster is maximized; Principle 3: The cluster contains the largest cumulative value of waiting time for the destination layer; Principle 4: The cluster contains the smallest possible target layer; Principle 5: The sum of the number of passengers exiting the elevator corresponding to the destination floor contained in the cluster is closest to the available passenger capacity of the elevator.

12. The elevator dispatching method according to claim 10, characterized in that, The preset adjustment method in step S2b3 is as follows: Step A1: For two given adjacent clusters, determine the median of the target layer in each cluster; Step A2: Determine the specific target layer in each of the two adjacent clusters. The specific target layer refers to the target layer in the cluster that is located between the two medians. Step A3: Assign several specific destination layers from the cluster with the larger total number of passengers exiting the escalator to the cluster with the smaller total number of passengers exiting the escalator.

13. The elevator dispatching method according to claim 12, characterized in that, When dividing the target layer of the cluster, a specific target layer that is far from the median target layer of the original cluster is selected for transfer.

14. The elevator dispatching method according to claim 10, characterized in that, When a cluster with a larger total number of passengers descending the escalator is located between a cluster with a smaller total number of passengers descending the escalator and the main floor station, the threshold is reduced by a preset amount; when a cluster with a smaller total number of passengers descending the escalator is located between a cluster with a larger total number of passengers descending the escalator and the main floor station, the threshold is increased by a preset amount.

15. The elevator dispatching method according to claim 1, characterized in that, Step S2 further includes the following sub-steps: Step S2c1: Search and determine the destination floor corresponding to the largest number of passengers getting off the elevator or the longest waiting time, and add the destination floor to the selected cluster; Step S2c2: Taking the destination floor determined in step S2c1 as the center, gradually increase the number of adjacent destination floors to the selected cluster, until the total number of passengers going down the elevator corresponding to each destination floor in the selected cluster exceeds the rated passenger capacity of the elevator that is about to arrive for the first time. Step S2c3: Assign the destination layer contained in the selected cluster to the elevator that is the first to arrive at the main floor station after the current time.

16. The elevator dispatching method according to claim 1, characterized in that, Step S2 further includes the following sub-steps: Step S2d1: Along the direction of travel of the elevator after it leaves the main station, add the destination floor closest to the main station to the selected cluster; Step S2d2: Gradually increase the number of passengers arriving at the destination floor along the running direction to the selected cluster, until the total number of passengers exiting the elevator at each destination floor in the selected cluster exceeds the rated passenger capacity of the elevator that is about to arrive for the first time; Step S2d3: Assign the destination layer contained in the selected cluster to the elevator that is the first to arrive at the main floor station after the current time.

17. The elevator dispatching method according to claim 1, characterized in that, Step S2 further includes the following sub-steps: Step S2e1: Preset a positive integer parameter α, enumerate and select all combinations of no more than α destination floors from all destination floors, and select candidate combinations from all combinations where the sum of the number of passengers going down the elevator on the destination floor and the remaining available passenger capacity of the elevator about to arrive do not exceed the number threshold. Step S2e2: Among the candidate combinations, further select the candidate combination that contains the fewest number of target layers or the smallest maximum distance between any two target layers; Step S2e3: Assign the destination floor included in the further selected candidate combination to the first elevator that will arrive after the current time.

18. The elevator dispatching method according to claim 1, characterized in that, Step S2 further includes the following sub-steps: Step S2f1: Search to determine whether there exists a single destination floor where the number of passengers going down the elevator is equal to the remaining available passenger capacity of the elevator that is about to arrive, or the difference between the remaining available passenger capacity of the elevator that is about to arrive and the number of passengers waiting for the elevator at the main station corresponding to that destination floor does not exceed the quantity threshold. Step S2f2: If there exists an elevator that will be assigned to the destination floor and will be the first elevator to arrive at the main floor station after the current time. If it does not exist, then the elevator that is about to arrive will be assigned.

19. The elevator dispatching method according to claim 1, characterized in that, Step S2 further includes the following sub-steps: Step S2g1: Sort the destination floors of the passengers waiting for the elevator at the main floor station in order, and take one end of the sorting queue as the starting point; Step S2g2: Starting from the starting point, accumulate the number of passengers corresponding to the destination floor. When the difference between the accumulated number and the remaining available passenger capacity of the elevator that is about to arrive is the smallest, the accumulated destination floors are grouped together. Step S2g3: Take the destination layer in the sorting queue that has not been assigned to a group and is closest to the destination layer that last entered the previous accumulation as the starting point, and repeat step S2g2 until all destination layers are assigned to a group. Step S2g4: Select one group from the various groups and assign the destination floor to the elevator that is about to arrive.

20. The elevator dispatching method according to claim 1, characterized in that, The elevator dispatching method also includes: Step S4: Update historical data; The method for updating historical data in step S4 is as follows: after the elevator about to arrive completes its stop at each destination floor and obtains the data on the number of passengers getting off at that destination floor, the data is added to the historical data; or after the elevator about to arrive completes its transport to all destination floors assigned this time and obtains the data on the number of passengers getting off at each destination floor, the data is added to the historical data.

21. The elevator dispatching method according to claim 5 or 10, characterized in that, The elevator dispatching method also includes: Step S5: Update the estimation results; The method for updating the estimation result in step S5 is as follows: when the transportation of each destination layer in the selected cluster is completed, if there are stranded passengers in each destination layer of the selected cluster at the main station, the number of stranded passengers is increased to the number of passengers going from the main station to the corresponding destination layer in the next preset time period.

Images