EP0356731A1 - Grouped control affording instantaneous attribution of destination calls - Google Patents

Abstract

In this grouped control, a call to be allocated for the first time to a cabin is instantaneously and definitively allocated after its input. For this purpose, immediately after the call input, for all the lifts operating costs corresponding to the waiting times of passengers are calculated from lift-specific data solely for the input floor and destination floor of the new call and are transferred to a cost register (R1). The comparison of these operating costs is then carried out immediately, the call being allocated definitively to the lift with the lowest operating costs. The operating-cost calculation extends to all the participants in the cabins and on the floors, the computer using a running-timetable (15), in which the running times between a particular floor and any other floor are stored. A door-timetable (14) stores the door opening and closing times of the particular lift, which the computer uses for calculating the standstill time of the cabin. Operating costs calculated in this way achieve better comparative results and provide exact data on the actual waiting times of all the participants. <IMAGE>

Description

The invention relates to a group control for elevators with immediate assignment of destination calls, with call registration devices arranged on the floors, by means of which calls for desired destination floors can be entered, with the store assigned to the elevators of the group, which are connected to the call registration devices, with the entry of calls on one floor a call characterizing the input floor and the calls characterizing the target floors are stored in the call memories, and with load measuring devices provided in the cabins of the elevator group, which are actively connected to load memories, associated with each elevator of the group, each floor of a possible stopping indicating selectors and with a device by means of which the entered calls are allocated to the cabins of the elevator group, according to the preamble of claim 1.

With such a group control, which has become known from EP-A-0 246 395, the assignments of the cars to the entered calls can be optimized in terms of time. The car call memory of an elevator of this group control consists of a first memory, which has already been allocated, and contains further memories assigned to the floors, in which the calls which have been entered on the floors concerned for desired destination floors and have not yet been allocated to a car are stored. A device by means of which the entered calls are allocated to the cabins of the elevator group has a computer in the form of a microprocessor and a comparison device. The computer calculates one immediately after the registration of a call during a scanning cycle of a first scanner Scanning device for each floor from at least the distance between the floor and the cabin position indicated by a selector, the intermediate stops to be expected within this distance and the current cabin load, a sum proportional to the time lost by waiting passengers on the floors and in the cabin. The cabin load at the time of the calculation is corrected by factors that correspond to the anticipated number of passengers boarding and alighting at future stops and that are derived from the number of passengers boarding and disembarking in the past. If the first scanner encounters an as yet unallocated floor call, then the calls entered on this floor for the desired destination floors and stored in the further memories of the cabin call memory must also be taken into account. An additional sum proportional to the time lost by the passengers in the cabin is therefore determined using the factors mentioned above, and a total sum is formed. This total, also called operating costs, is stored in a cost memory. During a scanning cycle of a second scanner of the scanning device, the operating costs of all elevators are compared with one another by means of the comparison device, an allocation instruction being stored in an allocation memory of the elevator with the lowest operating costs, which indicates the floor to which the relevant car is optimally assigned in terms of time.

The scanning of all floors in the up and down direction and the calculation of the service costs for each floor, whether there is a call or not, and the scanning of all floors for the purpose of comparing the service costs, at least for the floors with new calls, requires a relatively large amount of computing time and Storage capacity and an elaborately structured cabin call memory. On the other hand, in the sense of the desired optimization, a call that has already been allocated if it is not yet the drive control of the the elevator in question was handed over to another elevator on the basis of a later calculation and comparison cycle. It can also be considered advantageous that floors are also calculated on which no calls have been entered, so that when a call arrives, only the additional service costs have to be calculated.

The operation cost formula the allocation method of the aforementioned publication underlying has, in addition to the aforementioned factors for the calculation of likely supply and dropout numbers in a future maintenance still a factor Verzögerungszei t _v at an intermediate stop and a factor driving time MT _m of a lift which are also only approximate averages. In particular, the travel times of the individual elevators can differ more or less from one another with the same number of floors to be traversed, which is due to unevenly operating drives, inaccuracies in the floor distances or, in the case of high-performance elevators with a leading selector, in the different speeds that occur. As a result, the allocation process can lead to inaccurate results. The operating costs are also only determined over a limited area of the route, which is, however, completely sufficient for the comparison of the elevators with one another, but does not provide any information about the actual waiting times of all passengers taking part in traffic at the time of the calculation.

