JPS606277B2 - Elevator group control device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to an improvement in a device for managing a plurality of elevator cars having uneven service floors as a group.

When operating multiple cars as a group, it is better to have the same service floor for both efficiency and ease of use.

However, due to the structure of the building, there are floors where only some cars can be serviced (hereinafter referred to as floors with uneven service).

) may be desired. In such a case, even if a car responds to a Hataba call, it becomes somewhat troublesome if the passenger who registered the Hataba call wishes to go to a floor with uneven service, and the car that arrives next to it cannot be serviced. . In other words, the passenger can take the car to a floor near the desired floor and then use the stairs, or after the car has departed, the passenger can register a landing call again and the car that will service the desired floor falls down. I have no choice but to wait until it does. To prevent this, it is being considered that a separate Hataba button from the normal Hataba button will be provided for Hata who wish to go to a floor with uneven services.

However, this is not very desirable because it costs a lot of money, and some passengers press both Habata buttons as a prank, reducing the efficiency of car operation.

On the other hand, if only cars that can service floors with unbalanced services are allowed to respond to Hataba calls that may be registered by passengers going to floors with unbalanced services, passengers who do not go to floors with unbalanced services (generally This means that the waiting time will be considerably longer.

This invention solves the above-mentioned drawbacks, and provides a group of elevators that improves service to passengers by reducing the number of times a car that cannot be serviced arrives at the floor desired by the passenger without significantly increasing the waiting time. The purpose is to provide a management device.

An embodiment of the present invention will be described below with reference to FIGS. 1 to 4.

In this embodiment, when a Hataba call is registered, the car to which it should respond is selected and assigned in advance, and the call that has already been assigned is called an assigned call.

In the diagram, turtle~7 is the 1st floor to the 7th floor, A~C is the basket, AIC, A
2D is the first-floor car call registered to car A and the second-floor downbound Hataba call assigned to car A, B2C is the second-floor car call registered to car B, and CIC and C4D are to car C. The registered 1st floor car call, the 4th floor downbound Hataba call assigned to car C, 3U is the 3rd floor upbound Hataba call to be assigned, and 8 is the 3rd floor upbound Hataba call. When the 3rd floor up Hataba call registration signal becomes "H", 9
is a reference pulse train signal, 10A to 10C are car position pulse train signals (the added signals A to C indicate that they are related to cars A to C, respectively; the same applies hereinafter), 1
1A to 11C are assignment call pulse train signals, 12A to 12C
Cart call pulse train signals, 13A to 13C are constant value signals indicating a certain constant value, 14A to 14C are arrival time prediction devices, and 14Aa to 14Ca are output signals "15A to 15
C is an adder that outputs the sum of the two input values on the left side,
16 is a comparator L that compares the values of the three inputs on the left side and sets the output signal corresponding to the minimum value to "H". 17A to 17G are AND gates to 18A to 18C, when the input signal on the R side is "L". Memory 19 is an OR gate that is set when the input signal on the S side is "H" and makes the output signal "H", and is reset and makes the output signal "L" when the input signal on the R side is "H". , 20A to 20C are 3rd floor up assignment call signals which become "H" when assigned to the 3rd floor up hall call, 21, 2
2 is a constant value signal indicating a certain constant value, 23 is a memory 18A
-A memory similar to 18C, 23a is its output signal, 2
4 is an OR gate, 24a is its output signal, 25, 26
is a pulse counter that counts the number of pulses input from the left while the S terminal is "H" and outputs it, and is reset and outputs zero when the S terminal is "L", 27, 28
is a multiplier that outputs the value obtained by multiplying the two input values on the left side, 2
9 is an adder similar to 15A to 15C, PIU, P3U,
P7D is a pulse signal shown in FIG. Note that the circles attached to the input portions of the AND gates 17A to 17C and the memories 18A to 18C indicate that the signal levels are reversed.

Next, the operation of this embodiment will be explained.

As shown in Figure 1, there are three cars A~ in a seven-story building.
Suppose that car C provides service, but only car A can service the 5th floor, and only cars A and B can service the 7th floor. (In Figure 1,
Diagonal lines indicate that service is unavailable. ) In FIG. 2, the arrival time prediction devices 14A to 14C generate pulse signals P.
When 3U becomes "H", the time taken for cars A to C to arrive at the third floor in the upward direction is output signal 1 4Aa to 1
It is determined as 4Ca. If constant values 13A to 13C are appropriately determined and added by adders 15A to 15C, the comparator 16 outputs a signal corresponding to the minimum value of the added values as rH.

Assume that it is related to car A (input to AND gate 17A). (Details will be described later.) Here, the 3rd floor up Hataba call 3U is registered, and when the 3rd floor up Hataba call registration signal 8 becomes "H", the pulse signal P3U becomes "H".
When this happens, the output of the AND gate 17A becomes ``rH'', the memory 18A is set, the 3rd floor up assignment call signal 20A becomes ``H'', and the 3rd floor up Hataba call 3U is assigned to car A.
It will be assigned to.

Any of the 3rd floor ascending assignment call signals 20A to 20C is "H"
Then, "AND gate 17A~ by OR gate 19
17C are all closed and no car assignments are made again.

Note that the allocation is reset by resetting the memory boxes 8A to 18C when the third floor up Hataba call registration signal 8 becomes "L".

Next, the contents of the arrival time prediction device will be explained with reference to FIGS. 3 and 4.

However, since many parts are well known, we will briefly describe them.

Here, the car position and assigned call are determined by signals 10A to 1 in Fig. 4.
2A, it is assumed that the signal is pulsed in a time-series manner with meaning. In other words, since car A is running down the 5th floor, the pulse signal P5D corresponding to "5th floor down" is "5th floor down".
Car position pulse train signal 10 that becomes “H” only when “H”
A. Also, since the second floor has a descending assigned call A2D, the assigned call pulse train signal 11A becomes "H" only when the pulse signal P2D is "H", and the car call pulse train signal 11A similarly corresponds to the first floor car call AIC. It becomes 12A.

The pulse counter 25 measures the number of pulses of the reference pulse train signal 9, and the pulse counter 26 measures the number of pulses of the assigned call pulse signal 11A.
, car call pulse train signal 12A, pulse signal PIU, P
The number of pulses of the 7D OR signal is set to "H" at the S terminal.
It is counted only when

The memory 23 takes the direction into account and sets "H" only to the time interval corresponding to the floor where the car is located to the floor (3rd floor up) for which the arrival time is to be determined (see signal 23a in FIG. 4).

Therefore, at the time corresponding to the floor for which the arrival time is to be determined, that is, at the moment when the pulse signal P3U becomes "H", the pulse counter 25 calculates that the car A has arrived at the third floor by taking the direction into consideration. The pulse counter 26 also indicates the number of stops until the floor interval.

The reason why the pulse signals PIU and P7D are input to the OR gate 24 is because the first and seventh floors are the final floors and must always be stopped.

The constant value 21 is the running time per floor, and the constant value 22 is the stopping time per floor. For example, if they are 2 seconds and 8 seconds, respectively, then in the case of car A, the floor interval is 6 and the number of stops is 2. from,
The output 14 axis of the adder 29 is 6 through the multipliers 27 and 28.
x22 x 8 ko28 (seconds). Considering Cars B and C in the same way, for Car B, 2 x 21 x 8 = 1
2 (seconds), and for car C it is 7×22×8=30 (seconds).

Therefore, if constant values 13A to 13C are all zero, the input of comparator 16 is 28:12:3 as above.
0, and the car B with the shortest arrival time is assigned to the 3rd floor up Hataba call 3U.

However, since car B cannot service the 5th floor, as stated at the beginning, if the waiting time does not change much, it would be better to assign it to car A, which can service all floors. Therefore, for example, if the constant value signal 13A is 0, the constant value signal 13B is 20, and the constant value signal 13C is 30, the input of the comparator 16 will be 28:32:60, and car A will be assigned.

In this case, if there is no difference in waiting time of 20 seconds or more, car A
We decided to allocate it to .

In the above embodiment, the reading of the pulse counters 25 and 26 and the IJ setting are performed at the same time, but in reality, it is necessary to reset the pulse counters after reading. However, since this can be easily realized by using a delay element or the like, the explanation will be omitted. Also, although the explanation has been given only regarding calls going up to the third floor, calls on other floors can also be realized by simply changing the pulse signal of the floor (in this embodiment, P3U) for which the arrival time is to be determined. , What is important is how to determine the constant values 13A to 13C.This basically depends on the importance of the Hataba call to be assigned and the probability that passengers will go to the floor where only some cars can be serviced.In other words, The decision is between the length of the waiting time and the risk of a car arriving that cannot reach the passenger's desired floor.Furthermore, there is a floor in front of the Hataba call where only some cars can be serviced. It is important not only how many there are, but also how many there are behind them.

This is the opposite of what has been said so far, by preferentially allocating the Hataba call to cars that have many floors that cannot be serviced behind the Hataba call, and conserve cars that have fewer floors that cannot be serviced. That is.

For example, in the embodiment, for the 4th floor downbound Hataba call C4D, cars are preferentially allocated to car C, car B, and car A in this order.

Furthermore, it goes without saying that the basic allocation when there are floors with uneven services and the priority allocation described so far are not limited to the embodiments.

For example, as a basic allocation means, each car may be assigned to a Qinba call so that the sum of predicted arrival times of all Qinba calls becomes the smallest.

Further, as a priority allocation means, the predicted arrival time may be multiplied by a constant value, or the assigned car may be determined based on the number of floors that can be serviced only when the predicted arrival time is less than a predetermined value. Furthermore, various methods of determining the predicted arrival time can be considered.

Furthermore, the idea of the present invention can also be applied when determining whether to stop at a floor with a Habata call in a system in which the car is operated in circulation regardless of the presence or absence of a call.

As explained above, in this invention, in a plurality of elevators with uneven service floors, the car with more serviceable floors in front of the Hataba call is made to respond to the Hataba call, so the waiting time is reduced. It is possible to improve the service to passengers by reducing the number of times a car that cannot be serviced arrives at the floor desired by the passenger without increasing the length of time.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing elevator car calls, FIG. 2 is a block circuit diagram showing an embodiment of an elevator group management device according to the present invention, and FIG. 3 is a block circuit diagram of the arrival time prediction device of FIG. 2. FIG. 4 is a diagram of the signal waveform. 1 to 7...1st floor to 7th floor, A to C...basket, AIC...
...1st floor car call of car A~A2D...2nd floor assigned call of car A, B20...2nd floor car call of car B, CIC...1st floor of car C Car call, C4D・
...4th floor descending assignment call for car C, 3U...3
Up-stairs Hataba call, 8...3rd floor up-Higashiba call registration signal, 9...Reference pulse train signal, 10A to 10C...
... Car A to C position pulse train signal, 11A to 11C.
... Assignment call pulse train signal as above, 12A to 12C...
Car call pulse train signal as above, 13A to 13C... Constant value signal as above, 14A to 14C... Arrival time prediction device as above, 15A to 15C... Adder, Box 6... Comparator, 17
A~ITC...and gate "18A~18C...
...Memory, 19...OR gate, 20A-20C...Car A-C3 floor assignment call signal, 21, 22...Constant value signal, 23...Memory "24...Or gate"25,2
6... Pulse counter 27, 28... Multiplier, 29
.... . . . Adder, PIU, P3U, P7D . . . Pulse signal. In addition, the same parts in the figures are indicated by the same symbols. Figure 2 Figure 1 Figure 3 Figure 4

Claims (1)

[Claims] 1. In a system that manages multiple elevator cars with uneven service floors as a group, if the uneven service floor exists in front of the floor where the hall call is registered in the direction of the hall call, the above An elevator group management device characterized by comprising a circuit for determining a car having a large number of service floors in front as a car to be made to respond to the registered hall call.