EP0134892A1 - Lift group control for double-compartment cars - Google Patents

Abstract

With this group control, the assignments of the individual cars (5, 6) from double cars (4) of an elevator group to stored floor calls can be optimized in terms of time and new incoming floor calls can be assigned immediately. A computing device (CPU) provided for each elevator (a, b, c) calculates operating costs corresponding to the waiting times of passengers for each cabin (5, 6) of a double cabin (4) with respect to each floor. The operating costs are reduced if there are rectified calls in the calculation floor and a directly adjacent floor and / or there are coincidences between car calls and such floors. The operating costs of the two cabins (5, 6) of a double cabin (4) are compared with one another and the lower costs are stored in a cost memory (RAM9) of the elevator (a, b, c) in question. During a cost comparison cycle, the operating costs of all the elevators are compared with each other by means of a comparison device (14), an allocation instruction which designates the floor to which the elevator can be stored being stored in an allocation memory (RAM10) of the elevator (a, b, c) with the lowest operating costs the entering cabin (5, 6) of the double cabin (4) is optimally assigned in terms of time.

Description

The invention relates to a group control for elevators with double cars, which are formed from two cars arranged in a common car frame, with car call memories and the load measuring devices assigned to the cars, with floor call memories, with each elevator assigned to the group, each indicating the floor of a possible stopping, and with a scanning device having at least one position for each floor, a control device being provided by means of which the double cabins of the elevator group can be allocated to the floor calls.

Such lifts can carry twice as many passengers on each trip as lifts with single cabins. Since less has to be held, the same number of floor calls can be serviced in a shorter time, so that the conveying capacity can be increased considerably.

With the Swiss patent specification No. 529 054 a control for an elevator group with double cars has become known, in which the double cars are designed in such a way that two adjacent floors can be operated simultaneously. In this case, the filling of a building should be achieved in the shortest possible time with approximately even occupancy of the double cabins by the fact that on the ground floor the passengers board the even-numbered upper floors in the upper cabin and the odd-numbered ones in the lower cabin, whereby the cabin callers for those not the Storeys assigned to the cabin are locked. As soon as the cabin has to stop for a floor call, the lock is released so that the boarding person can drive to any floor. The control of the elevator group works according to the system of dividing the travel path into zones, with cars and zones being assigned to one another and the cars being distributed over the entire travel path according to the position of the zones. In the case of such controls, the allocation of the floor calls to the cars is only dependent on the position and direction of the calls, whereas other factors, such as the car load, are practically not taken into account in the allocation procedure. A uniform distribution of the passengers to the individual cabins of the double cabins is therefore not possible during normal operation of the elevator system, so that the passengers have short average waiting times and increasing the delivery rate, optimal results cannot be achieved.

With a group control for elevators with single cabins known from European patent application No. 0032213, the assignments of the cabins to the floor calls can be optimized in terms of time. Here, by means of a computing device in the form of a microprocessor, during a scanning cycle of a first scanner on each floor, whether there is a floor call or not, the distance between the floor and the car position indicated by a selector, the intermediate stops to be expected within this distance and the momentary cabin load is calculated as a sum proportional to the time lost by waiting passengers and the time lost by passengers in the cabin. The cabin load at the time of the calculation is corrected in such a way that the expected boarding and disembarking operations, derived from the number of boarding and disembarking passengers in the past, are taken into account in future stops. This total loss time, also called operating costs, is stored in a cost memory. During a cost comparison cycle by means of a second scanner are compared with the operating costs of all lifts over the comparison means with each other, each in a _Z uteilungsspeicher of the elevator with the lowest operating costs of a Zuteilungsanwei Solution can be stored, which designates the floor to which the cabin in question is optimally assigned in terms of time.

The object on which the invention is based is to provide, by improving the group control described above, a group control for elevators with double cabins, by means of which the double cabins can be allocated to the floor calls in such a way that minimal average waiting times of the passengers are achieved and the conveying capacity is increased. To achieve this object, the invention proposes, with the features characterized in the claims, to calculate the operating costs for each of the two cabins of a double cabin and to compare them with one another by means of a comparison circuit, the lower operating costs being stored in the cost memory of the elevator in question, and with If there are allocation instructions for rectified floor calls from two adjacent floors and / or coincidences between car calls and scanner positions, the operating costs to be saved are reduced.

The advantages achieved with the invention are, in particular, that stopping on adjacent floors with rectified floor calls and / or on floors with cabin and floor calls is promoted, which means fewer stops, shorter waiting times and increased conveying capacity. Another advantage is that the cab serves a single floor call with the lower operating costs. In this way, the double cabins are filled more evenly and the delivery rate is increased.

