JPS5826780A - Method of controlling group 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] The present invention relates to a group management control method for elevators in which a plurality of elevator ships are put into service for a plurality of floors, and is particularly suitable for use in response to low traffic demand, such as during dispatch and lunch times. This paper relates to a group management control method for certain operation patterns.

In order to efficiently operate multiple elevators installed in parallel, group management control of elevators is performed. Conventionally, a dedicated sequence circuit was often used as a group management control device, but it has not been applied. In order to satisfy the specifications of each building, such as the structure of the elevator body, the conditions of the building in which it is installed, and the special requirements of users, it is necessary to change the circuit design and parts each time. There were drawbacks such as not being able to fully satisfy the specifications and incompatible hardware configurations.

For this reason, recently, a #snow layer control device using a digital meter such as a small computer or a mountain massif is used to scan the condition of each lv@ hall, and when a hall call occurs, select the most suitable elevator. Group management control was implemented in which the main body was selected and serviced by the seventh hole.

In order to deal with traffic demand that fluctuates in a complex manner from moment to moment in this type of group management control, traffic demand is roughly divided into several types of patterns, and it is determined which pattern is appropriate for driving control at that time. The pattern is switched manually or automatically.

Currently, it is predicted that during morning dispatch and lunchtime, the traffic demand on each floor will be more likely to be called up from the standard floor or in the direction of the higher floor. In order to strengthen the assignment to specific floors, in order to strengthen the assignment to specific floors, during morning dispatch, down calls from floors other than the standard floor, and during lunch, calls from the direction opposite to the cafeteria floor will be assigned to car 7. The allocation is correct.

However, in cases where the cafeteria floor is different from the standard floor o)i
During mealtimes, in the event of a disaster, there are many descendants who walk in both directions to the dining hall.
On the other hand, there is often a very high demand for the standard floor direction, mainly from people who go out to eat. Furthermore, even when dispatched in the morning, depending on the demand situation in the building, there are often many down calls on a certain floor.