To improve the service cost formula, EP-OS 0 301 173 proposes to replace the likely numbers of people entering and exiting with those actually expected. Here, a sum is formed from the number of calls entered on a floor and the number of calls designating this floor as a destination and stored as a load value in a load memory, the Load value is calculated when calculating the floor in question. If the load values are no longer changed in the time between the receipt of a new call and the transfer of this call to the drive control of the elevator in question, the allocation can be regarded as optimal.

EP-OS 0 308 590 proposes for group controls of the type mentioned at the outset to definitely leave a call assigned to a cabin for the first time. As a result, the assigned cabin can be signaled to the passengers on the floors practically immediately after the call has been entered. Since it can be considered unlikely that the load values will be changed in the very short period between call entry and allocation, the allocation is optimal here, at least with regard to the future cabin load, at the time of allocation. However, since the first and definitely assigned call no longer takes part in the optimization process, and further calls could be entered and the load values changed accordingly until this call was transferred to the relevant drive control, the assignment can no longer be considered optimal, at least in such cases .

The object of the invention is to improve the group control mentioned above and its modifications in such a way that the waiting times of the passengers are recorded more precisely and more accurate comparison results can be achieved for an optimal call allocation and less computing time and storage capacity is required.

This object is achieved by the invention characterized in claim 1. Immediately after entering the call, the service costs are only calculated for the input and destination floor of the new call and transferred to a cost register. This is followed immediately by a comparison of those in the cost registers of all cabins operating costs, the resulting call allocation is final. The service charge calculation extends to all road users located in the cabins and on the floors, the computer using a time table in which the travel times between a particular floor and every other floor are stored. The door opening and closing times of the elevators are stored in door time tables, which the computer also takes into account when calculating the service life of a cabin.

The advantages achieved with the invention can be seen in that the simplification of the method saves computing time and storage capacity. With the improved service cost formula, better comparison results of the lifts with each other are achieved, the respective assignment of cabin / call at the moment of assignment being optimal. Another advantage is that the elevator operator has the calculation results to provide data on the actual waiting times of all road users.

• Fig. 1 eine schematische Darstellung der erfindungsgemässen Gruppensteuerung für zwei Aufzüge einer Aufzugsgruppe,
• Fig. 2 eine schematische Darstellung eines einem Aufzug zugeordneten Teiles der Gruppensteuerung gemäss Fig. 1, und
• Fig. 3 eine schematische Darstellung eines einem Aufzug zugeordneten Schaltkreises der Gruppensteuerung gemäss Fig. 1.

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

• 1 is a schematic representation of the group control according to the invention for two elevators of an elevator group,
• FIG. 2 shows a schematic illustration of a part of the group control according to FIG. 1 assigned to an elevator, and
• 3 shows a schematic illustration of a circuit of the group control according to FIG. 1 assigned to an elevator.

In Fig. 1, A and B are two elevators of an elevator group, with each elevator a car 2 guided in an elevator shaft 1 is driven by a conveyor 3 via a conveyor cable 4 and fifteen floors E0 to E14 are served. The carrier 3 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 implemented by means of a microcomputer system 5 which is connected to measuring and actuating elements 6 of the drive control. The microcomputer system 5 also calculates from elevator-specific data a sum corresponding to the waiting time of all passengers, also called service costs, which is used as the basis for the call allocation process. The cabin 2 has a load measuring device 7, which is also connected to the microcomputer system 5. On the floors, for example, call registration devices 8 known from EP-A-0 246 395 are provided in the form of 10 keyboards, by means of which calls can be entered for trips to the desired destination floors. The call registration devices 8 are connected via an address bus AB and a data input conductor CRUIN to the microcomputer system 5 and to an input device 9 which has become known from EP-B-0 062 141. The call registration devices 8 can be assigned to more than one elevator of the group, wherein, for example, those of the elevator A are connected to the microcomputer system 5 and the input device 9 of the elevator B via coupling links in the form of multiplexers 10. The microcomputer systems 5 of the individual elevators in the group are connected to one another via a comparison device 11 known from EP-B-0 050 304 and a party line transmission system 12 known from EP-B-0 050 305 and form together with the call registration and input devices 8, 9 and the components listed below the inventive Group control. Numeral 13 denotes a load memory, 14 a door time table and 15 a time table, which are connected to the bus SB of the microcomputer system 5 and are explained in more detail below.

