EP1418148B1 - Contrôle d'ascenseurs utilisant des zones - Google Patents

Contrôle d'ascenseurs utilisant des zones Download PDF

Info

Publication number
EP1418148B1
EP1418148B1 EP20030023708 EP03023708A EP1418148B1 EP 1418148 B1 EP1418148 B1 EP 1418148B1 EP 20030023708 EP20030023708 EP 20030023708 EP 03023708 A EP03023708 A EP 03023708A EP 1418148 B1 EP1418148 B1 EP 1418148B1
Authority
EP
European Patent Office
Prior art keywords
zone
lift
zones
favourite
call
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
EP20030023708
Other languages
German (de)
English (en)
Other versions
EP1418148A1 (fr
Inventor
Philipp Sw-Ing. Htl Wyss
Miroslav Dipl. El.-Ing. Kostka
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 EP20030023708 priority Critical patent/EP1418148B1/fr
Publication of EP1418148A1 publication Critical patent/EP1418148A1/fr
Application granted granted Critical
Publication of EP1418148B1 publication Critical patent/EP1418148B1/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/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 method and a device for controlling an elevator installation with a plurality of elevator cars in a building or the like, the floors of which are subdivided into several zones, wherein the lift cars are assigned driving orders.
  • an elevator system for zone operation has become known.
  • passenger traffic between at least one main stop and zones in the high building is managed by a three-elevation elevator system.
  • Each building-filling elevator user passes through a gate associated with a zone in which a sensor registers the elevator user. By selecting the appropriate gate, the elevator user communicates his desired zone without manual operation of a call registering device of the elevator control.
  • the elevator cars travel into certain, permanently assigned zones. Zoning is used to fill a tall building very quickly. There are express lifts that pass by floors not serviced by these elevators.
  • the object of the invention is to provide a method and a device for controlling an elevator installation referred to in the preamble of claim 1 such that a zone control with separation of the zones associated user groups is feasible so that waiting times for individual user groups are minimized as possible.
  • the zones should preferably be assigned to individual user groups with limited access authorization.
  • a zone operation for security purposes serves to strictly separate user groups from each other. If an elevator is busy with a travel order assigned to a zone, it may only be assigned further travel orders from the same zone. The elevator car can only be assigned to another zone if it has completed all the assigned driving assignments and is therefore free.
  • the number of free elevator cars is compared with the number of not yet allocated, that is currently not served, zones. This determines whether there are enough free elevator cars available for all zones. This is then taken into account in deciding where to assign the new call.
  • a call which is assigned to a zone already served by the elevator installation is only allocated to a free elevator cabin if a free elevator remains for each zone not served.
  • the elevators become user groups assigned to each zone that at least one elevator is always available to each group.
  • a particularly preferred embodiment solves problems that arise in a spatial separation of user groups due to their access authorization in a different elevator layout. So there may be elevator systems, in which some floors are operated only by a subset of elevators. Now, if these restricted floors are assigned or assigned to specific user groups, then these or other user groups may experience considerably increased waiting times, depending on the destination, or the persons of other user groups can no longer be assigned.
  • such preferential calls are preferably associated with elevator cars which can serve all floors of a preferred zone.
  • Such an elevator car is referred to herein as a "preferred cabin”.
  • the number of free preferred cabins is compared with the number not yet allocated preferential zones to always preferably a preferred cabin per unallocated preferential zone to be able to keep clear.
  • the number of non-preferential cabins with the Number of non-allocated non-preferential zones compared in order to keep as free as possible a free non-preferred cabin per non-allocated non-preferential zone.
  • a zone it is therefore also possible for a zone to be assigned to several elevator cars. So all elevator cars can be busy. If, however, an elevator car fails for any reason, it could just be one of the user group disadvantaged, if now no elevator is available for their assigned zone.
  • a zone control in buildings or the like (also conceivable ships) is used to separate different groups of elevator passengers from each other.
  • the zone control is a security feature used in buildings or the like where passenger groups must be separated from each other.
  • a passenger belonging to the group 1 may not travel together with a passenger belonging to the group 2.
  • each destination call is associated with a zone.
  • a busy elevator must not accept a call associated with a zone that is different from the zone that the elevator is currently serving. It is for example Assume that an elevator A serves a call for a zone 1. It is further assumed that at this moment a passenger belonging to the group 2 enters a call. Due to the zone separation, the group 2 passenger may only travel in zone 2, while the zone 1 passenger may only travel in zone 1. Therefore, this new call belonging to the group 2 passenger can not be assigned to the elevator A.
  • the individual operator groups can be assigned to the individual zones by known person identification measures.
  • the elevator installation can have various personal identification devices. Examples are key switches, code keys, electronic keys, smart cards, finger sensors, etc. Virtually any technique known in the locksmiths sector such as doors, gates or automobiles is usable.
  • a person belonging to a particular operator group can enter a call for a travel order with a destination floor in their zone using only a personal mechanical or electronic key or by entering their personal code.
  • a personal identification is preferably carried out during the call input in order to assign the call to a specific zone.
  • each elevator can either currently serve calls or it has no orders. If the elevator has no driving orders, it becomes "free”. When idle, an elevator can pick up a call from any zone.
  • the elevator can not change the zone until it becomes free.
  • Fig. 1 illustrates the above facts.
  • preference cabin algorithms are used here.
  • FIG. 2 shows an example of a heterogeneous elevator structure (elevator layout).
  • the elevator system schematically illustrated there has six elevators with elevator cars A, B, C, D, E, F. With a dashed line the main entrance ME is indicated.
  • the elevators with the cabins A, B, C, D lead from the main entrance ME only upwards.
  • the elevators with the cabins E, F also serve basement floors below the main entrance ME. Only the elevator cars E and F thus serve all floors of the building.
  • the following examples relate to this exemplary elevator structure as presented in FIG.
  • the building shown here should be a building in which a zone control is desired as a security feature. It is assumed for this purpose that the building is a bank building which additionally has public areas - for example a floor in which gastronomy is operated - and living areas.
  • the zones resulting therefrom, which are respectively assigned to individual user groups of the elevator installation, are each indicated by a gray bar.
  • the first user group should be visitors in this example.
  • visitors should have access to the main entrance and a visitor floor.
  • the visitor floor can be, for example, a floor with publicly available restaurants or contain the visitor's rooms of the bank.
  • Zone 1 is shown by reference Z1 in FIG.
  • the other two user groups for the example building are residents and bank employees.
  • Fig. 4 is an exemplary zone 2 - named by reference numeral Z2 - indicated for residents.
  • the floors for residents are in the example shown, the main entrance, all floors from the visitor floor and above and a few floors below the main entrance.
  • the floors for the bank employees are all floors from the main entrance ME to the visitor floor (the visitor floor is not included) and some floors below the main entrance ME.
  • the resulting zone 3 is marked in FIG. 5 with Z3.
  • the bank employees accordingly have only the floor "main entrance" ME in common with the visitors and the residents.
  • a zone is a "preferred zone” if it contains floors that are not accessible to each elevator car.
  • the zones "occupants" Z2 and “bank employees” Z3 are preferred zones.
  • An elevator car is a "preferred cabin” if it can service all floors of at least one preferred zone.
  • the elevator cars E and F are preferred cabs.
  • a call assigned to a travel job is a preference call if it is assigned to a preferred zone. This can be determined for example by known personal identification measures, as explained above. If a passenger identifies himself as a resident by means of a corresponding key or code, he can enter a travel order into a destination floor within zone Z2. The corresponding call is then assigned to zone Z2. The example shown here does not necessarily require a person identification for the visitors. Bank employees require a key or the like to enter a call assigned to zone Z3.
  • the number of those preferential zones which are currently or not currently associated with any elevator or elevator car is referred to as the number of unassigned preferred cabins. An example of this is shown in FIG. 6.
  • the elevator cars A, B, C and F are free (this condition is indicated by the reference character fr in the drawings).
  • Lifts D and E are busy with driving assignments.
  • the elevator D serves a driving job of a visitor, so it is assigned to the zone Z1.
  • the elevator E operates a driving order of a resident and is thus assigned to the zone Z2.
  • Zone Z3 is a preferred zone, but it is not associated with any elevator car.
  • Non-preferred zones are here all zones that are not preferred zones.
  • the number of non-preferential zones currently or currently not associated with a lift is referred to as the number of unassigned non-preferential zones. In the example of FIG. 4, the number of unassigned non-preferential zones is zero.
  • the only non-preferential zone in our example is Zone Z1.
  • the zone Z1 is associated with an elevator car, namely the elevator car D.
  • This condition or phrase is useful when a decision needs to be made as to whether a call should be assigned to a free elevator car or not.
  • the elevator cars A to C are free.
  • the elevator car D is assigned to the zone Z1 and the elevator cars E and F are assigned to the zone Z2.
  • not enough preferred cabins are available! Both preferred cabins E and F are busy.
  • For the preferential zone Z3 no preferred cabin is left.
  • This expression is useful when a decision has to be made as to whether or not a new call should be placed in a free elevator car.
  • the call When a call is entered by a user, the call is immediately assigned to a zone.
  • the elevator control selects the best elevator car which can serve this call. This can be done, for example, depending on a cost minimization or algorithms for the fastest possible filling and / or shortening of waiting times.
  • the elevator car For the selection of the best elevator car, there are currently only a few restrictions: The elevator car must be able to serve both the start floor and the destination floor, the zone state of the elevator car must be "free" or the zone assigned at the time of the elevator car must be in line with the call match the assigned zone.
  • FIGS. 8A to 8C What can happen is shown in FIGS. 8A to 8C.
  • Fig. 8A an exemplary initial state is shown. This state corresponds to the state of Fig. 6, that is, the elevator car D is the zone Z1 and the elevator car E is assigned to the zone Z2, while the other elevator cars are free fr. In this state, there is a new call nRZ2 in zone Z2, as shown in Fig. 8B. This new call nRZ2 should be a request for a travel order between a residential floor and a basement accessible to the residents.
  • the elevator controller selects the elevator car F as the best elevator car.
  • Fig. 8C The resulting allocation situation is shown in Fig. 8C.
  • the state corresponds to that of FIG. 7, wherein the newly assigned call is highlighted in gray.
  • Fig. 8E there is no available elevator car for this purpose.
  • the free elevator cars A to C can not operate the basement and the two preferred cabins E, F, which could serve the basement, are assigned to another zone Z2 and therefore may not be assigned to zone Z3.
  • the bank employee must wait until one of the two elevator cars E and F becomes free again. Since new destination calls from the zone Z2 could be entered here again and again, this can u. U. take a long time.
  • an "allocation to a free car” algorithm is proposed. The latter analyzes the situation and shifts the elevator allocation of the call belonging to the zone Z2 to the elevator car E and not to the elevator car F.
  • the call can be definitively assigned and the user is given information indicating the assigned car for his call.
  • the preferred cabin E already operates in zone Z2.
  • the condition "other preferred cabins run in the same zone” afKsZ is thus satisfied, as can be seen at reference numeral 104.
  • the algorithm leads to the instruction tbfKsZ, that is, the best non-preferential cabin operating in this zone must be taken, as indicated at reference numeral 108.
  • This is the correct decision, because now the new call nRZ2 is assigned to the elevator car E, thus a preferred car F is kept free for the preferential zone Z3.
  • the new call nRZ3 of Fig. 8D can be allocated without undue delay.
  • Fig. 11A illustrates another situation that may happen.
  • the elevators with the elevator cars A, B, D and E are inoperative, which is represented by the reference numeral oos (out of service).
  • the elevator car C is assigned to the zone Z2 and the elevator car F is free fr.
  • a new call NRZ2 is entered in the zone Z2 requesting a travel order between the main entrance ME and an upper resident floor.
  • Such an exemplary order can also be done by a non-preferred cabin A to D.
  • Conventional elevator controls would assign such a new call NRZ2 to the elevator car F, for example, because they recognize it as the best elevator car.
  • Fig. 12 shows what the algorithm shown in Fig. 9 would do in this case.
  • the algorithm has decided that the call is associated with zone Z2 and thus is a prefix call.
  • the decision 112 is based on the fact that only one preferred cabin is left, but there are two preferential zones. If you were to assign the reputation of the elevator car F, so would no longer be enough preferred cabins available. This leads to the decision 112.
  • the non-preferred cabin C operates in zone Z2. There are other non-preferred cabins operating in the same zone, as indicated at 116.
  • the new call NRZ2 since the new call NRZ2 only relates to the floors of the main entrance ME and floors above it, the call can be assigned to a non-preferred car that operates in the same zone.
  • the non-preferred cabin C operating in the same zone can serve all floors from the upstream entrance. The corresponding decision is reproduced at 118.
  • the algorithm results in the ZbnfKsZ instruction taking the best non-preferential cab running in the same zone. This is the car C! In the example of Fig. 11A.
  • the corresponding allocation made by the algorithm is shown in FIG.
  • the algorithm shifts the call allocation of the call NRZ2 from the elevator car F selected by upstream elevator algorithms to the elevator car C.
  • the algorithm has kept the elevator car F free for further calls belonging to the zone Z3. In any case, it can serve a call belonging to zone Z3.
  • the cabin E is assigned to the zone Z2.
  • the cabin F is free. For example, for a new call assigned to zone Z1, a costing algorithm would select car F for that call. If the Cab F would be allocated to zone Z1, but no cab would be left for zone Z3.
  • the algorithm of Fig. 9 prevents this problem.
  • the algorithm in this example decides that the best non-preferential cab already operating in this zone Z1 is to be taken for this new call for zone Z1.
  • the cars A and B are assigned to the zone Z1 and the cars D and E to the zone Z3.
  • the cab C and F are free. Now enter a new call assigned to Zone Z3.
  • a pure cost calculation algorithm would assign this new call, for example, to the elevator car C.
  • the decision of the algorithm can be easily obtained from the flowchart of FIG. 9, as in the above examples 1 and 2. As can be seen, the algorithm avoids the problem just mentioned. The algorithm decides that the best preference cabin already operating in zone Z3 must be taken for this new call assigned to zone Z3. The algorithm must not take the car F, because then no more cabin would remain for zone Z4.
  • the elevator cars C and F are free. For example, for a new call associated with zone Z2, a cost calculation algorithm would select car F for that call.
  • zone Z1 is "lost". From now on, all persons who enter a call assigned to Zone Z1 can no longer be served.
  • FIGS. 20 and 21 The operation is shown in FIGS. 20 and 21.
  • this algorithm determines among all traveling (ie non-free) cabins a particular car that will no longer receive calls.
  • This car - in the example car D - is locked against new calls.
  • a cab in such a condition is referred to herein as a "skydiver" SK.
  • this algorithm selects a jumper cabin for each lost zone, which then jumps to the idle state after executing its jobs from the assigned zone.
  • the Missing Cabin by Zone algorithm maintains two lists: one for all priority cabins locked to new orders, and one for all non-preferred cabins (non-preferred stall cabins) locked against new orders. ,
  • Figs. 22, 23 and 24 An example of a "Missing Zone by Zone" algorithm is shown in Figs. 22, 23 and 24, wherein Fig. 22 shows the main part of the algorithm, Fig. 23 shows the process of waiting for the list of non-preferential jumpers, and Fig. 24 represents the process of waiting for the list of preferred showers.
  • the "missing cabin by zone” algorithm shown therein is called each time before a call is finally assigned to a car.
  • the call is assigned to zone Z3.
  • a cost calculation algorithm would decide that the elevator car D is best for this call.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)

