CN117208689A

CN117208689A - Decentralized standby control method of elevator and elevator group management system

Info

Publication number: CN117208689A
Application number: CN202311081628.4A
Authority: CN
Inventors: 陈玉东
Original assignee: Shanghai Mitsubishi Elevator Co Ltd
Current assignee: Shanghai Mitsubishi Elevator Co Ltd
Priority date: 2023-08-25
Filing date: 2023-08-25
Publication date: 2023-12-12

Abstract

The invention provides a decentralized standby control method of an elevator and an elevator group management system, which relate to the technical field of elevator control and comprise the following steps: acquiring historical call data of each elevator in a building; processing historical call data to obtain call probability of call signals of all floors in a building, wherein the call probability corresponding to a certain floor refers to probability of the call signals taking the floor as a departure floor in future preset time from the current moment; acquiring current operation information of each elevator in a building, wherein the current operation information comprises the current position and the operation state of the elevator; the elevator with the idle running state is regarded as an idle elevator, and the current position of the idle elevator is further determined according to the current running information; determining a standby floor and a standby elevator corresponding to the standby floor according to the call probability of each floor and the current position of the idle elevator; and controlling each standby elevator to run to the corresponding standby floor to wait for calling. The elevator waiting time and electric energy consumption combined elevator has the beneficial effects that the elevator waiting time and the electric energy consumption are combined.

Description

Decentralized standby control method of elevator and elevator group management system

Technical Field

The invention relates to the technical field of elevator control, in particular to a decentralized standby control method of an elevator and an elevator group management system.

Background

The scattered standby function of an elevator means that an idle elevator is scattered standby at any floor of a building, and response performance to the vicinity thereof is improved. When the passenger flow is low and part of elevators are in an idle state, the waiting time required by passengers when taking the elevator at or near the waiting floor can be obviously shortened by reasonably selecting the waiting floor and allocating the idle elevators to the waiting floor.

For the decentralized standby control problem, the prior art discloses various schemes such as:

patent document No. cn200710004714.X discloses determining a waiting floor based on the result of prediction of the traffic flow at each floor and the prediction of the operation of an elevator car that received an elevator call;

patent document CN201110241188.5 discloses that the power consumption when the elevator cars move to the dispersion waiting floor but no passengers take the elevator is reduced as much as possible by allowing or prohibiting the dispersion waiting instruction according to the power consumption when each elevator car moves to the dispersion waiting floor;

patent document CN201210300709.4 discloses that a floor having a high hall call occurrence frequency in approximately the same time zone is determined as a standby floor based on a past hall call occurrence frequency history.

Although the above-described aspects have disclosed the idea of predicting the elevator riding demand based on each floor and the idea of considering the power consumption of the elevator moving from the current position to the standby floor, no method is given as to how to decide the actual number of standby elevators and how to select the standby elevator actually waiting at the standby floor while taking the standby time and the power consumption into consideration.

How to determine the number of actual waiting elevators, which elevators should be selected as actual waiting elevators and how to better determine the waiting floors is thus a technical problem to be solved.

Disclosure of Invention

According to the above technical problems existing in the prior art, a decentralized standby control method and an elevator group management system for elevators are provided, which aim to determine the number of standby elevators and which elevators are used as standby elevators and specific decentralized motor floors on the basis of considering the power consumption of the elevators from the current position to the standby floors, the moving distance of the elevators from the standby floors to the call signal generation floors and the waiting time of passengers, and realize the compromise between the waiting time and the power consumption. The technical scheme specifically comprises the following steps:

a decentralized standby control method of an elevator, comprising:

Step 1, acquiring historical call data of each elevator in a building, wherein the historical call data at least comprises call registration time when passengers register call signals and departure floors of the call signals;

step 2, processing the historical call data to obtain the call probability of the call signal of each floor in the building, wherein the call probability corresponding to a certain floor refers to the probability of the call signal taking the floor as the departure floor in the future preset time from the current moment;

step 3, obtaining current operation information of each elevator in the building, wherein the current operation information comprises the current position and the operation state of the elevator;

step 4, recognizing the elevator with the idle running state as an idle elevator, and further determining the current position of the idle elevator according to the current running information;

step 5, determining a standby floor and a standby elevator corresponding to the standby floor according to the call probability of each floor and the current position of the idle elevator;

and 6, controlling each standby elevator to run to the corresponding standby floor to wait for calling.

Preferably, the step 2 further includes:

Extracting a part of the historical call data, which is located in the preset duration after the current time, of the call registration time as extracted historical call data;

counting the total number of calls appearing in the extracted historical call data and the number of sub-calls of each departure floor;

and respectively calculating the ratio of the number of sub-calls to the total number of calls of each departure floor, and taking the calculated result as the probability of the calls corresponding to the departure floor.

Preferably, the step 5 further comprises the sub-steps of:

step 51, screening out high probability floors from all floors of the building according to the call probability of all floors;

a substep 52 of judging whether the number of the high-probability floors is greater than the number of the idle elevators, if yes, entering a substep 53, otherwise, entering a substep 54;

a substep 53 of adjusting the number of high-probability floors to be equal to or less than the number of free elevators;

and a sub-step 54 of determining the standby floor and the corresponding standby elevator according to the floor position of the high-probability floor and the current position of the idle elevator.

Preferably, the substep 51 screens the high probability floor using any one of the following screening methods:

Screening mode one: taking the floor with the call probability larger than a preset probability threshold as the high probability floor;

screening mode II: firstly, carrying out cluster analysis on each call probability to obtain a plurality of cluster groups, then calculating the group probability of each cluster group, and finally taking the floor corresponding to the call probability in the cluster group with the largest group probability as the high probability floor, wherein the group probability is an index for reflecting the overall size of all call probabilities in the corresponding cluster group.

Preferably, for a given cluster group, the substep 51 calculates the group probability in any of the following ways:

the first calculation mode is to take the average value of all call probabilities in the clustering group as the group probability of the clustering group;

calculating a second mode, wherein the maximum value of all call probabilities in the clustering group is used as the group probability of the clustering group;

calculating a third mode, wherein the minimum value of all call probabilities in the clustering group is used as the group probability of the clustering group;

and calculating a mode IV, wherein the median of all call probabilities in the clustering group is used as the group probability of the clustering group.

Preferably, the substep 53 implements the adjustment of the number of high-probability floors with any one of the following implementations:

The implementation mode is as follows: firstly, sorting the high-probability floors according to the corresponding order from high to low of the call probability, and then selecting the high-probability floors which are not more than the number of the idle elevators from the sorted high-probability floors according to the order from front to back as new high-probability floors;

the implementation mode II is as follows:

s1, sorting the high-probability floors according to positions in a building;

s2, calculating the distances between all adjacent high-probability floors;

s3, selecting the adjacent high-probability floor corresponding to the smallest distance from all the unselected adjacent high-probability floors as the selected adjacent high-probability floor;

s4, deleting one of the selected adjacent high-probability floors from the high-probability floors;

s5, judging whether the number of the current high-probability floors does not exceed the number of the idle elevators, if so, ending, otherwise, returning to the step S1.

The implementation mode II is as follows:

s1, sorting the high-probability floors according to positions in a building;

s2, calculating the distances between all adjacent high-probability floors;

s5, judging whether the number of the current high-probability floors does not exceed the number of the idle elevators, if so, ending, otherwise, returning to the step S1;

and the implementation mode is three: gradually increasing the preset probability threshold until the number of the high probability floors screened out by the sub-step 51 in the screening manner is equal to or smaller than the free elevator for the first time, and taking the high probability floors at the moment as new high probability floors.

Preferably, the substep 54 determines each of the high probability floors as the standby floors, and determines the standby elevator corresponding to each of the standby floors by minimizing a first elevator movement payout for each of the free elevators to move from the current position to the corresponding standby floor, the first elevator movement payout being a sum of payouts required for each of the free elevators to move from the current position to the corresponding standby floor.

