JPS629512B2 - - Google Patents

Description

[Detailed Description of the Invention] [Objective of the Invention] (Industrial Application Field) This invention relates to a control method for a group control elevator in which a plurality of elevators are operated in parallel. The present invention relates to an improvement in a method for canceling a forecast when a car is full or a breakdown occurs when determining a response car and lighting a forecast light at a landing to notify passengers.

(Conventional technology) Recent small computers (microcomputers, etc.)
With the development of computers (hereinafter simply referred to as computers), many group management control methods for elevators having a digital configuration have been proposed. The basic configuration of this type of group management control device is shown in FIG.

The figure shows a case where the elevator group consists of eight units, and the memory circuits or registration circuits and interface devices with the same function of each elevator are labeled with alphanumeric characters A to H to the right of the code. There is a distinction between (However, this symbol may be omitted in the explanation as long as it does not cause confusion.)
Further, the arrow lines connecting each memory circuit or registration circuit and the interface device in FIG. 1 indicate a plurality of parallel signal lines (for example, 12 lines). All storage or registration circuits consist of a number of bits equivalent to one computer word. 7 _A to 7 _H are each 1
This is an operation control device for each elevator.

In FIG. 1, numerals 1 to 5 are registers each consisting of a flip-flop or a gate, and are connected to a select circuit 8. The selection circuit 8 selects only a desired storage circuit or registration circuit according to the subaddress output from the selection register 11 of the computer 10, connects it to the input register 12 of the computer 10, and provides necessary data to the computer 10. .

In the figure, reference numeral 1 denotes a master condition memory circuit that stores information such as operation patterns and whether or not group control is activated for each elevator, as shown in Figure 2.
12-bit master condition information table
It constitutes MCT. 2 is a hall call registration circuit that stores common hall calls for each floor;
_3A to _3H are car state storage circuits, _4A to _4H are car call registration circuits, and _5A to _5H are quasi-car call registration circuits. Car status memory circuits _3A to _3H are 12-bit registers that can be used to open/close doors, stop running, etc. as shown in Figure 3.
Conditions such as MG operation, running direction, car position, car load, etc. are stored as digital information of “0” or “1”, and car status information table CCT is created for all cars.
(If the number of cars is 8, index number J = J _O ~ J
_O +7). Car call registration circuit 4 _A ~
4 _H remembers the registered destination floor of each car call. Semi-car call registration circuit 5 _A ~
_5H stores the assigned floor when the car is assigned as the optimum car via the computer 10 for a common hall call for each floor and commands the operation of the elevator based on this assigned floor.

_6A to _6H are signal synthesis circuits, respectively car call registration circuits _4A to _4H and quasi-car call registration circuits _5A to _5H.
and the information in the hall call storage circuit 2 are combined and code-converted together with the information in the hall call registration circuit 2 in the select circuit 8, and as shown in FIG. The presence or absence of a hall call by number, floor, and direction, and whether or not the allocation has been completed are stored, and the hall condition information table HCT as a whole (in the case of 10 floors, index number I = I _O ~ I _O +17).

8 is a selection circuit that selects an information table according to the specification of the selection register 11 of the computer 10.
MCT, CCT (index J) and HCT (index I) are sequentially read into memory 14 in the computer via input register 12. 9 is a decoding circuit which, when the computer 10 determines the optimum elevator for a common hall call, converts the car number information output from the output register 13 based on this determination into the corresponding car index number J (J _O ~J _O +7) and convert each basket A to H.
input to the semi-car call registration circuits _5A to _5H . The computer 10 includes the above-mentioned input register 12, selection register 11, output register 13, non-volatile random access memory (hereinafter referred to as RAM) 14,
In addition, it includes an arithmetic circuit 15, a wait time counter 16, a PROM 17 for an initial value table of wait times, and other basic circuit elements (not shown) necessary for the operation of the computer.

