EP0246395B1 - Lift group control - Google Patents

Abstract

A group control assigns elevator cars to floor calls optimized in such a manner, that minimal waiting times result and the elevating capacity is increased. A computing device provided for each elevator calculates at every floor a sum proportional to the time losses of the waiting passengers from the distance between the floor and the car position as indicated by a selector, the intermediate stops to be expected within the distance and the instantaneous car load. By means of call registering devices in the form of ten key keyboards at the floors, it is possible to enter calls for destination floors, so that at the time of calculation, the floor calls and the car calls are available simultaneously. The calculated lost time sum, also called servicing costs, is stored in a cost memory provided for each elevator. During a cost comparison cycle, the servicing costs of all elevators are compared with each other by way of a cost comparison device where in each case an assignment instruction can be stored in an assignment memory of the elevator with the lowest servicing costs which instruction designates that floor to which the respective car is optimally assigned in time.

Description

The invention relates to a group control for elevators, with call registration devices arranged on the floors, with load measuring devices provided in the cabins of the elevator group, with each elevator assigned to the group, each indicating the floor of a possible stopping, with a scanning device having at least one position for each floor and with a control device, by means of which the calls entered on the floors are allocated to the cabins of the elevator group, according to the preamble of claim 1.

With such a group control known from EP-B-0 032 213, the assignments of the cars 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 of a scanning device on each floor, whether there is a floor call or not, the distance between the floor and the car position indicated by a selector is used to determine the intermediate stops to be expected within this distance and the instantaneous 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 of the scanning device, the operating costs of all elevators are compared with one another via a cost comparison device, an allocation instruction being stored in an allocation memory of the elevator with the lowest operating costs, which designates the floor to which the relevant car is optimally assigned in terms of time.

The intermediate stops required for the calculation of the service costs result from the floor and cabin calls entered. Since the floor and cabin calls are usually entered by means of call buttons arranged on the floors or in the cabin, a passenger must dial twice in order to arrive at a destination, with access to the cabin panel often being difficult when the cabin is occupied. Under these circumstances, the control device finds the desired destination relatively late, which therefore cannot be billed for the optimization of the allocation.

With US-A-3 374 864 a group control has become known in which the desired destination floor can already be entered on the entry floor. For this purpose, call buttons are arranged on the floors for each floor, while no call buttons are provided in the cabin. The control works in such a way that the cabin intended for a destination floor announces the destination floor by an optical display device on arrival on the entry floor, so that passengers who want to change destination floors do not enter incorrectly. In this group control, which is not suitable for collective controls, the destination floor call input is not used to optimally allocate the cabin / call, but the primary aim is to avoid unnecessary journeys and stops triggered by incorrectly entered direction calls and unwanted transport of passengers in the wrong way To prevent direction. The arrangement of call buttons for each floor on each floor provided in this group control would increase the costs considerably in larger systems with many floors and lead to placement problems.

The invention has for its object to provide a group control according to the preamble, in which the temporal optimization of the assignments cabin / call is improved compared to the first-mentioned prior art and the disadvantages of the last-mentioned prior art are avoided.

This object is achieved by the invention characterized in claim 1. Here, the call registration device has call buttons in the form of a 10-key keyboard and a number of call memories corresponding to the number of floors, it being possible for calls to be input for desired destination floors, as is known from the last-mentioned prior art. The call memories are connected to the floor call memory and the car call memory, wherein if there is at least one call registered by a call registration device in the floor call memory, a call is stored for the floor identified by the call registration device in question. The car call memory consists of a first, already assigned car calls containing memory and the storeys assigned further storeys, in which the calls entered for the desired storey floors, but not yet assigned to a car, are stored, which are taken into account in the calculation of the service costs . The first memory, the further memories, the floor call memory and the allocation memory are linked to one another by means of a first coincidence circuit in such a way that when a floor call is allocated, the calls stored in the allocated further memory are transmitted to the first memory.