Preferably, said sub-step 54 determining said standby elevator corresponding to each said standby floor comprises:

step A1, enumerating all possible idle elevator combinations of m idle elevators selected from all the idle elevators, wherein m is the number of the high-probability floors;

step A2, enumerating all possible corresponding relations for each free elevator combination, wherein the corresponding relations are one-to-one corresponding relations between each free elevator contained in the free elevator combination and each high-probability floor;

step A3, calculating the first elevator movement and payment corresponding to the corresponding relation according to the position of each free elevator in the free elevator combination and the floor position of each standby floor aiming at each corresponding relation of each free elevator combination;

and A4, extracting the corresponding relation corresponding to the smallest first elevator movement and payment, taking the corresponding relation as a selected corresponding relation, taking each idle elevator in the selected corresponding relation as the standby elevator, and determining the standby floor corresponding to each standby elevator according to the corresponding relation.

Preferably, the sub-step 54 determines the high probability floor as the standby floor and determines the standby elevator corresponding to each of the standby floors by minimizing total elevator movement effort;

the total elevator movement effort is the weighted sum of the sum of a first elevator movement effort and a second elevator movement effort, the first elevator movement effort is the elevator movement effort when each free elevator moves to the standby floor corresponding to the free elevator from the current position, and the second elevator movement effort is the elevator movement effort required when the free elevator responds to a call signal appearing on a call floor of a floor coverage area corresponding to the standby floor corresponding to the free elevator and moves to the call floor from the standby floor corresponding to the free elevator.

Preferably, the determining the standby elevator corresponding to each standby floor by minimizing the elevator movement sum payment further includes:

Step A3, for each corresponding relation of each free elevator combination, calculating to obtain the first elevator movement effort corresponding to the corresponding relation according to the current position of each free elevator in the free elevator combination and the floor position of each standby floor, calculating to obtain the second elevator movement effort corresponding to the corresponding relation according to the standby floor corresponding to each free elevator in the free elevator combination, and calculating the weighted sum of the first elevator movement effort and the second elevator movement effort or the weighted sum of the first elevator movement effort and the second elevator movement effort to obtain the elevator total movement effort corresponding to the corresponding relation;

and A4, extracting the corresponding relation corresponding to the minimum elevator moving total payment, taking the corresponding relation as a selected corresponding relation, taking each idle elevator in the selected corresponding relation as the standby elevator, and determining the standby floor corresponding to each standby elevator according to the corresponding relation.

Preferably, the determining the standby floor and the corresponding standby elevator in the substep 54 includes:

step B1, configuring the number of standby floors as the number of idle elevators;

Step B2, enumerating all possible idle elevator combinations for selecting m idle elevators from all the idle elevators, wherein m is the number of standby floors;

step B3, enumerating all possible corresponding relations for each free elevator combination, wherein the corresponding relations are one-to-one corresponding relations between each free elevator contained in the free elevator combination and each standby floor;

step B4, calculating a corresponding elevator movement total payment according to the position of each free elevator in the free elevator combination and the floor position of each standby floor according to each corresponding relation of each free elevator combination, and adding the elevator movement total payment into a total payment list;

the total elevator movement effort is a weighted sum of a first elevator movement effort and a second elevator movement effort, the weight corresponding to the second elevator movement effort is larger than the weight corresponding to the first elevator movement effort, the first elevator movement effort is the elevator movement effort when each free elevator in the corresponding relation moves from the current position to the standby floor corresponding to the free elevator, and the second elevator movement effort is the elevator movement effort required when the free elevator in the corresponding relation responds to a call signal appearing on a call floor of a floor coverage area corresponding to the standby floor corresponding to the free elevator;

And B5, judging whether the number of the standby floors is 1:

if not, the number of the standby floors is reduced by 1, and then the step B2 is returned;

if yes, turning to a step B6;

and B6, extracting the corresponding relation corresponding to the minimum elevator moving total payment from the total payment list, taking each idle elevator in the idle elevator combination corresponding to the corresponding relation as the standby elevator, and determining the standby floor corresponding to each standby elevator according to the corresponding relation.

Preferably, for each of the correspondence relationships corresponding to each of the free elevator groups, the substep 54 calculates the second elevator movement effort in the following manner:

m1, determining the floor coverage area corresponding to each standby floor in the corresponding relation, wherein the floor coverage area refers to that when the call signal appears on a floor in the floor coverage area, a standby elevator positioned on a certain coverage floor in the floor coverage area responds to the call signal;

m2, selecting the unselected standby floor as a selected standby floor;

Step M3 of calculating, as a single floor movement effort, products of efforts required for the standby elevator to move from the selected standby floor to each of the floor coverage areas to which the selected standby floor belongs and the probability of calls for each of the floor coverage areas, respectively;

step M4, calculating the sum of the single floor mobile payments corresponding to each coverage floor and paying out the sum as a response mobile payment of the selected standby floor;

step M5, returning to the step M2 until the unselected standby floors do not exist;

step M6, calculating the sum of all the response movements and paying out it as the second elevator movement.

Preferably, when the call signal occurs on a floor, the standby elevator located in the coverage area of the floor to which the floor belongs responds to the call signal, or the idle elevator with the least effort to move to the floor generating the call signal from the standby floor on which the idle elevator is currently located in the idle elevator combination is used as the response elevator of the call signal.

Preferably, the substep 54 is followed by a substep 55:

a sub-step 55 of judging whether remaining free elevators exist and specific floor areas meeting specific floor conditions exist, if yes, allocating one free elevator to serve as the standby elevator of the specific floor area for each specific floor area, otherwise, turning to the step 6;

The specific floor condition includes:

condition 1, there are consecutive floors whose number exceeds a first floor threshold;

condition 2, the standby floor is not included in the specific floor area;

the distance between the specific floor area and the nearest standby elevator exceeds a first distance threshold.

Preferably, allocating one of the free elevators as the standby elevator for the floor area to the specific floor area includes:

when only one specific floor area exists, taking the rest idle elevator nearest to the specific floor area as the standby elevator of the specific floor area;

when there are a plurality of specific floor areas, one floor in the specific floor area is selected as the standby floor of the specific floor area, the remaining free elevator is used as the free elevator, the standby floor is used as the high probability floor, and the standby elevator is allocated to the specific floor area by adopting any one of the scattered standby control methods.

Preferably, the mode of selecting one floor in the specific floor area as the standby floor of the specific standby floor includes any one of the following modes of selection:

Selecting a first mode: taking the floor with the highest probability of calling in the specific floor area as the standby floor;

and a second selection mode: taking the floor closest to the rest free elevators in the specific floor area as the standby floor;

and selecting a third mode: taking the central floor in the specific floor area as the standby floor;

and a fourth selection mode: multiplying the distance between the floor and the rest of the floors in the specific floor area by the floor with the smallest sum of the call probabilities of the corresponding rest of the floors as the standby floor;

selecting a fifth mode: the floor in the floor area, in which the difference between the sum of the call probabilities of the floors above and the sum of the call probabilities of the floors below is the smallest, is the waiting floor.

Preferably, the step 5 further comprises the sub-steps of:

sub-step 5-1 enumerating all possible free elevator combinations of any elevator from among all free elevators that does not exceed the number of service floors, the number of service floors being the total number of all service floors in the building in which the elevator is located;

Step 5-2, enumerating all corresponding relations between the free elevators in the free elevator combination and the service floor layer for each free elevator combination;

step 5-3, for each corresponding relation, calculating a total elevator movement effort between the free elevator moved from the current position to the service floor corresponding to the free elevator, wherein the total elevator movement effort is a weighted sum of a first elevator movement effort and a second elevator movement effort, and the weight corresponding to the second elevator movement effort is larger than the weight corresponding to the first elevator movement effort, the first elevator movement effort is an elevator movement effort when each free elevator in the corresponding relation moves from the current position to the service floor corresponding to the free elevator, and the second elevator movement effort is an elevator movement effort required when the free elevator in the corresponding relation responds to a call signal appearing on a call floor of a floor coverage area corresponding to the service floor corresponding to the free elevator;