The RAM 14 stores various information obtained through the input register 12 and supplies parameter information to the arithmetic circuit 15. The arithmetic circuit 15 calculates the evaluation value E of the service suitability of each elevator using a predetermined evaluation formula for each hall call based on the above parameter information, and determines the evaluation value E as the optimal elevator.
Select the smallest elevator of output register 13
Output via. The output register 13 is also composed of 12 bits, for example, information bits as shown in FIG.

Next, the operation of such a conventional configuration will be explained using the flowchart shown in FIG. First, section A of the flowchart of FIG. 6a is a routine for initializing the memory (RAM) that stores information created inside the computer by synthesizing and integrating external data. Next, the MCT reading routine determines whether each elevator is under group management control from the master condition table (MCT) having the bit configuration shown in FIG. In the next CCT reading routine, the computer reads the door status, car direction, MG on/off status, car position, and car load status for each elevator from the car status table (CCT), which has the bit configuration shown in Figure 3. Load inside.

Next, check the condition of the hole. That is, first, the hall index I is set to I _O corresponding to the 10th floor descending call 10D (I = I _O ), and information such as whether there is a hall call on that floor and whether that call has been assigned is shown in Figure 4. Read from the hole condition table (HCT). The last two bits of HCT (10th and 11th bits in Figure 4) are used to detect hall call allocation and hall call occurrence detection, respectively, so when there is no hall call, the 10th and 11th bits are “00”. The mode is "01" when a hall call has occurred but the service elevator has not been determined, and the mode is "11" when a hall call has occurred and the service elevator has been determined.

Here, in the "00" mode, the hall waiting time counter T _I is initialized to an initial value corresponding to the hall call based on the waiting time counter initial value table (not shown), and the next hall state investigation (initialization) is performed. Moving on to Figure 6 b).

Next, in the "01" mode, in order to determine the service elevator, the hall waiting time counter T _I is first incremented, and then evaluation calculations are started for the allocatable cars. That is, in the car condition table CCT shown in Fig. 3, J=
As _JO , it is checked whether the car can be allocated, and if the car is allocatable, the process moves to the next evaluation calculation routine (Fig. 6c).

The flowcharts shown in FIGS. 6b and 6c above are not directly related to the gist of the present invention, and therefore will be described later to the extent necessary and will not be explained here.

In addition, when in the "11" mode, the hall waiting time counter T _I is incremented, and if it is interpreted that the elevator is in a state where it cannot be serviced due to a failure or other reason, the service of that elevator is canceled and the next cycle is started. Then, routine Y is entered to determine the service elevator.

(Problems to be Solved by the Invention) Here, the problem in this invention is the case of the "11" mode.

That is, in accordance with the call assigned mode "11", a service elevator is determined almost simultaneously with the occurrence of a call, and a warning light or the like is displayed in the hall. However, even though the elevator car was not full at the time the forecast light was turned on, a large number of passengers boarded the elevator in response to a call to an already allocated hall, and the elevator car may become full. In such a case, the probability of occurrence is only a few percent when closed, so it is not a big problem.
The probability of occurrence is more than 10% during lunch or when leaving work.

In this case, even if a crowded car is parked on the floor where the hall call occurs, the car cannot be boarded, so it is necessary to cancel the hall call as described in the "11" mode above. Conventionally, in such a case, almost at the same time when the car is full, 1) all assigned hall calls for that car are canceled 2) all calls up to the first car are canceled 3) all assigned hall calls in the forward direction of travel are canceled.

Such methods have been used. However, each of these methods has its advantages and disadvantages, but all of them have the following disadvantages because they cancel immediately when the event is full.

1. Due to the floor of the car shaking due to passengers coming in and going out, etc., it was easy to malfunction because it temporarily detected that the car was full.

2. Even if you cancel and allocate to another car, that car will often become full, and then you will cancel again and the forecast light will move to the next car. Passengers at the boarding area then have to move each time, which increases their frustration and distrust of group management. Complaints are particularly likely to occur when the first train is no longer full midway through and the forecast is issued again.

3 Even after changing the forecast, the changed cart does not always arrive right away, which increases frustration.

This invention was made in an attempt to eliminate the above-mentioned drawbacks of the prior art.Even if one car becomes full, the hole forecast is not changed until a car that is not full and can respond immediately approaches. The purpose of this invention is to provide a highly reliable control method for group control elevators.