The advantages achieved by the invention are that the complete passenger data are available to the control at an early stage, so that the optimization of the cabin / call assignments is improved, with the waiting times becoming shorter and the conveying capacity increasing. Other advantages will be This means that passengers only have to press call buttons once and the obstacles that often occur when entering calls in the cabin are eliminated. Due to the lack of a cabin panel, fewer cables are required in the hanging cable. The use of the 1-Ger keyboard is also an advantage, as this saves space and lines, especially in systems with many floors, and it is possible to standardize the floor table.

• Fig. 1 eine schematische Darstellung der erfindungsgemässen Gruppensteuerung für einen Aufzug einer aus drei Aufzügen bestehenden Aufzugsgruppe,
• Fig. 2 ein Schaltschema einer Rufregistriereinrichtung der Gruppensteuerung gemäss Fig. 1,
• Fig. 3 ein Diagramm des zeitlichen Ablaufes der Rufregistrierung,
• Fig. 4 eine schematische Darstellung der Struktur eines einem Aufzug zugeordneten Kabinenrufspeichers der Gruppensteuerung gemäss Fig. 1 und eine Koinzidenzschaltung für die Rufzuteilung,
• Fig. 5 eine schematische Darstellung zur Veranschaulichung einer der Rufzuteilung zugrunde liegenden Bedienungskostenberechnung bei einem Aufzug, und
• Fig. 6 ein Diagramm des zeitlichen Ablaufes der Gruppensteuerung.

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 shows a circuit diagram of a call registration device of the group control according to FIG. 1,
• 3 shows a diagram of the chronological sequence of the call registration,
• 4 shows a schematic representation of the structure of a car call memory of the group control according to FIG. 1 assigned to an elevator and a coincidence circuit for the call allocation,
• 5 shows a schematic illustration to illustrate an operating cost calculation for an elevator on which the call allocation is based, and
• Fig. 6 is a diagram of the timing of group 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 car 4 guided in the elevator shaft 1 via a conveyor cable 3, n floors EO to En being served, of which only the top floors En-4 to En are shown. The carrier 2 is controlled by a drive control known from EP-B-0 026 406, the setpoint generation, the control functions and the initiation of the stop being realized by means of a microcomputer system 5, and with 6 the measuring and actuating elements of the drive control which are symbolized are connected to the microcomputer system 5 via a first interface IF1. The cabin 4 has a load measuring device 7 and a device 8 signaling the respective operating state Z of the cabin, which are likewise connected to the microcomputer system 5 via the first interface IF1. Call registering devices 9, which are described in greater detail below with reference to FIGS. 2 and 3, are provided on the floors, by means of which calls can be entered for trips to desired target floors. The call registration devices 9 are connected via an address bus AB and a data input conductor CRUIN of a serial input / output bus CRU to the microcomputer system 5 and to an input device which has become known from EP-B-0 062 141 and which consists of a comparison device 10 and a DMA module DMA. The call registration devices 9 are also connected via lines 11 to the microcomputer systems and input devices of the elevators b and c.

The microcomputer system 5 consists of a storey call memory RAM1, a car call memory RAM2 described in more detail below with reference to FIG. 4, a memory RAM3 storing the current car load P _M and the operating state Z of the car 4, and a cost memory RAM4 for the UP and DOWN directions of travel , an allocation memory RAM5 for UP and DOWN direction of travel, a program memory EPROM and a microprocessor CPU, which is connected via the address bus AB, a data bus DB and a control bus STB to the memories RAM1 to RAM5, 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. 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.

The microcomputer systems 5 of the individual elevators a, b, c are comparator device 12 and a second interface IF2 known from EP-B-0 050 304 and a party line transmission system 13 and known from EP-B-0 050 305 a third interface IF3 connected to one another and in this way form the group control according to the invention.

