An elevator group control algorithm that significantly shortens passenger waiting time

Abstract

This invention relates to the field of elevator control and is an elevator control algorithm designed to shorten passenger waiting times. First, any two of n elevators are set to traditional elevator operation mode. Secondly, an elevator is ensured to be on the first floor at all times, and from the second floor upwards, each floor is no more than two floors away from the nearest elevator. The algorithm then ensures these conditions remain constant during elevator operation. This invention incorporates fault detection and overload protection, shortening passenger waiting times and improving operational efficiency.

Description

Technical Field

[0001] This invention is an elevator control algorithm invention and relates to the field of elevator control. Background Art

[0002] At present, the types of operating methods implemented by elevators in China are relatively few and simple, and cannot fully meet the needs of passengers for elevator use in different situations, such as short elevator ride time and comfortable riding space.

[0003] Currently, all elevators on the market can basically respond to the needs of passengers and ensure the safety of passengers' lives and property through load limit protection, fault detection and other means. However, as the number of passengers increases, the waiting time for passengers will also be greatly increased.

[0004] Based on this, we proposed an elevator group control algorithm that significantly shortens passengers' waiting time. Summary of the Invention

[0005] This invention is an elevator group control algorithm that significantly shortens the waiting time for passengers, and is intended to solve the problem of long waiting time for passengers in the above background.

[0006] To achieve the above object, this invention comprises the following steps:

[0007] 1. An elevator group control algorithm that significantly shortens passenger waiting time, characterized by:

[0008] Step 1: There are n elevators in total, and two of them are set to normal operation;

[0009] Step 2: At least one elevator is on standby on the first floor at all times;

[0010] Step 3: From the 2nd floor up, each floor is no more than two floors away from the nearest elevator. When one or more elevators start moving, according to the algorithm, the elevator that has no outbound call signal or has completed its mission recently will fill the vacant seat on that floor.

[0011] 2. The elevator control algorithm according to claim 1 is characterized in that: in the second step, when the elevator is running, the elevators are distributed on different floors. When the elevator on standby on the first floor is started, the top-most internal call button is used as the starting signal, and the elevator on the target floor or the closest to the target floor returns to the first floor to standby; if the elevator on the target floor is also triggered, the elevator closest to the original first floor and not triggered returns to the first floor to standby; if there is no elevator that meets the conditions, the elevator is called according to the internal call button signals of each elevator, and the elevator with the final destination on the first floor and the slowest arrival time is the first floor.

[0012] 3. The elevator group control algorithm according to claim 1 is characterized in that: in the third step, the operation of two normally operating elevators can affect the parking floors of other elevators, while other elevators will not affect these two normally operating elevators; at any time, there is an elevator on the first floor, and each floor from the second floor upwards is no more than two floors away from the nearest elevator. When the elevator starts running, each elevator sends a filling signal to the nearest elevator to the target floor according to the button inside the elevator. If the target elevator is occupied, it will turn to the elevator closest to the elevator sending the signal to fill the vacant floor; if no elevator meets the conditions, the elevator is arranged to fill the vacant floor according to the highest floor of the outside call button and the lowest floor of the car button.

[0013] 4. The elevator control algorithm according to claim 1 is characterized in that: in the fourth step, the position of the elevator to be moved is determined based on the algorithm assuming that both elevators are normal. If one elevator fails, the elevator closest to the failed elevator will take over the up call or down call signal that has been triggered. The elevator on the upper floor of the failed elevator will take over the down call task, and the elevator on the lower floor of the failed elevator will take over the up call task. When there is no up or down indication signal from the failed elevator, the floor position of the failed elevator will be re-determined.

[0014] 5. The elevator group control algorithm according to claim 1 is characterized in that: the fifth step enters the maintenance state. When the maintenance is completed, the elevator needs to arrive at the terminal station for reinitialization, and according to the algorithm, it stops at a position no more than four floors away from the nearest normally operating elevator, and then operates normally.

[0015] The algorithm is as follows:

[0016] The relationship between the running time and distance of a single elevator is: X = 0.5×(T-T1-t)×(T-T1-t)×Q+X0.

[0017] Where X represents the distance traveled by the new algorithm elevator; T represents an operating cycle, T = T0 + T1 + t, where T0 represents the elevator operating time and T1 represents the passenger waiting time; Q represents the slope of the tangent line of the operating speed and time coordinate curve, X0 represents the distance from the initial counting value to the first floor; t represents the time consumed by the algorithm in searching for the completing elevator, which is a very small value.

