JPS6312577A - Controller for elevator - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to a control device that selects a service car for a hall call from among a plurality of elevator cars and displays the selected service car in the hall.

[Conventional technology]

When a plurality of elevators are installed in parallel, one normal group management operation is performed. One type of group management operation is an assignment method, in which when a hall call is registered, the car to be serviced is immediately selected.

The above-mentioned hall call is assigned to this car, and only the assigned car responds to the hall call, thereby improving driving efficiency and shortening the hall waiting time.

In addition, in group-controlled elevators that use this kind of allocation system, arrival warning lights are generally installed at the landings on each floor for each car and in each direction, and this allows the passengers waiting at the landings to receive a forecast of the allocated car. For example, JP-A-59
It is shown in the publication No.-26874.

In other words, when car No. 1 (hereinafter simply referred to as car No. 1) is currently on the 1st floor, an up call for the 3rd floor is registered, and this is the 1st car.
Suppose that Unit 0 crashes.

The arrival forecast light on the third floor will be lit. As a result, 3
Passengers waiting in the ascending direction of the floor will know that the service car is in car No. 1, and will wait in front of the landing of car No. 1.

Next, when Unit 1 departs from the first floor and approaches the third floor and a stop command is issued, the forecast display on the third floor uplight is canceled.

At the same time, a one-cycle pulse signal is output, and the third floor uplight flashes in accordance with the pulse signal. This allows waiting customers to know that their cart has arrived. Then, open the basket door 1
After passengers have boarded and alighted, the doors begin to close, and when one door is closed, the uplights stop flashing and turn off.

In this way, the forecast display is displayed before the arrival of the service cart.
Since this service car is guided, the waiting customers have the advantage of being able to wait in front of the car whose forecast is displayed with peace of mind.

[Problem that the invention seeks to solve]

In the conventional elevator control device as described above, calls are generated randomly, so the predicted car (hereinafter referred to as the forecast car) does not always arrive first, and the unforeseen car (hereinafter referred to as the non-forecast car) does not always arrive first. A car call for the first landing call registration floor is registered in the forecast car, and a car may arrive before the forecast car in response to this car call, resulting in a so-called forecast failure. In this case as well, the same arrival display as for the forecast car is performed for the non-forecast car. Therefore,
If the non-forecast car arrives slightly before the forecast car,
The waiters are waiting in front of the forecast basket.

Lured by the arrival display of a non-forecast basket, they begin to move toward that basket. However, as the forecast cart arrives soon, waiting passengers are confused as to which car to board, causing confusion at platform 8. In addition, passengers may board the non-forecast cars and the forecast cars separately, which is not desirable in terms of transportation efficiency. There are other problems.

In addition, even in a system that predicts the order of arrival at a landing and displays the forecast at the landing, for example, the first car to arrive as the first car and the second car to arrive as the next, the prediction of the arrival order may be incorrect. There is also the problem that the next car arrives first, causing confusion for waiting customers.

This invention was made to solve the above problem, and is an elevator control that prevents non-forecast cars from arriving before forecast cars, thereby preventing confusion among passengers waiting at the second landing. The purpose is to provide equipment.

Means for Solving Problem C] When the elevator control device according to the present invention detects a non-forecast car that is expected to arrive at the hall call registration floor earlier than the forecast car in the same direction as the hall call, A determination means for outputting an arrival promotion command signal to the forecast car, and a promotion means for switching to a promotion operation that reduces the stop time or running time of the forecast car at a floor halfway to the landing call registration floor when the arrival promotion command signal is received. It is something that

[Effect]

In this invention, when a non-forecast car that is expected to arrive at the hall call registration floor before a forecast car is detected,
The system restricts the assignment of new landing calls on intermediate floors to forecast cars, increases the maximum speed or acceleration/deceleration above normal, switches to accelerated operation, and prevents forecast cars from arriving at the landing call registration floor. earlier than non-forecast baskets.

〔Example〕

FIG. 1 to FIG. B are diagrams showing one embodiment of the present invention.

Figure 1 is an overall configuration diagram showing the first group management device (1) 1 and the car control device 0z for No. 1 and No. 2 cars controlled by this,
Consists of 0. (IIA) is the landing call for each floor (
a landing call registration means for registering upbound calls and downbound calls;
(IIB) is an allocating means for selecting and allocating the best car to service a hall call.

For example, the time required for each car to respond to a hall call on each floor is calculated and the car with the shortest time is allocated. (1
) 0) is when the non-forecast car is expected to arrive at the landing call registration floor before the forecast car.

