EP0623546B1 - Répartiteur pour ascenseur avec fonction d'objectivité à terme multiple et assignation instantanée d'un ascenseur - Google Patents

Répartiteur pour ascenseur avec fonction d'objectivité à terme multiple et assignation instantanée d'un ascenseur Download PDF

Info

Publication number
EP0623546B1
EP0623546B1 EP19940303253 EP94303253A EP0623546B1 EP 0623546 B1 EP0623546 B1 EP 0623546B1 EP 19940303253 EP19940303253 EP 19940303253 EP 94303253 A EP94303253 A EP 94303253A EP 0623546 B1 EP0623546 B1 EP 0623546B1
Authority
EP
European Patent Office
Prior art keywords
hall call
car
time
objective function
assignment
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
EP19940303253
Other languages
German (de)
English (en)
Other versions
EP0623546A1 (fr
Inventor
Bruce A. Powell
John N. Williams
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.)
Otis Elevator Co
Original Assignee
Otis Elevator Co
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 Otis Elevator Co filed Critical Otis Elevator Co
Publication of EP0623546A1 publication Critical patent/EP0623546A1/fr
Application granted granted Critical
Publication of EP0623546B1 publication Critical patent/EP0623546B1/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/102—Up or down call input
    • 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/233—Periodic re-allocation of call inputs
    • 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

  • An elevator dispatcher causes a particular elevator in a bank of elevator cars to be sent to a floor in response to a user pressing a hall button at that floor.
  • a hall lantern will illuminate just prior to the opening of the car doors in order to inform the user as to which car will service his hall call.
  • the dispatcher assigns a car to a hall call according to a variety of elevator system parameters. It is possible for values of these system parameters to change between the time the hall call is registered and the time the hall call is serviced. Therefore, the dispatcher may reassign the hall call to other cars many times before the hall call is serviced. The user does not notice the reassignment because the hall lantern is lit only after these multiple reassignments have occurred and just before the car arrives at the floor.
  • ICA instantaneous car assignment
  • ICA informs the user at the instant of first assignment (or shortly thereafter) as to which car will service his/her hall call.
  • the benefit is that the user can be walking toward that particular car, of the bank of cars, which is going to serve him and be positioned and ready to enter that car when it arrives.
  • a know-and-go time is the time from when a passenger knows which car is responding to his hall call to the time it takes him to go over to the car. Therefore, giving the user the opportunity to be in front of the car when it arrives requires that numerous reassignments of a hall call to different cars cannot take place. To the extent a dispatcher is spending time reassigning, the know-and-go time is used up.
  • ICA Relative System Response
  • RSR Relative System Response
  • ICA was used in conjunction with RSR. This RSR/ICA scheme, therefore, fixed the first car to hall call assignment using RSR - a scheme for which the initial assignment did not account for future events (new hall calls and car calls) which would serve to degrade the quality of an initial assignment. The need for a better initial assignment remained after RSR/ICA.
  • the average registration time is the time from when the hall call button is pressed to the time that the hall call is cancelled. This latter point in time varies with different elevator systems - for some, the hall call is cancelled when the car arrives at the floor and is leveling while for others the hall call is cancelled at a stop control point typically located where deceleration of the elevator begins as it nears the floor begins and a hall lantern is lit. Note that registration time is not equal to waiting time because not all passengers wait the same time and therefore we cannot easily measure the waiting time of all passengers.
  • the average registration time of an elevator system is a common metric for the performance of that system.
  • a good average registration time can be deceptive, hiding an occasional, extremely long registration time among numerous, very short registration times.
  • Engineers have discovered that there will usually be one hall call during a heavy two-way traffic scenario which waits a very long time (for example, 135 seconds). These long waits occur rather infrequently (for example, once or twice in one thousand hall calls). It has been observed that the associated hall calls have often been bypassed by at least one (usually several) car. These bypasses happen because the bypassing car was not the one assigned to the hall call at the time of the bypass. If the bypassing car had stopped for the hall call, then the very long registration time could have been reduced.
  • Figure 1 illustrates this maximum registration time dilemma and the failure of the prior art to address it.
  • car B is assigned a hall call at floor 7 while car B is heading in the down direction when a new hall call at floor 9 is registered, which hall call is as yet not assigned.
  • Car A is also heading in the down direction but is farther from the hall call registered at floor 9 than car B.
  • car B will more than likely be assigned to the hall call at floor 9 because car B is closer than car A to floor 9. This is optimum for the person who registered the hall call at floor 9, but the person who registered the hall call at floor 7, to which car B is already committed, had been waiting for sixty seconds for a car already when the hall call at floor 9 was registered.
  • the person at floor 9 has a very short wait, but the person at floor 7 who has already waited a long time, now waits even longer.
  • Objectives of the present invention include reducing the maximum registration time, while maximizing the know-and-go time and still achieving a good initial elevator assignment.
  • a method for assigning a hall call to an elevator car out of a group of elevator cars comprising:
  • Assignment of cars to hall calls is performed directly as a function of system performance parameters, related to passenger waiting time including 1) remaining response time, (RRT), and 2) predicted registration time (PRT) and, preferably one or more of 3) maximum predicted registration time (maxPRT) and 4) a relative system response (RSR) quantity.
  • RRT remaining response time
  • PRT predicted registration time
  • maxPRT maximum predicted registration time
  • RSR relative system response
  • An advantage is that the waiting time of long-waiting calls is reduced.
  • the RSR algorithm uses an objective function.
  • the RSR algorithm and various modifications of it can be said to include various terms, depending on the RSR algorithm employed.
  • the basic component of the RSR quantity is an estimate of the number of seconds an elevator would require to reach a hall call.
  • the second part of the invention is the instantaneous car assignment (ICA) feature in combination with the objective function.
  • ICA instantaneous car assignment
  • a switch that is a reassignment, is permissible under two exceptional circumstances: 1) there is a car other than the assigned one that can reach the call significantly faster (for example, by at least 40 seconds) and 2) the assigned car is traveling away from the call (for example, the car assigned to an up hall call is traveling upwardly above the call).
  • the assignment is made based on the objective function.
  • the values of the coefficients A, B, C, and D can be varied to reflect the preference of the building owner. It is also clear that by setting all but one coefficient to zero, dispatching assignments can be made based on a single metric.
  • Figure 2 illustrates a car B moving in the down direction and positioned at floor 12 on its way to service a car call at floor 9.
  • a new hall call is registered at floor 6.
  • the remaining response time for the new hall call for car B is an exemplary 15 seconds.
  • another hall call is assigned when the car B, still moving downwardly in the direction of its car call at floor 9 and assigned hall call at floor 6, when another hall call is assigned to it at floor 10.
  • the additional hall call at floor 10 increases the remaining response time of the call at floor 6 to 25 seconds from 15 seconds.
  • Figure 3 maps floors in a building against car calls for cars B and C and a hall call assigned to car B.
  • Figure 3 illustrates the remaining response time concept after a hall call has already been waiting an exemplary time of 20 seconds.
  • a car B is traveling in the downward direction to service two car calls before servicing a hall call assigned to car B where the passenger has already been waiting for 20 seconds.
  • a car C is moving in the upward direction to service a car call at a floor above the location of the hall call. The question arises as to whether the hall call should remain assigned to car B or be reassigned to car C.
  • the remaining response time for assignment to car B is compared to the remaining response time for car C to evaluate the merit of the current assignment and determine whether a switch, that is a reassignment, from car B to car C would be a good idea.
  • the car is assumed to go to the terminal floor.
  • a down call is registered at floor 10.
  • the car is assumed to be sent to the top terminal to fulfill the car call resulting from the hall call at floor 9 before it can reach floor 10 in the down direction).
  • this assumption that the cars go to the terminal floor is not necessarily the worst case.
  • This metric is the sum of the amount of the time that the call has already been waiting (the wait time-so-far) and the RRT.
  • PRT RRT .
  • Figure 4 illustrates why assignment of hall calls based solely on remaining response time is not sufficient for good hall call assignments and why predicted registration time is important.
  • Car B is presently at floor 11, car B is moving downwardly to service a hall call assigned to it at floor 6 where the passenger's wait time-so-far is (a very long) 50 seconds when a new hall call is registered at floor 9.
  • Another car C at floor 14 is also moving downwardly.
  • the remaining response time of car B for the new hall call at floor 9 is six seconds.
  • the remaining response time of the car C with respect to the new hall call at floor 9 is 15 seconds, because the car C is farther away from the new hall than car B. It would seem at this point that the logical selection for the assignment for the hall call is car B. Under certain circumstances, this assignment would not be appropriate, however, because of the effect of that assignment on other calls.
  • the predicted registration time for the call at floor six if car B is assigned to the hall call at floor 9 is increased to 65 seconds.
  • the predicted registration time for the call at floor 6 if car B is assigned to the hall call at floor 9 is 55 seconds.
  • the predicted registration time metric is included in the objective function as the absolute value of the difference between the predicted registration time and the term, T 1 , of 20 seconds. If the predicted registration time is either very short or very long, then the term, T 1 , penalizes a car. This reflects the philosophy in some markets that a passenger is willing to wait approximately 20 seconds without any level of discomfort. Of course, this penalty term is variable and need not be 20 seconds. Therefore, a car that could reach the hall call in a very short time (for example, five seconds) might better proceed to answer other more urgent elevator system demands.
  • the present invention proposes to address these long calls by penalizing the car for an assignment only when that assignment will cause the longest waiting call (of all hall calls presently waiting) to wait longer than a term, T 2 , 60 seconds. It is thought that a call that has already waited 60 seconds has a potential to cross the 90 seconds threshold and therefore should be given special consideration.
  • the penalty term is variable and need not be 60 seconds.
  • the term is squared in the objective function to reflect the passengers growing irritation which is felt to be nonlinear and increasing as the waiting time increases beyond 60 seconds.
  • maxPRT like PRT, need not be squared but could be the argument for any other function to model passenger irritation.
  • the Dirac Delta operator ensures that the third term is zero where maxPRT is not longer than 60 seconds.
  • This metric is used currently in the objective function in order to allow the building owner to revert to the prior art RSR dispatching methodology.
  • the value of the RSR term selected depends upon which form of RSR is desired, as it has many modifications.
  • the basic component of the RSR quantity is the estimated amount of time for a car to reach the hall call whose assignment is being determined.
  • the value selected, however, for the RSR value may be any of those shown in U.S. Patent 5,146,053 issued to Powell et al entitled Elevator Dispatching Based on Remaining Response Time; U.S. Patent 4,363,381 issued to Bittar, entitled Relative System Response Elevator Call Assignments; U.S. Patent 4,185,568 to Bittar entitled Weighted Relative System Elevator Car Assignment System with Variable Bonuses and Penalties; U.S. Patent 4,782,921 to MacDonald et al.
  • Patent 5,022,497 issued to Thangavelu entitled Artificial Intelligence Based Crowd Sensing system for Elevator Car Assignment
  • U.S. Patent 4,838,384 issued to Thangavelu entitled Queue Based Elevator Dispatching System Using Peak Period Traffic Prediction.
  • the bonuses and penalties making up the RSR term can be varied or fixed.
  • Figure 5 is a master flow chart for implementing the method of the present invention. After a start, a hall call at a floor N in a given direction is registered. Then, an elevator dispatcher determines if the hall call was previously assigned to a car and records the car of the assignment. Next, the remaining response time is calculated for each car in the bank and the lowest remaining response time and the car associated with it is determined.
  • a series of tests is now executed to determine if a hall call assignment algorithm (Fig. 6) for reassigning the call should be executed.
  • the routines of Figures 5, 6 and 7 incorporate the basic concept of instantaneous car assignment in that the call is not reassigned unless there are strong incentives for doing so; even then, no more than one reassignment is allowed.
  • the first test asks "Is this a new hall call?". If so, completion of the routine of Figure 5 waits for execution of the hall call assignment algorithm illustrated in Figure 6. If not, the next three tests may be executed for determining whether the previously assigned call should be reassigned.
  • test two if the remaining response time of the assigned elevator is greater than the lowest remaining response time plus 40 seconds, execution of the routine at Figure 5 waits until execution of the hall call assignment algorithm (Fig. 6) for possible reassignment of the hall call to another car.
  • This test indicates that reassignment is strongly discouraged but if the remaining response time of the present car is extremely poor with respect to the lowest remaining response time then reassignment should be considered. Extremely poor is defined by a variable predicted registration time difference, here 40.
  • the third and fourth tests stall execution of the routine of Figure 5 until the hall call assignment algorithm is executed if the assigned car is traveling away from the assigned call. None of these tests being met in the affirmative, there is no reassignment.
  • Figure 6 illustrates the hall call assignment algorithm.
  • the remaining response time already computed for the current set of assignments of hall calls to cars is read and used for computing the predicted registration time (PRT) for all hall calls, by adding the wait time-so-far for each call to the associated remaining response time.
  • PRT predicted registration time
  • a car index icar is set to zero. The index is incremented by one for each car in the bank, and a multi-term objective function is computed for that car, until all cars have been considered.
  • the car with the lowest objective function is determined and given a label KAR.
  • a series of tests is then executed for determining whether there should be a reassignment. These three tests are similar to the four tests of Figure 5 insofar as their execution infrequently results in reassignment of a call out of deference to instantaneous car assignment.
  • the hall call is assigned. If the hall call is not a new call (test two) and the call has already been switched once from the car of first assignment, then the hall call is not reassigned. If the call is not a new one, then the predicted registration time (PRT) of the assigned car is compared with the predicted registration time (PRT) of the car, "KAR", with the lowest objective function.
  • the hall call is reassigned to the elevator car (KAR) with the lowest objective function, but otherwise, no reassignment occurs.
  • Figure 7 illustrates calculation of the multi-term objective function.
  • the wait time-so-far for each hall call is stored and mapped against the direction of that hall call.
  • the car for which the objective function is being calculated is assumed to be assigned to the call being considered for reassignment in the master flow chart routine.
  • the remaining response time (RRT), predicted registration time (PRT), maximum predicted registration time (maxPRT), and the RSR value are calculated.
  • the values for the four terms of the multi-term objective function are now calculated and summed for producing the multi-term objective function for use in the assignment algorithm hall call.
  • Figure 8 is a graph of the objective function of the cars in a bank; the car with the minimum value of the objective function (car B) is assigned to a hall call.