[Structure of the invention]

(Means for solving the problem) In order to achieve this objective, according to the present invention,
A plurality of elevators are operated on a plurality of floors, a service elevator is quickly assigned to a hall call that has occurred, and this decision is displayed on a forecasting device of the floor where the hall call is registered, and the elevator car is assigned to a service elevator. In the control method for a group control elevator in which the elevator car responds to the registered floor, when one elevator is assigned to a hall call and the elevator car is full or outside the group, If the car call of the elevator car does not match the hall call, calculate the expected time value for each other elevator car until it reaches the floor where the hall call occurs;
The minimum value of each expected time value is determined, and if this minimum value is smaller than a predetermined set value, the allocation is changed to the elevator car corresponding to the minimum value.

(Embodiments) Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings.

FIG. 7 shows a flowchart according to one embodiment of the present invention, and shows the corresponding operation in the configuration of FIG. 1.

That is, according to the present invention, the 0th to 3rd bits of the HCT (FIG. 4) are determined according to the "11" mode shown in FIG. 6a. In addition, in Fig. 7a,
Although only four units are shown for simplicity, codes are actually allocated to eight units.

In FIG. 7a, for example, the correspondence is made as follows: machine A 1000 J _O machine B 0100 J _O +1 machine C 0010 J _O +2 machine D 0001 J _O +3. Therefore, if 1000 is detected from the bit by computer scanning, it indicates that machine A has been allocated to the call. The index allocated here is J
Let it be _W. For example, if machine A is allocated, J _W = JO
becomes.

Next, the allocated index, e.g. J _W
= _JO Read the CCT (Figure 3) and judge whether it is full from the 10th and 11th bits. If the place is not full, there is no need to change the forecast, so the process moves to routine C8 (FIG. 6b).

If the car is full, the car index J is sent via D2.
The process moves to the next routine (FIG. 7b) to determine whether or not the index JW matches the allocated index _JW . At this time, whether or not there is a call registration for the allocated car, that is, whether the index J _W of the allocated car and the index J of the car with a call registration match (J = J _W ? ) to judge. If J = J _W , it is possible to get on and off, so there is no need to perform evaluation calculations, and there is no need to change the forecast, so either jump to C8 (Figure 6b) and start the next cycle or end the judgment. do.

When J = J _W , the car index is set to J = J _O , and the same as when allocating, "Is it in a group?", "Is it full?", "Service permission for Hall I?", "Deceleration allowed for Hall I". If the machine number is found to be inappropriate, the evaluation _E'J is set to a value (infinity) that is prohibited from being assigned, and the process jumps to E3.

If it is possible to assign (E2), the evaluation value E′ _J =
Calculate D _J +S _J. Here, D _J is the relative floor difference between the current car position and the allocated hall, which is a time element, and S _J is the time element when the car stops on the way from the floor it is currently on to the allocated hall (index I). This is also a time factor.

Here, each time one unit is finished, set J=J+1.
Return to E1 (Fig. 7b), and when all the machines are completed, search for the car with the minimum evaluation value. As a result, the minimum value
If E′ _MIN (J) is smaller than a predetermined set value E _W , it is determined that service is possible under favorable conditions, and a forecast change, that is, an allocation change is executed. This change can be made using the "spare" section in the format shown in FIG. For example, to change car No. A to car No. D, it is sufficient to clear the secondary car call registration circuit 5A and set a newly registered elevator 5D.

After this, jump to C8 (Figure 6b) and increment the hole index I by one step until all floors are completed, then return to B (Figure 6a) and repeat the same operation until all floors are completed. The process returns to A and the same operation is restarted from the beginning.

Furthermore, if the evaluation values E' _MIN are all greater than the constant E _W , this means that there are no cars suitable for changing the forecast, so the process jumps to C8 and waits for the next cycle.