determination means for outputting an arrival promotion command signal to the forecast car to promote arrival at the landing call registration floor;
(HD) receives the arrival promotion command signal.

This is a promotion method that sets the priority of the landing to a higher value than before so as to make it difficult for the forecast car to receive a new assignment to a landing call on a floor halfway up to the landing call registration floor.
Hall call registration means (1) A) and allocation means (1) B)
Both are well known.

(12A) is a hall call cancellation means for outputting a hall call cancellation signal for each floor; (12B) is a car call registration means for registering a car call; (120) is for controlling the lighting of the arrival forecast light (not shown) for each floor. Arrival warning light control means.

(12D) is an operation control means that controls basic operations such as running, stopping, and driving direction of the car in order to respond to the assigned hall call, and (12Ft) is a door control means that controls the opening and closing of the door. , these means (12A) ~ (
12E) are all well known. Note that the car control device +131 for the second car is also configured in the same manner as the car control device for the first car.

Figure 2 is a block circuit diagram of the group management device aυ.The first group management device +Il+ consists of a microcomputer (hereinafter referred to as microcomputer), a CPU (river), and a ROM (1) and 2).

RAM (1) 3), input circuit (1) and output circuit (1)
)5). The input circuit (1) 4) receives the hall button signal H from the hall button on each floor and the car control device ff.
'A.

The status signals of Unit 1 and Unit 2 from 03 are input.

A signal (1!9) to the hall call registration light (not shown) built in each hall button and a signal to the car control device Q3.ff3 is output from the output circuit (1) 5).

Next, the operation of this embodiment will be explained with reference to FIGS. 3 to 1. These are 70-charts showing the programs stored in the ROM (1) 2) of the microcomputer that constitutes the first group management device αυ, where FIG. 3 shows the group management program, and FIG. 4 shows its determination program 123. Figure m5 also shows the priority setting program export, Figure 6 shows the allocation program (G), and Figure 7 shows the priority setting program.
The figure shows the predicted waiting time calculation program (63), (67
).

First, an overview of the group management operation will be explained with reference to FIG.

