JPS636468B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a group management control method for elevators corresponding to hall calls.

Recently, we have been using computers such as small calculators to scan the condition of halls, and for floors where hall calls are occurring, we have calculated the evaluation value of each machine using an appropriate evaluation formula, and determined that the value is the best. Group management controls have become available that select the optimal car when the car is within a set range and display the forecast in the hall. However, in this type of group management control, when the direction of the car and the direction of the hall call are opposite, for example, a descending hall call when the car is ascending falls into this category (hereafter referred to as "hall call"). ``Reverse name'') and
This is because the car reverses direction due to changes in traffic demand, and the same direction as the hall call is called, for example, when the car is in the downward direction, it is called a down hall call, and when the car is going up, it is called an up hall call. Normally, the assignment is not made until the time is reached.

Therefore, a free car can provide an immediate forecast for a reverse call, but since there is considerable inter-floor traffic even during normal times in a building, it is often difficult to create a free car. Also, even if you are lucky enough to get a free car, after the reverse call is assigned to the free car, the car will go straight to the floor assigned to the reverse call, so if the car rises and is responding to the reverse call, the car will move directly to the floor above the reverse call. Even if a down hall call occurs, the car cannot respond and reverses direction at the floor in front of it, which is the reverse call allocation floor, and thereafter responds to calls further down.

Therefore, depending on the order in which hall calls are generated, that is, when a down call is generated and then a hall call on an upper floor is generated, there may be a hall where the service is extremely poor. In particular, there were drawbacks that tended to occur during descending calls for the upper layer or rising calls for the lower layer.

Here, the present invention has been created to eliminate the above-mentioned drawbacks.
For example, when the car is rising and responding to a reverse call floor, if a reverse call occurs on a certain floor (assumed to be the second floor) above it, it will first respond to the reverse call floor that occurred later, After that, the purpose is to average the service for each floor by responding to the previously assigned reverse calls.

Hereinafter, the present invention will be explained with reference to the drawings.

FIG. 1 is a system diagram showing the basic configuration of a group management control device to which the present invention is applied.

In FIG. 1, 7A to 7H are registers and interface devices having the same function, provided one for each elevator, and are distinguished by letters A to H. FIG. 1 shows a case where there are eight elevators.

Further, each arrow line connecting each register and interface device in FIG. 1 indicates a plurality (12) of parallel signal lines. Every register has the number of bits equivalent to one word in a small computer.

In FIG. 1, reference numeral 1 denotes a common hall call registration circuit, in which registers for the corresponding floor and direction are set when registering a hall call, and are reset when a car arrives. 3A to 3H are basket status buffers, and the third
It has the format of a diagram. 4A to 4H are set in the car call registration circuit at the time of car call registration.
It will be reset when the car arrives. 5A to 5H are quasi-car call registration circuits that store the hall call assigned to the car and are reset when the car arrives. 6A to 6H are signal synthesis circuits that OR the car call registration register and quasi-car call registration register.
Outputs (logical OR). 8 is a wiper select circuit, 9 is a decoding circuit, 10 is a small computer, 11
is an output register and has a function of holding the same output until the next output (subaddress signal S) is issued.
12 is an input register, and 13 is an output register.

Figure 2 shows the master condition table MCT that checks whether each car can be controlled in groups.
represents the bit configuration of

FIGS. 3 and 4 show the bit configurations of the car status table CCT and the hall call table HCT.

Rather than placing these tables inside the computer, by constantly importing information from various information sources externally through hard connections, the number of data memories and program memories can be reduced, and the calculation speed can be increased. I'm raising it. The CCT is a car status table, and by specifying a car number with a subaddress, the car status and the contents of buffers 3A to 3H are taken into the computer 10 and used in correspondence with each bit, as shown in FIG.

The car call information and the assigned hall call information (hereinafter referred to as "semi-car call") are obtained by ORing the car call registration circuits 4A to 4H and the secondary car call registration circuits 5A to 5H using signal synthesis circuits 6A to 6H. After that,
Enters the wiper select circuit 8. This OR operation may be performed within the computer 10, but it must be performed for each bit on all floors and all machines, which significantly increases the calculation time, so it is more practical to perform it externally.

As shown in FIG. 4, these pieces of information are distinguished by sub-addresses from the 10th floor down call (10D) to the 9th floor up call (9U), each having the bit structure shown in FIG. For example, if a call for 1U to ascend the first floor occurs, the 11 bits of that 1U become 1,
When a car suitable for service is found and the assignment is completed, bits 10 and 11 of 1U become 1, and bits 0 to 7 corresponding to the assigned car and the car that has a car call to that floor become 1. . When the response is completed and the call is reset, both bits 10 and 11 of 1U become 0.

When the information is processed in the computer 10 and the assigned car number is determined, it is output to the output register 13 in the format shown in FIG. 5, and is notified by the lantern in the hall. A decoding circuit 9 decodes the output signal from the output register 13 and sets the flip-flops of the sub-car call registers 5A to 5H of the corresponding floor and direction of the corresponding car. Each car is operated by a circuit (not shown) in sequence in response to the car call of that car and the sub-car call assigned to that car in the same direction as the car. Respond to direction calls in the same way.

Next, the present invention will be explained using the flowchart shown in FIG. Incidentally, FIG. 7 is a flowchart in which the portion from A3 to A4 in FIG. 6 is drawn in more detail.

First, the master condition table MCT
and checks whether group control is possible for each car. and the car state table CCT
and stores the position, direction, and load information of each car in the computer. This is read for all machines.