According to FIG. 2, the call registration device 9, which is designed, for example, for one- and two-digit calls, consists of a keyboard 20 which has ten keys for the digits 1 ... 9 and 0 for entering calls to desired destination floors. For example, an eleventh key labeled " ⁼ " can be used as a pre-selection key for calls for floors below the ground floor, the ground floor being identified by the number 0. A twelfth key labeled "C" could be used for other purposes such as The keys of the numbers 1 ... 9 and 0 are connected to the first inputs of the first AND elements 21.1 ... 21.9, 21.0, the outputs of which have inputs S from key memories 23.1. ..23.9, 23.0 for storing a digit entered first The keys of the digits 1 ... 9 and 0 are also connected to first inputs of second AND gates 22.1 ... 22.9, 22.0, the outputs of which are connected to inputs S of key memories 24.1 ... 24.9, 24.0 for storing a second entered digit in ver bond. RS flip-flops, for example, can be used as the key memory. The outputs Q of all key memories are connected to the inputs of a combinatorial logic 25, the outputs of which are connected to first inputs of third AND gates 26.0, 26.1 ... 26.n, the output memories having call memories 27.0, 27.1 assigned to the floors on the output side ... 27.n, in the form of, for example, RS flip-flops.

erfüllen, wobei die Eingangsvariablen 1', 2', 3'..... die erste eingegebene Ziffer und 1", 2", 3"... die zweite eingegebene Ziffer bedeuten und die Ausgangsvariablen 1, 13 die gewählten Zielstockwerke E1, E13 bezeichnen.The combinatorial logic 25 works in such a way that when a single-digit call is entered, one of the call memories 27.0, 27.1 ... 27.9 assigned to the floors EO, E1 ... E9, and when one two-digit call is entered, one of the floors E10 ... En assigned Call memory 27.10 ... 27.n is set. For example, if calls are entered for floors E1 and E13, combinational logic 25 must do the equations

meet, where the input variables 1 ', 2', 3 '..... mean the first digit entered and 1 ", 2", 3 "... the second digit entered and the output variables 1, 13 the selected destination floors E1, Designate E13.

The outputs Q of the call memory 27.0, 27.1 ... 27.n are connected to inputs of a multiplexer 28 and an OR gate 29, the output of which is connected to the first input of the multiplexer 28. The multiplexer 28 is also connected to the address bus AB and is connected on the output side to the data input conductor CRUIN. The outputs Q of the call memory 27.0, 27.1 ... 27.n are connected via lines 11 (FIG. 1) to the multiplexers 28 and OR gates 29 of the elevators b and c.

30 denotes a time limit circuit for the call input, which consists of a monoflop 31, a first and second delay element 32, 33, a first, second and third NOT element 34, 35, 36 and a first and second AND- each having two inputs Link 37, 38 exists. The keys of the digits 1 ... 9 and 0 are connected to the input e of the monoflop 31 via an OR gate 39, a further delay gate 40 and a further AND gate 41 having two inputs. The output a of the monoflop 31 is at the input of the first delay element 32, at second inputs of the second AND elements 22.1 ... 22.9, 22.0 and via a further NOT element 42 at second inputs of the first AND elements 21.1 ... 21.9 , 21.0 connected. The output of the first delay element 32 is connected to the input of the second delay element 33, the output of which is connected via the first NOT element 34 to the second input of the further AND element 41. Logic modules connected in series, for example, can be used as delay elements, the delay time resulting from the signal transit time. The output a of the monoflop 31 is. connected via the second NOT gate 35 to an input of the first AND gate 37, the second input of which is connected to the output of the first delay element 32 and the output of which is connected to the second inputs of the third AND gate connected upstream of the call memories 27.0, 27.1 ... 27.n. 26.0, 26.1 ... 26.n is connected. The output of the first delay element 32 is connected via the third NOT element 36 to an input of the second AND element 38, the second input of which is connected to the output of the second delay element 33 and the output of which is connected to reset connections R of the key memory.

The call registration device 9 described above operates as follows:

When a call is entered for, for example, floor E13, the key of the number 1 is initially actuated, a short pulse being generated and only the key memory 23.1 being set because of the first AND elements 21.1... 21.9, 21.0 released via the further NOT gate 42 (Time I, Fig. 3). After a delay caused by the further delay element 40, the monoflop 31 is switched so that the output of the further NOT element 42 is set low and the first AND elements assigned to the key memories 23.1 ... 23.9, 23.0 for the input of the first digit 21.1 ... 21.9, 21.0 are blocked (time II, Fig. 3). At the same time, the second AND gates 22.1 ... 22.9, 22.0 assigned to the key memories 24.1.:.24.9, 24.0 for entering the second digit are released. It is now assumed that the switch-on time of the monoflop 31 is, for example, one second and the key of the number 3 is still pressed during this time. The key memory 24.3 is set here, so that the combinatorial logic 25 has the input variables 1 'and 3 "and the output variable 13 assigned to the call memory 27.13 for floor E13.