When the human-powered program Qv is executed, the 1st landing button signal (
141 and the car status signal from the car control device [3, 63 (car position, direction, stop, running 2 doors open/closed status).

(car call/hall call cancellation command signal, etc.).

In the hall call registration program c23, the 2 hall button signal U
41 and the hall call cancellation command signal, the registration/cancellation of one hall call, the lighting/extinguishment of the hall call registration light, and the counting of the duration of the hall call are performed. In the determination program (c), when the non-forecast car is expected to arrive before the forecast car, it sends arrival promotion command data to cause the forecast car to perform a promotion operation to promote arrival at the landing call registration floor. Set.

In the priority setting program Q-hinge, upon receiving the arrival promotion command signal, the priority of the second landing call is set to a higher value than before. In the allocation program C, select one hall call that is not assigned to any car, calculate the predicted waiting time including the hall calls that have already been assigned, and correct it by combining this with the hall priority. Determine the predicted waiting time. and,
The sum of the square values of the corrected predicted waiting times is set as an allocation evaluation value, and the selected hall call is allocated to the car with the smallest evaluation value. The output program (1) outputs a 1-hall call registration light signal, 1-assignment signal, arrival promotion command signal, etc.

Next, the operation of the determination program θJ will be explained with reference to FIG.

In the expected arrival time calculation program in step 01).

A known expected time of arrival is calculated. This calculates the predicted time until the car arrives at each floor and direction. For example, it is assumed that it takes 2 seconds to advance one floor and 10 seconds to stop. It is calculated as if it were to be driven around. In step 03, the arrival promotion command data for all landing areas of the first and second cars is reset.

Next, the first floor up call determination program (4) consisting of steps (to) to (43) is executed.

In step 0, it is determined whether the 1st floor up call is registered, and if it is registered, in step 0, it is determined whether it is the forecast car or not. At step (to), it is determined whether Unit 2 has a car call on the first floor, and if it has a car call, step (to) is determined.
Expected arrival time in multiple directions on the first floor of Unit 2 at Tlu+2
1 determines whether it is less than the first specified value T1 (for example, 20 seconds). This is because expedited driving may make passengers in forecast cars and passengers waiting at the landings assigned to forecast cars feel suspicious, and may increase the waiting time for passengers assigned to non-forecast cars to call at the landings. Because of the negative impact it would have on service, we cannot afford to promote driving frequently. Therefore.

Promoted when rII'J at the time of predicted arrival of non-forecast cars becomes shorter (correspondingly, the dispersion of predicted arrival times is thought to become smaller), and predictions of incorrect forecasts [61] are almost accurately performed. This requires a decision as to whether or not to drive. As a result, it is possible to reduce the problem of extremely poor service due to accelerated driving being carried out prematurely. In addition.

This first specified value T1 needs to be set appropriately according to traffic conditions.

Now, the expected arrival time T l u+21 is the first specified value T1
If it is determined that the following is true, in step 13n, it is determined whether Unit 2 is likely to arrive at the first floor sooner.

Judgment is made based on T2≦Tlutll −T1u+21≦T3.

Here, 'r1um+ Estimated arrival time for the first floor of Unit 1 in the upward direction T2゛Second specified value (for example -5 seconds) T5゛Third specified value (for example 20 seconds) Here, the second specified value T2 is 0 seconds This is due to the following reason: instead of 15 seconds. In other words, even if the second specified value T2 is set to 0 seconds, a non-forecast car with a shorter expected arrival time than the forecast car will be detected as a car that will cause an incorrect forecast, and this will still be used to predict an incorrect forecast. It is enough. but,
Considering that there are variations in the estimated arrival time values, even if the forecast car is expected to arrive about 5 seconds earlier.

It is quite possible that the non-forecast car will arrive earlier. Therefore, in order to safely determine the possibility that the forecast will be incorrect,
The second specified value T2 is set to a negative value. Note that this second specified value T2 needs to be set appropriately according to traffic conditions. Also, Tlu(Il-T 1u f21≦T5
This is due to the following reasons. In other words, when the above-mentioned negative effect on accelerated driving is taken into account, and when the forecast car is expected to arrive considerably later than the non-forecast car (20 seconds or more in this example), the forecast It was decided not to perform accelerated operation because it would cause fewer problems in terms of service if it were to dislodge.

By restricting accelerated driving in this way, the negative effects of accelerated driving can be reduced. In addition, if this happens,
This condition is not necessarily required.

Now, when the condition of step 07) is satisfied, in step C4, the arrival promotion command signal for the first floor up call is set.

If it is determined in step (b) that the forecast car is not the first car, then in step O1 it is determined whether the forecast car is the second car, and it is determined that it is the second car.

In steps OI~(43), the process is carried out in the same manner as the first machine.

Next, the operation of the priority setting program @ will be explained with reference to FIG.

In step (51), it is determined whether there are many passengers at the landing on the first floor in the upward direction. This is a flag (R
(preset in OM(1)2)), but it is a value that changes depending on each building and traffic condition. If it is determined that there are many passengers, step (5)
In 2), the visitor priority level 1) u for the upper floor on the first floor is set to the crowded floor corresponding value M1. If it is determined that there are few passengers, the normal floor corresponding value MQ is also set. Here, the crowded floor refers to, for example, the first floor up, the dining room floor during lunch time, etc., and the corresponding value is, for example, Mo=0. M1=10. It is determined that M2=100. In step 5, it is determined whether the arrival promotion command signal for the call to the first floor above is set, and if it is set, the hall priority is increased by the corresponding value M2 to P1u + M2.
shall be. If the arrival promotion command signal is not set, step (55) is not executed.

Now, the priority setting program for the first floor up call (56)
When the above process is completed, the priority setting program (5) consisting of the priority setting program for up calls from the 2nd floor to the 9th floor and the priority setting program for down calls from the 10th floor to the 2nd floor is executed. The setting is shown in, for example, Japanese Patent Laid-Open No. 53-87446.

FIG. 6 shows the allocation program (c). This is basically described in Japanese Patent Publication No. 58-48464.

The hall call selection program (60) selects one hall call to be assigned to a car. Temporary allocation program (1
(for car) (61), the above-selected landing call is
Temporarily allocate to the No. 1 machine, and set the provisional allocation signal together with the assignment signal for the No. 1 car. Estimated arrival time calculation program (for provisional allocation of Unit 1) <62).

Car No. 1 is assigned to each floor according to the car call signal and provisional assignment signal.
The estimated arrival time for each direction is calculated, and for the second car, the estimated arrival time for each floor and direction is calculated in accordance with the car call signal and the assignment signal. The predicted waiting time calculation program (63) calculates the predicted waiting time based on the 10% roaring car for each hall call.