• Fig. 1 eine schematische Darstellung der erfindungsgemässen Gruppensteuerung für einen Aufzug einer aus drei Aufzügen bestehenden Aufzugsgruppe,
• Fig. 2 eine schematische Darstellung einer Vergleichsschaltung eines Aufzuges der Gruppensteuerung gemäss Fig. 1 und
• Fig. 3 ein Diagramm des zeitlichen Ablaufes der Steuerung.

The invention is explained in more detail below with reference to an exemplary embodiment shown in the drawing. Show it :

• 1 shows a schematic representation of the group control according to the invention for an elevator of an elevator group consisting of three elevators,
• Fig. 2 is a schematic representation of a comparison circuit of an elevator of the group control according to Fig. 1 and
• Fig. 3 is a diagram of the timing of the control.

1, 1 denotes an elevator shaft of an elevator a of an elevator group consisting of, for example, three elevators a, b and c. A conveyor machine 2 drives a conveyor cable 3 in the elevator shaft 1 guided double car 4, formed from two cars 5, 6 arranged in a common car frame, sixteen floors E1 to E16 being operated according to the elevator system chosen as an example. The distance between the two cabins 5, 6 is selected so that it corresponds to the distance between two adjacent floors. The carrier 2 is controlled by a drive control known from the European patent application No. 0026406, the setpoint generation, the control functions and the initiation of the stop being implemented by means of a microcomputer system 7, and with 8 the measuring and actuating elements of the drive control, which are symbolized by a first interface IF1 are connected to the microcomputer system 7. Each cabin 5, 6 of the double cabin 4 has a load measuring device 9, a device 10 signaling the respective operating state Z of the cabin and cabin call transmitter 11. The devices 9, 10 are connected to the microcomputer system 7 via the first interface IF1. The car call transmitter 11 and the floor call transmitter 12 provided on the floors are connected to the microcomputer system 7, for example, via an input device 13 which has become known with European patent application No. 0062141 and a second interface IF2.

The microcomputer system 7 consists of a storey call memory RAM1, two of the individual cabins 5, 6 of the double 4 assigned car call memories RAM2, RAM3, one load memory RAM4 storing the current load P _{m of} each individual car 5, 6, two memories RAM5, RAM6 storing the operating state Z of the cars 5, 6, two cost share memories RAM7, RAM8, one cost memory RAM9, one Allocation memory RAM10, a license memory RAM11 storing an identifier of the cabin 5, 6 with the lower service costs K, a program memory EPROM and a microprocessor CPU which is connected via a bus B to the memories RAM1 to RAM11, EPROM. R1 and R2 denote a first and a second scanner of a scanner, the scanner R1, R2 being registers by means of which addresses corresponding to the floor numbers and the direction of travel are formed. The cost share memory RAM7, RAM8 have two memory locations v, h for each scanning position, which are assigned to the two cabins 5, 6 of the double cabin 4. R3 denotes a selector in the form of a further register which, when the car is moving, displays the address of the floor on which the car could still stop. As is known from the drive control mentioned above, the selector addresses are assigned target paths which are compared with a target path generated in a setpoint generator. If the paths are identical and a stop command is present, the delay phase is initiated. If there is no stop command, the selector R3 is switched to the next floor.

A comparison circuit VS linked to the cost share memories RAM7, RAM8, the cost memory RAM9 and the identification memory RAM11 has, according to FIG. 2, two adders AD1, AD2 and a comparator KO. The comparison circuit VS required for the operations described in more detail below is formed by the microprocessor CPU.

The microcomputer systems 7 of the individual elevators a, b, c are connected to one another via a comparison device 14 known from European patent application No. 0050304 and a third interface IF3 as well as via a partyline transmission system 15 and a fourth interface IF4 known from European patent application No. 0050305 connected and in this way form the group control according to the invention.