The part of the microcomputer system 5 which is schematically shown in FIG. 2 and is assigned to elevator A, for example, has a call memory RAM1 and a first and second allocation memory RAM2, RAM3 which have memory locations corresponding to the number of floors for each direction of travel, only those assigned to the upward calls Memory are shown. The call memory RAM1 consists of a first and a second memory RAM1.1, RAM1.2, wherein in the first memory RAM1.1 the calls denoting the respective input storey and in the second memory RAM1.2 the calls identifying the destination storeys are stored, and wherein the first memory RAM1.1 is assigned to the first allocation memory RAM2 and the second memory RAM1.2 to the second allocation memory RAM3. R1 denotes a cost register intended for the storage of the operating costs and R2 denotes a cabin position register. A selector R3 in the form of a further register forms addresses corresponding to the floor numbers, by means of which the memory locations of the memories RAM1.1, RAM1.2, RAM2 and RAM3 can be addressed. While the selector R3 in each case indicates the floor on which the moving car 2 could still stop, the car position register R2 in each case shows the floor in the area of which the car 2 is actually located. The call memory RAM1 and the first and second allocation memories RAM2, RAM3 are read-write memories which are connected to the bus SB of the microcomputer system 5. The calls stored in the call memory RAM1 in accordance with example FIG. 2 and the allocation instructions stored in the allocation memories RAM2, RAM3 are symbolically marked with "1", the floors E1, E8, E9, E10 and E12 assigned (dashed connecting line) and E4 and E7 are new, not yet assigned calls (hatched fields).

2, the load memory 13 consists of a read-write memory in the form of a matrix which has exactly as many rows as floors and three columns S1, S2, S3. The first column S1 of the matrix is assigned to the calls of the same direction lying in front of the cabin 2, the second column S2 to the opposite direction calls and the third column S3 to the calls of the same direction lying behind the cabin 2 in the direction of travel. Load values are stored in the storage locations of the load storage device 13 in the form of a number of people who are located in the cabin 2 when they depart from or drive past a floor. For a more detailed explanation, it is assumed in FIG. 2, for example, that the car 2 is in the upward travel in the area of the floor E2 and that upward calls have been entered on the floors E1, E4 and E10. After the calls have been transferred to the first and second memories RAM1.1, RAM1.2, a sum is formed from the number of calls (beginners) entered on a floor and the number of calls (dropouts) that designate this floor and a load value stored in the load memory 13. The first column S1 of the load accumulator 13 will therefore have the load values shown in FIG. 2 due to the selected number of people entering and exiting. For example, the load value "2" for floor E7 results from two beginners on floor E1, one beginner on floor E4 and one dropout on floor E7. When calculating the operating costs, the computer can call up the number of passengers in the cabin 2 at a future stop from the load store 13. In addition, it can be determined on the basis of the stored load values whether an overload 2 would occur if a certain floor were allocated to a cabin.

As described above, when the load storage device 13 is created, the entered calls are used to infer the future passengers entering and exiting the cabin 2 and the resulting loads. However, it would now be possible for passengers to enter their call more than once, or for passengers who have not entered a call to board. In these cases, the saved load values must be corrected. For this purpose, the load storage device 13 is connected to the load measuring device 7 of the cabin 2 via the microcomputer system 5 (FIG. 1). In the first case, as many of the same destination calls are deleted on the respective floor as the difference between the stored load value and the actually measured cabin load. Then all stored load values between the entry floor and the destination floor of the call entered more than once are corrected. In the second case, the stored load values must be increased, it being assumed that the passenger who has not entered a call wants to drive to a destination which is characterized by a call already entered by another passenger. If several calls have been entered, it is assumed that the conscious passenger wants to drive to the most distant destination.

The door time table 14 consists of a read-write memory in which the door opening and closing times determined in real time by the microcomputer system 5 of the elevator in question are stored. It is assumed that the door opening and closing times are subject to certain fluctuations from floor to floor, which can be recorded in this way and taken into account when calculating the service costs. For each stop, the computer calculates from the table values t _{in question} , t _to and the door hold-open time t _off, which depends on the number of people entering or exiting, in accordance with the relationship defined in claim 2, the service life t _{h of} the cabin in question.