At this time, the estimated waiting time is also corrected based on the 1-hall priority (FIG. 7).

Evaluation value calculation program (for provisional allocation of Unit 1) (in 6ri,
For Car No. 1, the sum of the squares of the predicted waiting times for each hall call is determined as the evaluation value E1.

El-(wlu)2+(w212)2+-(W9u)2
+(W+oa)2+-(W2a)2 here r w+u
...W9u: 1st floor...9th floor up call predicted waiting time Wlod...W2d: 10th floor...2nd floor down call predicted waiting time provisional allocation program (for Unit 2) (65) 2. Temporarily allocate the selected hall call to car No. 2, and set a temporary allocation signal together with the allocation signal of car No. 2. The expected arrival time calculation program (for provisional allocation of car No. 2) (66) calculates the expected arrival time for each floor/direction according to the car call signal and provisional allocation signal for car No. 2, and calculates the expected arrival time for car No. 1 according to the car call signal and provisional allocation signal. The expected arrival time for each floor and direction is calculated according to the assigned signal. The child side waiting time calculation program (67) calculates the predicted waiting time in the same manner as the calculation program (62).

In the evaluation value calculation program (68), the calculation program (
The evaluation value E2 of the second machine is determined in the same manner as in step 6.

E2 = (Wlu) 2+(W2u)2+=-(W9u
)2+(Wloa) 2+-(W2d) The two-car assignment program (69) selects the car with the smaller value out of the evaluation values E1+E2, and sends an assignment signal to the car with the selected hall call as a regular assignment. Set.

Next, in FIG. 7, there is a predicted waiting time calculation program (65).

The operation of (67) will be explained.

In step (71), it is determined whether the first floor up call is registered, and if so, in step (72), whether the first floor up call is assigned to car No. 1 or not.

Or determine whether it has been provisionally allocated. If it is allocated or provisionally allocated to the No. 1 car, in step (73), the uplink call duration R1u+' is estimated arrival time T of the No. 1 car.
The predicted waiting time W1u is set from the sum of 1u (1) and the hall priority level Flu of the upper seat call. If it is determined in step (72) that the No. 1 machine is not infested with the insect, the determination is made regarding the second machine in step (7). If it is assigned or provisionally assigned to the second machine, in step (75), the step (73) is determined. ) Set the predicted waiting time W1u in the same manner as in step (7).
If it is determined in step 1) that the first floor up call is not registered, or if it is determined in step (74) that it has not been allocated or provisionally allocated to the second car.

In step (76), the predicted waiting time W1u is cleared to zero.

Now, the predicted waiting time calculation program for the first floor up call (7
When the process 7) is completed, a predicted waiting time calculation program (78) consisting of a predicted waiting time calculation program for up calls from the 2nd floor to the 9th floor and a predicted waiting time calculation program for down calls from the 10th floor to the 2nd floor is executed. .

FIG. 8 shows a specific example when controlled as described above,
Currently, Unit 1 is descending from the 5th floor, and the car call for the 4th floor is C41)1.
2, assigned to the up call Flu on the first floor.
It is assumed that Car No. 2 is descending on the first floor and is assigned to the car call on the first floor - (2) Rich, and the up call F2u on the second floor. In addition, the duration R1u of the first floor up call Flu is 1
2 seconds, the expected arrival time T lu+1) by Unit 1 is 1
8 seconds, the expected arrival time T lu t21 by Unit 2 is 1
2 seconds, the duration of the second floor up call F2u is R2u
is 16 seconds, and the expected arrival time T2u+21 by the second aircraft is 24 seconds.