The falling edges of the output signals of the monoflop 31 and the first delay element 32 generate a pulse at the output of the first AND element 37, by means of which the third AND elements 26.0, 26.1 ... 26.n are released and that of the floor E13 assigned call memory 27.13 is set (time 111, FIG. 3). Likewise, a further pulse is generated by the falling edges of the output signals of the first and second delay elements 32 and 33 at the output of the second AND element 38, by means of which all the key memories are reset (time IV, FIG. 3). With the falling edge of the second delay element 33, he is STE NOT gate 34 and the further AND gate 41, the monoflop 31 released, so that another call can be entered. (Time V, Fig. 3).

The call memories 27.0, 27.1 ... 27.n can be scanned via the multiplexer 28 and stored calls can be transmitted to the microcomputer system 5 of the elevator in question. If at least one call is present, the first input of the multiplexer 28 is activated via the OR gate 29 and the assigned address is interpreted as the address of a floor call. The addresses assigned to the other inputs of multiplexer 28 are interpreted as addresses of car calls, with, for example, a first part of the address serving as the destination floor, and a second part of the address as the selection code of the multiplexer in question, and denoting the floor on which the call for the destination floor was entered.

As is known from EP-B-0 062 141 mentioned in the description of FIG. 1, the calls are transmitted to the microcomputer system 5 in such a way that the microprocessor CPU signals its readiness to accept interrupt requests CINT by means of an enable signal CIEN. The DMA module is activated by the enable signal and takes control of the address bus AB and the serial input / output bus CRU. The call memories 27.0, 27.1 ... 27.n of the call registration devices 9 and a read-write memory flag RAM of the comparison device 10 are queried by means of the addresses now generated by the DMA module. In the comparison device 10, the content of the call memories 27.0, 27.1 ... 27.n and the associated memory locations of the random access memory Flag-RAM are compared. If they are not equal, the DMA operation is ended and an interrupt request CINT is generated. The microprocessor CPU now executes an interrupt program, which reads the data bit located on the data input line CRUIN and at the address located on the address bus AB in the floor call memory RAM1 or in the car call memory RAM2 and via a data line Do of the data bus DB in the read-write memory Register RAM flag.

4, the car call memory RAM2 consists of a first memory RAM2 ', which has memory locations corresponding to the number of floors, and in which calls which have already been allocated are stored. RAM2.0, RAM2.1 ... RAM2.n designate further memories assigned to floors EO, E1 ... En, which also have memory locations corresponding to the number of floors. In the further memories RAM2.0, RAM2.1 ... RAM2.n, only the calls entered on the relevant floors that have not yet been assigned to a specific cabin are transferred using the method described in the previous section. The first memory RAM2 ', the further memories RAM2.0, RAM2.1 ... RAM2.n, the storey call memory RAM1 and the allocation memory RAM5 are linked to one another via a coincidence circuit symbolized by AND elements 50 and 51. The coincidence circuit formed by the microprocessor CPU on the basis of a program at each position of the second scanner R2 has the effect that, if an assignment instruction determined in the manner described below and a floor call to the same floor coincide, the calls stored in the associated further memory are transmitted to the first memory RAM2 ' with which they are allocated and released for scanning by the selector R3. According to the selected example, only the allocation memory RAM5 for the UP direction of travel is shown in FIG. 4.

5, RAM4 ', RAM4 "and RAM4 _{"' are} cost share stores, in which, as explained in more detail below, service cost shares K _i , K _A and K; ' are saved. The cost share memory RAM4 ', RAM4 "and RAM4'_", the cost memory RAM4, the storey call memory RAM1 and the car call memory RAM2 are linked to each other at every position of the first scanner R1. The link required for the operations described in more detail below is carried out by the microprocessor CPU on the basis of a program. According to the selected example, only the cost memory RAM4 and the cost share memory RAM4 ', RAM4 "and RAM4"' for the OPEN travel direction are shown in FIG. 5.

