EP0407731B1 - Méthode de traitement d'appels enregistrés en cabine d'ascenseur - Google Patents

Méthode de traitement d'appels enregistrés en cabine d'ascenseur Download PDF

Info

Publication number
EP0407731B1
EP0407731B1 EP90110552A EP90110552A EP0407731B1 EP 0407731 B1 EP0407731 B1 EP 0407731B1 EP 90110552 A EP90110552 A EP 90110552A EP 90110552 A EP90110552 A EP 90110552A EP 0407731 B1 EP0407731 B1 EP 0407731B1
Authority
EP
European Patent Office
Prior art keywords
calls
dcc
destination
cage
destination calls
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
EP90110552A
Other languages
German (de)
English (en)
Other versions
EP0407731A1 (fr
Inventor
Michel Aimé
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 AT90110552T priority Critical patent/ATE93209T1/de
Publication of EP0407731A1 publication Critical patent/EP0407731A1/fr
Application granted granted Critical
Publication of EP0407731B1 publication Critical patent/EP0407731B1/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/212—Travel time
    • B66B2201/213—Travel time where the number of stops is limited
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/40—Details of the change of control mode
    • B66B2201/403—Details of the change of control mode by real-time traffic data

Definitions

  • the invention relates to a method for handling destination calls placed in elevator cars in elevator controls with immediate allocation of the destination calls placed on the floors.
  • a destination call control with floor sensors and car sensors for an elevator group consisting of several elevators according to US Pat. No. 4,555,000 is known, in which assigned floor destination calls are displayed in the elevator cars. Destination calls made in the elevator cars are made regardless of the assigned floor destination calls.
  • the invention seeks to remedy this.
  • the invention as characterized in the claims, solves the problem of creating a method in which the treatment of car calls is made without effect on the better use of the elevator systems achieved by the immediate assignment of the floor calls.
  • a conveyor machine labeled MOTOR.1 drives an elevator car KABINE.1 of the elevator 1.
  • the MOTOR.1 carrier is supplied with electrical energy by a SYSTEM.1 drive system, which is controlled by an elevator control CONTROL1.
  • a call device GEBER.1 and a display device ANZEIGE.1 are arranged on the elevator car KABINE.1.
  • a process computer COMPUTER stands with the call devices GEBER.E0 ... GEBER.EN, with the display devices ANZEIGE.E0 ... ANZEIGE.EN, in connection with the call devices ENCODER.1 ... ENCODER.n, with the display devices DISPLAY.1 ... DISPLAY.n and with the elevator controls CONTROLLING.1 ... CONTROLLING.n.
  • An algorithm KONTROLLER.E implemented in the process computer RECHNER controls the allocation of the destination calls placed on the floors E0 ... EN.
  • An algorithm KONTROLLER.K implemented in the process computer controls the handling of the destination calls made in the elevator cars KABINE.1 ... KABINE.n. Both algorithms have free access to a common REGION area.
  • FIGS. 2a, 3a and 4a an elevator group with the floors E0 ... E7 is shown in FIGS. 2a, 3a and 4a.
  • the car calls KR1, KR5 and KR6 are placed on floor E3 in the elevator car KABINE.1.
  • An arrow pointing upwards symbolizes the direction of travel of the elevator cabin CABIN. 1.
  • a circle framed 1 indicates a list in which the allocated floor calls of the current semicircle are entered graphically and numerically in FIGS. 2b, 3b and 4b.
  • a circular frame 2 indicates a list in which the assigned floor calls of the next semicircle are entered graphically and numerically in FIGS. 2c, 3c and 4c.
  • the reference symbols of the two lists are given without circles in the further description.
  • FIGS. 2a, 3a and 4a Solid lines and treated cabin calls with broken lines are shown graphically. Both types of calls are numerically entered in the START / DESTINATION columns in list 1 and list 2 in FIGS. 2c, 3c, 4c. At the end of the current semicircle, the content of list 1 is deleted and used for entries of the next semicircle in the future. At the same time, list 2 is made list 1 of the current semicircle.
  • List 1 of the current semicircle contains a trip from floor E3 to floor E7 and list 2 of the next semicircle contains a trip from floor E6 to floor E2 which is requested by a floor call.
  • the trips from floor E3 to floor E5 or E6 required by the car calls K5 and K6, which are ahead of the elevator car KABINE.1, are unconditionally entered in list 1 and carried out.
  • the user information INFO3 is immediately output with the wording "Call is being executed.”
  • the car call KR1 lying behind the elevator car KABINE.1 is not carried out, since the journey would take more than a selectable number of floors, in the present example there are eight floors.
  • the user information INFO1 is immediately output with the text "Call is not being executed, please get out and re-enter the destination call”.
  • the treatment of the car calls KR1, KR5 and KR6 in the case of medium traffic is explained in more detail in FIGS. 3a, 3b and 3c.
  • the list 1 of the current semicircle contains a trip E3 / E7 and a trip E4 / E7
  • the list 2 of the next semicircle contains a trip E7 / E2, a trip E4 / E0 and a trip E2 / E1.
  • the trips E3 / E5 and E3 / E6 required by the car calls KR5 and KR6 are treated with second priority and are only carried out in the opposite direction, if this means that the journey does not extend over eight floors than in the present example.
  • the driving distance for KR5 is six floors and for KR6 this is five floors.
  • List 1 is supplemented with a trip E3 / E7 and list 2 with a trip E7 / E5 and a trip E7 / E6.
  • the user information INFO2 is immediately output with the wording "Call is being carried out in the opposite direction of travel". Even though E1 is a stopping floor, KR1 is not executed because the E3 / E7 / E1 run has more than eight floors.
  • the user information INFO1 is immediately output with the text "Call is not being executed, please get out and re-enter the destination call”.
  • List 1 of the current semicircular contains the rides E3 / E5, E3 / E7, E4 / E7, E4 / E7.
  • the rides E7 / E3, E6 / E2, E6 / E2 and E6 / E1 are entered in list 2 of the next semicircles.
  • the trips E3 / E5 and E3 / E6 requested by the cabin calls KR5 and KR6 are only carried out if the corresponding stopping floors have already been entered in List 1 or List 2.
  • E5 is a stop floor entered in list 1
  • E6 is a stop floor entered in list 2.
  • the user information INFO3 is immediately output with the wording "Call is being executed”.
  • the user information INFO2 is immediately output with the wording "Call is being carried out in the opposite direction of travel".
  • the same restriction applies to the execution of journey E3 / E6 in the opposite direction as for medium traffic, in that it is only carried out if there are no more than eight floors between START and DEST. So that the destination call control the additional Can take traffic volume into account, list 1 is supplemented with a trip E3 / E5 and a trip E3 / E7 and list 2 with a trip E7 / E6.
  • the algorithm KONTROLLER.E implemented in the process computer RECHNER controls the allocation of the destination calls DCF made on the floors E0 ... EN by means of the call devices GEBER.E0 ... GEBER.EN.
  • Cabin assignments ASC are communicated to the users on the floors by means of the display devices ANZEIGE.E0 ... ANZEIGE.EN and forwarded to the elevator controls STEUERUNG.1 ... STEUERUNG.n. With a device that is not shown, assigned calls are displayed in the elevator cabins KABINE.1 ... KABINE.n.
  • the elevator controls STEUERUNG.1 ...
  • STEUERUNG.n export the directions of travel of the RDC cabins and the cabin positions CPO according to the KONTROLLER.E algorithm.
  • the algorithm KONTROLLER.K which controls the handling of destination calls made in the elevator cars KABINE.1 ... KABINE.n by means of the call devices GEBER.1 ... GEBER.n, imports the traffic volume TRF and the car positions CPO from the algorithm KONTROLLER.E. 1 ... CPO.n and the directions of travel of the cabins RDC.1 ... RDC.n.
  • the algorithm KONTROLLER.K handles the car calls DCC depending on the imported car directions RDC and on the imported car positions CPO.
  • KABINE.n and the algorithm KONTROLLER.K is triggered by the status variable cabin data offers RSC.
  • messages INFO1 ... INFO3 are exported to the display devices DISPLAY.1 ... DISPLAY.n.
  • the common REGION area of the algorithms KONTROLLER.E and KONTROLLER.K comprises the sub-areas REGION.1 ... REGION.n.
  • the sub-area REGION.1 is assigned to the elevator 1 and the sub-area REGION.n to the elevator n.
  • a list 1 and a list 2 are installed for each section, in which the assigned destination calls are entered in the form START / ZIEL STT / DSN of the current semicircle and the next semicircle.
  • the lists are read or updated by the KONTROLLER.E algorithm and the KONTROLLER.K algorithm.
  • the algorithm KONTROLLER.E also takes over control of the transition from one list to the other list at the end of each semicircle, so that the list of the next semicircle to the list of the current semicircle and the list of the current semicircle are deleted in terms of content and to the list of the next semicircle in the future becomes.
  • step S1 all constants and variables used in the KONTROLLER.K algorithm are brought to the initial state once in a known manner.
  • step S2 the algorithm KONTROLLER.K uses the status variable data offer cabin RSC to check whether cabin calls DCC are pending. If the result of the test is positive, the data-providing elevator car is identified in a step (not shown). The procedure shown in the following steps relates to the identified elevator car.
  • step S3 a selection procedure is carried out depending on the direction of travel RDC of the identified cabin.
  • the comparison operator> and the operator 2 OP2 the comparison operator ⁇ are assigned to the operator 1 OP1 in step S4.
  • the operator 1 OP1 in step S5 Comparison operator ⁇ and the operator 2 OP2 the comparison operator> assigned.
  • the further treatment of the car target calls depends on the traffic volume TRF, which is checked for weak, medium or high in the selection procedure shown in step S6. If the traffic volume TRF is low, the method is continued in the steps shown in FIG. 7. In the case of medium traffic volume TRF, the car destination calls DCC are handled in accordance with FIG. 8 and in the case of high traffic volume in accordance with FIG. 9. In a further embodiment variant, a smaller gradation of the traffic volume TRF is provided in the selection procedure.
  • FIG. 7 shows the structure and the sequential sequence of the algorithm CONTROLLER.K for handling the car target calls DCC in the case of light traffic TRF.
  • step S7 it is checked whether the car target call DCC is in front of the elevator car when viewed in the direction of travel. The direction of travel is determined using the comparison operator assigned to operator 1 OP1 in step S4 or S5. If the result of the test is positive, the treatment of the car target calls DCC in FIG. 11 is continued.
  • step S8 it is checked whether the car destination call DCC is after the elevator car, as seen in the direction of travel. With this repeated check of the position of the DCC car call, it is achieved that cases in which the DCC car call is equal to the CPO car position are excluded. The direction of travel is determined using the comparison operator assigned to operator OP2 in step S4 or S5. If the result of the test is positive, the treatment of the car target calls DCC in FIG. 10 is continued.
  • step S7 and S8 show the structure and the sequential sequence of the algorithm KONTROLLER.K for handling the car target calls DCC in the case of medium traffic TRF. Steps S7 and S8 are identical to steps S7 and S8 in FIG. 7 are therefore not explained in more detail. If the result of the test in step S7 is positive, a further test is carried out in step S9, in which it is checked whether target calls of the same name are already entered in list 1 of the current semicirculars for the car target call DCC. If destination calls have already been entered in list 1 for the destination floor denoted by DCC, the further treatment of the car destination calls DCC according to FIG. 11 takes place. If the result of the test in step S9 is negative, the treatment of the car destination calls DCC is continued in FIG. 10.
  • FIG. 9 shows the structure and the sequential sequence of the algorithm KONTROLLER.K for handling the car target calls DCC in the case of high traffic volume TRF.
  • Steps S7, S8 and S9 are identical to steps S7, S8 and S9 in FIG. 8. They are therefore not explained in more detail. If the result of the test in step S9 is positive, the car target calls DCC are further processed as shown in FIG. 11. If the result of the test in step S9 is negative, a further test is carried out in step S10, in which it is checked whether the list 2 contains the next one Half-round target calls of the same name have already been entered for the DCC cabin call.
  • step S10 A negative result of the test in step S10 is followed by step S11, in which the user information INFO1 with the wording "Call is not being executed, please get out and re-enter the destination call" after the display of the elevator car is exported.
  • step S 10 shows the structure and the sequential sequence of the algorithm KONTROLLER.K for checking the driving distance DST and for entering permissible trips into list 1 of the current semicircle and into list 2 of the next semicircle.
  • step S12 the last destination entered in list 1 becomes LDN and that in list 2 registered first start imported FST.
  • step S13 it is checked whether the last destination LDN of list 1 is after the first start FST of list 2. If the test in step S13 is positive, the driving distance DST is calculated in accordance with the equation shown in step S14. The driving distance DST is calculated from the current cabin position CPO via the last destination LDN to the destination floor desired with the cabin destination call DCC.
  • step S13 If the result of the test in step S13 is negative, the driving distance DST is calculated in accordance with the equation shown in step S15.
  • the driving distance DST is calculated from the current cabin position CPO via the first start FST to the destination floor desired with the cabin destination call DCC. If the check in step S16 shows that the driving distance DST is less than or equal to a freely selectable maximum driving distance MDT, a check identical to step S13 is carried out in step S17. If the result of the test in step S17 is positive, in step S18 a trip in the form of start / last destination STT / LDN is entered in list 1 and a trip in the form of final destination / destination LDN / DSN in list 2.
  • the start STT corresponds to the current cabin position CPO and the destination DSN to the cabin call DCC. If the result of the test in step S17 is negative, a trip in the form start / first start STT / FST is entered in list S19 and a trip in the form of first start / destination FST / DSN is entered in list 2 in step S19.
  • the start STT corresponds to the current cabin position CPO and the destination DSN to the cabin call DCC.
  • Steps S18 and S19 are followed by step S20, in which the user information INFO2 with the wording “call is being executed in the opposite direction of travel” is exported to the display device of the elevator car.
  • a negative result of the test in step S16 is answered in step S21, in which the user information INFO1 with the wording “call is not being executed, please get out and re-enter the destination call” is exported to the display device of the elevator car.
  • step S22 a trip in the form of start / destination STT / DSN is entered in list 1 of the current semicircle.
  • User information INFO3 with the wording “call is being executed” is exported to the display device of the elevator car in step S23.

Claims (10)

  1. Procédé pour le traitement d'appels de destination (DCC) enregistrés dans des cabines d'ascenseurs(CABINE.1...CABINE.n), pour des commandes d'ascenseurs comportant une attribution immédiate des appels de destination (DCF) enregistrés aux étages (EO...EN), caractérisé en ce que le traitement des appels de destination de cabines (DCC) se fait selon un algorithme (CONTROLEUR.K), en fonction de la circulation (TRF), de leur position et des appels de destination attribués.
  2. Procédé selon la revendication 1, caractérisé en ce que, dans le cas d'une circulation (TRF) faible, les appels de destination de cabines (DCC) situés en aval sont traités sans condition, tandis que les appels de destination de cabines (DCC) situés en amont sont traités en fonction de la distance de trajet (DST).
  3. Procédé selon la revendication 1, caractérisé en ce que, dans le cas d'une circulation (TRF) moyenne, les appels de destination de cabine (DCC) situés en aval sont traités en fonction des appels de destination attribués, tandis que les appels de destination de cabines (DCC) situés en amont sont traités en fonction de la distance de trajet (DST).
  4. Procédé selon la revendication 1, caractérisé en ce que, dans le cas d'une circulation (TRF) dense, les appels de destination de cabines (DCC) situés en aval et en amont sont traités en fonction des appels de destination attribués et de la distance de trajet (DST).
  5. Procédé selon la revendication 3, caractérisé
    - en ce que les appels de destination de cabines (DCC) situés en aval sont traités dans la demi-ronde actuelle si des appels de destination portant le même nom sont attribués à celle-ci,
    - et en ce que les appels de destination de cabines (DCC) situés en aval sont traités comme des appels de destination de cabines (DCC) situés en amont si aucun appel de destination portant le même nom n'est attribué à la demi-ronde actuelle.
  6. Procédé selon la revendication 4, caractérisé
    - en ce que les appels de destination de cabines (DCC) situés en aval sont traités dans la demi-ronde actuelle si des appels de destination portant le même nom sont attribués à celle-ci, et
    - en ce que les appels de destination de cabines (DCC) situés en aval et en amont sont traités dans la demi-ronde suivante si des appels de destination portant le même nom sont attribués à celle-ci.
  7. Procédé selon l'une des revendications précédentes, caractérisé
    - en ce que la distance (DST) pour des trajets supérieurs à une demi-ronde est calculée suivant l'équation DST = (LDN-CPO) + (LDN-DCC), dans laquelle LDN désigne la dernière destination de la demi-ronde actuelle, CPO la position de cabine actuelle et DCC un appel de destination de cabine, et
    - en ce que la distance de trajet (DST) ne dépasse pas une distance de trajet maximale (MDT) apte à être choisie.
  8. Procédé selon l'une des revendications précédentes, caractérisé
    - en ce que la distance (DST) pour des trajets supérieurs à une demi-ronde est calculée suivant l'équation DST = (FST-CPO) + (FST-DCC), dans laquelle FST désigne le premier départ de la demi-ronde suivante, CPO la position de cabine actuelle et DCC un appel de destination de cabine, et
    - en ce que la distance de trajet (DST) ne dépasse pas une distance de trajet maximale (MDT) apte à être choisie.
  9. Procédé selon l'une des revendications précédentes, caractérisé en ce que les appels de destination de cabines (DCC) autorisés sont inscrits, en fonction de leur traitement comme trajets, sous la forme départ/destination, sur des listes (1 ; 2) comportant les appels de destination de la demi-ronde actuelle et de la demi-ronde suivante.
  10. Procédé selon l'une des revendications précédentes, caractérisé en ce que chaque appel de destination de cabine (DCC) est suivi par une information pour utilisateurs (INFO1...INFO3) qui est fonction du déroulement du procédé et est transmis aux dispositifs d'affichage (AFFICHAGE.1...AFFICHAGE.n).
EP90110552A 1989-07-11 1990-06-02 Méthode de traitement d'appels enregistrés en cabine d'ascenseur Expired - Lifetime EP0407731B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AT90110552T ATE93209T1 (de) 1989-07-11 1990-06-02 Verfahren zur behandlung von in aufzugkabinen abgesetzten zielrufen.

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CH2583/89 1989-07-11
CH258389 1989-07-11

Publications (2)

Publication Number Publication Date
EP0407731A1 EP0407731A1 (fr) 1991-01-16
EP0407731B1 true EP0407731B1 (fr) 1993-08-18

Family

ID=4237058

Family Applications (1)

Application Number Title Priority Date Filing Date
EP90110552A Expired - Lifetime EP0407731B1 (fr) 1989-07-11 1990-06-02 Méthode de traitement d'appels enregistrés en cabine d'ascenseur

Country Status (6)

Country Link
US (1) US5056628A (fr)
EP (1) EP0407731B1 (fr)
JP (1) JP2937425B2 (fr)
AT (1) ATE93209T1 (fr)
DE (1) DE59002371D1 (fr)
ES (1) ES2046590T3 (fr)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5557893A (en) * 1995-07-27 1996-09-24 Bowls; George A. Adjustable pitch spiral stairway kit
US6439349B1 (en) 2000-12-21 2002-08-27 Thyssen Elevator Capital Corp. Method and apparatus for assigning new hall calls to one of a plurality of elevator cars
AU2006275280B2 (en) * 2005-08-04 2012-01-19 Inventio Ag Method for assigning a user to an elevator system
WO2009021016A1 (fr) 2007-08-06 2009-02-12 Thyssenkrupp Elevator Capital Corporation Commande pour limiter la pression sur le tympan du passager d'un ascenseur et son procédé
US8151943B2 (en) 2007-08-21 2012-04-10 De Groot Pieter J Method of controlling intelligent destination elevators with selected operation modes
WO2016192807A1 (fr) * 2015-06-05 2016-12-08 Kone Corporation Procédé pour l'attribution d'appels dans un groupe d'ascenseurs
CN111877820B (zh) * 2020-06-24 2022-03-22 上海新时达电气股份有限公司 汽车梯目的层群控方法及其群控制器

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CH648001A5 (de) * 1979-12-21 1985-02-28 Inventio Ag Gruppensteuerung fuer aufzuege.
JPS59227672A (ja) * 1983-06-07 1984-12-20 三菱電機株式会社 エレベ−タの運転装置
ATE51386T1 (de) * 1986-04-11 1990-04-15 Inventio Ag Gruppensteuerung fuer aufzuege.
US4691808A (en) * 1986-11-17 1987-09-08 Otis Elevator Company Adaptive assignment of elevator car calls

Also Published As

Publication number Publication date
US5056628A (en) 1991-10-15
EP0407731A1 (fr) 1991-01-16
JP2937425B2 (ja) 1999-08-23
ATE93209T1 (de) 1993-09-15
DE59002371D1 (de) 1993-09-23
JPH0373772A (ja) 1991-03-28
ES2046590T3 (es) 1994-02-01

Similar Documents

Publication Publication Date Title
DE69636282T2 (de) Verfahren zur zuteilung der stockwerkrufe bei einer aufzugsgruppe
DE3611173C2 (de) Fahrstuhlanlage mit mehreren Doppelabteil-Kabinen
EP1276691B1 (fr) Commande d'appel cible pour ascenseurs
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
DE112009002258B4 (de) Fahrstuhlgruppen-Verwaltungssystem
DE69833880T2 (de) Genetisches verfahren zur zuteilung der aufzugszielrufe
EP0091554B1 (fr) Commande d'un groupe d'ascenseurs comportant un dispositif pour la commande d'une pointe de trafic descendante
EP0246395B1 (fr) Commande d'un groupe d'ascenceur
EP1319625B1 (fr) Dispositif et méthode pour la modernisation d'ascenseur
DE3820568C2 (fr)
EP0440967A1 (fr) Commande de groupes pour ascenseurs avec distribution directe d'appels d'une entrée d'appels située sur l'étage
EP2121499B1 (fr) Dispositif d'affichage et procédé de communication pour un système d'ascenseur
EP0459169B1 (fr) Commande de groupes pour ascenseurs avec deux cabines superposées avec distribution directe d'appels
EP0365782B1 (fr) Dispositif et méthode de commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
EP0407731B1 (fr) Méthode de traitement d'appels enregistrés en cabine d'ascenseur
EP1041032A1 (fr) Procédé de communication avec un système de transport
EP1319624A1 (fr) Dispositif et méthode pour la modernisation d'ascenseur
EP2370335A1 (fr) Commande d'ascenseur pour une installation d'ascenseur
EP0419802B1 (fr) Méthode de traîtement des appels de destination faits en cabine d'ascenseur
EP0624540A1 (fr) Système d'ascenseur pour opération à zones
DE2411824C2 (de) Verfahren zum Betreiben einer Aufzugsanlage
DE60203514T2 (de) Verfahren zur zuteilung von stockwerkanrufen
EP0324068B1 (fr) Procédé pour régler le trafic sur le palier principal d'une installation d'ascenceurs
EP3728094B1 (fr) Planification de parcours en raison du nombre de passagers attendu
DE102021001015A1 (de) Verfahren zum Betreiben einer technischen Anlage und technische Anlage

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

17Q First examination report despatched

Effective date: 19921013

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

Country of ref document: AT

Date of ref document: 19930915

Kind code of ref document: T

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)

Effective date: 19930819

REF Corresponds to:

Ref document number: 59002371

Country of ref document: DE

Date of ref document: 19930923

ET Fr: translation filed
ITF It: translation for a ep patent filed

Owner name: MODIANO & ASSOCIATI S.R

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2046590

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

Payment date: 20080627

Year of fee payment: 19

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

Ref country code: AT

Payment date: 20080616

Year of fee payment: 19

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

Ref country code: IT

Payment date: 20080625

Year of fee payment: 19

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

Ref country code: DE

Payment date: 20080620

Year of fee payment: 19

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

Ref country code: FR

Payment date: 20080613

Year of fee payment: 19

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

Ref country code: GB

Payment date: 20080620

Year of fee payment: 19

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

Ref country code: CH

Payment date: 20090917

Year of fee payment: 20

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20090602

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20100226

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

Ref country code: FR

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

Effective date: 20090630

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 NON-PAYMENT OF DUE FEES

Effective date: 20090602

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

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

Ref country code: DE

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

Effective date: 20100101

Ref country code: AT

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

Effective date: 20090602

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20090603

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 NON-PAYMENT OF DUE FEES

Effective date: 20090603

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

Ref country code: IT

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

Effective date: 20090602