At this time, the first floor up call determination program (4
In this case, Unit No. 1 is assigned to the first floor above, called Flu, and forecasted. Unit 2 has a car call (2) on the first floor. Then, the expected arrival time of the second aircraft Tlui21 (first specified value T1 (2o seconds), second specified value T2 (-5 seconds) ≦T
1u(1)-T1u+21≦Third specified value T3 (20 seconds)
Since this holds true, the arrival promotion command signal for the first floor call is set. In the second floor up call determination program, since car No. 1, which is a non-forecast car, does not have a second floor car call, the arrival promotion command signal is not set for the second floor up call F2u. It is not set for other floors either.

Next, the priority setting program for the first floor up call shown in Fig. 5 (
56), it is assumed that the multi-directional landing area on the first floor has a large number of passengers and is expected to be crowded. Also, since the arrival promotion signal for the 1st floor up call is set, the 1st floor priority is p4u-
= Ml + M2 = 1) 0. Assuming that the second floor upbound landing is not expected to be crowded, the first landing priority P2u=MO=0. On other floors, the hall priority is 0.

In such a state, if the 3rd floor lower floor call 1)"3d is newly registered, the 1st landing call selection program (60)
Then, the third floor down call F1a is selected as the call to be assigned. First, provisional allocation program (for Unit 1)
At (61), the 3rd floor up call is provisionally assigned to the No. 1 car, and a provisional assignment signal is set. and.

Expected arrival times in this state are calculated respectively using a predicted waiting time calculation program (63).

The predicted waiting time for each hall call is calculated in consideration of the hall priority. Furthermore, the evaluation value calculation program (for provisional allocation of Unit 1) (
6, the sum of the square values of the predicted waiting times is obtained.

Similarly, programs (65) to (68) are executed, and the sum of the square values of the predicted waiting times when the third floor up call F'ga is provisionally assigned to the second car is determined. That is, it is calculated as shown in the table below.

"To the power of [-, evaluation value E1 = 1502 + 402 + 142 = 24,
296 and.

The evaluation value E2 is calculated as 1402+502+82=22,164.

Therefore, by the two-car allocation program (six), the car with the smaller evaluation value, that is, the car No. 2, receives the down-call F'xa on the third floor
assigned to. By this assignment.

The expected arrival time for multiple directions on the first floor is Tlu (1) (1 u seconds) rl/'l (2
2) < T 1u (21 (24 seconds)), and the possibility that Unit 1 will arrive at the first floor first becomes much higher than before, so it is possible to reduce the number of missed forecasts.

If the landing priority P1u of the first floor up call Flu is 0, then B1=402+4[12+142=3396E2=
302+502+82=3464, gl(
g2 Suddenly, the 3rd floor down call F3a was assigned to Car 1. Therefore, 'I'1
ufl) (28 seconds) > T1u421 (12 seconds), and there is an extremely high possibility that Unit 2 will arrive at the first floor first, which means that the forecast will almost certainly be wrong.

In this way, when a non-forecast car that is likely to arrive before a forecast car is detected, the priority of the hall call that is likely to be missed as described above is set to a higher value than before, and the forecast is updated. To make it difficult to newly allocate a mid-way landing call to a car. This allows the forecast car to quickly respond to predicted hall calls. Further, since a hall call on an intermediate floor is assigned to another non-forecast car, the arrival of the non-forecast car can be delayed. In the end, the number of missed forecasts can be reduced by promoting operation by limiting the number of boarding halls on intermediate floors.

In the embodiment, in order to limit the allocation of hall calls on intermediate floors, the priority of hall calls that are likely to miss the forecast is set to a higher value than before.

Although this was achieved by calling a boarding hall with an apparently very long waiting time, the means for limiting the number of seats to one is not limited to this. A similar function can be obtained by completely prohibiting the use of hall calls on intermediate floors.

FIG. 9 is a judgment program Q showing another embodiment of this invention.
4, and whereas the one in FIG. 4 makes judgments based on the expected arrival time, the one in FIG. 9 introduces a forecast deviation index, and c3n to G41. L cl
l, (4Q~(45) tdm S Figure 41
) There is.

In this embodiment, the car call probability calculation program in step (31A) is executed after the predicted arrival time calculation program in step 13n. This is 5For example, JP-A-53
i 18651.

For each car and each floor, the probability that a car call will occur on that floor is calculated.

Then, if it is determined in step (34) that the forecast car is car No. 1, then in step (36A), the expected arrival time Tlufil, T1u+ of cars No. 1 and No. 2 in the direction of the first floor above
21 and the first floor car call occurrence probability 01f2+ of car No. 2, the forecast failure index (probability) Ylu+21 is calculated using the following formula.

y, u+2+=c1t2+x (15-Haq)T1u(
1) Here, if the value in [ ] is [X], [X] has the following meaning.

When x>1 [xl=1 When 0≦X≦1 [x]-x

”Next, in step (37A), it is determined whether there is a high possibility of causing a forecast error for Unit 1 using the forecast error index Y1u.
+21 is greater than or equal to a predetermined value y1 (for example, 0, 1), and if it is determined that there is a high possibility that the forecast will be incorrect, the arrival promotion command data is sent in step (to),
Facilitate the arrival of Unit 1 on the 1st floor. In addition, if the forecast basket is No. 2, step (41A), (4
2A) If there is a high possibility that Unit 2 will miss the forecast due to (4M), then the arrival of Unit 2 to the first floor will be accelerated.

In this way, it is possible to predict incorrect forecasts with high accuracy based on probability.

FIG. 10 and FIG. 1) are diagrams showing other embodiments of the present invention, FIG. 10 is an overall configuration diagram, and FIG. 1) is a promoting means (12).
F) and the operation control means (12D), in which the promotion means (12F) is used as the car control means 03.F) instead of the promotion means (IID) in FIG. ff3 to increase the maximum speed and acceleration/deceleration of the forecast car.

