JPS6334111B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a group management control method using an evaluation formula for a predicted value of hall waiting time to determine which elevator among a plurality of elevators is assigned to a hall call. .

It has become common for group management control devices to manage multiple elevators to use small computers (mainly microcomputers). Then, various signals of elevator car status and hall status are obtained, a comprehensive evaluation formula is calculated, and the optimum car number for the target hall call is determined.

Although various forms of evaluation formulas are used, it is usually expressed as the following formula.

E=F(xd, Cd, Hd, Wd)+Td...(1) However, F indicates a function, and xd indicates the relative floor difference between the landing area to be calculated and the car to be calculated, depending on the ascending/descending direction. Cd indicates the number of stops due to only car calls up to the calculation target landing, and Hd indicates the number of stops assigned to hall calls on intermediate floors up to the calculation target landing. Wd indicates the car load (because the car is full), and Td indicates the waiting time that has elapsed by the time the evaluation value is calculated.

This evaluation formula basically indicates a predicted value E of the hall waiting time. However, the conventional evaluation formula shown in equation (1) only incorporates information at the time of calculating the evaluation formula, and cannot predict the number of car calls that will increase when assigned to a landing call on an intermediate floor. The evaluation formula did not necessarily accurately represent the predicted value of the waiting time at the boarding point. This has led to inconveniences such as incorrectly selecting the elevator, increasing the waiting time at the hall, and first-arriving car calls (a phenomenon in which other cars arrive by car call before the assigned car).

The present invention has been developed in view of the above-mentioned drawbacks, and it predicts the distribution and number of car calls that will be derived when assigned to hall calls on intermediate floors, and uses this predicted value to calculate the increase in waiting time on the target floor. is added to the evaluation value, thereby accurately calculating the waiting time at the landing, selecting the optimal car, reducing the waiting time for the hall manager, reducing inconveniences such as car calls arriving first, and improving service for users. The purpose is to

FIG. 1 is a system diagram showing the basic configuration of a group management control device to which the present invention is applied. 2A in Figure 1
-2H is a control device (interface device) having the same function, which is provided for each elevator, and alphabets A to H are attached to distinguish between the elevators. FIG. 1 shows a case where there are eight elevators. Further, the arrow lines connecting the control devices (interface devices) in FIG. 1 indicate a plurality of parallel signals. All registers have the number of bits equivalent to one word in a small computer. Reference numeral 1 denotes a common hall call registration circuit, in which registers for the corresponding floor and direction are set at the time of hall registration, and the registers are reset when a car arrives. 3A-3H
is a car status buffer, which inputs various car status signals including a car position signal. 4A to 4H are car call registration circuits, which are set at the time of car call registration and reset when a car arrives. 5A to 5H are quasi-car call registration circuits that store hall calls assigned to the car and are reset when the car arrives.
6 is a wiper select circuit, by specifying the address where the signal exists using the output register 9, the necessary signal is selected by the number of bits corresponding to one word of the small computer 8, and is sent to the input register from the same signal line. Enter 10. 7 is a decoder circuit that outputs a signal from the small computer 8 through the output register 11;

FIG. 2 is a comprehensive flowchart showing the entire group management control method, and in addition to the conventional program for allocating hall calls, a section for storing statistical distribution of car calls and hall waiting times is added.

Figure 3a shows the statistical probability distribution of car calls, showing the probability distribution of car calls made when responding to a call to get off the top floor landing, and the probability distribution of car calls made when responding to a call to go up the bottom floor landing. ing. Here, we use a building with 10 floors as an example, and the method for determining these values is shown in Figure 8a.

Figure 8a shows symbols A1 to A9 in Figure 2 in detail, and car calls that occurred in the past are stored by direction, floor, and time zone as shown in Figure 3b. An area is set up in a small computer to count up by 1 each time a car call is registered, and when a certain period of time has passed or the total number of car calls at all landings has reached a certain value, the car call count for each floor is counted. Divide the register by 2 or some other number to prevent overflow, halve (or reduce) the weight of data from the distant past, and provide a learning function. At this time, 〓 ^F K _o (F) is also automatically cleared by 1/2. The probability distribution P _o (F _k ) in Figure 3 is There is a relationship between