and a substep 5-4, wherein the idle elevator in the idle elevator combination in the corresponding relation corresponding to the smallest elevator moving total payment is used as the standby elevator, and the service floor corresponding to the standby elevator is used as the standby floor.

Preferably, the step 5 further comprises the sub-steps of:

substep 501, reducing the number of service floors of the free elevator and the building in which the elevator is located by using pretreatment mode 1 and/or pretreatment mode 2:

the preprocessing mode 1, taking a call floor corresponding to a regular call event within a preset time period in the future as a standby floor, determining the standby elevator for the standby floor according to a first movement paying minimum principle, and deleting the standby floor from a service floor and deleting the standby elevator from the idle elevator;

a preprocessing mode 2, wherein a high probability floor in the service floors is taken as a standby floor, the standby elevator is determined for the standby floor according to a first mobile payment minimum principle, and meanwhile, the standby floor is deleted from the service floors, and the standby elevator is deleted from the standby elevators;

a substep 502, taking the rest of the idle elevators as new idle elevators, taking the rest of the service floors as new service floors, and determining the standby floors and the corresponding standby elevators according to the new service floors and the new idle elevators;

substep 503, combining the standby floor determined by the preprocessing mode 1 and/or the preprocessing mode 2 and the corresponding standby elevator with the result of the substep 502, and taking the combined result as the final standby floor and standby elevator.

Preferably, the step 502 determines the standby floor and its corresponding standby elevator for a new service floor and a new free elevator according to the following substeps:

sub-step 502-1 enumerating all possible free elevator combinations of any elevator from among all new free elevators that does not exceed the number of new service floors;

step 502-2, enumerating all corresponding relations between the free elevators in the free elevator combination and the service floor layer for each free elevator combination;

step 502-3, for each corresponding relation, calculating a total elevator movement effort between the free elevator moving from the current position to the service floor corresponding thereto, wherein the total elevator movement effort is a weighted sum of a first elevator movement effort and a second elevator movement effort, and the weight corresponding to the second elevator movement effort is greater than the weight corresponding to the first elevator movement effort, the first elevator movement effort is an elevator movement effort when each free elevator in the corresponding relation moves from the current position to the service floor corresponding thereto, and the second elevator movement effort is an elevator movement effort required when the free elevator in the corresponding relation responds to a call signal occurring on a call floor of the service floor corresponding thereto, and the standby floor corresponding thereto moves to the call floor;

And step 502-4, taking the idle elevator in the idle elevator combination in the corresponding relation corresponding to the smallest elevator moving total payment as the standby elevator, and taking the service floor corresponding to the standby elevator as the standby floor.

Preferably, in the step 5, the service floor of the building where the elevator is located is divided into a plurality of floor areas, each floor area is taken as a new service floor, and the standby floor and the standby elevator are determined for each floor area.

Preferably, the means for determining the standby floor for each of the floor areas includes any one of the following selection means:

selecting a first mode: taking the floor with the highest probability of calling in the floor area as the standby floor;

and a second selection mode: taking the central floor in the floor area as the standby floor;

and selecting a third mode: multiplying the floor with the smallest sum of the call probabilities of the corresponding remaining floors by the distance between the remaining floors in the floor area as the standby floor;

and a fourth selection mode: the floor in the floor area, the sum of the call probabilities of the floors in the upper portion of the floor area and the sum of the call probabilities of the floors in the lower portion of the floor area are the standby floor, and the floor in which the difference between the sum of the call probabilities of the floors in the upper portion of the floor area and the sum of the call probabilities of the floors in the lower portion of the floor area is the standby floor.

Preferably, determining the standby elevator for each of the standby floors comprises the sub-steps of:

a substep C1, enumerating all possible free elevator combinations of any elevator selected from all free elevators not exceeding the number of standby floors;

step C2, enumerating all corresponding relations between the idle elevators in the idle elevator combination and the standby floor layer for each idle elevator combination;

a substep C3, for each corresponding relation, calculating a total elevator movement effort between the idle elevator moving from the current position to the standby floor corresponding to the idle elevator, wherein the total elevator movement effort is a weighted sum of a first elevator movement effort and a second elevator movement effort, and the weight corresponding to the second elevator movement effort is greater than the weight corresponding to the first elevator movement effort, the first elevator movement effort is an elevator movement effort when each idle elevator in the corresponding relation moves from the current position to the standby floor corresponding to the idle elevator, and the second elevator movement effort is an elevator movement effort required when the idle elevator in the corresponding relation responds to a call signal appearing on a call floor of a floor coverage area corresponding to the standby floor corresponding to the idle elevator;

And C4, taking the idle elevator in the idle elevator combination in the corresponding relation corresponding to the smallest elevator moving total payment as the standby elevator, and taking the standby floor corresponding to the standby elevator as the standby floor.

Preferably, in the preprocessing mode 1, when the number of regular call events in the preset time period in the future is greater than the number of idle elevators, or the difference between the number of regular call events in the preset time period in the future and the number of idle elevators is greater than a preset difference threshold,

and counting the occurrence time interval between two adjacent regular call events, and if the occurrence time interval is larger than the response completion time of the previous regular call event, shortening the preset duration so that the preset duration only comprises the previous regular call event.

The invention also provides an elevator group management system which adopts the scattered standby control method to carry out standby control on each idle elevator in the building.

The beneficial effects of the technical scheme are as follows: on the basis of considering the power consumption of the elevator moving from the current position to the standby floor, the moving distance of the elevator moving from the standby floor to the call signal generation floor and the waiting time of passengers, the number of the standby elevators, which elevators are used as the standby elevators and specific scattered motor floors are determined, and the balance between the waiting time and the power consumption is realized.

Drawings

Fig. 1 is a general flow diagram of a decentralized standby control method for an elevator in a preferred embodiment of the invention;

FIG. 2 is a schematic flow chart of the substeps of step 5 in the first embodiment of the present invention;

fig. 3 is a schematic flow chart of the adjustment of the number of floors with two pairs of high probability in the first embodiment of the present invention;

fig. 4 is a schematic flow chart of the standby elevator corresponding to each standby floor determined in step 54 in the first embodiment of the present invention;

fig. 5 is a schematic flow chart of determining a standby elevator corresponding to each standby floor by minimizing the total payment of elevator movement in the second embodiment of the present invention;

fig. 6 is a schematic flow chart of calculating the second elevator motion effort in step 54 in the second embodiment of the present invention;

fig. 7 is a schematic flow chart of a sub-step 54 of determining a standby floor and a corresponding standby elevator in a third embodiment of the present invention;

FIG. 8 is a flow chart of the sub-steps of step 5 in a second embodiment of the present invention;

FIG. 9 is a flow chart of the substeps of step 5 in embodiment three of the invention;

fig. 10 is a schematic flow chart of a treatment process of the pretreatment mode 1 in the third embodiment of the present invention;

Fig. 11 is a schematic flow chart of determining a standby floor and its corresponding standby elevator for a new service floor and a new free elevator in step 502 in the third embodiment of the present invention;

fig. 12 is a schematic flow chart of a standby elevator determination for each standby floor in the fourth embodiment of the present invention.

Detailed Description

The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

It should be noted that, without conflict, the embodiments of the present invention and features of the embodiments may be combined with each other.

The invention is further described below with reference to the drawings and specific examples, which are not intended to be limiting.

In a preferred embodiment of the present invention, based on the above-mentioned technical problems existing in the prior art, a method for controlling a decentralized standby of an elevator is provided, which is used for controlling a decentralized standby of an elevator group formed by all elevators in a building, especially for controlling a decentralized standby of an idle elevator, so that the idle elevator can run to a corresponding standby floor to wait for a call with a minimum paying cost, and thus, when a passenger calls, the elevator waiting time of the passenger can be quickly responded, and the passenger waiting time is effectively reduced.