Landscapes

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

Claims (7)

  1. Procédé pour l'assignation d'un appel d'étage à une cabine d'ascenseur parmi un groupe de cabines d'ascenseur, consistant à:
    a) fournir un temps de réponse résiduel associé à une cabine d'ascenseur et audit appel d'étage; et
    b) fournir un temps de prise en compte calculé à l'avance associé à ladite cabine d'ascenseur et audit appel d'étage; et
    c) fournir une fonction d'objectivité en réponse audit temps de réponse résiduel et audit temps de prise en compte calculé à l'avance;
    d) exécuter les étapes (a) à (c) pour chaque cabine d'ascenseur disponible pour l'assignation dudit appel d'étage;
    e) comparer ladite fonction d'objectivité pour toutes les cabines disponibles pour l'assignation dudit appel d'étage pour obtenir un résultat comparatif;
    f) assigner une cabine d'ascenseur audit appel d'étage en réponse audit résultat comparatif.
  2. Procédé selon la revendication 1, comprenant en outre la fourniture de ladite fonction d'objectivité en réponse à un temps de prise en compte calculé à l'avance maximal associé à ladite cabine et audit appel d'étage.
  3. Procédé selon la revendication 1 ou 2, dans lequel une grandeur de réponse relative du système (RSR) est incorporée à ladite fonction d'objectivité.
  4. Procédé selon la revendication 1 ou 2, dans lequel ledit temps de réponse résiduel et ledit temps de prise en compte calculé à l'avance sont combinés de façon linéaire pour effectuer ladite fonction d'objectivité.
  5. Procédé selon l'une quelconque des revendications précédentes, dans lequel ladite assignation est interdite si ledit appel d'étage a été antérieurement assigné plus d'un nombre limité de fois antérieurement.
  6. Procédé selon l'une quelconque des revendications précédentes, dans lequel ladite assignation est interdite si ledit appel d'étage a été antérieurement assigné plus d'un nombre limité de fois antérieurement et dans lequel la limitation du nombre de réassignations est attendue dans les cas où :
    a) le temps de prise en compte calculé à l'avance de la cabine d'ascenseur actuellement assignée audit appel d'étage est supérieur au temps de prise en compte calculé à l'avance d'une cabine d'ascenseur associée à la fonction d'objectivité de plus faible valeur, dans la proportion de la différence de temps de prise en compte calculé à l'avance, ou
    b) la cabine d'ascenseur assignée audit appel d'étage s'éloigne de l'étage d'où provient ledit appel d'étage.
  7. Procédé selon l'une quelconque des revendications précédentes, dans lequel ladite fonction d'objectivité est de la forme : OBJ (icar) = A.RRT + B. PRT - T 1 + δ . C.[(maxPRT) - T 2 ] 2 + D.RSR
    Figure imgb0005
        dans laquelle OBJ (icar) est la fonction d'objectivité ;
       dans laquelle RRT est le temps de réponse résiduel.
       PRT est le temps de prise en compte calculé à l'avance ;
       maxPRT est le temps de prise en compte calculé à l'avance maximum ;
       T1 est une valeur de temps ;
       T2 est une autre valeur de temps ;
       RSR est la grandeur représentant la réponse relative du système ;
    δ =   1 si maxPRT > T2
    0 dans le cas contraire.
