JPS6279178A - Group control method of 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 [Technical Field of the Invention] The present invention relates to an elevator system that determines how to respond to a newly generated hall call from among a plurality of elevators installed in parallel in a building having a plurality of service floors. Concerning group management control methods.

[Technical background and problems of the invention]

In recent years, when multiple elevators are installed in parallel, small computers such as microcomputers are used to control how to respond to hall calls from the halls on each floor in order to improve elevator operating efficiency and improve service to elevator users. So-called group management control is being carried out to allocate information rationally and promptly using the above methods. In other words, when a hall call occurs, the system selects the elevator most suitable for handling that hall call, quickly assigns the elevator to respond to that hall call, and prevents other elevators from responding to that hall call. . Conventionally, it has been thought that the best method for determining this allocation is to predict which elevator will arrive first at the floor where the hall call has occurred and to allocate the hall call to that elevator.

In such conventional group management control methods, emphasis has been placed on ease of use for passengers so that when they board the car, they always head toward the desired floor. Therefore, when an ascending hall call and a descending hall call occur on the same floor, if the elevator that reaches the elevator in the shortest time is assigned to the ascending hall call, even if there is a considerable time difference for this elevator, the second The elevator that arrives first is assigned to the down hall call.

For this reason, if the elevator that can reach the elevator in the shortest time is assigned to both the ascending hall call and the descending hall call, even if the passengers who have called the descending hall can be transported to the destination floor faster, the elevator that can reach the elevator in the shortest time may not actually be in the descending hall. There has been a problem in that the waiting time for the passengers who have called the vehicle can be extremely long, which reduces operational efficiency.

[Purpose of the invention]

The present invention was made to solve the above-mentioned problem, and when an ascending hall call and a descending hall call occur on the same floor, the arrival time difference between the first elevator to arrive and the second elevator to arrive is large. It is an object of the present invention to provide a group management control method for elevators that can make the elevator respond appropriately even when the elevator is quite large, thereby significantly improving operating efficiency.

[Summary of the invention]

In order to achieve this objective, the present invention determines the car with the smallest predicted unanswered time and the car with the second smallest predicted unanswered time to the service floor where the hall call occurred, and calculates the difference between these predicted unanswered times. When the predicted non-response time difference exceeds a predetermined value, the second car of the car with the minimum predicted non-response time is selected.
It is characterized by allowing direction reservations.

[Embodiments of the invention]

FIG. 1 is a block diagram showing the system configuration of a group management control device implementing the present invention.

In FIG. 1, a hall call registration circuit 1 and elevator operation control devices 2A, 2B, .

2F is connected to a small computer 9 via a wiper select circuit 7, and further connected to an elevator operation control device 2Δ,
2B, . . . , 2F are connected to a small computer 9 via a decoding circuit 8.

In the hall call registration circuit 1, registers for the corresponding floor and direction are set when registering a hall call, and are reset when the car arrives at the floor corresponding to the hall call. In addition, the elevator operation control device 2A~
2F is provided for each of the six elevators Δ@ machine to F, and has car status buffers 3Δ to 3F, car call registration circuits 4Δ to 4F, *car call registration circuits 5A to 5F.
, signal synthesis circuits 6A to 6F are provided separately.

Here, the car status buffers 3A to 3F are buffers for inputting the car status to the wiper select circuit 7. The car call registration circuits 4Δ to 4F are set at the time of car call registration and reset when the car arrives at the call registration floor.

The semi-car call registration circuits 5A to 5F store the hall call assigned to the car, and are reset when the car arrives at the floor corresponding to the hall call. Further, the signal synthesis circuits 6A to 6F are connected to the car call registration circuit 4A.
4F and the outputs of the quasi-car call registration circuits 5A to 5F are output.