The allocation of a floor call and the calls entered on a floor for desired target floors is carried out in a similar manner to that in EP-B-0 032 213 recognized in the prior art and is explained in more detail below with reference to FIGS. 4, 5 and 6:

When a call is entered, the first scanners R1 of the elevators a, b, c begin with one cycle, hereinafter referred to as the KBZ cost calculation cycle, starting from the selector position in the direction of travel of the relevant cabin (time 1, FIG. 6). During the cost calculation cycle KBZ, 5 operating costs K are calculated by the microcomputer system according to the equation K = tv ( _P M + k ₁ .R _E -k ₂ .Rc) + k ₁ [mt _m + t _v (R _E + R _c - R _EC + Z) GI.1

• t_vdie Verzögerungszeit bei einem Zwischenhalt,
• P_Mdie Momentanlast im Zeitpunkt der Berechnung,
• R_Edie Anzahl zugeteilter Stockwerkrufe zwischen Selektor- und Abtasterstellung,
• Rcdie Anzahl Kabinenrufe zwischen Selektor- und Abtasterstellung,
• kieine in Abhängigkeit von den Verkehrsverhältnissen ermittelte voraussichtliche Anzahl zusteigende Personen pro Stockwerkruf,
• k₂ eine in Abhängigkeit von den Verkehrsverhältnissen ermittelte voraussichtliche Anzahl aussteigende Personen pro Kabinenruf,
• mdie Anzahl Stockwerkdistanzen zwischen Selektorund Abtasterstellung,
• tmdie mittlere Fahrzeit pro Stockwerkdistanz,

calculated, whereby

• t _v the delay time for an intermediate stop,
• P _{M is} the instantaneous load at the time of the calculation,
• R _E the number of assigned floor calls between selector and scanner position,
• Rc the number of cabin calls between selector and scanner position,
• no expected number of people getting in depending on the traffic conditions per floor call,
• k ₂ an expected number of people getting out per cabin call, depending on the traffic conditions,
• the number of floor distances between selector and scanner position,
• tmthe average journey time per floor distance,

R _E c the number of coincidences of car calls and assigned floor calls between selector and scanner position,

Zeine surcharge depending on the operating state of the cabin, tv (P _M + k ₁ .R _E -k ₂ .Rc) internal service costs Ki and k ₁ [mt _m + t _v (R _E + R _C -R _EC + Z)] outer Operating costs K _A mean.

The operating costs K, K _l , K _A determined according to the above equation are stored in the cost memory RAM4 or in the cost share memories RAM4 ', RAM4 ". If a car call Rc is present at the time of the calculation at the scanning position concerned, the operating costs K reduced by setting the internal service costs Ki to 0. By forming a new address, the scanner R1 is switched to the next floor and a new calculation is carried out.

• K = K_l+K_A+K' Gl.2
• K' = tv(P' _M+k₁R' _E-k₂.R' c)Gl.3
• mit in Rechnung gestellt, wobei
• P'Mdie erwartete, sich aus der Beziehung tv'P'_M=K_l ergebende Last bei Erreichen des zugeteilten Stockwerkrufes,
• R' Edie Anzahl zugeteilter Stockwerkrufe zwischen Zusteige- und Zielstockwerk des noch nicht zugeteilten Rufes und
• R'cdie Anzahl Kabinenrufe zwischen Zusteige- und Zielstockwerk des noch nicht zugeteilten Rufes bedeuten, und wobei die gemäss Gleichung Gl.3 ermittelten zusätzlichen inneren Bedienungskosten K' im Kostenanteilspeicher RAM4" gespeichert werden.

If the sampler R1 encounters an as yet unallocated floor call during the cost calculation cycle KBZ according to the example (FIG. 5) at floor E10 and a call is stored in the assigned further memory RAM2.10, for example for floor E14, the additional internal calls caused by this call become Operating costs K 'when calculating the scanner position E10 according to the equations