• Bei Auftreten eines einen bestimmten Aufzug a, b, c der Gruppe betreffenden Ereignisses, wie beispielsweise Eingabe eines Kabinenrufes, Zuteilung eines Stockwerkrufes oder Änderung der Selektorstellung, beginnt der dem betreffenden Aufzug zugeordnete erste Abtaster Rl mit einem Umlauf, im folgenden Kostenberechnungszyklus KBZ genannt, ausgehend von der Selektorstellung in Fahrtrichtung der Kabine, wobei das Ereignis bei Aufzug a eingetreten sein möge (Zeitpunkt I). Bei jeder Abtasterstellung wird nun vom Mikroprozessor CPU des Mikrocomputersystems 7 für jede einzelne Kabine 5, 6 der Doppelkabine 4 gemäss den Formeln der Patentansprüche 2 und 3 eine den Zeitverlusten von wartenden Fahrgästen proportionale Summe, auch Bedienungskosten K genannt, errechnet, wobei die Faktoren k₁ und k₂ wie bei einer mit der europäischen Patentanmeldung Nr. 0032213 bekannt gewordenen, nach dem gleichen Prinzip arbeitenden Gruppensteuerung für Aufzüge mit Einzelkabinen ermittelt werden. Beim Berechnungsvorgang werden die inneren und äusseren Bedienungskosten K_Iv, K_Av, ^K _Ih' K_Ah getrennt ermittelt und in den Speicherplätzen v, h der Kostenanteilspeicher RAM7, RAM8 gespeichert. Die danach für jede einzelne Kabine 5, 6 der Doppelkabine 4 mittels der Addierer AD1, AD2 der Vergleichsschaltung VS gebildetenen gesamten Bedienungskosten K_v, K_h werden miteinander verglichen und im Kennzeichenspeicher RAM11 ein Kennzeichen der Kabine 5 oder 6 mit den kleineren Bedienungskosten eingeschrieben, wobei beispielsweise die in Fahrtrichtung hintere Kabine 5 oder 6 die kleineren Bedienungskosten aufweisen möge und die hintere Kabine jeweils durch eine logische "1" gekennzeichnet ist (Fig. 1, 2). Bei Vorhandensein des Kennzeichens "1" werden somit die Bedienungskosten K_h der hinteren Kabine im Kostenspeicher RAM9 gespeichert. Hierauf wird durch Bildung einer neuen Adresse der Abtaster R1 auf das nächste Stockwerk geschaltet und der Berechnungsvorgang wiederholt.

The time sequence and the function of the group control described above are explained below with reference to FIG. 3:

• When an event relating to a specific elevator a, b, c of the group occurs, such as entering a car call, assigning a floor call or changing the selector position, the first scanner R1 assigned to the elevator concerned begins with one cycle, hereinafter referred to as the cost calculation cycle KBZ from the selector position in the direction of travel of the Cabin, the event may have occurred at elevator a (time I). At each scanning position, the microprocessor CPU of the microcomputer system 7 calculates a sum proportional to the time lost by waiting passengers, also called service costs K, for each individual cabin 5, 6 of the double cabin 4 according to the formulas of claims 2 and 3, the factors k ₁ and k _{2 can be determined} as in a group control for elevators with single cabins which has become known with the European patent application No. 0032213 and works according to the same principle. During the calculation process, the inner and outer service _costs K _Iv , K _Av , ^K _{Ih '} K _Ah are determined separately and the cost share memory RAM7, RAM8 is stored in the memory locations v, h. The total operating costs K _v , K _h then formed for each individual cabin 5, 6 of the double cabin 4 by means of the adders AD1, AD2 of the comparison circuit VS are compared with one another and an identifier of the cabin 5 or 6 with the lower operating costs is written into the number memory RAM11, whereby for example, the rear cabin 5 or 6 may have the lower operating costs and the rear cabin is each identified by a logical "1" (FIGS. 1, 2). If the indicator "1" is present, the operating costs K _{h of} the rear cabin are stored in the cost memory RAM9. This is done by creating a new address the scanner R1 is switched to the next floor and the calculation process is repeated.

After completion of the cost calculation cycle KBZ (time II) the second sampler R2 start at all lifts a, b, c at the same time one rotation, hereinafter referred to as _K east CPC comparison cycle, starting from the first floor (time III). For example, the KVZ cost comparison cycles start five to ten times per second. At each scanning position, the operating costs K or K _h contained in the cost memories RAM9 of the elevators a, b, c are fed to the comparison device 14 and compared with one another, wherein an allocation instruction in each case in the allocation memory RAM10 of the elevator a, b, c with the lowest operating costs K. Form of a logical "1" can be stored, which designates the floor to which the elevator a, b, c in question is optimally assigned in time. For example, based on the comparison in the scanning position 9, a reassignment may take place by deleting an assignment instruction for elevator b and enrolling one for elevator a (FIG. 1). Since, according to the example for floor E9, a floor call is stored and the selector R3 points to this floor (FIG. 1), the delay phase could be initiated for elevator a if the criteria mentioned at the beginning were given. Here, if the indicator "1" is present in the Indicator memory RAM11 predefines the destination path corresponding to the next selector position, so that the double cabin 4 would hold, for example, with the less loaded rear cabin 5 or 6 on floor E9. As a result of the reallocation in scanner position 9, a new cost calculation cycle KBZ is started for elevators a and b, and cost comparison cycle _{5 is} interrupted because the former has priority. While the cost calculation cycle KBZ of elevator b runs without interruption, that of elevator a may be suspended between times IV and V due to a drive control process. The cost comparison is then continued from scanner position 10 in order to be interrupted again at scanner position 9 (downward) by the occurrence of an event in elevator c, for example a change in the selector position (time VI). After the cost calculation cycle KBZ triggered thereby in elevator c (time VII) has ended, the cost comparison cycle KVZ continues and its termination with scanning position 2 (downward). A further cost calculation cycle KBZ for elevator a, triggered for example by a car call, runs between times VIII and IX, whereupon the next cost comparison cycle KVZ is started at time X.

Claims (3)

1. Group control for elevators with double cabins, which are formed from two cabins (5, 6) arranged in a common car frame, with cabin call memories (RAM2, RAM3) and load measuring devices (9) assigned to the cabins (5, 6), with storey call memories (RAM1 ), with each elevator of the group assigned selectors (R3) which indicate the floor of a possible stopping as well as with a scanning device (R1, R2) having at least one position for each floor, a control device being provided which has a computing device (CPU ), which determines the operating costs (K) corresponding to the waiting times of passengers at each position of a first scanner (R1) of the scanning device (R1, R2), and two cost share memories (RAM7, RAM8) each storing a service cost share (Kii, K _A ) , a cost storage (RAM9) storing the operating costs (K), a the cabin with the lowest operating costs (K) for each position ng a second scanner (R2) of the scanning device (R1, R2) determining comparison device (14) and an allocation memory (RAM10) are provided, wherein in the allocation memory (RAM10) of the cab (4) having the lowest operating costs (K) an allocation instruction for an existing to whom or future floor calls can be registered,
characterized, - That the cost share memory (RAM7, RAM8) has two memory locations (v, h) for each scanning position, in which the operating _{cost components} calculated for each individual cabin (5, 6) of the double cabin (4) (K _Iv , K _{Ih '} K _Av' K _Ah ) are saved, - That a comparison circuit (VS) is provided, which is linked to the cost share memories (RAM7, RAM8) and the cost memory (RAM9) and which the operating costs (K _v , K _h ) of the two cabins (5, 6) of the double cabin (4th ) compares with one another, the lower operating costs (K _v , K _h ) being storable in the cost memory (RAM9), - That a number plate memory (RAM11) is provided, which is connected to the comparison circuit (VS) and the selector (R3) and in which a number plate of the cabin (5, 6) with the lower operating costs (K _v , K _h ) is stored is and - That the first service cost share (K _Iv , K _Ih ) to be stored in the one cost share memory (RAM7) can be _reduced if there are allocation instructions for rectified floor _calls from two adjacent floors and / or coincidences of car calls and scanner positions of the first scanner (R1). 2. Group control for elevators according to claim 1, wherein the determination of the service costs (K) according to the relationship ^{K =} t _v (P _M + k ₁ R _E -k ₂ R _C ) + k ₁ mt _m + t _v (R + Z), in which the delay time t _v the current car load at the time of _B at an intermediate stop, P _M e-bill, R the number of assigned floor calls between selector and scanner position, R _C the number of cabin calls between selector and scanner position, k _{1 is} an expected number of people getting on per floor call, depending on the traffic conditions, k ₂ an expected number of people getting out per cabin call, depending on the traffic conditions, m the number of floor distances between selector and scanner position, t _m the average travel time per floor distance, R the number of expected stops between selector and scanner position, Z a surcharge dependent on the operating state of the cabin, t _v (P _M + k ₁ · R _E -k ₂ · R _C ) the waiting times in the cabin Corresponding internal service costs (K _I ) that would probably be present to passengers and would arise during a stop on a floor designated by the scanning position, and

External operating costs (K _A ) corresponding to the waiting times of passengers likely to be in a floor designated by the scanning position, characterized in that the determination of the operating costs (K _v , K _h ) of each individual cabin (5, 6) of the double cabin (4) each time you scan according to relationships

takes place in what K _Iv , K _Av the internal and external service _costs the front cab in the direction of travel and ^K _{Ih '} ^K _Ah the internal and external operating costs the rear cabin in the direction of travel and S _v , S _h mean a status factor, where S _v , S _h ⁼ 0 if there is a coincidence of a car call and the scanning position, S _v , S _h = 1 if there are assignment instructions for rectified calls from two adjacent floors, S _v , S _h = 2 if there are neither coincidence nor allocation instructions for rectified calls from two neighboring floors. 3. Group control for elevators according to claim 2, characterized in that a counter (CPU) is provided, the assigned, rectified calls of two adjacent floors counts in pairs, and that the number of expected stops (R) between the selector and scanner position after the relationship

is calculated, whereby R _E the number of assigned floor calls between selector and scanner position, R _e the number of car calls between selector and scanner position, R _{EC is} the number of coincidences of cabin calls and assigned floor calls between selector and scanner position and R _{EE means} the number of pairs of assigned, rectified calls from two adjacent floors between the selector and scanner positions.

Images