The travel time table 15 also consists of a read-write memory, in which the travel times of the elevator in question between a particular floor and every other floor are stored separately according to the upward and downward travel direction. The time table 15 is created during the initial start-up by learning trips from each floor to each floor and is correct if all possible trips have been carried out at least once. In this way, the travel times of the individual elevators in the group, which deviate more or less from one another over the same uninterrupted route, can be recorded, whereby the deviations can lie in unevenly operating drives, inaccuracies in the floor distances or, in the case of high-performance elevators, in the distance-dependent variable limit speeds. When calculating the service costs according to the relationship defined in claim 1, the table values assigned to the routes in question can be used directly. The table values are also used to calculate the time losses Δt _s , Δt _z caused by a new call from calls already allocated to road users. In the case of an intermediate stop caused by a new call, the time loss Δt _s or Δt _{z of} the passengers in the cabin during the intermediate stop is dependent on the standing time t _h and the difference resulting from the travel times, in accordance with the relationships defined in claim 3 with intermediate stop and the travel time without intermediate stop. The time loss Δt _s caused by an intermediate stop at the input floor of a new call must be taken into account according to claim 1 when calculating the waiting time of all incoming calls between the input and destination floors. For those who have already been allocated calls beyond the input and destination floor of the new call, the time loss Δt _z that arises during an intermediate stop at the destination floor must also be taken into account.

If a stop due to an already assigned call coincides with a stop at the input or destination floor caused by a new call, the time loss Δt is reduced to the standing time t _h , since the stop is not forced by the new call, but occurs anyway. The standing time t _h here consists only of the door hold-open time t ' _off or t˝ _off, which is calculated from the number of people entering or leaving the new call in accordance with the relationships defined in claim 4.

In Fig. 3, the first and second memory RAM1.1, RAM1.2 of the call memory RAM1 and the first and second allocation memory RAM2, RAM3 for the up calls additionally with u and for the down calls additionally with d. A circuit 16 connecting the memory cells of the upward and downward memories has the task of suppressing the allocation of a new call if a reverse direction call has already been allocated to the same input floor for the elevator in question. In this way it can be prevented that the newcomers are taken along in the wrong direction.

3, the circuit 16 consists of a register 17 containing a maximum value K _{max of} the operating costs K, first and second tristate buffers 18, 19, a NOT gate 20, a two-input OR gate 21 and a first and second , AND inputs 22, 23 each having three inputs. The first AND gate 22 is connected on the input side to the outputs of the memory cells of the first memory RAM1.1u and of the first allocation memory RAM2u in the upward direction, and to the cost register R1. The second AND gate 23 is connected on the input side to the memory cells of the first memory RAM1.1d and the first allocation memory RAM2d of the downward direction and also to the cost register R1. The outputs of the AND gates 22, 23 are connected to the inputs of the OR gate 21, the output of which with the Activation connections of the first tristate buffers 18 and via the NOT link 20 with the activation connections of the second tristate buffers 19 in connection. The register 17 is connected via the first tristate buffers 18 to the data inputs of the comparison device 11, which are connected to the cost register R1 via the second tristate buffers 19. The circuit 16 formed by the microcomputer system 5, for example on the basis of a program, is activated each time the operating costs K are transferred to the cost register R1 for the floor in question.

The group control described above works as follows:

After the entry of a call, for example according to FIG. 2 on floor E4 for floor E7, a call characterizing the input floor is transferred to the first memory RAM1.1 and a call characterizing the target floor is transferred to the second memory RAM1.2 of the call memory RAM1 of all elevators . Then, as already described above, the load memories 13 of all elevators are created or corrected in the case of already existing load values, the number of calls entered on one floor remaining stored separately until the passengers in question have entered. For the time being, it is checked for each elevator whether the load value for the floor to be allocated would exceed a certain load limit. If so, then, as described in EP-OS 0 301 173, the elevator in question is excluded from the allocation process. Thereafter, the service costs K for the input and destination floor of the new call are calculated for all elevators in accordance with the relationships of claims 1-4. It is assumed here that the possibly occurring new stops at the entry and destination floor would result not only in waiting times for the new passengers, but in all traffic participants who had already been assigned calls to the elevator in question.

