EP0091554B1 - Gruppensteuerung für Aufzüge mit einer Einrichtung für die Steuerung des Abwärtsspitzenverkehrs - Google Patents

Gruppensteuerung für Aufzüge mit einer Einrichtung für die Steuerung des Abwärtsspitzenverkehrs Download PDF

Info

Publication number
EP0091554B1
EP0091554B1 EP83102061A EP83102061A EP0091554B1 EP 0091554 B1 EP0091554 B1 EP 0091554B1 EP 83102061 A EP83102061 A EP 83102061A EP 83102061 A EP83102061 A EP 83102061A EP 0091554 B1 EP0091554 B1 EP 0091554B1
Authority
EP
European Patent Office
Prior art keywords
call
group
boarding
calls
floor
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired
Application number
EP83102061A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP0091554A1 (de
Inventor
Joris Dr. Ing. Dipl. Schröder
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Inventio AG
Original Assignee
Inventio AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Inventio AG filed Critical Inventio AG
Priority to AT83102061T priority Critical patent/ATE22429T1/de
Publication of EP0091554A1 publication Critical patent/EP0091554A1/de
Application granted granted Critical
Publication of EP0091554B1 publication Critical patent/EP0091554B1/de
Expired legal-status Critical Current

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B66B1/02—Control systems without regulation, i.e. without retroactive action
    • B66B1/06—Control systems without regulation, i.e. without retroactive action electric
    • B66B1/14—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements
    • B66B1/18—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages
    • B66B1/20—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages and for varying the manner of operation to suit particular traffic conditions, e.g. "one-way rush-hour traffic"

Definitions

  • the invention relates to a group control for elevators with a device for controlling the downward peak traffic, by means of which the storey calls to be allocated to each car of the elevator group can be limited to a predetermined number in the downward direction.
  • Group controls with such facilities have the purpose of controlling the lifts of the group in such a way that there are short, balanced waiting times in the event of an extreme mass traffic flow towards the ground floor or another main stop, for example when the work is staggered in an office building or at the end of visiting hours in hospitals of passengers can be reached.
  • the device can be activated by means of a timer or by means of a measuring device which determines the flow of traffic in the direction of the main stop, and at the same time the operation of calls in the upward direction can be reduced or completely prevented.
  • the floors are divided into fixed zones in groups.
  • the elevator system goes into down peak operation when a certain number of down calls in more than one zone is exceeded or when a down car is fully occupied.
  • an allocation device compares the number of registered downward calls with the number of cabins used to settle the same. If the quotient of both numbers exceeds a certain size, an additional cabin is used in each case.
  • the known control now works in such a way that the first car, for example assigned to an upper zone with down calls, travels to the highest call of this zone, while the second car, also assigned to this zone, serves the highest down call of a lower section of the same zone.
  • the first car is assigned to the upper zone, this is switched off by the downward peak traffic, whereby if there are simultaneous down calls in a lower zone, the second car is assigned to the lower zone and serves the highest call of this zone, although the number of predetermined down calls in the upper zone is exceeded.
  • alternate, preferred operation of the zones is to be achieved and balanced waiting times are to be achieved.
  • the object on which the invention is based is to eliminate the difficulties in determining the optimum number of boarding stops per car in order to remedy the disadvantages described above and to allocate the corresponding number of floor calls in the downward direction to the cars in such a way that the average of the mean waiting time and the return time is average System time of a passenger in the collective operation, for example for the purpose of emptying a building, a minimum is reached and the conveying capacity of the elevator group is increased.
  • calculation bases are used, with the aid of which the number of boarding steps per car can be determined for which the average system time reaches minimum values.
  • the largest number of these boarding stops is stored in a control counter, by means of which the allocation of floor calls in the downward direction to those in the Control counter stored number per cabin is limited.
  • the floor calls are combined by means of a circuit to groups of calls entered one after the other in the amount of the number stored in the control counter, the call groups being assigned to the cabin that can serve the top call of a call group the fastest.
  • the call groups are formed in such a way that when the number of calls increases, the oldest call group is enlarged first, the youngest and the last one is increased by taking over a call from the next younger call group and the youngest call is assigned to the youngest call group, call groups being the same Extent are formed until the control counter reading is reached.
  • the advantages achieved with the invention are essentially to be seen in the fact that the proposed circuit for call group formation enables minimum average system times to be achieved, with the aid of the proposed calculation bases the most favorable number of boarding steps can be determined for achieving the minimum average system time of a passenger. From the basis of the calculation, it can also be concluded with advantage that a reduction in the waiting time by increasing the number of boarding stops would be inappropriate, since the system time would increase significantly.
  • a further advantage is achieved in that the call group size is adapted to the respective traffic conditions by determining the most frequently occurring boarding rate and thus the expected arrival load, making it possible to increase the conveying capacity of the elevator group with approximately the same minimum system time.
  • I 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, fifteen floors E1 to E15 being operated in accordance with the elevator system selected as an example.
  • the carrier is controlled by a drive control 5 known from European patent application No. 0026406, 5 being a microcomputer system by means of which the setpoint generation, the control functions and the initiation of the stop are implemented, and 6 symbolizing the measuring and actuating elements which are connected to the microcomputer system 5 via a first interface IF1.
  • the microcomputer systems 5 of the individual elevators a, b, c are connected to one another via a comparison device 7 and a second interface IF2 as well as via a party line transmission system 8 and a third interface IF3 and in this way form one known from European Patent Application No. 0032213 Group control. With this group control, the assignments of the elevators a, b, c to the floor calls stored in a floor call memory RAM1 can be optimized in terms of time.
  • the microprocessor CPU of the microprocessor system 5 during a scanning cycle of a first scanner R1 on each floor, whether there is a floor call or not, from the distance between the floor and the car position indicated by a selector R3, the intermediate stops to be expected within this distance and the current cabin load is calculated as a sum proportional to the time lost by waiting passengers.
  • 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 intermediate stops.
  • This total loss time also called operating costs, is stored in a cost memory RAM2.
  • a circuit arrangement 9 for the input of floor calls into the microcomputer system 5 consists of a peripheral unit 10, one Sampling and comparison device 11 and a DMA module DMA.
  • the peripheral unit 10 is connected on the input side during the downward peak traffic via a transmission device 12, described in more detail below with reference to FIG. 2, for the forwarding of the downstairs calls in the chronological order of their input to downstairs callers 13.
  • the peripheral unit 10 is also connected to the address bus AB and to a data input conductor CRUIN of a serial input and output bus CRU of the microcomputer system 5.
  • the scanning and comparison device 11 is connected to the address bus AB, the data input conductor CRUIN, the second interface 1F2 and the DMA module DMA, which in turn is connected to the serial input / output bus CRU, the address bus AB and the control bus StB of the microcomputer system 5 stands.
  • the circuit arrangement 9 operates in such a way that the microprocessor CPU of the microprocessor system 5 signals its readiness to accept interruptions by means of an enable signal.
  • the scanning and comparison device 11 and the DMA module DMA are activated by the release signal, whereupon the inputs of the peripheral unit 10 are scanned by addresses of a DMA address register DMA-R.
  • the switching state of the downstairs call transmitter 13 is compared with a switching state stored under the same address in the comparison device 11. In the event of inequality, an interruption request for the registration or deletion of a floor call is generated and the stored switching state is matched to that of the down floor call transmitter 13.
  • the circuit 14 consists of a waiting list RAM4 in the form of a read-write memory, in which the addresses of the downstairs calls are stored in the chronological order of the input, from a control counter which limits the number of calls of a call group or the number of boarding stops B of a car CC and from a priority counter PC, by means of which the priority of the elevators a, b, c is determined in relation to the cheapest operating costs determined in each case in a comparison.
  • a waiting list RAM4 in the form of a read-write memory, in which the addresses of the downstairs calls are stored in the chronological order of the input, from a control counter which limits the number of calls of a call group or the number of boarding stops B of a car CC and from a priority counter PC, by means of which the priority of the elevators a, b, c is determined in relation to the cheapest operating costs determined in each case in a comparison.
  • the circuit 14 also consists of a first data counter DC1 for addressing the memory locations of the waiting list RAM4, a second data counter DC2 for the transfer of the addresses stored in the waiting list RAM4 to the address bus AB and a buffer ZS for the transfer of the addresses of the DMA address register in the waiting list RAM4.
  • the memories RAM4, ZS and counters CC, PC, DC1, DC2 are connected to the microcomputer system 5 via the address bus AB, the control bus StB and a data bus DB, the counters CC, PC, DC1, DC2 e.g. Registers of the microprocessor CPU or the counter CC, PC can also be RAM memory chips.
  • a load measuring device 15 arranged in the cabin 4 is connected to the microcomputer system 5 via the interface IF1.
  • the load differences for each boarding level are calculated from the data determined by the load measuring device 15, and the average number of boarders per boarding level - also called boarding rate BR - is determined by forming the arithmetic mean from the sum of the load differences and the number of boarding levels B.
  • the most frequently occurring boarding rate BR is stored in a RAM memory location RAM5 of the circuit 14 in order to be used to determine the number of calls of a call group or boarding level B, as described in more detail below with reference to FIGS. 4 to 6.
  • the transmission device 12 for forwarding the downstairs calls in the chronological order of their input consists of shift registers 16, which, for example, each consist of twelve JK flip-flops and are assigned to the downstairs call transmitters 13.
  • the down floor call transmitters 13 are connected on the one hand to the inputs D of the shift register 16 and on the other hand to the positive pole of a voltage source.
  • Each JK flip-flop of the shift register 16 is assigned a NOR gate 17, an OR gate 18, a further OR gate 19 and, with the exception of the last JK flip-flops, an AND gate 20, the NOR -, OR and AND gates 17, 18, 20 each have two inputs and the further OR gate 19 has 16 inputs corresponding to the number of shift registers.
  • One input of the NOR gate 17 is connected to a conductor 21 carrying a clock signal 0 and the other input is connected to the output of the AND gate 20.
  • the output of the NOR gate 17 is connected via one input of the OR gate 18 to the clock terminals C of the JK flip-flops of the shift register 16, the other input of the OR gate 18 to an output of the DMA block DMA in Connection is established.
  • the outputs Q of the JK flip-flops of the shift register 16 are connected to the inputs of the further OR gates 19, the outputs of which are connected to an input of the AND gates 20, the other inputs of the AND gates 20 each having the outputs of the preceding AND gates 20 are connected.
  • the outputs Q of the last JK flip-flops of the shift register 16 are also connected to the set connections S of RS flip-flops 22, which are assigned to the crossing points of a matrix 23 of the peripheral unit 10 are.
  • the outputs Q of the RS flip-flops 22 are each connected to an input of an AND element 24 having two inputs, the other input of which is connected to a row conductor ZL and the output of which is connected to a column conductor SL of the matrix 23.
  • the row conductors ZL are activated via a row drive 25, the information from the RS flip-flop 22 being taken over by a gap receiver 26, the outputs of which are connected to the inputs of a multiplexer 27.
  • the transmission device 12 and the circuit 14 work as follows:
  • the output Q of the shift register 16 assigned to the floor E14 is first increased.
  • the clock signal 0 at this JK flip-flop is interrupted via the logic elements 17, 18, 19 assigned to the last JK flip-flop, so that its output Q remains at a high potential.
  • the clock signal 0 is also interrupted for this via the associated logic elements 17 to 20. In the same way, the next following information is blocked by floor E15 at output Q of the third-to-last JK flip-flop in question.
  • the waiting list RAM4 of the circuit 14 is now filled in such a way that, after the oldest call from the floor E14 has been registered, the start address A1 stored in a read-only memory EPROM of the microcomputer system 5 is loaded into the first data counter DC1 while continuing the interrupt program. Then the address of the oldest call, which may be the same as floor number E14 for the purpose of simplifying the description, is taken over by the DMA register DMA-R into the intermediate memory ZS and written into the memory space of the waiting list RAM4 designated by the data counter DC1 (FIG. 1). The data counter DC1 is then incremented so that it displays the address A2. In the case of the elevator group on which the description example is based, with three elevators a, b, c, the interrupt program is completed when the data counter DC1 ⁇ A3, so that the interrupted program can be continued.
  • elevator a may be the cheapest, so that an allocation instruction is written into its allocation memory RAM3 at address E13 and its priority counter PC is set to second priority (FIG. 1 ).
  • the most recent call from the floor E15 is thus assigned to the elevator c, an allocation instruction being written into the associated allocation memory RAM3 at the address E15 and the priority counter PC being set to third priority.
  • the elevator b identified by its priority counter PC which indicates the first priority and to which the oldest call has already been allocated, is also assigned the second oldest call from the floor E13. This is done in such a way that the floor address E13 stored under the address A2 in the waiting list RAM4 is brought to the address bus AB via the second data counter DC2 and an allocation instruction in the form of a 1-bit data word "1" in the allocation location RAM3 1 "is registered (time I).
  • the assignment instruction for the second oldest call is deleted and one for the third oldest call is registered from floor E15 (time I).
  • the assignment instruction for the third oldest call is deleted and an assignment instruction for the fourth call is written in from the floor E10 (time I).
  • call groups can be formed according to the selected example, which, for elevator a, from the allocation instructions for the calls of floors E10, E8, E12, for elevator b from the allocation instructions for the calls of floors E14, E13, E15 and for elevator c consist of the assignment instructions for the calls to floors E9, E11, E7 (time VI).
  • the cabin serves the highest call of the group first. This is achieved by counting the coincidences of the leading selector position and the floor calls that do not match in the direction and comparing the sum with the control counter reading, the highest floor of the group being found if the number of coincidences is identical with the control counter reading.
  • the call groups now consist of the assignment instructions for calls from floors E15, E10, E8 for elevator a, the assignment instructions for calls to floors E14, E13 for elevator b and the assignment instructions for calls for floors E12, E9 for elevator c , E11.
  • the calls stored in the transmission device 12 can be released for input into the microcomputer system 5 and the waiting list RAM4 can be refilled.
  • the average waiting time W of a passenger to get into the cabin, the return time T to the ground floor and the average system time D that the passenger spends in the elevator system until they get out are plotted in seconds.
  • the relationship between these times and the boarding levels B is shown by means of the characteristic curves W, T and D and by the equations given, the letters have the same meaning as for the delivery rate HC according to the first equation G1.1.
  • the factor F / B is a frequency number which, for a selected number B of boarding steps, indicates how many round trips are necessary to cover all floors F to operate via ground floor.
  • BR is used to denote lines of the same rate of boarding in the performance characteristic field, the rate of boarding being understood to mean the average number of people boarding at a boarding rate.
  • the number of B boardings at which the average system time D reaches a minimum is determined by the formation of the differential quotient and its equation with zero is determined as follows:
  • boarding levels B of the cabins of the elevator group are plotted on the horizontal axis and the car round trip time RTT and the average waiting time W of a passenger until entering the cabin are plotted in seconds on the vertical axis.
  • BR denotes straight lines of the same boarding rate, with the boarding rate, as in the case of the conveying capacity characteristics according to FIG. 4, to be understood as the number of people boarding at a boarding rate.
  • the relationship between the average waiting time W and the boarding hold B is given for twelve dropouts by the third equation Eq. 3 and represented by the characteristic curve W 12 .
  • the boarding levels B of the cabins are again plotted on the horizontal axis, while the vertical axis is assigned to the system time D in seconds.
  • D 13 denotes the system time characteristic for thirteen dropouts according to the fifth equation Eq. 5.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)
  • Indicating And Signalling Devices For Elevators (AREA)
  • Devices For Checking Fares Or Tickets At Control Points (AREA)
  • Compositions Of Oxide Ceramics (AREA)
  • Diaphragms For Electromechanical Transducers (AREA)
  • Lift-Guide Devices, And Elevator Ropes And Cables (AREA)