In the figure, (St) is set by the determination program Q3 in Figure 4 and becomes rLJ when the engine is operated at normal speed.

an arrival acceleration command signal that becomes rHJ when accelerated operation is performed;
(52), (55) are NOT gates, (5) A running command signal that becomes rHJ when the car starts running and becomes rLJ when it stops, (ss) is a terminal when the running command signal changes from rLJ to [H-1. H1, H2, A1.A2
Speed command signal (5) of maximum speed and acceleration/deceleration corresponding to
5a), terminals H1 + H2 each have a maximum speed of 150 l in + 160 m/mj
n and acceleration/deceleration (19 m182, which corresponds to 1.1 m/82. (56) is a speed control device that controls the speed of the car in accordance with the speed command signal (55a).

In other words, in the normal state, the arrival promotion command signal (51) is "L", so the output of the NOT gates (52) and (53) becomes rHJ, and the terminal H of the speed command generator (55)
1+AI input becomes rHJ. Now, the speed command generator (55) generates the speed command signal (55a) corresponding to the input.
) output and speed control device! (56), the car has a maximum speed of 150 m/mi. , and is operated at an acceleration/deceleration of 0.9 m/B2.

Unit 2 can cancel the forecast for Unit 1's 1st floor up call (2T). If saturation is predicted to be high, arrival promotion command signal (51)
is rHJ, so terminals H2 and A of the speed command generator
The input of 2 becomes [Hl. Now, Unit 1 has a maximum speed of 1
The vehicle is operated at a speed of 60 m/min and an acceleration/deceleration of 1) m//82, increasing the running time. Therefore, since the arrival at the first floor is earlier, it is possible to prevent errors in the forecast.

Note that the means for detecting a non-forecast car that is expected to cause a forecast failure is not limited to the embodiment.

In particular, if the forecast failure index is calculated based on both the predicted arrival time of the forecast car and the non-forecast car, and the index value increases as the possibility of the non-forecast car arriving first increases, then what kind of It may be a combination.

Further, the promotion driving means is not limited to the embodiment.

The stopping time of the car may be increased by the following means.

(7) Start opening the car door earlier than usual.

(b) Set the car door opening/closing speed faster than usual.

(2) Set the car door to fully open for a shorter time than usual (2)
B) Establish.

2) Start the car earlier than usual when the car departs.

(2) Any combination of the above (7) to).

In addition, the degree of promotion is changed as follows depending on the difference between the expected arrival time of the forecast car and the expected arrival time of the non-forecast car, so that misses in the forecast can be reliably prevented. is also easy.

(7) The greater the difference in expected arrival times, the more difficult it is to accept assignment of a new landing call on an intermediate floor.

(b) The greater the difference in expected arrival times, the greater the degree of increase in the maximum speed or acceleration/deceleration of the car.

(1) The larger the difference in expected arrival times, the earlier the car door starts to be opened.

b) The greater the difference in expected arrival times, the greater the degree of increase in the car door opening/closing speed.

(4) The greater the difference in expected arrival times, the greater the degree of reduction in the car door full opening time.

(Effectiveness: The greater the difference in expected arrival times, the earlier the activation time at the time of car departure will be increased.

e→ Depending on the size of the difference in expected arrival time, the above (7)
) to change the combination of (forces).

In addition, the order of arrival (first arrival basket, first arrival basket, third arrival basket, etc.)
・) Even if the car is displayed as a guide at the landing, if the order of arrival is predicted to be reversed, the earlier car will be promoted. Arrival with guidance display 1) Cars can be arrived at the beginning and end of the day. Specifically, this can be easily realized by making the first arriving car correspond to the forecasting car of the above embodiment and the first arriving car corresponding to the non-forecasting car.