• K = K _l + K _A + K 'Eq. 2
• K '= tv (P' _M + k ₁ R ' _E -k ₂ .R' c) Eq. 3
• billed with
• P'Mdie expected the load resulting from the relationship tv'P ' _M = K _l when the assigned floor call was reached,
• R 'Edie number of floor calls allocated between the landing and destination floors of the as yet unallocated call and
• R'cmeans the number of cabin calls between the boarding and destination floors of the not yet allocated call, and the additional internal service costs K 'determined according to equation Eq. 3 are stored in the cost share memory RAM4 ".

Since it is assumed according to the example that the scanning takes place in the upward direction using the scanner R1 and when the scanner position E10 is reached it is established that the floor call which has not yet been allocated is stored with regard to the location of the RAM2.10 in the further memory for the floor E14 Call is an upward call, the service costs K are stored in the memory RAM4 assigned to the UP direction.

If, for example, a car call already assigned to elevator a is stored for floor E10, the internal service costs Ki for floor E10 are not taken into account in the addition according to equation Eq. 2 above. As a result of the reduced operating costs K, the allocation of the floor call E10 to the elevator a is more likely, so that the desired goal of saving waiting times by entering and exiting the same stop can be achieved more quickly.

If, for example, a floor or cabin call already assigned to elevator a is also stored for floor 14 at the same time (FIG. 5), the call stored in the further memory RAM2.10 for floor E14 is calculated when this scanning position is calculated according to equation Eq. 2 caused additional internal service costs K 'not charged.

After the end of the cost calculation cycle KBZ (time II, FIG. 6), the second scanners R2 simultaneously begin one round for all elevators a, b, c, hereinafter referred to as the KVZ cost comparison cycle, starting from the floor EO (time III, FIG. 6). For example, the KVZ cost comparison cycles start five to ten times per second. At each scanning position, the operating costs K contained in the cost memories RAM4 of the elevators a, b, c are fed to the cost comparison device 12 and compared with one another, wherein in the allocation memory RAM5 of the elevator a, b, c with the lowest operating costs K, an allocation instruction in the form of a Logical "1" can be stored, which denotes the floor to which the elevator a, b, c in question is optimally assigned in terms of time. For example, based on the comparison in the scanning position E9, a reassignment may take place by deleting an assignment instruction for elevator b and enrolling one for elevator a (FIG. 4). As a result of the reallocation when the scanner is in position E9, a new cost calculation cycle KBZ is started for lifts a and b and the cost comparison cycle KVZ is interrupted because the former has priority.

According to the example (FIG. 4), a call is stored in the floor call memory RAM1 for floor E9, so that by activating the AND gates 51 of the coincidence circuit, the calls stored in the associated further memory RAM2.9, for example for floors E11 and E13, are stored in the first memory RAM2 'of the car call memory RAM2 are transmitted, and are therefore also assigned to the elevator a. During the new cost calculation cycle KBZ, these calls are now taken into account as cabin calls Rc or floor calls R _E in equation GL1. If the selector R3 is switched on and when the scanning position E9 is reached, it is determined that the allocation instruction is stored in the allocation memory RAM5 assigned to the UP direction of travel, so that the calls for the floors E9, E11 and E13 must be served by the elevator a, which according to the example is in the upward direction. After switching the selector R3 to the scanning position E9, as can be seen from the reference to the drive control given in the description of FIG. 1, the deceleration phase is initiated and the car 4 of the elevator a on the floor E9 is stopped. If, during the delay phase on floor E9, further calls are entered for destination floors lying in the direction of travel of cabin 4, the microprocessor CPU of elevator a, after these calls have been written into the further memory RAM2.9, causes them to be immediately transferred to the first memory RAM2 '. with which they are allocated to the elevator a without the allocation procedure described above.