EP83102061A 1982-04-08 1983-03-03 Gruppensteuerung für Aufzüge mit einer Einrichtung für die Steuerung des Abwärtsspitzenverkehrs Expired EP0091554B1 (de)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AT83102061T ATE22429T1 (de) 1982-04-08 1983-03-03 Gruppensteuerung fuer aufzuege mit einer einrichtung fuer die steuerung des abwaertsspitzenverkehrs.

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CH2187/82 1982-04-08
CH2187/82A CH658852A5 (de) 1982-04-08 1982-04-08 Gruppensteuerung fuer aufzuege mit einer einrichtung fuer die steuerung des abwaertsspitzenverkehrs.

Publications (2)

Publication Number Publication Date
EP0091554A1 EP0091554A1 (de) 1983-10-19
EP0091554B1 true EP0091554B1 (de) 1986-09-24

Family

ID=4227924

Family Applications (1)

Application Number Title Priority Date Filing Date
EP83102061A Expired EP0091554B1 (de) 1982-04-08 1983-03-03 Gruppensteuerung für Aufzüge mit einer Einrichtung für die Steuerung des Abwärtsspitzenverkehrs

Country Status (14)

Country Link
US (1) US4492288A (enrdf_load_stackoverflow)
EP (1) EP0091554B1 (enrdf_load_stackoverflow)
JP (1) JPS5917471A (enrdf_load_stackoverflow)
AT (1) ATE22429T1 (enrdf_load_stackoverflow)
BR (1) BR8301748A (enrdf_load_stackoverflow)
CA (1) CA1189990A (enrdf_load_stackoverflow)
CH (1) CH658852A5 (enrdf_load_stackoverflow)
DE (1) DE3366366D1 (enrdf_load_stackoverflow)
EG (1) EG15582A (enrdf_load_stackoverflow)
ES (1) ES521345A0 (enrdf_load_stackoverflow)
FI (1) FI72492C (enrdf_load_stackoverflow)
HK (1) HK20488A (enrdf_load_stackoverflow)
HU (1) HU191080B (enrdf_load_stackoverflow)
MX (1) MX154455A (enrdf_load_stackoverflow)