Claims (9)

  1. Procédé pour commander une installation d'ascenseur comprenant plusieurs cabines (A-F) dans un bâtiment dont les étages sont divisés en plusieurs zones (Z1, Z2, Z3), les ordres de circulation d'une zone étant affectés aux cabines d'ascenseur,
    étant précisé que tant qu'une cabine exécute un ordre pour une zone, aucun ordre pour une autre zone n'est affecté à cette cabine,
    caractérisé en ce qu'à la suite d'un appel (nRZ2, NRZ2) pour un ordre de circulation, le nombre de cabines libres (fr) est comparé au nombre de zones non encore affectées ou non encore desservies, et en ce que l'ordre qui répond à l'appel est affecté à une cabine en fonction du résultat de la comparaison.
  2. Procédé selon la revendication 1, caractérisé en ce qu'un nouvel appel (nRZ2, NRZ2) qui est affecté à une zone (Z2) déjà desservie par l'une au moins des cabines d'ascenseur (A-F) n'est affecté à une cabine libre (fr) que si le nombre de cabines libres (fr) est supérieur ou égal au nombre de zones (Z3) qui ne sont pas alors desservies par l'installation d'ascenseur.
  3. Procédé selon la revendication 2, caractérisé en ce que dans le cas où le nombre de cabines libres (fr) est inférieur au nombre de zones (Z3) non desservies par l'installation d'ascenseur, le nouvel appel est affecté à une cabine qui circule déjà dans la même zone.
  4. Procédé selon l'une des revendications précédentes, caractérisé en ce que dans le cas où
    a) l'un au moins des étages ne peut pas être desservi par toutes les cabines de l'installation d'ascenseur, et
    b) les zones comprennent au moins une zone prioritaire (Z1, Z2) qui est définie par le fait qu'elle comprend au moins un étage qui ne peut pas être desservi par toutes les cabines (A-F),
    l'affectation d'un nouvel appel dépend du fait que cet appel est affecté ou non à une zone prioritaire.
  5. Procédé selon la revendication 4, caractérisé en ce que dans le cas où les conditions a) et b) sont remplies et aussi, en supplément,
    c) l'installation d'ascenseur a au moins une cabine prioritaire (E, F) qui est définie grâce au fait qu'elle peut desservir tous les étages d'au moins une zone prioritaire (Z2, Z3),
    lors d'un appel qui est affecté à une zone prioritaire, le nombre de cabines prioritaires (E, F) libres est comparé au nombre de zones prioritaires non encore affectées ou non encore desservies par l'installation d'ascenseur, et l'affectation de l'appel se fait en fonction du résultat de la comparaison, et/ou
    en ce que lors d'un appel qui n'est pas affecté à une zone prioritaire, le nombre de cabines non prioritaires (AD) libres est comparé au nombre de zones non prioritaires (Z1) non encore affectées ou non encore desservies par l'installation d'ascenseur, et l'affectation de l'appel se fait en fonction du résultat de la comparaison.
  6. Procédé selon la revendication 5, caractérisé en ce qu'un nouvel appel (nRZ2, NRZ2) affecté à une zone prioritaire n'est affecté à une cabine prioritaire (E, F) libre que si le nombre de cabines prioritaires libres est supérieur ou égal au nombre de zones prioritaires (Z2, Z3) non desservies à ce moment-là par l'installation d'ascenseur et/ou en ce qu'un nouvel appel non affecté à une zone prioritaire n'est affecté à une cabine non prioritaire (A-D) libre que si le nombre de cabines non prioritaires libres est supérieur ou égal au nombre de zones non prioritaires (Z1) actuellement non desservies par l'installation d'ascenseur.
  7. Procédé selon l'une des revendications précédentes, caractérisé en ce que dans le cas où le nombre de cabines d'ascenseur libres (fr) est inférieur au nombre de zones actuellement non desservies par l'installation d'ascenseur et où une zone (Z3) est desservie par deux cabines ou plus, l'une (D) de ces cabines qui desservent la même zone (Z3) est interdite pour d'autres d'affectations jusqu'à ce qu'elle soit libre et donc accessible à une affectation à l'une des zones non desservies.
  8. Procédé selon la revendication 7, caractérisé en ce qu'avec une installation d'ascenseur dans laquelle le nombre total de zones (Z1, Z2, Z3) est inférieur ou égal au nombre de cabines (A-F), pour chaque zone non desservie l'une des cabines qui desservent la même zone qu'une autre cabine est interdite pour de nouvelles affectations.
  9. Procédé selon l'une des revendications précédentes, caractérisé en ce que la division des étages en plusieurs zones (Z1, Z2, Z3) est ou se fait en fonction de l'autorisation d'accès des passagers aux étages.