Next, set the car index J to _J0 , that is, car number A, and check whether car number A currently has reverse call assignment and is running to respond to that floor.
If the car is a reverse call response car, the prohibition of additional allocation is canceled when the car arrives at the reverse call floor to which it was first allocated.

Then read the hole condition table HCT with hole index I=I ₀ (10D),
The state of the hole is determined by the combination of bits 10 and 11 of this HCT. That is, when the 10th and 11th bits are "00", there is no hall call, so the hall index I is set to I+1 (that is, 9D) and scanning for the next floor is started. If bits 10 and 11 are “01”
Since 10D has a hall call and is not allocated, each car is checked to see if it can be allocated, and if a car cannot be allocated, it is moved to another car.

The procedure for determining whether or not allocation is possible is step 7.
This will be explained in detail using the flowchart shown in the figure. In other words, check whether group control is possible for the corresponding machine (initially, machine A with J = J ₀ ), whether it is not full, and whether the hall to be allocated (floor with index I, in this case, initially with I ₀₎ .
10D)
We check whether the number of floors that the car must stop on the way to 10D is within a certain number, and whether it is possible to start decelerating now and stop at 10D. Cars that satisfy all of the above conditions are taken to the next step. Go to symbol S1,
For other cars, the evaluation value E _J is set to a suitably large value that prohibits allocation, the car index is set to J=J+1, and the process moves to the next car.

When symbol S1 is reached, it is checked whether the direction of car J and the hole to be allocated (initially 10D) are in the opposite direction. (If the car is descending, all the descending hall calls become reverse direction calls, and if the car is descending, the ascending hall calls become reverse direction calls), then S2
Yes, otherwise go to A4. In S2, it is checked whether there is a reverse call already assigned to car J, and if there is, a more detailed check is performed as described below depending on the direction of the car.

In other words, if the car is ascending, the size of Hall I, which is the reverse call, and the already allocated reverse call floor are compared, and if Hall I is physically above the already allocated reverse call floor, and both If the floor difference is within a predetermined number, allocation is permitted, and after setting a reverse call flag (held for each car), evaluation calculations begin. If Hall I is below the already allocated reverse call floor, the allocation is postponed until the car arrives at the already allocated reverse call floor and the direction is reversed. Furthermore, if the direction of the car is descending, allocation is permitted only when Hall I is below the reverse call floor that has already been assigned and the floor difference is within a certain value (the reverse call flag is set (same as when raising the car).

Using the method described above, it is checked whether there are any cars that can be allocated for all machines, and for the cars that can be allocated (1
E _J = D _J + S _J + C _J + W _J ...... (Equation 1) Here, D _J represents the relative floor difference between the current car position and the allocated hall, S _J is the number of floors that the car stops on the way from the current position to the allocated hall, and C _J is a constant value C _J if there is a car call to the allocated hall depending on the presence or absence of a car call to the allocated hall.
In addition, W _J indicates the car load.

The above evaluation calculations were carried out for all units, and the evaluation value
The car with the minimum E _J is output as the car assigned to the floor of hall index I. Furthermore, if the reverse call flag of the allocated output car is set, additional allocation is prohibited from now on until the car arrives at the reverse call floor to which it was initially allocated.

Hall condition table HCT 10, 11
Since the time when the bit is "11" has already been allocated, we move on to scanning the next floor.

Repeat the above operations until all floors are completed, and once completed, repeat start.
start) and repeat the same process cyclically.

As is clear from the above description, according to the present invention, assignments to reverse call halls are assigned to cars that are responding to reverse calls as much as possible, and the non-response time to already assigned reverse call floors is not increased too much. Because I live in
Even if there are many hall calls that result in reverse call responses, it is possible to prevent service from becoming extremely poor.

[Brief explanation of the drawing]

FIG. 1 is a system diagram showing the basic configuration of a group management control device to which the present invention is applied, FIG. 2 is a bit configuration diagram of a master condition table MCT, and FIG. 3 is a bit configuration diagram of a car status table CCT. Fourth
The figure shows the bit configuration diagram of the hall call table HCT.
Figure 5 shows the format of the output register 13;
The figure is a flowchart of one embodiment of the present invention, and FIG. 7 is a flowchart showing a part of the flowchart in detail. 1... Hall call registration circuit, 3A-3H... Car status buffer, 4A-4H... Car call registration circuit, 5A-5H... Semi-car call registration circuit, 6A-
6H...Signal synthesis circuit, 7A-7H...Register and interface device with the same function provided one for each elevator, 8...Wiper selection circuit, 9...Decoding circuit, 10...Small computer , 11, 13...output register, 12...
...input register.

Claims (1)

[Scope of Claims] 1. In an elevator group management method in which an optimal car is determined using a predetermined evaluation formula for hall calls that occur arbitrarily, a reverse call is applied to a car that is ascending in order to respond to a descending hall call. Assignment is permitted if a descending call from a higher floor is within a certain floor, and if an ascending call from a reverse call floor is within a certain floor for a car that is descending in response to an ascending hall call. 1. A group management control method for elevators, characterized in that the group management control method for elevators is characterized in that the elevator group management and control method is characterized in that the elevator group management and control method is characterized in that the elevator group management and control method is characterized in that the elevator group management control method is characterized in that the elevator group management control method is characterized in that the elevator group management control method is characterized in that the elevator group management control method is characterized in that the elevator group management control method is characterized in that the elevator group management control method is characterized in that the elevator group management and control method is characterized in that the group management and control method of the elevators is permitted.