As shown in fig. 1, the method for controlling the elevator in a decentralized standby mode specifically includes:

step 2, processing historical call data to obtain call probability of call signals of all floors in a building, wherein the call probability corresponding to a certain floor refers to probability of the call signals taking the floor as a departure floor in a future preset time from the current moment;

The call probability is the call probability of a preset time length in the future after the current moment. It can be seen that the call probability is a predicted value, and in this embodiment, the step 2 of obtaining the call probability further includes:

Extracting a part of the historical call data, which is located in a preset time period after the current time, of the call registration time as extracted historical call data;

and respectively calculating the ratio of the number of sub calls to the total number of calls of each departure floor, and taking the calculated result as the probability of calling of the corresponding departure floor.

Specifically, considering that the passenger flow of the elevator tends to change regularly along with time and week, such as the elevator in an office building, the passenger flow of the early-work peak and the late-work peak can be larger, and the passenger flow of monday to friday relative to the weekend can be larger, the historical call data of the same time period as the future preset time period can be adopted to estimate the call probability when the call probability is predicted. If the current moment is eight points on Monday and the probability of eight-point to eight-point two-tenth of calls needs to be predicted, historical call data of eight points on Monday to eight-point two-tenth of last Monday can be extracted, the total number of calls and the corresponding number of sub-calls are counted, and then the corresponding probability of calls is calculated. In the case that the data amount of the historical call data is sufficient, the historical call data from eight points to two ten points on the last monday can be extracted at the same time to participate in calculation, and so on.

Furthermore, the passenger flow of the elevator also shows regular change along with holidays, such as the elevator in an office building, the passenger flow of the elevator is also eight points on monday, the probability of calling is needed to be predicted from eight points to eight points by two ten minutes, the passenger flow of the holiday is obviously reduced, the historical calling data participation calculation result of the last monday is certainly inaccurate, the continuity of the passenger flow change of the elevator and the slowness of the change are considered, in other words, the passenger flow of the elevator generally does not mutate, particularly when the passenger flow is smaller and the elevator is in a relatively idle state, the calling probability can be calculated based on the historical calling data of a preset time period before the current moment, and the historical calling data participation calculation can also be based on the historical calling data of the same holiday under the condition that the data amount of the historical calling data is sufficient, and the situation is not limited.

It will be appreciated that the above is merely taken as an example of an office building, and other buildings are analogically different in that the change rule of the traffic flow may be different, for example, the traffic flow of a mall is usually opposite to the traffic flow of the office building, but the concept of calculating the probability of a call may be similar.

The current running information of each elevator comprises the current position and the running state of the elevator, and the running state indicates whether the elevator is in an idle state or an operating state, wherein the operating state can comprise a passenger carrying running state and an idle response call state, and the corresponding idle state can be regarded as an idle and non-response call state. The current position of the elevator may be the current running floor or stopping floor of the elevator.

After the idle elevators are determined, the idle elevators can be subjected to distributed standby control, namely, corresponding standby floors are allocated to the idle elevators, so that the idle elevators can wait for a call at the corresponding standby floors, and the waiting time of passengers is shortened.

Embodiment one:

in this embodiment, as shown in fig. 2, step 5 further includes the following sub-steps:

step 51, screening out high probability floors from all floors of the building according to call probability of all floors;

step 52, judging whether the number of the high-probability floors is larger than the number of the idle elevators, if yes, entering a step 53, otherwise, entering a step 54;

step 53, the number of the high probability floors is adjusted to be less than or equal to the number of the idle elevators;

and a substep 54, determining a standby floor and a corresponding standby elevator according to the floor position of the high-probability floor and the current position of the idle elevator.

Specifically, the number of elevators in the building is relatively small for the number of floors in the building, and usually, idle elevators cannot be allocated to each floor correspondingly, so that before standby elevator allocation is performed, floors which can be matched with the number of idle elevators need to be screened out, idle elevators are allocated to the screened floors, and one-to-one correspondence between the floors and the idle elevators is realized. In this embodiment, first, high probability floors that are more likely to generate a call signal in a future time at a current moment are screened based on call probability, and preliminary adjustment of the number of floors is implemented, where any of the following screening modes may be used to screen the high probability floors:

Screening mode one: taking a floor with the call probability larger than a preset probability threshold as a high probability floor;

screening mode II: firstly, carrying out cluster analysis on each call probability to obtain a plurality of cluster groups, then calculating the group probability of each cluster group, and finally taking the floor corresponding to the call probability in the cluster group with the largest group probability as a high probability floor, wherein the group probability is an index for reflecting the overall size of all call probabilities in the corresponding cluster group.

Further, for a given cluster group, the group probability may be calculated in any of the following ways:

the second calculation mode is to take the maximum value of all call probabilities in the clustering group as the group probability of the clustering group;

the third calculation mode is to take the minimum value of all call probabilities in the clustering group as the group probability of the clustering group;

and a fourth calculation mode, wherein the median of all call probabilities in the cluster group is used as the group probability of the cluster group.

If the number of the screened high-probability floors still does not meet the condition of being smaller than or equal to the number of the idle elevators, further adjustment of the high-probability floors is needed until the number of the high-probability floors is adjusted to be smaller than or equal to the number of the idle elevators.

When the screening method is adopted to screen the high-probability floors, if the number of the screened high-probability floors still does not meet the condition of being smaller than or equal to the number of idle elevators, the following implementation method can be adopted to adjust the number of the high-probability floors:

the implementation mode is as follows: firstly, sorting high probability floors according to the corresponding call probability from high to low, and then selecting high probability floors which are not more than the number of idle elevators from the sorted high probability floors according to the sequence from front to back as new high probability floors;

as shown in fig. 3, implementation two:

s1, sorting high-probability floors according to positions in a building;

s2, calculating the distances between all adjacent high-probability floors;

s3, selecting the adjacent high-probability floor corresponding to the minimum distance from all the unselected adjacent high-probability floors as the selected adjacent high-probability floor;

and the implementation mode is three: the preset probability threshold is gradually increased until the number of the high probability floors screened out by the first screening mode in the substep 51 is equal to or smaller than the idle elevator for the first time, and the high probability floors at this time are taken as new high probability floors.

Specifically, in this embodiment, for the second implementation manner, taking the order of the high probability floors as L1, L4, L7, and L9 and the number of free elevators as 2 as an example, two floors need to be screened out, where the distance between L1 and L4 is 3 floors, the distance between L4 and L7 is 3 floors, the distance between L7 and L9 is 2 floors, L7 and L9 are selected as adjacent high probability floors, then L7 is deleted (L9 may be deleted), the new high probability floors are formed in the order of L1, L4, L9, the distance between L1 and L4 is 3 floors, and the distance between L4 and L9 is 5 floors, then L1 and L4 are selected as adjacent high probability floors, then L1 is deleted (L4 may be deleted), and L4 and L9 are obtained as the final high probability floors, and the second implementation manner is not described herein.

For the third implementation mode, when the preliminary screening is performed, a default preset probability threshold is adopted, the default preset probability threshold can be set according to experience according to actual use conditions of the building and the elevator, but the number of screened high probability floors is more likely to be still not smaller than or equal to the number of idle elevators, at this time, the preset probability threshold can be gradually increased by adopting a preset step length until the number of screened high probability floors is smaller than or equal to the number of idle elevators.

When the screening method II is adopted to screen the high-probability floors, if the number of the screened high-probability floors still does not meet the condition of less than or equal to the number of idle elevators, the following implementation method is adopted to adjust the number of the high-probability floors:

as shown in fig. 3, implementation two:

s1, sorting high-probability floors according to positions in a building;

s2, calculating the distances between all adjacent high-probability floors;

After the number of high probability floors screened meets the condition of being less than or equal to the number of free elevators, the specific implementation of sub-step 54 includes the following embodiments:

Embodiment one:

in this embodiment, sub-step 54 identifies each high probability floor as a standby floor, and identifies the standby elevator corresponding to each standby floor by minimizing the first elevator movement payment for each free elevator to move from its current location to the corresponding standby floor, the first elevator movement payment being the sum of the payments required for each free elevator to move from its current location to its corresponding standby floor.

In particular, in this embodiment, the effort required for the free elevator to move from its current location to the corresponding standby floor may be characterized by including, but not limited to, the energy consumption, wear, distance of movement, or the number of floors between the current location of the free elevator and the corresponding standby floor.

More specifically, as shown in fig. 4, sub-step 54 determining the standby elevator corresponding to each standby floor includes:

step A1, enumerating all possible idle elevator combinations for selecting m idle elevators from all idle elevators, wherein m is the number of high-probability floors;

Step A3, calculating a first elevator movement payment corresponding to the corresponding relation according to the position of each idle elevator in the idle elevator combination and the floor position of each standby floor aiming at each corresponding relation of each idle elevator combination;

and A4, extracting the corresponding relation of the smallest first elevator movement and payment, taking the corresponding relation as a selected corresponding relation, taking each idle elevator in the selected corresponding relation as a standby elevator, and determining the standby floor corresponding to each standby elevator according to the corresponding relation.

Specifically, in this embodiment, taking the number of free elevators m=3, A1, A2, and A3, respectively, and the number of high probability floors n=2, L1 and L2, respectively, as an example, two out of the 3 free elevators are first selected, and three possible free elevator combinations are included, namely (A1, A2), (A1, A3), and (A2, A3), respectively.

For the free elevator group (A1, A2), two possible corresponding relations are included, namely A1-L1, A2-L2, corresponding first elevator movement and pay-out are C1, and A1-L2, A2-L1, corresponding first elevator movement and pay-out are C2;

for the free elevator group (A1, A3), two possible corresponding relations are included, namely, A1-L1, A3-L2, corresponding first elevator movement and pay-out are C3, and A1-L2, A3-L1, corresponding first elevator movement and pay-out are C4;

For the free elevator group (A2, A3), two possible corresponding relations are included, namely A2-L1, A3-L2, corresponding first elevator movement and pay-out are C5, and A3-L2, A2-L1, corresponding first elevator movement and pay-out are C5;

the final first elevator movement and payout is C1, C2, C3, C4 and C5, respectively, and the minimum value is selected, if the minimum value is C4, A1 is a standby elevator, the corresponding standby floor is L2, A3 is a standby elevator, the corresponding standby floor is L1, and then A1 is controlled to stop at L2, A3 is controlled to stop at L1, and waiting for a call.

Embodiment II:

in this embodiment, sub-step 54 determines the high probability floor as a standby floor and determines the standby elevator corresponding to each standby floor by minimizing the total movement effort of the elevator;

the total elevator movement effort is the weighted sum of the first elevator movement effort and the second elevator movement effort, the first elevator movement effort is the elevator movement effort when each free elevator moves to the standby floor corresponding to the free elevator from the current position, and the second elevator movement effort is the elevator movement effort required when the free elevator responds to the call signal appearing on the call floor of the floor coverage area corresponding to the standby floor corresponding to the free elevator and moves to the call floor from the standby floor corresponding to the free elevator.

More specifically, as shown in fig. 5, determining the standby elevator corresponding to each standby floor by minimizing the total payment of elevator movement further includes:

step A3, calculating a first elevator movement payment corresponding to the corresponding relation according to the current position of each idle elevator in the idle elevator combination and the floor position of each standby floor, calculating a second elevator movement payment corresponding to the corresponding relation according to the standby floor corresponding to each idle elevator in the idle elevator combination, and calculating the sum of the first elevator movement payment and the second elevator movement payment or the weighted sum of the first elevator movement payment and the second elevator movement payment to obtain an elevator total movement payment corresponding to the corresponding relation;

and A4, extracting a corresponding relation corresponding to the minimum elevator moving total payment, taking the corresponding relation as a selected corresponding relation, taking each idle elevator in the selected corresponding relation as a standby elevator, and determining a standby floor corresponding to each standby elevator according to the corresponding relation.

Specifically, in the present embodiment, in addition to the response waiting floor, the waiting elevator considers the floor coverage area corresponding to the response waiting floor, that is, when a call signal occurs at a floor located in the floor coverage area, as compared with the first embodiment, the waiting elevator on the waiting floor corresponding to the floor coverage area is taken as the response elevator for the call signal. Based on this, the elevator total movement effort includes, in addition to the first elevator movement effort in the first embodiment, the second elevator movement effort in response to the call signal. The calculation manner of the first elevator movement and the first elevator movement are performed in the same manner, and the details are not repeated here.

Likewise, the second elevator movement effort may be characterized by the number of floors between the current location of the free elevator and the corresponding floor generating the call signal, including but not limited to the energy consumption, wear, movement distance of the free elevator to the floor generating the call signal, wherein, for example, the higher the energy consumption, the longer the movement distance, the longer the movement time needed, and the movement time corresponding to the waiting time of the passenger, it can be seen that the second elevator movement effort not only embodies the elevator effort, but also implies the waiting time of the passenger. Thus, in calculating the total elevator movement effort, a weighted sum of the first elevator movement effort and the second elevator movement effort is preferably used, wherein the weight of the second elevator movement effort is preferably greater than the weight of the first elevator movement effort.

Wherein for each correspondence for each free elevator group, as shown in fig. 6, sub-step 54 calculates the second elevator movement effort in the following manner:

m1, determining a floor coverage area corresponding to each standby floor in the corresponding relation, wherein the floor coverage area refers to that when a call signal appears on a floor in the floor coverage area, a standby elevator positioned on a certain coverage floor in the floor coverage area responds to the call signal;

m2, selecting an unselected standby floor as a selected standby floor;

step M3, calculating the product of the required payment of each coverage floor and the probability of calling of each coverage floor in the floor coverage area of the standby elevator from the selected standby floor to the selected standby floor as single floor movement payment;

step M4, calculating the sum of single floor movement payments corresponding to each coverage floor, and taking the sum as the response movement payment of the selected standby floor;

step M5, returning to the step M2 until no unselected standby floors exist;

step M6, the sum of all the response movement efforts is calculated and taken as the second elevator movement effort.

Specifically, in the present embodiment, taking the correspondence relationship of a1→l2 as an example, if the floor coverage area corresponding to L2 further includes the floor L3 and the floor L4, L2 may be selected as the selected standby floor first, and if the call probability of L3 is P1 and the call probability of L4 is P2. Calculating the payments C6 and C7 of the movement A1 from the L2 to the L3 and the L4 respectively, obtaining single floor movement payments C6 x P1+C7 x L4, and the like, then selecting the L3 and the L4 as the selected standby floors and correspondingly calculating the single floor movement payments, and finally summing to obtain the second elevator movement payments corresponding to the corresponding relation A1-L2.

Embodiment III:

in this embodiment, as shown in fig. 7, the determining of the standby floor and the corresponding standby elevator in the sub-step 54 includes:

step B2, enumerating all possible idle elevator combinations for selecting m idle elevators from all idle elevators, wherein m is the number of standby floors;

step B3, enumerating all possible corresponding relations for each free elevator combination, wherein the corresponding relations are one-to-one corresponding relations between each free elevator and each standby floor contained in the free elevator combination;

Step B4, calculating corresponding elevator movement total payouts according to the positions of the idle elevators in the idle elevator combinations and the floor positions of the standby floors according to each corresponding relation corresponding to each idle elevator combination, and adding the elevator movement total payouts into a total payout list;

step B5, judging whether the number of standby floors is 1:

if not, the number of standby floors is reduced by 1, and then the step B2 is returned;

if yes, turning to a step B6;

and B6, extracting the corresponding relation of the minimum elevator moving total payment from the total payment list, taking each idle elevator in the idle elevator combination corresponding to the corresponding relation as a standby elevator, and determining the standby floor corresponding to each standby elevator according to the corresponding relation.