EP20030023708 2002-11-06 2003-10-20 Contrôle d'ascenseurs utilisant des zones Expired - Lifetime EP1418148B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP20030023708 EP1418148B1 (fr) 2002-11-06 2003-10-20 Contrôle d'ascenseurs utilisant des zones

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
EP02405953 2002-11-06
EP02405953 2002-11-06
EP20030023708 EP1418148B1 (fr) 2002-11-06 2003-10-20 Contrôle d'ascenseurs utilisant des zones

Publications (2)

Publication Number Publication Date
EP1418148A1 EP1418148A1 (fr) 2004-05-12
EP1418148B1 true EP1418148B1 (fr) 2007-04-04

Family

ID=32109160

Family Applications (1)

Application Number Title Priority Date Filing Date
EP20030023708 Expired - Lifetime EP1418148B1 (fr) 2002-11-06 2003-10-20 Contrôle d'ascenseurs utilisant des zones

Country Status (1)

Country Link
EP (1) EP1418148B1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI120534B (fi) * 2008-04-02 2009-11-30 Kone Corp Hissijärjestelmä

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2575526B2 (ja) * 1990-10-16 1997-01-29 三菱電機株式会社 エレベータの群管理装置
CN1201993C (zh) * 2001-02-12 2005-05-18 因温特奥股份公司 将电梯轿厢分配成目标呼叫控制组的方法