On the other hand, the auxiliary deceleration command circuit shown in Fig. 8 is connected in series with the normally open contact HKSL _a of the HKSL relay (not shown), which is energized when it detects a sub-car call that should be decelerated and stopped in response, and is energized when a full car is detected. normally closed contact WR _b of the WR relay (not shown), and KSL, which is energized when a car call that should be decelerated and stopped in response is detected.
A parallel circuit of normally open contacts KSL _a of a relay (not shown) is connected to the auxiliary deceleration command relay XSL coil. P and N are positive and negative power busbars, respectively.

For the full car mentioned above, WR _b is open, and when the car is called and KSL _a closes, XSL
is excited, and a deceleration command is issued by a known method (not shown). In response to a landing call, if a suitable car cannot be found to change the forecast, the elevator may arrive at that floor.
Even if HKSL _a is closed, WR _b is open, XSL is not excited, and no deceleration command is issued, so it passes. After that, the forecast will not be changed until a car with E′ _MIN (J) equal to or less than E _W appears. However, since it is common practice to install only hall lanterns that serve as forecast lights and arrival lights without installing position indicators at the landing, the forecast light of the first aircraft continues to be lit, which is unnatural from the viewpoint of passengers at the landing. I don't feel that way at all. E′ _MIN (J)
When a car with E _W or less appears, the forecast light will be changed to that car. At this time, it is common to also sound a chime to alert the passengers. The elevator arrives just as the passengers are moving towards that number.

In the above example, the judgment was started based on the condition of "full", but as shown in Fig. 9, the judgment of whether or not it is "outside the group" was added to the judgment of "full" in Fig. 7a. It's okay. By doing this, the same applies to changing the forecast when an elevator is out of the group, and the forecast is changed when a car whose evaluation value E′ _MIN (J) is equal to or less than E _W appears. Cases in which an elevator falls outside the group include failure, inspection, etc. In this case, at the time of failure or inspection, the
The configuration should be such that WR _b is open.

〔Effect of the invention〕

According to this invention, the following effects can be obtained.

(1) Forecast changes are made only after the changed car is expected to arrive soon, which reduces the number of changes to the forecast, and even if changes occur quickly, passengers' confidence in group management can be maintained.

(2) In the event of a full crew or failure, it often takes about 10 to 15 seconds to recover. Previously, the forecast would be canceled if the cluster was full or out of the group, even if it was momentary, but with this invention, in such cases, the forecast would be canceled. There will be more opportunities to avoid canceling. Therefore, even if the full-occupancy detector malfunctions due to shaking of the car floor when passengers enter and leave, it is less likely to be affected.

(3) If the car call and the landing call match, the allocation will not be changed, so if there is a car call and the car will definitely stop at the called floor, there is no need to change the forecast.

[Brief explanation of the drawing]

Fig. 1 is a system diagram of an elevator group management control device to which the present invention is applied, Figs. 2 to 5 are diagrams showing input/output formats used for each circuit in Fig. 1, and Fig. 6. is a flowchart for explaining the prior art, FIG. 7 is a flowchart for explaining an embodiment of the present invention, FIG. 8 is a circuit diagram for showing a part of the embodiment of the present invention, and FIG. 9 is for explaining a modified example. This is a flowchart for 1... Master condition storage circuit, 2...
Hall call registration circuit, 3...car state memory circuit,
4... Car call registration circuit, 5... Quasi-car call registration circuit, 6... Signal synthesis circuit, 8... Select circuit, 9... Decoding circuit, 10... Computer.

Claims (1)

[Scope of Claims] 1 A plurality of elevators are operated on a plurality of floors, and a service elevator is quickly assigned to a landing call that is determined, and this determination is carried out by a forecasting device for the floor where the landing call is registered. In the control method for a group control elevator, in which the elevator car is displayed to respond to the registered floor, one elevator is assigned to a hall call, and the elevator car is full or the elevator car is in a group. If the car call of the elevator car does not match the hall call, calculate the expected time value for each other elevator car until it reaches the floor where the hall call has occurred;
A control method for a group management elevator, characterized in that the minimum value of each expected time value is determined, and if this minimum value is smaller than a predetermined set value, the allocation is changed to an elevator car corresponding to the minimum value.