Specifically, in this embodiment, the total elevator movement effort is calculated when the number of standby floors is m, m-1, and each standby elevator and the corresponding standby floor are determined based on the minimum total elevator movement effort, that is, each total elevator movement effort is calculated in a cyclic manner in which the number of standby floors decreases. However, considering that in engineering practice, for the idle period (e.g. for the elevators located in the office building, the non-workday is the idle period, because only the individual overtime staff is working in the office building at this time), almost all the elevators are idle elevators at this time, and the number of standby floors of the office building may be closer to the total number of elevators (and all the elevators are idle elevators at this time), in this case, the number of standby floors may be smaller from the number of idle elevators, so that it is preferable to calculate the total effort of moving each elevator in a manner that the number of standby floors is decreased to further reduce the calculation amount.

The calculation method of the first elevator movement and the calculation method of the second elevator movement and the calculation method of the first elevator movement and the calculation method of the second elevator movement are the same as those of the first embodiment, and are not repeated here.

Further, after the standby floor and the corresponding standby elevator are determined, when a call signal appears on a certain floor, the standby elevator positioned in the coverage area of the floor to which the floor belongs responds to the call signal, or the idle elevator with the least effort of moving to the floor generating the call signal from the standby floor where the idle elevator is currently positioned in the idle elevator combination is used as the response elevator of the call signal.

In a preferred embodiment of the present invention, in the case where the standby floor and the corresponding standby elevator determined in the first, second or third embodiments are the optimal standby floor and standby elevator obtained in consideration of the minimum elevator movement effort, not all the idle elevators are standby elevators, and based on this, the sub-step 55 is further included after executing the sub-step 54 for the remaining idle elevators:

step 55, judging whether remaining free elevators exist and specific floor areas meeting specific floor conditions exist, if yes, allocating a free elevator to each specific floor area as a standby elevator of the specific floor area, otherwise, turning to step 6;

the specific floor conditions include:

Condition 2, the specific floor area does not include a standby floor;

the distance between the condition 3, the specific floor area and the nearest standby elevator exceeds the first distance threshold.

In particular, in this embodiment, if there is a specific floor area that satisfies the specific floor condition, if the number of consecutive floors in the specific floor area exceeds the first floor threshold, this indicates that the floor span of the specific floor area is relatively large, and when the specific floor area generates a call signal, the waiting time of the passenger is relatively long due to relatively large moving distance of the response elevator, which affects the user experience. Further, if the waiting floor is included in the specific floor area although the floor span is large, the waiting elevator is allocated to the waiting floor, and the waiting elevator can be used as a response elevator for the specific floor area, and if the waiting floor is not included in the specific floor area, similarly, the waiting time of the passenger is relatively long due to relatively large moving distance of the response elevator. Further, although the specific floor area has a large floor span, if the standby floor is not included but the nearest standby elevator is located close to the specific floor area, the specific floor area can be used as a response elevator for the specific floor area, if the distance between the specific floor area and the nearest standby elevator is too large, even if the nearest standby elevator is used as the response elevator for the specific floor area, the passenger's backward-lift time is relatively too long due to the relatively large moving distance of the response elevator. In summary, if the specific floor condition satisfies the specific floor condition, it is indicated that the specific floor area needs to be allocated with a standby elevator, so as to reduce the waiting time of passengers in the specific floor area.

In a preferred embodiment of the invention, the allocation of a free elevator for a particular floor area as a standby elevator for the floor area comprises:

when only one specific floor area exists, taking the rest idle elevator nearest to the specific floor area as a standby elevator of the specific floor area;

when there are a plurality of specific floor areas, one floor in the specific floor area is selected as a standby floor of the specific floor area, the remaining free elevator is used as a free elevator, the standby floor is used as a high probability floor, and the standby elevator is allocated to the specific floor area by using any one of the scattered standby control methods of the first embodiment, the second embodiment and the third embodiment.

In a preferred embodiment of the present invention, the manner of selecting one floor in the specific floor area as the standby floor of the specific standby floor includes any one of the following selection manners:

selecting a first mode: taking the floor with the highest probability of calling in the specific floor area as a standby floor;

and a second selection mode: taking the floor closest to the rest free elevators in the specific floor area as a standby floor;

and selecting a third mode: taking the central floor in the specific floor area as a standby floor;

And a fourth selection mode: a floor with the smallest sum of call probabilities of the corresponding rest floors multiplied by the distance between the rest floors in the specific floor area is used as a standby floor;

selecting a fifth mode: the floor with the smallest difference between the sum of the call probabilities of the floors above and the sum of the call probabilities of the floors below in the floor area is taken as the standby floor.

Specifically, in this embodiment, regarding the above-mentioned selection mode four, taking the specific floor area including L1, L2, L3 and L4, the floors are sequentially increased, and the corresponding call probabilities are respectively P1, P2, P3 and P4 as an example:

for L1, the sum of the distance between the floor and the rest multiplied by the probability of the call of the rest corresponding to the floor is d1= (L2-L1) p2+ (L3-L1) p3+ (L4-L1) P4;

for L2, the sum of the distance between the floor and the rest multiplied by the probability of the call of the rest corresponding to the floor is d2= (L2-L1) p1+ (L3-L2) p3+ (L4-L2) P4;

for L3, the sum of the distance between the floor and the rest multiplied by the probability of the call of the rest corresponding to the floor is d3= (L3-L1) p1+ (L3-L2) p2+ (L4-L3) P4;

for L4, the sum of the distance between the floor and the rest multiplied by the probability of the call for the rest is d4= (L4-L1) p1+ (L4-L2) p2+ (L4-L3) P3.

Comparing D1, D2, D3 and D4, if D1 is minimum, L1 is the standby floor of the specific floor area, if D2 is minimum, L2 is the standby floor of the specific floor area, if D3 is minimum, L3 is the standby floor of the specific floor area, and if D4 is minimum, L4 is the standby floor of the specific floor area.

Regarding the fifth selection manner, the specific floor area still includes L1, L2, L3 and L4, and the corresponding call probabilities are respectively P1, P2, P3 and P4 as an example:

for L1, the sum of the call probabilities of the floors at the upper part is P2+P3+P4, the call probability of the floors at the lower part is 0, and the difference value between the two is P2+P3+P4;

for L2, the sum of the call probabilities of the floors at the upper part is P3+P4, the sum of the call probabilities of the floors at the lower part is P1, and the difference between the two is P3+P4-P1;

for L3, the sum of the call probabilities of the floors at the upper part is P4, the sum of the call probabilities of the floors at the lower part is P1+P2, and the difference between the two is P4- (P1+P2);

for L4, the sum of call probabilities of the floors above is p1+p2+p3, the sum of guard probabilities of the floors below is 0, and the difference between them is p1+p2+p3.

And comparing the difference values, wherein the floor with the smallest difference value is the standby floor.

Embodiment two:

in this embodiment, as shown in fig. 8, step 5 further includes the following sub-steps:

sub-step 5-1, enumerating all possible free elevator combinations of any elevator not exceeding the number of service floors from all free elevators, the number of service floors being the total number of all service floors in the building in which the elevator is located;

step 5-2, enumerating all corresponding relations between the idle elevators in the idle elevator combination and the service floor layer for each idle elevator combination;

step 5-3, calculating, for each corresponding relation, a total elevator movement effort between the free elevator moved from the current position to the service floor corresponding thereto, the total elevator movement effort being a weighted sum of a first elevator movement effort and a second elevator movement effort, and the weight corresponding to the second elevator movement effort being greater than the weight corresponding to the first elevator movement effort, the first elevator movement effort being an elevator movement effort when each free elevator in the corresponding relation is moved from the current position to the service floor corresponding thereto, the second elevator movement effort being an elevator movement effort required when the free elevator in the corresponding relation is moved from the standby floor corresponding thereto to the call floor in response to a call signal occurring at the call floor of the floor coverage area corresponding thereto;