[0018] The running speed of the elevator car: V = √2 × ∑A' × X.

[0019] ∑A' represents the average acceleration during the operation of the elevator.

[0020] When the entire system is running, the elevator maintains safe and fast operation according to the set values ​​of A and Q.

[0021] According to the calculated size of T1, the minimum value is found, the appropriate target filling elevator is automatically calculated, and the filling signal is sent.

[0022] Repeat calculations, find the optimal algorithm solution in real time, and make timely adjustments.

[0023] Compared with all current elevator algorithms, this algorithm has the following advantages:

[0024] The division of labor is clear and mutually compatible, which greatly shortens the waiting time for passengers, and the algorithm is simple.

[0025] The impact is minimal; even if an elevator stops operating for maintenance, it won't significantly impact the overall algorithm. For example, if one non-traditional elevator is undergoing maintenance while all other elevators are operating normally, and this elevator's up and down calls go unanswered, a signal is automatically transmitted to a nearby elevator. If the nearby elevator's signal for a call is unanswered, the signal is automatically sent to an elevator one elevator further away from the elevator that sent the signal, and so on, until a suitable elevator is found. This is highly efficient. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] In order to more clearly illustrate the implementation scheme of this algorithm, a clear and simple structural diagram description of this scheme will be given below. It can be clearly seen that the following figures are only an explanation of the process of the algorithm of the present invention.

[0027] Figure 1 This is the inventive structure diagram of the algorithm of the present invention. DETAILED DESCRIPTION

[0028] The algorithm of the present invention will be described clearly and completely below with reference to the accompanying drawings. The following description is only one of the embodiments, not all of the embodiments.

[0029] read Figure 1 The present invention provides an elevator group control algorithm that significantly shortens the waiting time for passengers. The specific steps include:

[0030] 1. An elevator group control algorithm that significantly shortens passenger waiting time, characterized by:

[0031] Step 1: There are n elevators in total, and two of them are set to normal operation;

[0032] Step 2: At least one elevator is on standby on the first floor at all times;

[0033] Step 3: From the 2nd floor up, each floor is no more than two floors away from the nearest elevator. When one or more elevators start moving, according to the algorithm, the elevator that has no outbound call signal or has completed its mission recently will fill the vacant seat on that floor.

[0034] 2. The elevator control algorithm according to claim 1 is characterized in that: in the second step, when the elevator is running, the elevators are distributed on different floors. When the elevator on standby on the first floor is started, the top-most internal call button is used as the starting signal, and the elevator on the target floor or the closest to the target floor returns to the first floor to standby; if the elevator on the target floor is also triggered, the elevator closest to the original first floor and not triggered returns to the first floor to standby; if there is no elevator that meets the conditions, the elevator is called according to the internal call button signals of each elevator, and the elevator with the final destination on the first floor and the slowest arrival time is the first floor.

[0035] 3. The elevator control algorithm according to claim 1 is characterized in that: in the third step, the operation of two normally operating elevators can affect the parking floors of other elevators, while other elevators will not affect these two normally operating elevators; at any time, there is an elevator on the first floor, and each floor from the second floor upwards is no more than two floors away from the nearest elevator. When the elevator starts running, each elevator sends a filling signal to the nearest elevator to the target floor according to the button inside the elevator. If the target elevator is occupied, it will turn to the elevator closest to the elevator sending the signal to fill the vacant floor; if no elevator meets the conditions, the elevator is arranged to fill the vacant floor according to the highest floor of the outside call button and the lowest floor of the car button.

[0036] 4. The elevator control algorithm according to claim 1 is characterized in that: in the fourth step, the position of the elevator to be moved is determined based on the algorithm assuming that both elevators are normal. If one elevator fails, the elevator closest to the failed elevator will take over the up call or down call signal that has been triggered. The elevator on the upper floor of the failed elevator will take over the down call task, and the elevator on the lower floor of the failed elevator will take over the up call task. When there is no up or down indication signal from the failed elevator, the floor position of the failed elevator will be re-determined.

[0037] 5. The elevator control algorithm according to claim 1 is characterized in that: the fifth step enters the maintenance state. When the maintenance is completed, the elevator needs to arrive at the terminal station for reinitialization, and according to the algorithm, it stops at a position no more than four floors away from the nearest normally operating elevator, and then operates normally.

[0038] The specific algorithm is as follows:

[0039] The relationship between the running time and distance of a single elevator is: X = 0.5×(T-T1-t)×(T-T1-t)×Q+X0.