Also Published As

Publication number Publication date
EP1418148A1 (fr) 2004-05-12

Similar Documents

Publication Publication Date Title
DE112009002258B4 (de) Fahrstuhlgruppen-Verwaltungssystem
EP1418147B1 (fr) Contrôleur pour ascenseur avec cabine avec plusieurs compartiments
DE60308837T2 (de) Verfahren zur zuteilung von benutzern in einer aufzugsgruppe
EP1565396B1 (fr) Procede pour commander un systeme d'ascenseurs et systeme d'ascenseurs pour mettre en oeuvre le procede
EP2238065B1 (fr) Procédé d'attribution d'appels d'une installation d'ascenseur et installation d'ascenseur dotée d'une attribution d'appels selon ce procédé
EP0246395B1 (fr) Commande d'un groupe d'ascenceur
EP3224172B1 (fr) Procédé permettant de faire fonctionner un système d'ascenseur
EP3099616B1 (fr) Procédé pour faire fonctionner un système d'ascenseur
EP1276691B1 (fr) Commande d'appel cible pour ascenseurs
DE4120586C2 (de) Verfahren zum betreiben einer aufzugsanlage
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
CH677225A5 (fr)
EP0365782B1 (fr) Dispositif et méthode de commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
EP0440967A1 (fr) Commande de groupes pour ascenseurs avec distribution directe d'appels d'une entrée d'appels située sur l'étage
DE3611173A1 (de) Fahrstuhlanlage mit mehrabteilkabinen-rufzuweisung
EP3218294B1 (fr) Procédé de traitement d'entrées d'appel par une commande d'ascenseur et système d'ascenseur permettant la mise en oeuvre du procédé
EP0312730A1 (fr) Commande de groupe pour ascenceurs avec commande des cabines dépendant de leur charge
EP0134892B1 (fr) Commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
EP1193207A1 (fr) Méthode de contrôle pour un ascenseur avec une cabine à plusieurs compartiments
EP1418148B1 (fr) Contrôle d'ascenseurs utilisant des zones
DE102018213575B4 (de) Verfahren zum Betreiben einer Aufzuganlage mit Vorgabe einer vorbestimmten Fahrtroute sowie Aufzuganlage und Aufzugsteuerung zur Ausführung eines solchen Verfahrens
WO2017016878A1 (fr) Système d'ascenseur muni d'un ascenseur à cabine à plusieurs ponts
EP1270486B1 (fr) Méthode pour sélectionner le parcours optimal, changements de cabines inclus, parmis plusieurs groupes d'ascenseurs
EP3774627A1 (fr) Procédé permettant de faire fonctionner un système d'ascenseur

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 BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