While the cost calculation cycle KBZ of elevator b continues without interruption, continuing that of the example according to FIG. 6, 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 E10 in order to be interrupted again at scanner position E7 (downward) by the occurrence of an event in elevator c, for example a change in the selector position (time VI). After the resulting cost calculation cycle KBZ has ended at elevator c (time VII), the cost comparison cycle KVZ continues and its termination when the scanner is set to E1 (downward). A further cost calculation cycle KBZ for elevator a runs between times VIII and IX, whereupon the next cost comparison cycle KVZ is started at time X.

Upon arrival of a car intended for one or more target floors on a floor, as is also known from the prior art described, the passengers waiting on this floor are informed by a suitable display device, not shown, whether the desired cabin is the desired one with the arriving car Destination can be reached.

Claims (8)

1. Lift group control with call registering devices (9), with load measuring devices (7) provided in the cars of the lift group, with selectors (R3) assigned to every lift of the group, indicating in each case, the floor of a possible stop, with a scanning device (R1, R2) exhibiting at least one position for every floor, and with a control device, by means of which the calls entered at the floors are assigned to the cars of the lift group, where the control device per lift exhibits a computing device (CPU), a floor call memory (RAM1) and a car call memory (RAM2), and where the computing device at every position of a first scanner (R1) of the scanning device (R1, R2) calculates the servicing costs (K) corresponding to the waiting times of the passengers according to the equation.