[0040] Where X represents the distance traveled by the new algorithm elevator; T represents an operating cycle, T = T0 + T1 + t, where T0 represents the elevator operating time and T1 represents the passenger waiting time; Q represents the slope of the tangent line of the operating speed and time coordinate curve, X0 represents the distance from the initial counting value to the first floor; t represents the time consumed by the algorithm in searching for the completing elevator, which is a very small value.

[0041] The running speed of the elevator car: V = √2 × ∑A' × X.

[0042] ∑A' represents the average acceleration during the operation of the elevator.

[0043] When the entire system is running, the elevator maintains safe and fast operation according to the set value of A.

[0044] According to the calculated size of T1, the minimum value is found, the appropriate target filling elevator is automatically calculated, and the filling signal is sent.

[0045] Repeat calculations, find the optimal algorithm solution in real time, and make timely adjustments.

[0046] When the elevator starts running, a single elevator starts running according to the target floor or the target floor call signal in the car, and other elevators automatically receive the complementary signal, so that the moving elevator can perform its task more specifically, thus reducing the waiting time for passengers.

[0047] The specific working principle is as follows:

[0048] After the elevator initialization is completed, except for the two traditional elevators, the elevators will stop at different floors according to the algorithm. When one of the elevators starts operating, it will send a filling signal to the elevator closest to the corresponding floor based on the signal of the farthest target floor in the car. If the target elevator is occupied, the filling signal will be transmitted to the elevator closest to the signal starting elevator. From far to near, the appropriate filling elevator will be selected based on the running time, load capacity, target floor, and pause floor in each car, ensuring that the passengers' waiting time can be greatly shortened, saving passengers' time, and making the overall operation orderly.

[0049] After the elevators are initialized, n-2 of the n elevators are distributed on different floors according to the algorithm settings and waiting for the elevator call signal. Two elevators are initialized according to the original algorithm and are on standby on the first floor. Among them, the position of the elevator with the new algorithm will affect the position of the elevator with the new algorithm, but the position of the elevator with the new algorithm will not affect the operation of the two elevators with the original algorithm.

[0050] Assume that there are x elevators from left to right. If x is an even number, then elevators x / 2 and (x / 2)+1 are elevators using the original algorithm. If x is an odd number, then elevators (x+1) / 2 and (x+1) / 2+1 are elevators using the original algorithm.

[0051] When a call button signals the elevator, the entire elevator system begins operating. First, a check is performed to determine whether the elevator generating the call signal is an elevator using the new algorithm. If not, it is an elevator using the original algorithm. The two elevators using the original algorithm start running from the first floor to the floor closest to the call signal. Accordingly, when the elevator using the original algorithm begins running, the elevator using the new algorithm begins running based on the floor the original algorithm elevator is about to reach, completing the first floor completion.

[0052] If it is an elevator with a new algorithm, according to the algorithm, to reduce passenger waiting time, each floor is no more than two floors away from the nearest elevator. In other words, the distance between the farthest elevators cannot exceed five floors. If it is an elevator with a new algorithm, after the car is loaded with passengers, it receives the passenger's target floor signal based on the button inside the car. If the load inside the car is not overloaded, it will send a replenishment signal to the nearest standby elevator at the target floor inside the car. If the nearest elevator is occupied, it will send a replenishment signal to the elevator one level further away. If it is occupied again, it will search again until it finds the one. If an elevator that originally did not meet the requirements completes its task and becomes qualified, the search will stop, the elevator will automatically be replenished, and the next round of the algorithm will be carried out.

[0053] If the elevator in the car is overloaded, a replenishment signal will be sent to the farthest standby elevator at the target floor in the car. If the farthest elevator is occupied, a replenishment signal will be sent to the elevator one level closer. If it is occupied again, the search will be continued until it is found. If an elevator that originally did not meet the requirements completes the task and becomes qualified, the search will be stopped, the elevator will be automatically replenished, and the next round of the algorithm will be carried out.

[0054] Among them, during each cycle of scanning calculation, the new algorithm will take into account the operating positions and trajectories of the two elevators running with the original algorithm, perform algorithm comparison, and thus obtain the operation plan with the shortest waiting time for passengers. However, the signals and calculation results generated by the elevator with the new algorithm will not have any effect on the operation of the elevator with the original algorithm.