17P Request for examination filed

Effective date: 20041016

AKX Designation fees paid

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

REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 1065769

Country of ref document: HK

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REF Corresponds to:

Ref document number: 50306951

Country of ref document: DE

Date of ref document: 20070516

Kind code of ref document: P

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

Effective date: 20070514

REG Reference to a national code

Ref country code: HK

Ref legal event code: GR

Ref document number: 1065769

Country of ref document: HK

ET Fr: translation 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

Effective date: 20080107

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 13

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 14

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 15

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

Ref country code: FR

Payment date: 20171024

Year of fee payment: 15

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

Ref country code: AT

Payment date: 20171020

Year of fee payment: 15

Ref country code: CH

Payment date: 20171019

Year of fee payment: 15

Ref country code: BE

Payment date: 20171019

Year of fee payment: 15

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: AT

Ref legal event code: MM01

Ref document number: 358648

Country of ref document: AT

Kind code of ref document: T

Effective date: 20181020

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20181031

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

Ref country code: BE

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

Effective date: 20181031

Ref country code: CH

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

Effective date: 20181031

Ref country code: LI

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

Effective date: 20181031

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

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

Ref country code: DE

Payment date: 20211027

Year of fee payment: 19

Ref country code: GB

Payment date: 20211026

Year of fee payment: 19

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 50306951

Country of ref document: DE

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

Effective date: 20221020

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

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