EP0301173B1 - Commande d'un groupe d'ascenceurs - Google Patents

Commande d'un groupe d'ascenceurs Download PDF

Info

Publication number
EP0301173B1
EP0301173B1 EP88106273A EP88106273A EP0301173B1 EP 0301173 B1 EP0301173 B1 EP 0301173B1 EP 88106273 A EP88106273 A EP 88106273A EP 88106273 A EP88106273 A EP 88106273A EP 0301173 B1 EP0301173 B1 EP 0301173B1
Authority
EP
European Patent Office
Prior art keywords
calls
load
call
stored
storey
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 - Lifetime
Application number
EP88106273A
Other languages
German (de)
English (en)
Other versions
EP0301173A1 (fr
Inventor
Joris Dr. 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 AT88106273T priority Critical patent/ATE66895T1/de
Publication of EP0301173A1 publication Critical patent/EP0301173A1/fr
Application granted granted Critical
Publication of EP0301173B1 publication Critical patent/EP0301173B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime 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/24—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration
    • B66B1/2408—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration where the allocation of a call to an elevator car is of importance, i.e. by means of a supervisory or group controller
    • B66B1/2458—For elevator systems with multiple shafts and a single car per shaft
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/10—Details with respect to the type of call input
    • B66B2201/103—Destination call input before entering the elevator car
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/211—Waiting time, i.e. response time
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/222—Taking into account the number of passengers present in the elevator car to be allocated
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/231—Sequential evaluation of plurality of criteria
    • B66B2201/232—Sequential evaluation of plurality of criteria where the time needed for a passenger to arrive at the allocated elevator car from where the call is made is taken into account

Definitions

  • the invention relates to a group control for elevators, with call registration devices arranged on the floors in the form of 10-keyboards, by means of which calls for desired target floors can be entered, with the storeys and cabin call memories assigned to the elevators, which are connected to the call registration devices, whereby When entering calls on a floor, a call that characterizes the input floor is stored in the floor call memory and the calls that characterize the target floors are stored in the cabin call memory, and with load measuring devices provided in the cabins of the elevator group, with each elevator assigned to the group, the floor of a possible one Suspending selectors, with each elevator assigned to the group, for each floor having at least one position and first and second scanners and with a device by means of which the entered calls the cabins of the Auf train group can be allocated immediately after registration, according to the preamble of claim 1.
  • 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 calculator calculates during a scanning cycle of a first scanner of a scanning device on 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, the time lost by waiting passengers on the floors and in the cabin proportional sum.
  • 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.
  • 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 factors on which the calculation of the service costs are based are only likely numbers of boarding and alighting passengers, which also have different values for each elevator in the group, the allocation procedure can lead to inaccurate results. Since, moreover, the sum proportional to the time lost by the passengers in the cabin, also called internal operating costs, is used in this control to determine a future one Overload is used, so that the allocation of a call to the relevant cabin can be prevented in good time, wrong decisions can also be made here due to the factors used in the calculation of the internal service costs.
  • a load table is provided for each elevator, in which load values corresponding to the loads in the cabin are stored and which is connected to the computer and the cabin call memory.
  • the load values on the input floor are increased in proportion to the number of calls entered and on the destination floors are reduced in proportion to the number of calls for the respective destination floor.
  • the load values stored in the load table are taken into account when calculating the operating costs, a monitoring circuit being provided by means of which the assignment of a call causing the overload to the relevant cabin is prevented in the event of an overload.
  • the advantages achieved by the invention are that the loads caused by future boarding and alighting are recorded more precisely using the proposed load table, the three-column design of the load table making it possible to record all future loads caused by boarding and alighting in any position and Direction to the cabin.
  • more precise allocation decisions can be made, particularly in the case of elevators with immediate assignment of calls, and thus the average waiting times of all passengers can be further reduced.
  • Another advantage can be seen in the fact that incorrect allocations and the resulting useless stops can be avoided more reliably by the more accurate detection of future overloads.
  • 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 thirteen floors E0 to E12 are served.
  • the carrier 2 is controlled by a drive control known from EP-B-0 026 406, the setpoint generation, the control functions and the start 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 parameters a sum corresponding to the average waiting time of all passengers, also referred to as operating costs, which corresponds to the call allocation process is the basis.
  • the cabin 2 has a load measuring device 7, which is also connected to the microcomputer system 5.
  • Call registering devices 8 in the form of 10-keyboards are provided on the floors, 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 in this way a group control which structurally corresponds to a group control described in EP-A-0 246 395.
  • 13 denotes a load table and 14 denotes a monitoring circuit, which are connected to one another and to the microcomputer system 5 and are explained in more detail below with reference to FIGS. 2 and 3.
  • the load table 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 memory locations of the load table 13 in the form of a number of people who turn up when they depart or drive past one floor in cabin 2. For a more detailed explanation, it is assumed in FIG.
  • the monitoring circuit 14 consists of a comparator 15, a first register 16 containing a load limit value L max , a second register 17 containing a maximum value of the operating costs K max , first and second tristate buffers 18, 19 and a NOT element 20
  • the comparator 15 is connected on the input side to the load table 13 and the first register 16. On the output side, the comparator 15 is connected to the activation connections of the first tristate buffers 18 and via the NOT element 20 to the activation connections of the second tristate buffers 19.
  • the second register 17 is connected via the first tristate buffers 18 to the data inputs of the comparison device 11, which are connected to the data bus DB of the microcomputer system 5 via the second tristate buffers 19.
  • the monitoring circuit 14 that can be implemented, for example, by means of the microprocessor of the microcomputer system 5 is activated at every position of a scanner scanning the load table.
  • the microcomputer system 5 has a floor call memory RAM1, a car call memory RAM2, a cost memory RAM4, an allocation memory RAM5, a first and a second scanner R1 and R2 and a selector R3.
  • the car call memory RAM2 consists of a first memory RAM2 ', which has the number of floors corresponding memory locations, in which already assigned calls are stored.
  • the car call memory RAM2 also has further memories RAM2.0, RAM2.1 Vietnamese RAM2.12 assigned to the floors E0, E1 ....
  • the group control described above works as follows: When entering calls, the load tables 13 of all elevators are initially created. This is done in such a way that after the calls have been transferred to the storey call memory RAM1 and other memories RAM2.0, RAM2.1 .... RAM2.12 from the number of calls entered on a floor (entry level) and the number of these Calls (dropouts) that designate the floor as the destination and are stored as a load value in the load tables 13.
  • upward calls for floors E3 and E6 to E12 may have been entered on floors E1, E3, E4 and E5, the car being located on floor E0 according to the position of selector R3.
  • the first column S1 of the load table 13 will therefore have the load values shown in FIG. 3 due to the selected number of people entering and exiting. For example, the load value "11" results from four beginners on floors E1, E3, E4 and one dropout on floor E3 for floor E4.
  • the service cost calculation takes place, which, as described in EP-A-0 246 395, is triggered when a call is input and is carried out on each floor designated by the scanner R1 (FIG. 3).
  • the formula used here which is known from the above-mentioned publication, is modified in such a way that instead of the cabin load based on probable future entrants and exits, the load value stored in the load table 13 and the calls entered on the relevant floor are used instead of the probable future entrants .
  • the operating costs calculated in this way are stored in the cost memory RAM4 (FIG. 3).
  • a cost comparison cycle is carried out after the end of a cost calculation cycle.
  • the operating costs of the floors designated by the second scanner R2 stored in the cost memories RAM4 of all elevators are compared with one another and the relevant call is allocated to the cabin 2 which has the lowest operating costs, the initial assignment of a call being final.
  • the load table 13 is created, it is concluded from the entered calls that the future boarding and alighting passengers and the resulting loads in the cabin 2. 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.
  • the load table 13 is connected via the microcomputer system 5 to the load measuring device 7 of the cabin 2 (FIG. 1). In the first case, as many of the same destination calls are deleted on the relevant floor as the difference between the stored load value and the actual 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.
  • 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.

Claims (5)

  1. Commande de groupe d'ascenceurs, comportant des dispositifs d'enregistrement d'appels (8) disposés aux étages et se présentant sous la forme de claviers décadiques, à l'aide desquels des appels peuvent être introduits pour des étages de destination désirés, ladite commande comprenant également des mémoires (RAM1,RAM2) d'appels d'étages et d'appels de cabines, associées aux ascenseurs du groupe et reliées aux dispositifs d'enregistrement d'appels (8), étant précisé que lors de l'introduction d'appels au niveau d'un étage, un appel caractérisant l'étage d'entrée est mémorisé dans la mémoire d'appels d'étages (RAM1) et les appels caractérisant les étages de destination sont mémorisés dans la mémoire d'appels de cabines (RAM2), ainsi que des dispositifs de mesure de charge (7) prévus dans les cabines (2) du groupe d'ascenseurs, des sélecteurs (R3) associés à chaque ascenseur du groupe et indiquant respectivement l'étage d'un arrêt possible, des premiers et seconds organes d'exploration (R1,R2) associés à chaque ascenseur du groupe et comportant au moins une position pour chaque étage, et un dispositif à l'aide duquel les appels introduits sont affectés aux cabines (2) du groupe d'ascenseurs, directement après l'enregistrement, le dispositif comportant, pour chaque ascenseur, un ordinateur et un dispositif comparateur (11), l'ordinateur calculant, pour chaque étage désigné par le premier organe d'exploration (R1), et à partir au moins de la distance entre cet étage et un étage indiqué par le sélecteur (R3), des arrêts intermédiaires auxquels il faut s'attendre sur cette distance et de la charge présente dans la cabine (2), les coûts de desserte correspondant aux temps d'attente des passagers, tandis que les coûts de desserte de toutes les cabines sont comparés entre eux pour chaque position du second organe d'exploration (R2), à l'aide du dispositif comparateur (11), et que l'appel considéré est affecté à la cabine (2), qui présente les plus faibles coûts de desserte ;
    caractérisée par le fait :
    - qu'il est prévu un tableau des charges (13) dans lequel sont mémorisées des valeurs de charges correspondant aux charges dans la cabine (2), et qui est relié à l'ordinateur et à la mémoire d'appels de cabines (RAM2),
    - auquel cas, lors de l'introduction d'appels et de leur mémorisation dans la mémoire d'appels de cabines (RAM2), les valeurs de charges sont augmentées, au niveau de l'étage d'entrée, proportionnellement au nombre des appels introduits et, sont réduites, au niveau des étages de destination, proportionnellement au nombre des appels pour l'étage de destination considéré,
    - que les valeurs de charges mémorisées dans le tableau des charges (13) sont prises en compte lors du calcul des coûts de desserte ; et
    - qu'il est prévu un circuit de contrôle (14), qui est relié au tableau des charges (13), auquel cas lors de la présence d'une valeur de charge dépassant une valeur de charge limite, l'affectation de l'appel provoqué par la surcharge à la cabine concernée est empêchée.
  2. Commande de groupe selon la revendication 1, caractérisée par le fait que le tableau des charges (13) est constitué par une mémoire d'enregistrement-lecture sous la forme d'une matrice, qui possède exactement autant de lignes qu'il y a d'étages et trois colonnes (S1,S2,S3), le première colonne (S1) étant associée aux appels de même sens, qui se situent en avant de la cabine (2) selon la direction de déplacement, tandis que la seconde colonne (52) est associée aux appels dirigés en sens inverse et que la troisième colonne (53) est associée aux appels de même sens, qui apparaissent en arrière de la cabine (2) selon la direction de déplacement.
  3. Commande de groupe selon la revendication 1, caractérisée par le fait que les valeurs de charges, mémorisées dans le tableau des charges (13), sont exprimées par un nombre de personnes.
  4. Commande de groupe selon la revendication 1, dans lequel l'ordinateur fait partie d'un système à micro-ordinateur (5), qui possède une mémoire de coûts (RAM4) dans laquelle sont mémorisés les coûts de desserte calculés ;
    caractérisée par le fait :
    - que le circuit de contrôle (14) est formé par un comparateur (15), un premier registre (16) contenant la' valeur limite de charge (Lmax), un second registre (17) contenant une valeur maximale des coûts de desserte (Kmax), des premier et second tampons trois-états (18,19) et un circuit NON (20),
    - que le comparateur (15) est raccordé, côté entrée, au tableau des charges (13) et au premier registre (16) et, côté sortie, à des bornes d'activation du premier tampon trois-états (18) et, par l'intermédiaire du circuit NON (20), aux bornes d'activation du second tampon trois-états (19) ; et
    - que le second registre (17) est relié, par l'intermédiaire du premier tampon trois-états (18) à des entrées de données du dispositif comparateur (11), qui sont raccordées, par l'intermédiaire du second tampon trois-états (19), à un bus (DB) de transmission de données du système à micro-ordinateur (5),
    - auquel cas, pour chaque position du second organe d'exploration (R2), le circuit de contrôle (14) est activé et dans le cas d'une surcharge à un étage, la valeur maximale des coûts de desserte (Kmax), contenue dans le second registre (17), est transmise, à la place des coûts de desserte mémorisés dans la mémoire de coûts (RAM4), au dispositif comparateur (11).
  5. Commande de groupe selon la rev dication 1, caractérisée par le fait que le tableau des charges (13) est relié au dispositif de mesure de charge (7) de la cabine (2), auquel cas, lors de l'apparition de différences entre les valeurs de charges mémorisées et les charges mesurées, les valeurs mémorisées des charges sont adaptées aux charges mesurées et, lors de l'apparition de différences positives, un nombre correspondant d'appels adressés aux mêmes étages de destination est effacé.
EP88106273A 1987-07-28 1988-04-20 Commande d'un groupe d'ascenceurs Expired - Lifetime EP0301173B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AT88106273T ATE66895T1 (de) 1987-07-28 1988-04-20 Gruppensteuerung fuer aufzuege.

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CH2873/87 1987-07-28
CH287387 1987-07-28

Publications (2)

Publication Number Publication Date
EP0301173A1 EP0301173A1 (fr) 1989-02-01
EP0301173B1 true EP0301173B1 (fr) 1991-09-04

Family

ID=4243493

Family Applications (1)

Application Number Title Priority Date Filing Date
EP88106273A Expired - Lifetime EP0301173B1 (fr) 1987-07-28 1988-04-20 Commande d'un groupe d'ascenceurs

Country Status (7)

Country Link
US (1) US4939634A (fr)
EP (1) EP0301173B1 (fr)
JP (1) JP2632377B2 (fr)
AT (1) ATE66895T1 (fr)
CA (1) CA1288181C (fr)
DE (1) DE3864625D1 (fr)
ES (1) ES2026595T3 (fr)

Families Citing this family (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA1315900C (fr) * 1988-09-01 1993-04-06 Paul Friedli Systeme centralise de commande d'ascenseurs avec attribution immediate de cabines-cibles
EP0419802B1 (fr) * 1989-09-27 1994-03-09 Inventio Ag Méthode de traîtement des appels de destination faits en cabine d'ascenseur
JPH04246077A (ja) * 1990-09-11 1992-09-02 Otis Elevator Co エレベータ制御装置における階床人口検出装置
US5694323A (en) * 1995-04-04 1997-12-02 Persyst, Inc. Monitoring system with particular application to monitoring a cash-basis operation
US5808247A (en) * 1995-11-30 1998-09-15 Otis Elevator Company Schedule windows for an elevator dispatcher
US5841084A (en) * 1995-11-30 1998-11-24 Otis Elevator Company Open loop adaptive fuzzy logic controller for elevator dispatching
US5714725A (en) * 1995-11-30 1998-02-03 Otis Elevator Company Closed loop adaptive fuzzy logic controller for elevator dispatching
US5767460A (en) * 1995-11-30 1998-06-16 Otis Elevator Company Elevator controller having an adaptive constraint generator
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
US5786550A (en) * 1995-11-30 1998-07-28 Otis Elevator Company Dynamic scheduling elevator dispatcher for single source traffic conditions
US5767462A (en) * 1995-11-30 1998-06-16 Otis Elevator Company Open loop fuzzy logic controller for elevator dispatching
US5786551A (en) * 1995-11-30 1998-07-28 Otis Elevator Company Closed loop fuzzy logic controller for elevator dispatching
JPH09315708A (ja) * 1996-05-29 1997-12-09 Otis Elevator Co 群管理エレベーター
EP1270486B1 (fr) * 2001-06-29 2018-01-03 Inventio AG Méthode pour sélectionner le parcours optimal, changements de cabines inclus, parmis plusieurs groupes d'ascenseurs
US6655501B2 (en) 2001-06-29 2003-12-02 Inventio Ag Method for selection of the most favorable elevator of an elevator installation comprising at least two elevator groups
FI20011898A0 (fi) * 2001-09-27 2001-09-27 Kone Corp Hissikorin täyttösuhteen huomioiva hissi
JP4960585B2 (ja) 2003-10-10 2012-06-27 インベンテイオ・アクテイエンゲゼルシヤフト エレベータ装置の制御方法およびエレベータ装置
AU2006275280B2 (en) * 2005-08-04 2012-01-19 Inventio Ag Method for assigning a user to an elevator system
US8151943B2 (en) 2007-08-21 2012-04-10 De Groot Pieter J Method of controlling intelligent destination elevators with selected operation modes
JP5218556B2 (ja) 2008-05-21 2013-06-26 三菱電機株式会社 エレベータ群管理システム
WO2011106010A1 (fr) * 2010-02-26 2011-09-01 Otis Elevator Company Sélection de meilleur groupe dans un système de répartition d'ascenseurs comprenant des informations de score de groupe
JP5495871B2 (ja) 2010-03-15 2014-05-21 東芝エレベータ株式会社 エレベータの制御装置
CN104640799B (zh) * 2012-09-11 2017-05-03 通力股份公司 电梯系统
CN109250593B (zh) * 2018-11-05 2021-01-05 上海木木聚枞机器人科技有限公司 一种多机器人与多电梯的调度方法及系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5740066B2 (fr) * 1974-10-11 1982-08-25
CH648001A5 (de) * 1979-12-21 1985-02-28 Inventio Ag Gruppensteuerung fuer aufzuege.
US4662479A (en) * 1985-01-22 1987-05-05 Mitsubishi Denki Kabushiki Kaisha Operating apparatus for elevator
ATE51386T1 (de) * 1986-04-11 1990-04-15 Inventio Ag Gruppensteuerung fuer aufzuege.

Also Published As

Publication number Publication date
US4939634A (en) 1990-07-03
ES2026595T3 (es) 1992-05-01
JPS6443475A (en) 1989-02-15
DE3864625D1 (de) 1991-10-10
ATE66895T1 (de) 1991-09-15
CA1288181C (fr) 1991-08-27
JP2632377B2 (ja) 1997-07-23
EP0301173A1 (fr) 1989-02-01

Similar Documents

Publication Publication Date Title
EP0301173B1 (fr) Commande d'un groupe d'ascenceurs
EP0356731B1 (fr) Commande groupée avec attribution immédiate des appels
EP0312730B1 (fr) Commande de groupe pour ascenceurs avec commande des cabines dépendant de leur charge
EP0445419B1 (fr) Arrangement pour sélectionner une cabine d'ascenseur pour personnes handicapées dans des systèmes d'ascenseurs avec distribution directe d'appels
EP0440967B1 (fr) Commande de groupes pour ascenseurs avec distribution directe d'appels d'une entrée d'appels située sur l'étage
EP0246395B1 (fr) Commande d'un groupe d'ascenceur
EP0320583B1 (fr) Clavier de destination et dispositif d'affichage à l'étage pour ascenseurs
EP1418147B1 (fr) Contrôleur pour ascenseur avec cabine avec plusieurs compartiments
EP0301178B1 (fr) Système de commande d'ascenseur
EP0443188B1 (fr) Méthode et dispositif de distribution directe d'appels de groupes d'ascenseurs, basés sur des charges de service et sur des facteurs bonus/malus variables
EP0091554B1 (fr) Commande d'un groupe d'ascenseurs comportant un dispositif pour la commande d'une pointe de trafic descendante
DE112009002258B4 (de) Fahrstuhlgruppen-Verwaltungssystem
EP0459169B1 (fr) Commande de groupes pour ascenseurs avec deux cabines superposées avec distribution directe d'appels
DE3820568C2 (fr)
DE3611173C2 (de) Fahrstuhlanlage mit mehreren Doppelabteil-Kabinen
EP0378834B1 (fr) Commande d'un groupe d'ascenseurs avec attribution immédiate des appels
EP0365782B1 (fr) Dispositif et méthode de commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
EP0624540B1 (fr) Système d'ascenseur pour opération à zones
DE102015102564A1 (de) Aufzugsystem mit mehreren Schächten und mehreren Kabinen und zusätzlichem Kabinenaufnahmeschacht
EP0308590B1 (fr) Commande d'un groupe d'ascenceurs avec attribution immédiate des appels
EP0134892B1 (fr) Commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
EP0248997A1 (fr) Dispositif de commande de la répartition des cabines à un palier principal pour un groupe d'ascenseurs
EP0242520B1 (fr) Dispositif d'affichage pour ascenseur
EP1193207A1 (fr) Méthode de contrôle pour un ascenseur avec une cabine à plusieurs compartiments
EP0534123B1 (fr) Clavier de destination et dispositif d'affichage à l'étage pour ascenseurs

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

Kind code of ref document: A1

Designated state(s): AT CH DE ES FR GB IT LI

17P Request for examination filed

Effective date: 19890623

17Q First examination report despatched

Effective date: 19900727

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT CH DE ES FR GB IT LI

REF Corresponds to:

Ref document number: 66895

Country of ref document: AT

Date of ref document: 19910915

Kind code of ref document: T

REF Corresponds to:

Ref document number: 3864625

Country of ref document: DE

Date of ref document: 19911010

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)
ET Fr: translation filed
ITF It: translation for a ep patent filed

Owner name: MODIANO & ASSOCIATI S.R.L.

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2026595

Country of ref document: ES

Kind code of ref document: T3

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
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: AT

Payment date: 20070413

Year of fee payment: 20

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

Ref country code: DE

Payment date: 20070423

Year of fee payment: 20

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

Ref country code: ES

Payment date: 20070427

Year of fee payment: 20

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

Ref country code: CH

Payment date: 20070718

Year of fee payment: 20

Ref country code: GB

Payment date: 20070426

Year of fee payment: 20

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

Ref country code: IT

Payment date: 20070613

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: 20070416

Year of fee payment: 20

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20080419

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20080421

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

Ref country code: ES

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20080421

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: 20080419