On the other hand, the decoding circuit 8 decodes the output signal of the output register 12, which will be described later, and sets the secondary car call registration circuits 5A to 5F in the corresponding floor direction of the corresponding @ machine. The small computer 9 uses a 12-bit microcomputer and has an output register 10, an input register 11, and an output register 12. Here, the output register 10 has the ability to hold the same output until the next output is issued.

Note that the registers and interface devices having the same function, which are provided for each elevator, are connected by a plurality of parallel signal lines, for example, 12 signal lines. Furthermore, all the registers are made up of p]-l, which corresponds to one word of the small size converter 9.

The operation of the group management control device configured as described above will be explained below.

Now, as shown in the flowchart of FIG. 4, when the program of the small computer 9 starts at step 101, the RAM area of the internal random access memory is cleared at step 102, and then the program moves to the repeat 1-start point R8P. At step 103, the format □ car status table OCT shown in FIG.

FIG. 5 shows the processing of symbol C, in which the call state of the ball is scanned by the following method.

First, in step 104, the hole index I is set to O.

Next, in step 105, the state of the hall, ie, a new hall call has been generated, a response to the hall call has been completed, a hall call has been generated but the service has not been completed, and there is no hall call are determined by the method described below.

When a hall call is registered in the hall call σ record circuit 1 shown in FIG. 1, the corresponding bit of the hall call status table HCT whose format is shown in FIG. 3 becomes "1", and when there is no hall call, 110 IT becomes. Therefore, when the corresponding bit changes from "0" to II 1 ++, it means that a new call has occurred, and the process proceeds to step 106. Further, when the corresponding bit changes from II 1 ++ to 110 II, it means that the response to the hall call has been completed, and after storing the unanswered time TI of the hall call in step 107, in step 108, TI = O and in step 109 Move to. If the corresponding bit changes from 1" to "1", there is a ball call, but the service has been completed, so in step 110, the unresponse time TI for the hole call is set to 11".
The value is incremented and the process proceeds to step 109. If the corresponding bit is 0"→"O++, there is no hall call and there is no change, so in step 108 TI = O is set and the process moves to step 109.

In step 106, the answering car number for the newly generated hall call is determined by the method shown in the flowchart of FIG. 6. First, the processing in step 111 will be explained using the formula for allocating the hall call on the i floor.