Families Citing this family (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
ES2014264B3 (es) * 1986-04-11 1990-07-01 Inventio Ag Grupos de mando para ascensores
ATE84495T1 (de) * 1987-09-24 1993-01-15 Inventio Ag Gruppensteuerung fuer aufzuege mit sofortzuteilung von zielrufen.
US4793443A (en) * 1988-03-16 1988-12-27 Westinghouse Electric Corp. Dynamic assignment switching in the dispatching of elevator cars
US4782921A (en) * 1988-03-16 1988-11-08 Westinghouse Electric Corp. Coincident call optimization in an elevator dispatching system
US4784240A (en) * 1988-03-16 1988-11-15 Westinghouse Electric Corp. Method for using door cycle time in dispatching elevator cars
US4790412A (en) * 1988-03-16 1988-12-13 Westinghouse Electric Corp. Anti-bunching method for dispatching elevator cars
GB2251093B (en) * 1990-10-01 1994-11-16 Toshiba Kk Apparatus for elevator group control
US5480006A (en) * 1993-07-16 1996-01-02 Otis Elevator Company Elevator downpeak sectoring
US5767460A (en) * 1995-11-30 1998-06-16 Otis Elevator Company Elevator controller having an adaptive constraint generator
US5714725A (en) * 1995-11-30 1998-02-03 Otis Elevator Company Closed loop adaptive fuzzy logic controller for elevator dispatching
US5750946A (en) * 1995-11-30 1998-05-12 Otis Elevator Company Estimation of lobby traffic and traffic rate using fuzzy logic to control elevator dispatching for single source traffic
US5841084A (en) * 1995-11-30 1998-11-24 Otis Elevator Company Open loop adaptive fuzzy logic controller for elevator dispatching
US5808247A (en) * 1995-11-30 1998-09-15 Otis Elevator Company Schedule windows for an elevator dispatcher
US5786551A (en) * 1995-11-30 1998-07-28 Otis Elevator Company Closed loop fuzzy logic controller for elevator dispatching
US5767462A (en) * 1995-11-30 1998-06-16 Otis Elevator Company Open loop fuzzy logic controller for elevator dispatching
US5786550A (en) * 1995-11-30 1998-07-28 Otis Elevator Company Dynamic scheduling elevator dispatcher for single source traffic conditions
US5883343A (en) * 1996-12-04 1999-03-16 Inventio Ag Downpeak group optimization
US6644442B1 (en) * 2001-03-05 2003-11-11 Kone Corporation Method for immediate allocation of landing calls
DE502004010757D1 (de) * 2003-06-27 2010-04-01 Inventio Ag Verfahren zur Steuerung einer im Zonenbetrieb betriebenen Aufzugsgruppe
WO2009024853A1 (en) 2007-08-21 2009-02-26 De Groot Pieter J Intelligent destination elevator control system
WO2009029697A1 (en) * 2007-08-28 2009-03-05 Thyssenkrupp Elevator Capital Corporation Method and apparatus to reduce waiting times for destination based dispatching systems
US8950555B2 (en) * 2011-04-21 2015-02-10 Mitsubishi Electric Research Laboratories, Inc. Method for scheduling cars in elevator systems to minimize round-trip times
GB2509025B (en) 2011-09-08 2017-02-08 Otis Elevator Co Elevator system with dynamic traffic profile solutions
US11027943B2 (en) 2018-03-29 2021-06-08 Otis Elevator Company Destination dispatch sectoring
US12116240B2 (en) 2018-08-09 2024-10-15 Otis Elevator Company Destination calls across multiple elevator groups
JP7171773B2 (ja) * 2021-01-04 2022-11-15 東芝エレベータ株式会社 エレベータ制御装置、エレベータ制御システム、方法及びプログラム

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US2104478A (en) * 1934-12-01 1938-01-04 Westinghouse Elec Elevator Co Elevator control system
CH625767A5 (enrdf_load_stackoverflow) * 1978-01-17 1981-10-15 Inventio Ag
US3315765A (en) * 1959-01-20 1967-04-25 Toledo Scale Corp Program computer for elevator system
US3073417A (en) * 1959-12-23 1963-01-15 Otis Elevator Co Elevator dispatching and control system
US3645361A (en) * 1970-05-05 1972-02-29 White & Co Inc K M Elevator control system with priority dispatching capability
JPS5197155A (en) * 1975-02-21 1976-08-26 Erebeetano jokyakudeetashushusochi
US4063620A (en) * 1976-07-09 1977-12-20 Westinghouse Electric Corporation Elevator system
US4129199A (en) * 1977-04-29 1978-12-12 Westinghouse Electric Corp. Elevator system
CH632723A5 (de) * 1978-08-22 1982-10-29 Inventio Ag Einrichtung zur auswahl einer aufzugskabine fuer direktfahrten bei einer mittels gruppensteuerung gesteuerten aufzugsgruppe.
CH648001A5 (de) * 1979-12-21 1985-02-28 Inventio Ag Gruppensteuerung fuer aufzuege.

Also Published As

Publication number Publication date
FI72492B (fi) 1987-02-27
ATE22429T1 (de) 1986-10-15
ES8403416A1 (es) 1984-03-16
FI72492C (fi) 1987-06-08
EG15582A (en) 1987-10-30
FI831079L (fi) 1983-10-09
JPH0124711B2 (enrdf_load_stackoverflow) 1989-05-12
MX154455A (es) 1987-08-26
ES521345A0 (es) 1984-03-16
DE3366366D1 (en) 1986-10-30
CH658852A5 (de) 1986-12-15
US4492288A (en) 1985-01-08
JPS5917471A (ja) 1984-01-28
BR8301748A (pt) 1983-12-13
HK20488A (en) 1988-03-25
HU191080B (en) 1987-01-28
CA1189990A (en) 1985-07-02
FI831079A0 (fi) 1983-03-30
EP0091554A1 (de) 1983-10-19

Similar Documents

Publication Publication Date Title
EP0091554B1 (de) Gruppensteuerung für Aufzüge mit einer Einrichtung für die Steuerung des Abwärtsspitzenverkehrs
EP0246395B1 (de) Gruppensteuerung für Aufzüge
EP0443188B1 (de) Verfahren und Einrichtung zur sofortigen Zielrufzuteilung bei Aufzugsgrupppen, aufgrund von Bedienungskosten und von variablen Bonus-/Malus-Faktoren
EP1418147B1 (de) Steuerungsvorrichtung für eine Aufzugsanlage mit Mehrfachkabine
DE3820568C2 (enrdf_load_stackoverflow)
EP0312730B1 (de) Gruppensteuerung für Aufzüge mit lastabhängiger Steuerung der Kabinen
EP0301178B1 (de) Steuereinrichtung für eine Aufzugsanlage
EP0365782B1 (de) Verfahren und Einrichtung zur Gruppensteuerung von Aufzügen mit Doppelkabinen
DE69802876T2 (de) Passagier-reisezeit optimierendes steuerverfahren für aufzugsgruppen aus doppeldeck-aufzügen
EP1565396B1 (de) Verfahren zur steuerung einer aufzuganlage sowie aufzuganlage zur durchführung des verfahrens
EP0199015B1 (de) Einrichtung zur lastabhängigen Steuerung eines Aufzuges
EP0440967B1 (de) Gruppensteuerung für Aufzüge mit vom Rufeingabeort auf einem Stockwerk abhängiger Sofortzuteilung von Zielrufen
DE3611173C2 (de) Fahrstuhlanlage mit mehreren Doppelabteil-Kabinen
EP3099616B1 (de) Verfahren zum betreiben eines aufzugsystems
EP0459169B1 (de) Gruppensteuerung für Aufzüge mit Doppelkabinen mit Sofortzuteilung von Zielrufen
EP0301173B1 (de) Gruppensteuerung für Aufzüge
EP2370335A1 (de) Aufzugssteuerung einer aufzugsanlage
EP0356731A1 (de) Gruppensteuerung mit Sofortzuteilung von Zielrufen
EP0248997B1 (de) Einrichtung für die Steuerung des Verteilverkehrs in einer Haupthaltestelle bei Aufzugsgruppen
DE69208427T2 (de) Aufzugssystem mit dynamischer Sektorzuteilung
EP0134892B1 (de) Gruppensteuerung für Aufzüge mit Doppelkabinen
DE69517366T2 (de) Wartezeitanzeige für einen Aufzug
EP0378834B1 (de) Gruppensteuerung für Aufzüge mit Sofortzuteilung von Zielrufen
EP0624540A1 (de) Aufzugsanlage für Zonenbetrieb
EP0308590B1 (de) Gruppensteuerung für Aufzüge mit Sofortzuteilung von Zielrufen

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Designated state(s): AT BE DE FR GB IT NL

17P Request for examination filed

Effective date: 19840221

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE DE FR GB IT NL

REF Corresponds to:

Ref document number: 22429

Country of ref document: AT

Date of ref document: 19861015

Kind code of ref document: T

REF Corresponds to:

Ref document number: 3366366

Country of ref document: DE

Date of ref document: 19861030

ET Fr: translation filed
ITF It: translation for a ep patent filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
ITTA It: last paid annual fee
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: AT

Payment date: 20010226

Year of fee payment: 19

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: BE

Payment date: 20010309

Year of fee payment: 19

REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20020222

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20020228

Year of fee payment: 20

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20020303

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20020309

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20020315

Year of fee payment: 20

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20020331

BERE Be: lapsed

Owner name: *INVENTIO A.G.

Effective date: 20020331

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20030302

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20030303

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Effective date: 20030302

NLV7 Nl: ceased due to reaching the maximum lifetime of a patent