Furthermore, the cars whose forecasts are missed are not necessarily the only cars that respond to car calls. For example, when there are many passengers going up from the first floor, up-beak operation is selected and two or more cars are assigned to the upper-bound calls on the first floor. in this case,
Normally, only one car is selected for the forecast, but if an assigned car that has not been predicted arrives first in response to a hall call, this will also be out of forecast and will confuse the waiting passengers. It can also be applied to prevent forecast errors when multiple units are assigned like this.

〔Effect of the invention〕

As explained above, in this invention. When a non-forecast car that is expected to arrive at the landing call registration floor earlier than the forecast car in the same direction as the hall call is detected, it outputs an arrival promotion command signal to the forecast car, and when this is received, the car returns to the first landing call registration floor. By reducing the stopping time or running time of the forecasting car on the middle floor of the train, the non-forecasting car will not arrive before the forecasting car, thereby reducing confusion among passengers waiting at the platform. be.

[Brief explanation of the drawing]

1 to 8 are diagrams showing one embodiment of an elevator control device according to the present invention, in which FIG. 1 is an overall configuration diagram and FIG. 2 is a block circuit diagram of a group management device. Figures 3 to T are flowcharts of each program. Figure 3 is the group management program, Figure 4 is the judgment program, Figure 5 is the priority setting program, Figure 6 is the allocation program, and Figure 1 is the prediction program. Waiting time calculation program, FIG. 8 is an operation explanatory diagram, FIG. 9 is a flowchart of a determination program showing another embodiment of the present invention, and FIG. 10 and FIG. 1) are also diagrams showing other embodiments of the present invention. FIG. 10 is an overall configuration diagram, and FIG. 1) is a block circuit diagram of the accelerated operation and operation control means. In the figure, Oll is a group management device, (1) A) is a hall call registration means, (1) B) is an allocation means, (1) 0)
Vi determination means. (1)T)) is a promotion means, f13. f13 is the car control device for No. 1 and No. 2 cars, (12B) is the car call registration means, (12D) is the operation control means, (12F)
) is a promotion means, and (51) is an arrival promotion command signal. Note that the same reference numerals in each figure indicate the same or equivalent parts.

Claims (6)

[Claims] (1) When a hall call is registered, a car that will service the hall call is selected from among multiple cars, and a forecast is displayed at the hall where the hall call is registered. determining means for outputting an arrival promotion command signal to the forecast car when a non-forecast car that is expected to arrive at the hall call registered floor in the same direction as the hall call first; and inputting the arrival promotion command signal. A control device for an elevator, characterized in that the elevator control device is provided with a promotion means for switching to a promotion operation that reduces the stop time or running time of the forecast car at a floor halfway up to the hall call registration floor. (2) The determination means predicts the expected arrival time required for each car to arrive at the landing call registration floor, and uses the non-forecast car in which the car call of the landing call registration floor is registered to reach the landing call registration floor. 2. The elevator control device according to claim 1, wherein said non-forecast car is detected whose expected arrival time is shorter than that of the forecast car. (3) The determination means predicts the expected arrival time required for each car to arrive at the landing call registration floor, and uses the non-forecast car in which the car call of the landing call registration floor is registered to reach the landing call registration floor. 2. The elevator control device according to claim 1, wherein said non-forecast car is detected whose expected arrival time is shorter than the expected arrival time of the forecast car and shorter than a certain value. (4) The determination means predicts the expected arrival time required for each car to arrive at the hall call registration floor, and calculates the probability that the car call on the hall call registration floor will be registered for each car;
Based on the above expected arrival time and the above car call registration probability, an index is calculated that becomes a larger value as the probability that each non-forecast car misses the forecast for the above landing call increases, and this forecast miss index is larger than a certain value. 2. The elevator control device according to claim 1, wherein said non-forecast car is detected as it becomes larger. (5) Claim 1, wherein the promotion means reduces the stop time of the forecast car by restricting the allocation of new hall calls to the forecast car on floors halfway up to the hall call registration floor. elevator control equipment. (6) The elevator according to claim 1, wherein the promotion means increases the maximum speed or acceleration/deceleration of the forecast car on the intermediate floor to the hall call registration floor to reduce the running time by increasing the maximum speed or acceleration/deceleration of the forecast car more than usual. Control device.