In other words, the predicted non-response time (approximately equal to the predicted arrival time) Tji for car j to the 1st floor hall is the time required for car j to travel from its current position to floor i, and the time required for car j to travel from its current position to floor i, plus the time it takes to stop on the way to floor i. It is calculated as the sum of the loss time (mainly acceleration/deceleration time, door opening/closing time, and opening time) used for Next, when assigning the hall call on floor i to car i,
Predicted time Tjkn (kn=
The number of ball calls already allocated is calculated using the following formula. However, i
The predicted time changes only for calls that stop on the floor (assigned to hall calls).

Tj kfJ - (time elapsed since the hall call for floor kρ occurs) + (estimated arrival time until the car arrives at floor kρ) + (time required for car j to stop at floor i)... -(1) Note that the kβ floor is a floor that stops after the i floor, and for floors that stop earlier, the time required for the car to stop at the i floor in the above formula is not necessary.

Next, in step 112, the shortest car number and the second smallest car number are determined among the predicted non-response time Tji for the newly generated hall call on the i floor.The details of the process are shown in FIG.

In other words, the predicted non-response time Tji of car j to floor i (in this case, service '4m is determined within 1 second for a newly generated hall call, so it is approximately equal to the predicted arrival time) and The set minimum value MIN1 and the second smallest value MIN2 of the predicted non-response time are compared in steps 121 and 122, respectively. If Tji is smaller than the minimum value MINI, in step 123 the predicted non-response time is stored in MIN1, the machine index J at that time is stored in MIN1$C, and the process advances to symbol EIB to proceed to the processing of the next machine. The predicted non-response time Tji is the minimum value M
When it is larger than IN1 and smaller than the second smallest value MIN2, the predicted non-response time is set to MI in step 124.
Store the current car INDEXJ in N2 as MIN2$C, and if it is larger than MIN2, proceed to 218 without doing anything.

When it is determined in step 113 of FIG. 6 that the above processing has been completed for all cars, the process advances to the symbol EIC, and it is determined in step 114 whether the car MIN1$C with the minimum predicted non-response time to the first floor is a two-way reservation. The detailed processing contents are shown in FIG. 8.

That is, in step 131 of symbol 21G, parameter 1ALL$MAX is determined according to the following formula.

HALL$MAX=2xF$MAX-2 (2) Here, F$MAX is the number of service floors of the building including the express zone.

Next, in step 132, calculate the opposite inner corner H of the newly generated hall call floor I (for example, in a poem whose sub-address I corresponds to 5U, the opposite inner corner will be the sub-address corresponding to 5d), From the ball call status table HCT in Figure 3, check in step 1 whether car MIN1$C is scheduled to stop on the H floor in the opposite direction of the 1st floor for a car call or a hall call.
33, the hall call status table HCT (H) and the beat mask pattern MASK (MINT$C) (here M
ASK (MIN1$C) is MIN as a ROM value in advance.
If 1$C=O, then 1000$0000$0000, MI
If N1$C=1, 0100$0000$0000...
・and prepare for 8 machines] and make a judgment,
If it is 0, that is, if there is no scheduled stop on the 3rd floor in the opposite direction,
Proceeding to symbol E1C1, the machine MIN1$C with the minimum predicted non-response time on the first floor is determined as the service machine.

If the logical product is other than O, that is, if it is a two-way reservation, the arrival time on the first floor is set to the second number 11 in step 134.
The presence or absence of a 2-way forklift on the 1st floor of MlN2$C is checked in the same manner, and if it is other than 0, that is, if the 2nd car is in 2nd direction, then the MIN1$C car is selected as the service basket.

Further, if the second car does not have a two-way reservation, the difference between the predicted non-response time of the first car and the predicted non-response time of the second car is calculated in step 135, and the predetermined upper limit value of the two-way reservation is determined. If it is less than N I HO$LMT, in step 136, the second number 111MlN is set as the service number.
2$C, if it is more than MIN1$C in step 137
Select and proceed to symbol E1D, step 115 in Figure 6.
The forecast will be displayed in the hall as a service machine.

The following operations are executed for all floors, and when these operations are completed, the process returns to repeat start point R3P and the same process is repeated thereafter.

〔Effect of the invention〕

As is clear from the above description, according to the present invention, for a newly generated ball call, the car with the minimum predicted unanswered time and the car with the second smallest predicted unanswered time are determined, and the predicted unanswered time difference is calculated. When the opening movement exceeds a predetermined value, two-way reservation of the car with the minimum predicted non-response time is allowed, so the efficiency of elevator operation can be significantly improved without compromising ease of use of passenger capacity. play.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an example of the configuration of a group management control device that implements the present invention, FIGS. 2 and 3 are configuration illustrations of the main elements of the device, and FIGS. It is a flowchart for explaining the operation of the device. DESCRIPTION OF SYMBOLS 1... Hall call registration circuit, 2A-2F... Elevator operation control device, 7... Wiper selection circuit, 8.
...Decoding circuit, 9...Small computer. Applicant's agent Mr. Sato, Figure 2, Figure 3, Procedure Ner 13, Masade October 1930, β

Claims (1)

[Claims] In an elevator group management control method for determining an answering machine for a newly generated hall call from among a plurality of elevators installed in parallel in a building having a plurality of service floors, the elevator is directed to the service floor where the hall call has occurred. The machine with the minimum predicted non-response time and the machine with the second smallest predicted non-response time are determined, and the difference between these predicted non-response times is determined, and when this predicted non-response time difference exceeds a predetermined value, the machine with the minimum predicted non-response time is determined. A group management control method for an elevator, characterized in that it allows two-way reservation of cars.