And 5-4, taking the idle elevator in the idle elevator combination in the corresponding relation corresponding to the minimum elevator movement total payment as a standby elevator, and taking the service floor corresponding to the standby elevator as a standby floor.

Specifically, in this embodiment, there is no need to screen out high probability floors in advance, only the number of free elevators and the number of service floors need to be considered, all the possibilities that any number of free elevators are allocated to each service floor as standby elevators can be obtained, and the combination of the free elevator corresponding to the minimum total elevator movement effort and the service floor is used as a final decentralized standby scheme, so that the optimization of the standby elevators and the standby floors is realized. The calculation manners of the first elevator movement effort and the second elevator movement effort are the same as those of the first embodiment, and are not repeated here.

Embodiment III:

further, in the second embodiment, since all possible combinations of the free elevator and each service floor need to be considered, the calculated amount will be relatively large, and in order to reduce the calculated amount, as shown in fig. 9, step 5 further includes the following sub-steps:

substep 501, reducing the number of free elevators and service floors of the building in which the elevators are located by means of pretreatment mode 1 and/or pretreatment mode 2:

The preprocessing method 1 comprises the steps of taking a call floor corresponding to a regular call event in a future preset time period as a standby floor, determining a standby elevator for the standby floor according to a first movement paying minimum principle, deleting the standby floor from a service floor, and deleting the standby elevator from the standby elevator;

the preprocessing mode 2, taking the high probability floor in the service floors as a standby floor, determining a standby elevator for the standby floor according to the first mobile payment minimum principle, deleting the standby floor from the service floors, and deleting the standby elevator from the standby elevator;

step 502, taking the rest free elevator as a new free elevator, taking the rest service floor as a new service floor, and determining a standby floor and a corresponding standby elevator aiming at the new service floor and the new free elevator;

sub-step 503 combines the standby floors determined by the preprocessing mode 1 and/or the preprocessing mode 2 and the corresponding standby elevators thereof with the results of sub-step 502, and takes the combined results as the final standby floors and standby elevators.

Specifically, in this embodiment, one or both of the pretreatment mode 1 and the pretreatment mode 2 may be selected to reduce the number of free elevators and service floors, and when two pretreatment modes are simultaneously adopted, the pretreatment mode 1 is preferably adopted first and then the pretreatment mode 2 is adopted. It can be understood that, in this embodiment, the number of idle elevators and service floors is reduced to reduce the number of idle elevators and service floors applied to the second embodiment, so as to reduce the amount of calculation, instead of directly reducing the number of idle elevators and service floors, a part of idle elevators and service floors are screened out to perform primary decentralized standby, then the rest of idle elevators and service floors are subjected to secondary decentralized standby by adopting the second embodiment, and finally the results of the primary decentralized standby and the secondary decentralized standby are used as final standby floors and standby elevators.

More specifically, as shown in fig. 10, the pretreatment method 1 includes:

step 501-1, analyzing and obtaining a regular call event which occurs in one day according to historical call data;

step 501-2, judging whether a regular call event is included in a future preset time period:

if yes, taking the floor with the regular call event as a standby floor, allocating a corresponding idle elevator as a standby elevator for the floor, and then turning to step 501-3;

if not, adding each floor to the first object floor set, and then turning to step 501-4;

step 501-3, deleting the floors with regular call events and the floors with the distance not exceeding the threshold value of the second floor from the floors with the regular call events, deleting the idle elevators serving as the standby elevators of the floors with the regular call events, and adding the rest floors into the first target floor set;

step 501-4, judging whether the first target floor set contains high probability floors according to the call probability of each floor contained in the first target floor set:

if yes, comparing the magnitude relation between the number of the high-probability floors and the number of the unassigned free elevators to obtain a comparison result, and when the comparison result shows that the number of the high-probability floors exceeds the number of the unassigned free elevators, firstly adjusting the number of the high-probability floors to be not more than the number of the unassigned free elevators, then determining a standby floor and a corresponding standby elevator according to the floor positions of the high-probability floors and the current positions of the unassigned free elevators, and then turning to step 501-5;

If not, go to step 502;

step 501-5, after deleting the high-probability floor and the floor that is not more than the third floor threshold from the high-probability floor, and deleting each free elevator that is a standby elevator for each high-probability floor, the process proceeds to step 502.

Further, in the preprocessing mode 1, when the number of regular call events in the future preset time period is larger than the number of idle elevators or the difference between the number of regular call events in the future preset time period and the number of idle elevators is larger than the preset difference threshold,

and counting the occurrence time interval between two adjacent regular call events, and if the occurrence time interval is larger than the response completion time of the previous regular call event, shortening the preset time length to ensure that the preset time length only comprises the previous regular call event.

Specifically, in this embodiment, a histogram of call signals of each floor may be drawn by using historical call data, so as to determine whether an obvious regular event exists in one day, that is, a certain floor always presents a call signal at a certain specific time, the occurrence time of the call signal is normally distributed with the specific time as the center, and a specific identification manner of the regular call event is referred to a published patent document with application number CN201910449301.5, where an occurrence time interval between two adjacent regular call events is an interval between occurrence times of passenger taking demand disclosed in CN 201910449301.5.

Further, by counting the regular call events, the idle elevator can be allocated as a standby elevator before the occurrence of the regular call events, and the corresponding standby floor is the occurrence floor of the regular call events. However, if the number of regular call events in the future preset duration is greater than the number of idle elevators, the number of idle elevators is less than the number of idle elevators, which is insufficient to allocate standby elevators to floors associated with each regular call event one by one, or the difference between the number of regular call events in the future preset duration and the number of idle elevators is greater than a preset difference threshold, after allocating standby elevators to floors associated with each regular call event one by one, the remaining idle elevators are too small, so that the number of floors required to be served by each remaining idle elevator is too large, which results in longer waiting time for some passengers. Based on this, in this embodiment, the preset duration is shortened according to the occurrence time interval between two adjacent regular call events, so that the preset duration only includes the previous regular call event, and the above situation is improved.

Furthermore, since the call signal to be responded to by the elevator (including destination floor information) and the information of the passengers not arriving at the destination floor in the elevator car are allocated to the elevator currently, the path required by the elevator to travel and the floor required to stop can be determined according to the current position of the elevator and the information of the two destination floors, the approximate time required by the elevator to complete the responses can be estimated according to the path required by the elevator to travel and the floor required to stop, and the response completion time is obtained.

When the occurrence time interval is longer than the response completion time, the preset time length is shortened to be slightly longer than the time period from the current time to the time when the elevator completes the passenger transportation of the earliest regular call event, but the length of the elevator is not excessively long, so that the standby elevator is not moved to the floor of the next regular event from the current position before the occurrence of the next regular event, and preferably, the shortened preset time length only comprises the previous regular call event. The elevator becomes an idle elevator again after the passengers with the earliest regular call events are transported, and the scattered standby allocation is performed again at the moment, so that the new accurate information instead of the predicted information is fully utilized due to the new position of the elevator after the transportation is completed, and the scattered standby effect is better.

In a preferred embodiment of the invention, as shown in fig. 11, step 502 determines a standby floor and its corresponding standby elevator for a new service floor and a new free elevator according to the following sub-steps:

Step 502-2, enumerating all corresponding relations between the idle elevators and the service floor in the idle elevator combination for each idle elevator combination;

step 502-3, for each corresponding relation, calculating a total elevator movement effort between the free elevator moved from its current position to the service floor corresponding thereto, the total elevator movement effort being a weighted sum of a first elevator movement effort and a second elevator movement effort, and the weight corresponding to the second elevator movement effort being greater than the weight corresponding to the first elevator movement effort, the first elevator movement effort being the elevator movement effort when each free elevator in the corresponding relation is moved from its current position to the service floor corresponding thereto, the second elevator movement effort being the elevator movement effort required when the free elevator in the corresponding relation is moved from the standby floor corresponding thereto to the call floor in response to the call signal occurring at the call floor of the floor coverage area corresponding thereto;