As already mentioned above, the computer takes the door times from the door time table 14 and the travel times from the time table 15, the floor in the car position register R2 being relevant in each case for the latter. The number of passengers already in the cabin is taken from the load store 13. The number of separately stored calls is used for the number of boarders waiting on the floors. Thus, according to example FIG. 2, for elevator A the travel time t _s from floor E2 to floor E4 and the number F = 1 of new passengers are charged for the call cost K _rs . For the passenger costs K _ps , the time loss Δt _s caused by the stopover on floor E4 of the two passengers on floor E1 would have to be taken into account. Finally, when determining the waiting costs K _wz , the time losses Δt _s , Δt _z caused by the intermediate stops on floors E4 and E7 and the number F˝ = 1 of boarders from floor E10 would have to be taken into account.

Immediately after the calculation, the service costs K are transferred to the cost register R1 and compared with the service costs K of the other elevators by means of the comparator 11 proposed, for example, in accordance with EP-B-0 050 304. It may be assumed that elevator A has the lowest service costs K, so that an allocation instruction is written in the first allocation memory RAM2 on floor E4 and in the second allocation memory RAM3 on floor E7 (dashed arrows, FIG. 2). The assignment of the assignment instruction in the second assignment memory RAM3 can be achieved, for example, by the address of the destination floor also having an address part characterizing the input floor in addition to the selection code, so that all destination calls are always considered to have been assigned whose address is an address part characterizing the common, assigned input floor exhibit. Selector R3 now switches in Continuation of the assumed upward travel of the car 2 located in the area of the floor E2 to the new assigned floor E4, the deceleration can be initiated when the braking application point is reached according to the proposed drive control EP-B-0 026 406.

If the input storey E4 of the new call is the input storey of an already assigned opposite-direction call, the output of the second AND gate 23 of the circuit 16 (FIG. 3) is increased when the service costs K are transferred to the cost register R1, so that the first tristate buffers 18 are released, but the second tristate buffers 19 are blocked. As a result, the comparison device 11 is not supplied with the operating costs K located in the cost register R1, but rather with the maximum value K _max contained in the register 17, so that the elevator A cannot be assigned the new call from floor E4 in this situation.

After the call has been allocated to elevator A, as initially assumed in accordance with the example, the cost registers R1 of all elevators are deleted and are available for recording the service costs K of another new call. If it is determined in the allocation process of a new call from the same floor that elevator A does not have the lowest operating costs K, then it is prevented that the allocation instructions written in the first and second allocation memories RAM2, RAM3 of elevator A can be deleted again, which can be done, for example, by means of a device known from EP-OS 0 308 590 can be achieved.

Claims (6)