EP19940303253 1993-05-05 1994-05-05 Répartiteur pour ascenseur avec fonction d'objectivité à terme multiple et assignation instantanée d'un ascenseur Expired - Lifetime EP0623546B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US59152 1979-07-20
US5915293A 1993-05-05 1993-05-05

Publications (2)

Publication Number Publication Date
EP0623546A1 EP0623546A1 (fr) 1994-11-09
EP0623546B1 true EP0623546B1 (fr) 1997-03-19

Family

ID=22021174

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19940303253 Expired - Lifetime EP0623546B1 (fr) 1993-05-05 1994-05-05 Répartiteur pour ascenseur avec fonction d'objectivité à terme multiple et assignation instantanée d'un ascenseur

Country Status (6)

Country Link
EP (1) EP0623546B1 (fr)
JP (1) JP3461564B2 (fr)
AU (1) AU672487B2 (fr)
CA (1) CA2122869A1 (fr)
DE (1) DE69402100T2 (fr)
HK (1) HK115197A (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001072622A1 (fr) * 2000-03-29 2001-10-04 Mitsubishi Denki Kabushiki Kaisha Dispositif de commande de gestion d'un groupe d'ascenseurs
CN114933218B (zh) * 2022-03-24 2024-05-28 浙江华睿科技股份有限公司 一种电梯调度方法、终端及计算机可读存储介质

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2607597B2 (ja) * 1988-03-02 1997-05-07 株式会社日立製作所 エレベータの群管理制御方法
US4793443A (en) * 1988-03-16 1988-12-27 Westinghouse Electric Corp. Dynamic assignment switching in the dispatching of elevator cars
JPH0772059B2 (ja) * 1988-10-19 1995-08-02 三菱電機株式会社 エレベータの群管理装置
US5146053A (en) * 1991-02-28 1992-09-08 Otis Elevator Company Elevator dispatching based on remaining response time

Also Published As

Publication number Publication date
AU672487B2 (en) 1996-10-03
JPH06340378A (ja) 1994-12-13
CA2122869A1 (fr) 1994-11-06
HK115197A (en) 1997-08-29
DE69402100D1 (de) 1997-04-24
EP0623546A1 (fr) 1994-11-09
JP3461564B2 (ja) 2003-10-27
AU6188394A (en) 1994-11-10
DE69402100T2 (de) 1997-10-16

Similar Documents

Publication Publication Date Title
US5024295A (en) Relative system response elevator dispatcher system using artificial intelligence to vary bonuses and penalties
KR920011080B1 (ko) 엘리베이터의 군(群)관리장치
US5679932A (en) Group management control method for elevator system employing traffic flow estimation by fuzzy logic using variable value preferences and decisional priorities
US6345697B1 (en) Procedure for controlling an elevator group where virtual passenger traffic is generated
US5146053A (en) Elevator dispatching based on remaining response time
EP0444969A2 (fr) Système d'apprentissage utilisant l'intelligence artificielle pour la prédiction des heures de pointe pour la distribution d'appels d'ascenseur
KR920001299B1 (ko) 엘리베이터의 군관리장치
JP3042904B2 (ja) エレベータ配送システム
JPS63218484A (ja) エレベータカーコールの最適割当て装置
US5274202A (en) Elevator dispatching accommodating interfloor traffic and employing a variable number of elevator cars in up-peak
US5447212A (en) Measurement and reduction of bunching in elevator dispatching with multiple term objection function
US5511634A (en) Instantaneous elevator up-peak sector assignment
JPH05201628A (ja) エレベータかごをセクタに動的に割当てる方法及び装置
EP0645337B1 (fr) Annonce précoce de la cabine
US5388668A (en) Elevator dispatching with multiple term objective function and instantaneous elevator assignment
EP0452225A2 (fr) Canalisation dynamique de la distribution d'appels d'ascenseur pour les heures de pointe du trafic montant
GB2276470A (en) Group supervisory control device for elevators
JP2001310876A (ja) ダブルデッキエレベータシステムの制御装置および制御方法
EP0623546B1 (fr) Répartiteur pour ascenseur avec fonction d'objectivité à terme multiple et assignation instantanée d'un ascenseur
US5480006A (en) Elevator downpeak sectoring
JPH07117941A (ja) エレベータの群管理制御装置
JPH08198529A (ja) ダブルデッキエレベーターの制御装置
JP2001058764A (ja) エレベーターの群管理制御システム
JPH0553712B2 (fr)
KR101024799B1 (ko) 승강기 통행 제어

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): DE FR GB

17P Request for examination filed

Effective date: 19941208

17Q First examination report despatched

Effective date: 19960326

GRAG Despatch of communication of intention to grant

Free format text: ORIGINAL CODE: EPIDOS AGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

REF Corresponds to:

Ref document number: 69402100

Country of ref document: DE

Date of ref document: 19970424

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
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20000411

Year of fee payment: 7

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

Ref country code: DE

Payment date: 20000425

Year of fee payment: 7

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

Ref country code: GB

Payment date: 20010412

Year of fee payment: 8

REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

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

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

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

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

Effective date: 20020505