K = tv(PM+K₁.R_E-k₂.R_C) + k_1[m_"tm+tv(R_E+Rc-REC+Z)] where

tv the delay time at an intermediate stop,

P_M the instantaneous load at the time of calculation,

R_E the number of assigned floor calls between selector and scanner position,

Rc the number of assigned car calls between selector and scanner position,

k₁ an expected number of entering passengers per floor call, determined as function of the traffic conditions,

k₂ an expected number of leaving passengers per car call, determined as function of the traffic conditions,

m the number of floor distances between selector and scanner position,

t_m the means travelling time per floor distance,

R_EC the number of coincidences of car calls and assigned floor calls between selector and scanner position,

Z an addition dependant on the operating condition of the car, tv(P_M+K₁.RE-k₂.Rc) internal servicing costs Ki and ki[m-tm+tv(RE+Rc-REC+Z)] external servicing costs K_A

stand for the given explanation and that a cost memory (RAM4) storing the servicing costs (K), one each share memory (RAM4', RAM4") storing the internal respectively external servicing costs (K_i, K_A), a cost comparison device (12) determing the car with the lowest servicing costs (K) at every position of a second scanner (R2) of the scanning device (R1, R2) and an assignment memory (RAMS) are provided, where an assignment instruction for a floor call of the respecitve scanner position can be written into the assignment memory (RAMS) of the car exhibiting the lowest servicing costs (K), so characterized

- that all the call registering device (9) exhibits call buttons in the form of a 10-key keyboard (20) and a number of call memories (27.0, 27.1 ... 27.n) corresponding to the number of floors, where by means of the call buttons, calls for desired destination floors can be entered,

- that the call memories (27.0, 27.1 ... 27.n) are connected with the floor call memory, (RAM1) and the car call memory (RAM2), where at presence of at least one call in the floor call register (RAM1), registered by a call registering device (9), a call is stored for the floor specified by the respective call registering (9), that

- the car call memory (RAM2) of a lift consists of a first memory (RAM2') already containing assigned car calls (Rc) and the further memories (RAM2.0, RAM2.1 ... RAM2.n) assigned to the floors, where in the further memories the calls are stored, which are entered at the respective floors for desired destination floors, not yet assigned to a car, which are considered in the calculation of the servicing costs (K) of the scanner position assignment to the respective floor, and

- that the first memory (RAM2'), the further memories (RAM2.0, RAM2.1 ... RAM2.n), the floor call register (RAM1) and the assignment memory (RAM5) are linked by means of a coincidence circuit (50, 51) in such a manner to each other, that on assignment of a floor call the calls stored in the assigned further memory (RAM2.0, RAM2.1 ... RAM2.n) are transferred into the first memory (RAM2').

2. Lift group control according to patent claim 1, so characterized, that in presence of a not yet assigned floor call the servicing costs (K) of the corresponding scanner position are calculated according to the equations

K = Ki+K_A+Ki,

K'_l = tv(P'M+k1.R'_E-k₂.R'c) where the symbols signify

P'_M the expected load resulting from the relationship t_v'P'_M = Ki on reaching the assigned floor call,

K'_l the additional internal servicing costs caused by calls stored in the assigned further memory

(RAM2.0, RAM2.1 ... RAM2.n),

R' the number of assigned floor calls between entry- and destination floor of a not yet assigned call, and

R'c the number of car calls between entry- and destination floor of the not yet assigned call.

3. Lift group control according to patent claim 2, so characterized, that a further cost share memory (RAM4") is foreseen, in which the additional internal servicing costs (K'l) are stored, and that the further cost share memory (RAM4"), the cost share memories (RAM4', RAM4") storing the internal and external servicing costs (K_I, K_A), the cost memory (RAM4), the floor call memory (RAM1) and the car call memory (RAM2) are linked with each other in such a manner, that at presence of an assigned floor-or car call and a not yet assigned car call at the same scanner position, the servicing costs (K) to be stored in the cost memory (RAM4) are not increased by the additional internal servicing cost (K'_l).

4. Lift group control according to patent claim 1, so characterized,

- that the keys of the numerals 1 ... 9 and 0 of the 10-key keyboard (20) are connected with key memories (23.1 ... 23.9, 23.0) for the storage of a first entered numeral and with key memories (24.1 ... 24.9, 24.0) for the storage of a second entered numeral,

- that the outputs (Q) of all key memories are connected with inputs of a combinatorial logic (25), the outputs of which are in connection, by way of AND-gates (26.0, 26.1 ... 26.n) with inputs (S) of the call memories (27.0, 27.1 ... 27.n), and

- that time limiting circuit (30) is foreseen, which on its input side is connected with the keys of the numerals 1 ... 9 and 0 and on its output side with the reset-connections (R) of all key memories, as well as by way of the AND-gates (26.0, 26.1 ... 26.n) with the inputs (S) of the call memories (27.0, 27.1 ... 27.n),

- where through the input of a numeral the time limiting circuit (30) is activated during a certain time provided for the input of a second numeral, and after expiration of this time the call memory (27.0, 27.1

... 27.n) assigned to the first numeral or eventually to the first and second numeral is set and all key memories are reset.

5. Lift group control according to patent claim 4, so characterized, that the specific time provided for the input of a second numeral is one second.

6. Lift group control according to patent claim 4, so characterized,

- that the time limiting circuit (30) consists of a monoflop (31) a first and second delay element (32, 33) a first, second and third NOT-gate (34, 35, 36) and a first and second AND-gate (37, 38) each exhibiting two inputs,

- that the input (e) of the monoflop (31) is connected by way of a further AND-gate exhibiting two inputs, a further delay element (40) and an OR-gate (39) with the keys of the numerals 1 ... 9 and 0,

- that the output (a) of the monoflop (31) is connected to the input of the first delay element (32) and by way of the second NOT-gate (35) to one input of the first AND-gate (37), the second input of which is in connection with the output of the first delay element (32) and the output of this with inputs of the AND-gates (26.0, 26.1 ... 26.n) connected in series with the call memories (27.0, 27.1 ... 27.n),

- that the output of the first delay element (32) is connected with the input of the second delay element (33) and by way of the third NOT-gate (36) with an input of the second AND-gate (38), the second input of which is connected to the output of the second delay element (33) and the output of which is connected to the reset-connections (R) of all key memories, and

- that the output of the second delay element (33) is connected by way of the first NOT-gate (34) with an input of the further AND-gate (41).

7. Lift group control according to patent claim 1, so characterized, that the outputs (Q) of the call memories (27.0, 27.1 ... 27.n) are connected to the data inputs of a multiplexer (28) and the inputs of an OR-gate (29), the output of which is in connection with fhe first data inputs of the multiplexer (28) are connected with an address-bus (AB) of the control device, where the address assigned to the first data input is interpreted by the control device as address of a floor call and the addresses assigned to the remaining data inputs are interpreted as addresses of car calls.

Images