Even though the above demand is always detected during morning dispatch and lunch time when traffic demand on all floors is uneven, the above demand is always met under certain conditions. Since the screws are delayed for a certain period of time, if there is a high possibility that the demand for the standard floor will occur frequently, such as when there is a demand for the standard floor during lunch, the screws will be delayed for a certain period of time, so if there is a high possibility that this will occur frequently, such as when there is a demand for the standard floor during lunch, the screws will be delayed for a certain period of time. The pattern changes [decreases the overall effectiveness,
The present invention was made in view of the above-mentioned drawbacks, and its purpose is to provide services that are uniform on all floors, such as during dispatch or lunch times, etc. When the demand is low, by delaying the illumination of the response unit for a certain period of time in response to the failure of the Ia floor (denoted by T-), and changing the temperature of IMJ' at the time of its installation by changing the degree Celsius according to the demand and supply of each floor. The purpose of the present invention is to provide a method for controlling elevators that can operate fbIJ with uniform service on all floors.

An embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram Φ showing the basic configuration of an elevator group management control device in which the present invention is used. In FIG. 1, 1 to 9 are logic circuits, and 10 is a computer such as a microcomputer.

One of the logic circuits is a mask condition storage circuit that stores information such as operation patterns and whether or not group control is activated for each elevator, and as shown in FIG. 2, a 12-pit mask condition information table MCT'Y4M is formed ing. 2 is a hall call memory circuit that stores common hall calls for each floor, and 3A to 3H are each elevator A.
Car status memory circuits 4A to 4H and car call memory circuits are stored in the interface parts of Nos. to H, respectively. It is comprised of I5A-5H and hole call allocation memory circuits 6A-6H.

In addition, Figure 1 shows the number of elevators (A to H).
In the following explanation,
Unless you have peace of mind about something, the suffix symbol A-Hk Ministry II
l&jri. The car status memory circuit 4 is a 12-pit register as shown in FIG.
Check whether the running direction, car position, corner load, etc. are “0” or not.
The car status information table OCT (index number i=1~
8). The car call storage circuit 5 stores the cars called in each car and the registered destination floors.

The hall call assignment storage circuit 6 stores the assigned floor when the car is assigned via the computer 10 as the optimal one for a common hall call for each floor. 7 is a hall condition storage circuit, car call storage circuits 5A to 5H, and hall call allocation storage circuit 6.
A-6H and the information in the hall call storage circuit 2 are collected, and as shown in FIG. 4, the number of the car determined to run by destination floor and direction of travel, the presence or absence of a hall call by floor and direction, Whether or not the allocation has been completed is stored, and an @table)tcT (index!-@j = 1 to 18) is configured in hole condition 1 as a whole. Note that FIG. 4 shows a case where the number of floors is 10. 8 is the Wainoso select circuit and is the selection register 1 of the computer IO.
According to the designation of 1, fresh news? -f MCT, CCT
(It Oyobi HCT < jr is input sequentially to register 1.
2 and read it into the memory 13. Reference numeral 9 is a decoding circuit which determines the optimum elevator in the computer 10 for a common hall call and outputs the car number information from the output register 15 to the corresponding car index number i (
1 to 8) and input the hall call floor numbers assigned to the hall call assignment storage circuits 6A to 6H of the valley cars A to H. The computer 10 includes the above-mentioned input register 12,
Proper translation register 11, output register 15, volatile random access memo! J (RAM) 13, arithmetic circuit 14
, a waiting time counter 16, and other basic circuit elements (not shown) necessary for computer operation.

The R muscle 113 stores the valley 1d information obtained through the input register 12, and provides the nomura meter information to the arithmetic circuit 14, and Φ. The calculation circuit 14 calculates the evaluation value f of the service overpressure of the valley elevator using a predetermined measurement formula for the valley hall call based on the above parameter information, and selects the elevator with the minimum evaluation value f as the kt-through elevator. , output via the output register 15, etc.

The output register is also composed of 12 pits and information pits as shown in FIG. 5, for example. The waiting time counter 16 is
Count the number of samplings after the call registration for each floor,
A waiting time count Tj is given for each floor.

Next, the operation of the computer according to the present invention will be explained using a 70-chart. When the start of group control is commanded, the master condition information table MC, which has the pit configuration shown in Figure 2, is first created as explained in Figure 1.
T is read into the computer, and mask conditions such as driving patterns are set. Group control will not be carried out unless the number of particles incorporated into group control reaches a predetermined number. When it is determined that group control is possible, the cage status IR is
Information table CCT (mu) and hole condition 1,! The information table HCT (jl) is read, the evaluation parameters for the evaluation calculation are set, and the service waiting time (this routine will be explained later in FIG. 8) is set.

Next, six samplings of hall calls on each floor are performed in sequence. First hole index j = 1 to 1 on - "i.e. 1
Check whether a descending call was made in the 0th floor hall. Whether or not there is a hall call is determined by bit 12 of HCT wlm
, #oN indicates whether the hole call has been assigned or not, as it is given by 11"j"0" of the 11th pit.
In hall call state determination, the above 11th and 12th: &: bit combinations result in @oo” (no hole call),
Distinguish "01" (hall call available, allocation not completed), 111" (hall call available, allocation completed). 00" is the waiting time) (j = 13, next sampling j = 2
In other words, in the case of 9DK transfer O "11#, the time it takes to arrive at the floor of the assigned car or hall call is long (if the hall call assignment is completed or the hall is full or due to other conditions).
The jJ count TJ is incremented by 1 in each sampling cycle, and when Tj≧L&C is reached, an allocation cancel signal is issued to cancel the hall call of the car that has already been assigned Z'J to the hall call.

Hall call cancellation is performed by setting the third pit ya-@o'' of the cutting edge register shown in FIG.

101'', first set the waiting time counter T = 1'' (j = 1), and then trace the conditions of the routine between A6 and M7 (the explanation of this routine is 7th of
(This will be explained in the explanation of the figure), a preliminary test to see if elevator A can be serviced with first car number i=1? and move on to the evaluation value calculation step. Estimation calculation (for example, publicly known in %Kaisei No. 53-23457, etc.) including the preliminary round is performed for all elememe with M = l + 1,
The car with the minimum f is selected, and if its optimal evaluation value is less than or equal to a predetermined limit candy, the hall call is assigned to the car with the minimum f.

As mentioned above, when the hall call assignment is completed for j=1, that is, 100, the same processing is performed for 9D as j=j+1±2, and the same process is performed for Mj=i −18 cases, that is, all the hall calls (IOD ~2D.

When the optimal allocation for IU to 9U)K is completed, the process returns to the first MCT-ic and repeats the sampling cycle.

Next, an example of the hall demand capture routine between A6 and A7 and the service waiting time setting routine between A2 and A3 in Fig. 6 is shown below. The three-pole setting of DR8P (lunch time) will be explained in detail using the 70-chart of FIGS. 7 and 8.

First, A4 K becomes 01", and when a call occurs,
At A6 in FIG. 8, pattern determination is also performed using the star condition IW report table, and the pattern is divided into three poles. In the case of the balanced pattern, do not perform any operation, go to A7, and assign the responders. In the up-peak pattern (dispatch) 2, the standard floor is during the ascent, and after the service on the top service floor is completed, the standard floor is returned, so the standard floor is determined at A60 using the hole index, and the counter C1ya is ’ to count the urine on all floors other than the standard floor, and
20, the allocation is the limit value L according to the number of counter C1
T is set at M21 to A24 in FIG.

Then, at A63 in FIG. 7, the waiting time count is compared with the waiting time count Tj, and if it is less than LT, the routine does not proceed to the allocation routine, the process goes to A9 and the allocation of the response number is delayed, and when the LT is exceeded, the process goes to A7 and the allocation is done. Go to the routine and assign the response number.

In addition, in the DR8P/e turn (lunch time), calls for both directions to the cafeteria are at the rear, so use the hall index at A61 to divide the hall calls into those for both directions and other directions, and use the CI and C2 counters. Count each number t, and call both directions of the cafeteria t2).
The routine A7 for 1 allocation is entered, and for calls in the direction opposite to the rental hall floor direction, the allocation is set at the delay time limit value LTY A21-A24 according to the ratio gK of CI and 02 at A25.

The following is the same as up peak, LT and T at A63.
If Tj is less than or equal to LT, the assignment will be delayed and the assignment will be delayed, and if Tj is less than or equal to LT, the assignment will be delayed.
Assign at C7L. A26 initializes the counters C1 and C2Y each time the scanning cycle of calls for all halls is completed, and in the next hall scanning cycle, performs a new demand J& intake for all floors. Is this a trap, depending on the demand for all floors, the whole? Operation can be controlled efficiently.

In addition, in the above embodiment, as a method of grasping the traffic demand of all floors moment by moment, a method was described using the ratio of the number of hall calls counted using the hall index iJ, but ultrasonic sensors and two-dimensional image processing The number of people in the valley hall is detected using a device for detecting the number of people in the hall and in the car. No matter which method you use to measure the demand on each floor relative to the whole using a variable rate, the method of understanding the demand for the 4th floor in an up-peak pattern is the same.
Based on the ffm comparison with the direction of the dining room floor for R8PR8-, the allocation can also be done by setting the waiting time t to its desired value. I mentioned the 1t stiff Ah nozo turn as well as the up big and DR8P pattern, but the same is true for others.

As explained above, according to the present invention, in an elevator group control system that uses a computer to determine and allocate an optimal elevator for a common hall call, there is an imbalance in traffic demand between building floors. Even for hall calls where the demand is expected to be small or large, such as during dispatch or lunch time, operation control can be efficiently carried out on all floors without unnecessarily prolonging the service life.

[Brief explanation of the drawing]

Is Figure 1 the real one? The block diagrams shown in Figures 2 to 5 are the block diagrams showing the configuration 7 of 5S, respectively.
FIG. 6, a diagram showing the bit 4δ configuration of T, CCT, HCT and output register, illustrates the operation of this part of the present invention.
"Station flowchart, Figure 7 is A6 in Figure 6.
, A flowchart showing the expansion between A7, Fig. 8 is the 6th
Figure 9 shows the details between A2 and A3, and Figure 9 is a 1.14 composition diagram of the pill used to explain the present invention. 1... Mask condition memory circuit, 2... Hall call memory circuit, 4A to 4H... Car state memory [i:
+1 path, 5A to 5H... Car call memory circuit, 6A to 6
H...Hall call assignment memory circuit, 7...Hole condition shore v, Q memory circuit, 8...Wainozo selection circuit, 9...Decode time IM, 10...Computer. Applicant's Representative Ino Mata Figure 1

Claims (1)

[Claims] 1. A plurality of elevators are put into service for a plurality of floors, and operation turns are switched according to the momentary traffic demand;
When a hall call occurs, the evaluation value of each elevator is calculated using a predetermined evaluation formula, and the elevator group management control that assigns the hall call to the elevator with the optimal evaluation value predicts that demand will be low at each time. A group management control method for elevators in which service is delayed for a predetermined period of time for each hall call. 2. The elevator group management control method according to claim 1, characterized in that the predetermined time for delaying the service is varied according to the demand for correspondence on each floor.