Figure 8b shows symbols A9 to A14 in Figure 2.
This is a flowchart for determining the average unregistered hall call time. Second
In the figure, the unregistered time for hall calls by hall and the unanswered time for hall calls by hall are counted up, and when a certain period of time has elapsed, the average unregistered time for each hall is calculated.
This has the effect of dividing each register into two equal parts to prevent RAM overflow, and at the same time providing a learning function. By performing these steps for each landing, it is possible to know the derived car call probability distribution and the unregistered time at the landing. In FIG. 3, 21 is a register for counting the number of car call registrations provided for each direction and floor in time zone n, and for the ascending direction, K _o (F ₀ ), K _o (F ₀ +1), K _o
(F ₀ +2)..., and the descending direction is K _o (F ₁ ), K _o (F ₁ +
1), K _o (F ₂ +2)... Finally 〓 ^F K _o (F)=
K _o (F ₀ ) + K _o (F ₀ +1) +...+K _o (F ₀ ) + K _o (F ₀ +
1) A register area for storing +... is provided. 22 is a similar register in time zone n+1.

Next, an evaluation formula representing the hall waiting time will be explained. When a certain hall call is made, the evaluation formula for determining whether to allocate this car is to calculate the time required to arrive at the hall where the longest waiting time is expected to be, which is assigned or is about to be assigned to each car. Generally, calculations are made for each car, and the car that is expected to have the longest wait time is assigned to the assigned boarding area. Predicted value of waiting time E until arriving at the boarding point
is expressed by the following equation.

E= _M 〓 ^k=1 f (xk) + _M-1 〓 ^k=1 td + T _Fi + T _s ... (2) M indicates the planned number of intermediate floor stops. f(xk) is the time required to travel by the relative floor difference xk and is a function of xk. This is because the speed pattern is determined by the relative floor difference as shown in Figure 5a, and the speed pattern is determined by the relative floor difference as shown in Figure 5b.
As shown in , travel time (the time required from departure to arrival) is also a function of the relative floor difference. That is, the elevator stops at multiple locations due to car calls before reaching a certain destination floor. Therefore, the predicted arrival time to a certain destination floor is basically expressed as the sum of the respective travel times to the destination floor and the door opening time. td is the door opening time,
If the average door opening time is used, _o-1 〓 ^k=1 td = (n-1) td
becomes. T _Fi is the floor targeted for evaluation calculation (usually the longest waiting floor)
, it is the time that has elapsed from the time the hall button was pressed to the present time (the time of evaluation value calculation). T _s is the remaining time of the departure interval when departure interval control is being performed.

For example, in the case of Figure 4, the time E required to reach the 9th floor is E=f if T _Fo and T _s are not considered.
It is given by ( _x1 )+f( _x2 )+f( _x3 )+2td+0+0. However, when arriving at the 5th floor, a new car call is made and if it is on the 6th or 8th floor, the arrival time at the 9th floor will be significantly delayed. Therefore, there is a need to predict the number of car calls and floors that will be made when the car stops in response to a hall call on an intermediate floor, which is the object of the present invention.

FIG. 6 is a time chart showing the status of hall calls. t ₂ , t ₄ , and t ₆ were unregistered hall calls, and it is thought that there were no passengers waiting at the hall during these times. _t1 ,
t ₃ and t ₅ are non-response times, which represent the time from when the hall call is registered until the assigned car arrives and the door opens. 31A, 32A... are hall call registration times 31B,
32B... indicates the departure time of the allocated cart.

Record the unanswered time and unregistered hall call time during the same time every day or past number + decile in the computer's RAM, and perform statistical processing to calculate the expected number of car calls, K. is expressed by the following equation.

K=T _a /T _b +1 T _b =t ₂ +t ₄ ...+t _2o /n T _b is the average unregistered time, which represents the average time for one person to come to the landing, and the data stored in the RAM. It is determined by T _a is the estimated time it will take to arrive at the landing on the intermediate floor (this is (2)
) is obtained by calculating the evaluation value of the formula. That is, it is considered that the number of passengers waiting at the platform increases by Ta/Tb people, and when a certain person presses the platform button for the first time, the equation K=Ta/Tb+1 is given. In other words, the number K of car calls per floor is expressed by Ta/Tb+1.