1. Group control for elevators with immediate allocation of destination calls, with call registration devices (8) arranged on the floors, by means of which calls for desired destination floors can be entered, with the elevators of the group assigned call memories (RAM1), which are connected to the call registration devices (8) , When entering calls on a floor, a call characterizing the input floor and the calls characterizing the target floors are stored in the call memories (RAM1), and load measuring devices (7) provided in the cabins (2) of the elevator group, which are equipped with load memories ( 13) are in operative connection with each elevator assigned to the group, the respective floor of a possible stopping selectors (R3), and with a device by means of which the entered calls are allocated to the cars (2) of the elevator group, the device per elevator comprises a computer and a comparison device (11) d the computer calculates operating costs corresponding to the waiting times of passengers, based on elevator-specific data, and wherein at least one allocation memory is provided and the operating costs of all the cabins are compared with one another by means of the comparison device (11) and that cabin (2) the relevant call by writing an allocation instruction in the Allocation memory is permanently allocated, which has the lowest service costs,
characterized by
- That the service costs (K) immediately after the call input only for the input and destination floor of a new call after the relationship
K = K _rs + K _rz + K _ps + K _pz + K _ws + K _wz
can be calculated, whereby
K _rs = t _s · F the waiting time of the new passengers at the input floor,
t _s the travel time of the cabin to the input floor (plus delays due to intermediate stops),
F the number of new passengers on the entry floor,
K _rz = t _z · F the travel time of the new passengers,
t _z the travel time from the input to the destination floor (plus delays due to intermediate stops),
K _ps = delta _s · P _s the time loss of the passengers in the cabin at an intermediate stop at the input storey,
Δt _{s is} the loss of time per passenger, which is dependent on the standing time (t _h ) during the stopover and the travel time difference resulting from the journey with an intermediate stop and the journey without an intermediate stop,
P _{s is} the number of passengers on the input floor,
K _pz = delta _z · P _z the time loss of the passengers in the cabin at an intermediate stop at the destination floor,
Δt _z as Δt _s , but related to the target floor,
P _z the number of passengers on the destination floor,
K _ws = Δt _s · F ′ the waiting time of all boarders between the input and destination floors,
F ′ the number of calls already assigned,
K _wz = (Δt _s + Δt _z ) · F˝ the waiting time of all boarders behind the target floor, and
For the number of boarders who have already been assigned
mean,
- That a with the computer and the comparison device (11) connected cost register (R1) is provided, in which the operating costs (K) are transferred immediately after the calculation, immediately after the Transmission of the comparison of the operating costs located in the cost registers (R1) of all the cabins is carried out and the resulting call allocation is final,
- that a door time table (14) is provided for each elevator, in which the door opening and closing times are stored, which are taken into account by the computer when calculating the standing time (t _h ) of the relevant car (2),
- That a time table (15) is provided in each elevator, in which the travel times between a particular floor and every other floor are stored separately according to the upward and downward direction of travel, which are included in the calculation of the service costs (K), and
- That a position register (R2) is provided for each elevator, in which the current cabin position is stored, which serves the computer as the basis for access to the time table (15). 2. Group control according to claim 1,
characterized by
that the service life (t _h ) of a cabin according to the relationship
t _h = t _on + t _off + _t
is calculated, where
t _on the door opening time,
t _off the door hold-open time, which consists of the number of people entering and exiting and a constant time factor per person, and
t _to the door-closing time
mean. 3. group control according to claim 2,
characterized by
that the time lost (Δt _s , Δt _z ) of a passenger in the cabin during a stop caused by a new call after the relationships
Δt _s = t _xs + t _hs + t _sy -t _xy and
Δt _z = t _xz + t _hz + t _zy -t _xy
is calculated, where
t _xy the travel time from one floor x to the input floor s of the new call,
t _hs the service life at the input floor s,
t _sy the travel time from the input floor s to a floor y,
t _xy the travel time from floor x to floor y without stopping at the input floor s,
t _xz the travel time from floor x to the destination floor z of the new call,
t _hz the service life on the target floor z, and
t _zy the travel time from the destination floor z to floor y
mean. 4. group control according to claim 3,
characterized by
that the loss of time (Δt _s , Δt _z ) when a stop coincides with a new and an allocated call for the relationships
Δt _s = t ′ _off and
Δt _z = t˝ _off
is calculated, where
t ′ _off the door hold-open time at the entry floor of the new call, which consists of the number of new entrants and a constant time factor and
t˝ _off the door hold-open time on the target floor of the new call, which consists of the number of new dropouts and the constant time factor
mean. 5. group control according to claim 1,
characterized by
that the call memory (RAM1) consists of a first and a there is a second memory (RAM1.1, RAM1.2), the calls characterizing the respective input storey being stored in the first memory (RAM1.1) and the calls characterizing the destination storeys being stored in the second memory (RAM1.2), and the first memory (RAM1.1) a first allocation memory (RAM2) and the second memory (RAM1.2) is assigned a second allocation memory (RAM3). 6. group control according to claim 5,
characterized by
- that a circuit (16) is provided which consists of a register (17) containing a maximum value (K _max ) of the service costs (K), first and second tri-state buffers (18, 19), a NOT element (20), there is a two-input OR gate (21) and a first and a second, three input AND gate (22, 23),
- That the first AND gate (22) is connected on the input side to the outputs of the memory cells of the first memory (RAM1.1u) and the first allocation memory (RAM2u) of the upward direction and to the cost register (R1),
- That the second AND gate (23) is connected on the input side to the memory cells of the first memory (RAM1.1d) and the first allocation memory (RAM2d) of the downward direction and the cost register (R1),
- That the outputs of the AND gates (22, 23) are connected to the inputs of the OR gate (21), the output of which is connected to the activation connections of the first tristate buffer (18) and via the NOT gate (20) Activation connections of the second tristate buffer (19) is connected, and
- that the register (17) is connected via the first tristate buffers (18) to the data inputs of the comparison device (11) which are connected to the cost register (R1) via the second tristate buffers (19),
- The circuit (16) for the respective floor is activated during the transfer of the operating costs (K) into the cost register (R1), so that in the presence of an already assigned opposite direction call the same input floor, the comparison device (11) instead of the one in the cost register (R1 ) stored operating costs (K) the maximum value (K _max ) contained in the register (17) is supplied and the call in question cannot be assigned to the elevator in question.

Images