in the substep 502-4, the idle elevator in the idle elevator combination in the corresponding relation corresponding to the minimum elevator moving total payment is used as the standby elevator, and the service floor corresponding to the standby elevator is used as the standby floor.

In particular, in this embodiment, the calculation manners of the first elevator movement effort and the second elevator movement effort are the same as those of the first embodiment, and are not described herein again.

Embodiment four:

in this embodiment, in step 5, the service floor of the building in which the elevator is located is divided into a plurality of floor areas, each floor area is defined as a new service floor, and the standby floor and the standby elevator are determined for each floor area.

Specifically, in this embodiment, by dividing the service floors of the building into a plurality of floor areas, and similarly, in order to reduce the number of service floors, this embodiment may be used alone or in combination with the second embodiment, and when used in combination with the second embodiment, it is preferable to perform the pretreatment mode 1 and/or the pretreatment mode 2 in the second embodiment first and then perform the division of the floor areas in this embodiment.

Specifically, the manner of determining the standby floor of each floor area comprises any one of the following selection manners:

selecting a first mode: taking the floor with the highest probability of calling in the floor area as a standby floor;

and a second selection mode: taking the central floor in the floor area as a standby floor;

and selecting a third mode: taking a floor with the smallest sum of the call probabilities of the corresponding rest floors as a standby floor, wherein the sum of the call probabilities of the rest floors is multiplied by the distance between the rest floors in the floor area;

And a fourth selection mode: the floor with the smallest difference between the sum of the call probabilities of the floors above and the sum of the call probabilities of the floors below in the floor area is taken as the standby floor.

After determining the new service floor, as shown in fig. 12, determining the standby elevator for each standby floor comprises the following sub-steps:

step C2, enumerating all corresponding relations between the idle elevators and the standby floor in the idle elevator combination aiming at each idle elevator combination;

step C3, calculating the total elevator movement effort between the idle elevator moving from the current position to the standby floor corresponding to the idle elevator aiming at each corresponding relation, wherein the total elevator movement effort is a weighted sum of a first elevator movement effort and a second elevator movement effort, the weight corresponding to the second elevator movement effort is larger than that corresponding to the first elevator movement effort, each idle elevator in the corresponding relation moves to the elevator movement effort when the current position of the idle elevator moves to the standby floor corresponding to the idle elevator, and the second elevator movement effort is the elevator movement effort required when the idle elevator in the corresponding relation responds to a call signal appearing on a call floor of a floor coverage area corresponding to the standby floor corresponding to the idle elevator;

And C4, taking the idle elevator in the idle elevator combination in the corresponding relation corresponding to the minimum elevator movement total payment as a standby elevator, and taking the standby floor corresponding to the standby elevator as a standby floor.

Specifically, the calculation manners of the first elevator movement effort and the second elevator movement effort are the same as those of the first embodiment, and are not described herein again.

The foregoing description is only illustrative of the preferred embodiments of the present invention and is not to be construed as limiting the scope of the invention, and it will be appreciated by those skilled in the art that equivalent substitutions and obvious variations may be made using the description and illustrations of the present invention, and are intended to be included within the scope of the present invention.

Claims

1. A decentralized standby control method of an elevator, characterized by comprising:

2. The distributed standby control method according to claim 1, wherein the step 2 further comprises:

3. The distributed standby control method according to claim 1, wherein the step 5 further comprises the sub-steps of:

4. A distributed standby control method according to claim 3, characterized in that the substep 51 screens the high probability floors by means of any of the following screening methods:

5. The decentralized standby control method according to claim 4, wherein for a given cluster group, the substep 51 calculates the group probability in any of the following ways:

6. A distributed standby control method according to claim 3, characterized in that the substep 53 implements the adjustment of the number of high probability floors with any one of the following implementations:

the implementation mode II is as follows:

s1, sorting the high-probability floors according to positions in a building;

s2, calculating the distances between all adjacent high-probability floors;

7. The decentralized standby control method according to claim 4, wherein the substep 53 implements the adjustment of the number of high probability floors with any one of the following implementations:

the implementation mode II is as follows:

s1, sorting the high-probability floors according to positions in a building;

s2, calculating the distances between all adjacent high-probability floors;

8. A decentralized standby control method according to claim 3, characterized in that the substep 54 determines each of the high probability floors as the standby floor, the standby elevator corresponding to each of the standby floors being determined by minimizing a first elevator movement payout for each of the free elevators moving from the current position to the corresponding standby floor, the first elevator movement payout being the sum of the payouts required for each of the free elevators moving from the current position to the corresponding standby floor.

9. The decentralized standby control method according to claim 8, wherein the sub-step 54 of determining the standby elevator corresponding to each of the standby floors comprises:

10. A decentralized standby control method according to claim 3, characterized in that the substep 54 determines the high probability floor as the standby floor and determines the standby elevator corresponding to each of the standby floors by minimizing the total elevator movement effort;

11. The decentralized standby control method according to claim 10, wherein the determining the standby elevator corresponding to each of the standby floors by minimizing the elevator movement sum payment further comprises:

12. A decentralized standby control method according to claim 3, characterized in that the substep 54 of determining the standby floor and its corresponding standby elevator comprises:

and B5, judging whether the number of the standby floors is 1:

if yes, turning to a step B6;

13. The decentralized standby control method according to claim 10 or 11 or 12, wherein for each of the correspondence for each of the idle elevator groups, the substep 54 calculates the second elevator movement effort by:

m2, selecting the unselected standby floor as a selected standby floor;

14. The decentralized standby control method according to claim 13, characterized in that when the call signal occurs at a floor, the call signal is responded by the standby elevator located within the floor coverage area to which the floor belongs, or the idle elevator in the idle elevator group whose effort to move from the standby floor where it is currently located to the floor where the call signal originates is smallest is the responding elevator to the call signal.

15. A distributed standby control method according to claim 3, characterized in that the substep 54 is followed by the substep 55 of:

the specific floor condition includes:

Condition 2, the standby floor is not included in the specific floor area;

16. The decentralized standby control method according to claim 15, wherein assigning one of the free elevators to the specific floor area as the standby elevator of the floor area comprises:

when there are a plurality of the specific floor areas, one floor in the specific floor area is selected as the standby floor of the specific floor area, the remaining free elevator is used as the free elevator, the standby floor is used as the high probability floor, and the standby elevator is allocated to the specific floor area by using the distributed standby control method according to any one of claims 1 to 14.

17. The distributed standby control method according to claim 15, wherein the manner of selecting one floor in the specific floor area as the standby floor of the specific standby floor includes any one of the following selection manners:

18. The distributed standby control method according to claim 1, wherein the step 5 further comprises the sub-steps of:

19. The distributed standby control method according to claim 1, wherein the step 5 further comprises the sub-steps of:

20. The decentralized standby control method according to claim 19, wherein step 502 determines the standby floor and its corresponding standby elevator for a new service floor and a new free elevator according to the following sub-steps:

21. The decentralized standby control method according to claim 1 or 19, wherein in step 5 the service floor of the building in which the elevator is located is divided into a number of floor areas, each floor area is regarded as a new service floor, and the standby floor and the standby elevator are determined for each of the floor areas.

22. The distributed standby control method of claim 21 wherein the manner in which the standby floor is determined for each of the floor areas comprises any one of the following options:

23. The decentralized standby control method according to claim 21, wherein determining the standby elevator for each of the standby floors comprises the sub-steps of:

24. The decentralized standby control method according to claim 19, wherein in the preprocessing mode 1, when the number of regular call events in the preset time period in the future is greater than the number of free elevators or a difference between the number of regular call events in the preset time period in the future and the number of free elevators is greater than a preset difference threshold,

25. An elevator group management system, characterized in that each of the free elevators in the building is standby-controlled by a decentralized standby control method according to any one of claims 1 to 24.