In the example in Figure 4, the car calls that are made because the car arrives at the 5F landing on the intermediate floor are from 6F to 10F, and the probability distribution Pon (Fk) of car calls is obtained by normalizing the probability distribution from 6F to 10F in Figure 3. is given by Therefore, the number of car calls Kn that is expected to increase by the time the car reaches the 9th floor is given by Kn=K(Pon(F6)+Pon(F8)) since there are already car calls on the 7th floor. If the number of car calls increases, the number of floors at which cars stop will increase, the time the car will open the door will increase, the number of short trips will increase, and the time it will take to arrive at the landing will be delayed. If the correction value for this purpose is set as a function of the number of car calls that are expected to increase, the landing arrival time can be obtained with high accuracy. Therefore, the final predicted value of waiting time Ey
The evaluation formula representing Ey＝ _M 〓 ^k=1 f(xk)＋ _M-1 〓 ^k=1 td＋T _Fi +T _s + _l1 〓 ^l=1 Tz(K ₁ )...(3), and this formula (3) is the addition of Tz to equation (2), where Tz is a correction value for the time expected to be delayed due to an increase in the number of car calls when a car is allocated to a mid-floor landing call. Therefore, Tz becomes a function only of the increasing number of car calls, as shown in Figure 7, and if the number of car calls that stop at intermediate floors is ₁₁ , the total correction time is _l1 〓 ^l=1
Tz(K ₁ ). Note that ₁₁ indicates the number of stops at intermediate floors.

According to the present invention, it is possible to record the distribution of past car call registrations for each direction and floor, and to obtain the probability distribution of car calls that occur through statistical processing, and to record the distribution of past car call registrations for each floor. The registration time is also recorded in the same way, and based on the average unregistered time, the waiting time that will increase due to the car call that will be generated when the mid-floor hall call is answered is predicted, and the time of arrival at the landing area to be calculated is accurately calculated. It is possible to reduce inconveniences such as waiting for the hall manager and first-arriving car calls, which helps improve service for elevator users.

Further, according to the data recording method shown in the present invention, a learning function is provided using a small RAM area. It is possible to predict the derived car call probability distribution and the average landing unregistered time for each floor direction, and has the feature that as the elevator system operates, more accurate predicted values can be obtained.

[Brief explanation of the drawing]

Fig. 1 is a system configuration diagram of a group management control device to which the present invention is applied, Fig. 2 is an overall flowchart showing the entire group management control method, and Fig. 3a is a statistically calculated probability of car calls occurring. Figure 3b is an area configuration diagram of the car call count register in a small computer, Figure 4 is a specific example for calculating the evaluation formula, and Figure 5a is an elevator floor differential speed pattern. Figure 5b is a graph showing the floor differential running time, Figure 6 is a time chart showing the hall call status, and Figure 7 is the increase in the number of car calls due to stops at intermediate floor landings. 8a and 8b are flowcharts showing the method for determining the statistical distribution of car calls and the time for determining the average unregistered hall call time.

Claims (1)

[Scope of Claims] 1 A plurality of elevators are put into service for a plurality of floors, and an optimal elevator is determined using a comprehensive evaluation formula that determines elevator operation in response to a landing call, and the elevator is assigned to a landing. In the group management control method for elevators, when calculating the target landing waiting time for the evaluation formula calculation, the average unregistered time for landing calls stored for each landing up to now and the current intermediate waiting time are used. Calculate the ratio with the predicted value of the waiting time at the floor landing, use this ratio to calculate the number of cars from which car calls are derived, and then calculate the statistical probability distribution based on the positions of car calls that have occurred in the past. The car call is derived by a predetermined function based on the ratio of the average landing call unregistered time and the predicted waiting time of the intermediate floor landing, the number of cars from which the call is derived, and a statistical probability distribution. Calculate the estimated waiting time at the platform that will increase due to the car stopping,
A group of elevators characterized in that the predicted waiting time at the landing point is calculated by adding this waiting time to the predicted waiting time based on the determined car status signal, and the allocation of cars is determined according to the predicted waiting time at the landing point. Management control method.