[0055] If one of the elevators breaks down, if it is the original algorithm elevator, the overall impact on the new algorithm elevator is not significant, because the operation of the original algorithm elevator only plays an optimization role in the operation of the new algorithm elevator. The new algorithm elevator only considers the running position of the original algorithm elevator and will not have any impact on the operation of the original algorithm elevator. When the fault is restored, the initialization is completed and it can start running. After a cycle scan of the new algorithm elevator, it is determined that the fault of the original elevator has been eliminated and the initialization is completed. Therefore, in the next cycle scan, the position and running trajectory of the repaired faulty elevator are taken into consideration in the algorithm.

[0056] If an elevator using the new algorithm breaks down, it will no longer be considered in the next cycle after the cycle in which the fault is scanned, and the system will continue. Since it was initially set that each floor cannot be more than two floors away from the nearest elevator, the system will skip the faulty elevator with the completion signal according to the algorithm settings and make new plans for the operation of the entire system. Therefore, the failure of a certain elevator will have little impact on the overall operation effect, and it can still operate stably. When the fault is repaired, the elevator completes initialization and transmits a repair signal to the system. In the next scanning cycle of the system, the repaired elevator will be taken into consideration in the algorithm, and the operation effect will be optimized to ensure that the waiting time for passengers is shortened.

[0057] The above describes the principles, methods, contents, and advantages. Those skilled in the art should understand that the present invention is not limited to the above embodiments, which are merely illustrative of the working methods and principles of the present invention. Numerous modifications, supplements, and variations can be made based on the contents and principles of this specification. The present invention is limited only by the claims and their full scope and equivalents.

Claims

1. An elevator group control algorithm that significantly shortens passenger waiting time, characterized by: Step 1: There are n elevators in total, and two of them are set to normal operation; Step 2: At least one elevator is on standby on the first floor at all times; Step 3: From the 2nd floor up, each floor is no more than two floors away from the nearest elevator. When one or more elevators start moving, the algorithm uses the elevator that has no outbound call signal or has completed its mission to fill the vacant seat on that floor. In the second step, when the elevator is running, the elevators are distributed on different floors. When the elevator on standby on the first floor starts, the topmost internal call button is used as the starting signal, and the elevator on the target floor or the nearest elevator to the target floor returns to the first floor to standby. If the elevator on the target floor is also triggered, the elevator closest to the original elevator on the first floor and not triggered returns to the first floor to standby. If there is no elevator that meets the conditions, the elevator will go to the floor with the slowest arrival according to the internal call button signals of each elevator; In the third step, the operation of two elevators in normal operation can affect the parking floors of other elevators, while other elevators will not affect these two elevators in normal operation; at any time, there is an elevator on the first floor, and each floor from the second floor up is no more than two floors away from the nearest elevator. When the elevator starts running, each elevator sends a filling signal to the nearest elevator to the target floor according to the button inside the elevator. If the target elevator is occupied, it will turn to the elevator closest to the elevator that sent the signal to fill the vacant floor; if there is no elevator that meets the conditions, the elevator with the highest floor of the outside call button and the lowest floor of the car button will be arranged to fill the vacant floor; The elevator group control algorithm is as follows: The relationship between the running time and distance of a single elevator is: X = 0.5 × (T - T1 - t) × (T - T1 - t) × Q + X0; where X represents the distance traveled by the new algorithm elevator; T represents an operating cycle, T = T0 + T1 + t, T0 represents the elevator running time, and T1 represents the passenger waiting time; Q represents the slope of the tangent line of the running speed and time coordinate curve, X0 represents the distance between the initial count value and the first floor; t represents the time consumed by the algorithm in finding the completing elevator, which is a very small value; Elevator car speed: V = √2 × ∑A' × X; ∑A' represents the average acceleration during the operation of the elevator; When the entire system is running, the elevator maintains safe and fast operation according to the set values ​​of A and Q; According to the calculated size of T1, the minimum value is found, the appropriate target filling elevator is automatically calculated, and the filling signal is sent.

2. The elevator group control algorithm according to claim 1 is characterized in that: in the fourth step, the position of the elevator to be moved is determined based on the algorithm assuming that both elevators are normal. If one elevator fails, the elevator closest to the failed elevator will take over the up call or down call signal that has been triggered. The elevator on the upper floor of the failed elevator will take over the down call task, and the elevator on the lower floor of the failed elevator will take over the up call task. When there is no up or down indication signal from the failed elevator, the floor position of the failed elevator will be re-determined.

3. The elevator group control algorithm according to claim 1 is characterized in that: the fifth step enters the maintenance state. When the maintenance is completed, the elevator needs to arrive at the terminal station for reinitialization, and according to the algorithm, it stops at a position no more than four floors away from the nearest normally operating elevator, and then operates normally.

Images