[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

EP2183177B1 - Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination - Google Patents

Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination Download PDF

Info

Publication number
EP2183177B1
EP2183177B1 EP08798845A EP08798845A EP2183177B1 EP 2183177 B1 EP2183177 B1 EP 2183177B1 EP 08798845 A EP08798845 A EP 08798845A EP 08798845 A EP08798845 A EP 08798845A EP 2183177 B1 EP2183177 B1 EP 2183177B1
Authority
EP
European Patent Office
Prior art keywords
elevator
time
value
estimated
threshold
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.)
Not-in-force
Application number
EP08798845A
Other languages
German (de)
English (en)
Other versions
EP2183177A1 (fr
Inventor
Rory S. Smith
Richard D. Peters
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.)
ThyssenKrupp Elevator Capital Corp
Original Assignee
ThyssenKrupp Elevator Capital Corp
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 ThyssenKrupp Elevator Capital Corp filed Critical ThyssenKrupp Elevator Capital Corp
Priority to EP10005426A priority Critical patent/EP2213604B1/fr
Publication of EP2183177A1 publication Critical patent/EP2183177A1/fr
Application granted granted Critical
Publication of EP2183177B1 publication Critical patent/EP2183177B1/fr
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

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/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
    • 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/215—Transportation capacity
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/222—Taking into account the number of passengers present in the elevator car to be allocated
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/235—Taking into account predicted future events, e.g. predicted future 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

  • the present disclosure relates in general to elevators and, in particular, to control systems governing the operation of elevator systems.
  • Existing hall call allocation systems and methods use criteria, such as waiting time, time to destination, energy consumption, and elevator usage, with neural networks, generic algorithms, and/or fuzzy logic to find an optimum solution for assigning a new hall call to one of a group of available elevator cars.
  • ETA Estimate Time of Arrival
  • ETA based systems calculate the amount of time required for each available elevator to answer a new hall call.
  • ETA based systems have some advantages, they do not adequately evaluate the negative impact of a new hall call assignment on existing call assignments. For example, when a passenger enters a new hall call and it is accepted by an elevator car carrying existing passengers that are traveling to a floor beyond the floor where the newly assigned hall call was entered, the existing passengers will be delayed by the time needed to pick up the new passenger and depending upon the new passenger's desired destination, the existing passengers may be delayed by the time needed to drop off the new passenger.
  • Destination dispatch systems also have shortcomings. For example, they often require a destination input device at each elevator landing and usually have no call input devices in the elevator car. Because destination dispatch systems require entry devices at every elevator landing, they must make an instant call assignment and inform a waiting passenger which car to enter. This instant assignment does not permit an improved assignment if conditions change during the time period between call entry and car arrival. Thus, an elevator hall call assignment system and method that does not require destination entry devices at every elevator landing and that takes into account the delay that a new hall call assignment will have on existing passengers would greatly improve the elevator car.
  • WO 2005/100223 A1 discloses a method and a system for the allocation of elevators on the basis of calls in an elevator system.
  • the method produces for different route alternatives a cost function wherein the traveling time of each passenger is calculated.
  • the calculation of the traveling time is performed taking into account the time spent while waiting for an elevator at a floor, the ride time in the elevator car, the delaying effect of active landing and car calls on the traveling time and the delaying effect of car calls given by new passengers entering at intermediate stops.
  • the method is advantageous in the destination call system, but in the traditional up-down call system it is possible to utilize information provided by traffic statistics to predict the destination floor.
  • Route alternatives can be created e.g. by using genetic algorithms. Once the route alternative giving the shortest average traveling time has been calculated, the elevators are controlled according to this route.
  • WO 02/49950 A1 provides a method and apparatus for use in elevator systems for assigning new hall calls to one of a plurality of available elevator cars.
  • the method comprises calculating for each car a call cost for accepting the new hall call.
  • the call cost is a function of the estimated time to the desired destination of the passenger requesting the new hall call and of the delay that other passengers who are using the elevator car will experience.
  • a destination is inferred for the passenger requesting the new hall call.
  • the passenger requesting the hall call may input a desired destination at the time the hall call request is made.
  • the invention provides a method for assigning a new hall call to one of a plurality of elevator cars in an elevator system, according to the subject-matter of independent claim 1. Further aspects and embodiments of the invention are set forth in the dependent claims, the following description and the drawings.
  • Fig. 1 shows a perspective view of one version of an elevator system.
  • Fig. 2 shows a schematic depicting one version of a controller system governing the operation of the elevator system of Fig. 1 .
  • Fig. 3 shows a schematic depicting an alternate version of a controller system governing the operation of the elevator system of Fig. 1 .
  • Fig. 4 shows a flowchart depicting one version of a method for assigning a new call.
  • Fig. 5 shows a table containing sample data relating to the operation of one version of an elevator system.
  • Fig. 6 shows a table containing sample data relating to the operation of the version of the elevator system relating to Fig. 5 .
  • Fig. 7 shows a table containing sample data relating to the operation of the version of the elevator system relating to Fig. 5 .
  • Fig. 8 shows a table containing sample data relating to the operation of the version of the elevator system relating to Fig. 5 .
  • Fig. 9 shows a table containing sample data relating to the operation of the version of the elevator system relating to Fig. 5 .
  • Fig. 10 shows a table containing sample data relating to the operation of the version of the elevator system relating to Fig. 5 .
  • Versions of elevator systems described herein may improve a passenger's perception of ride efficiency by accounting for different levels of inconvenience associated with different types of waiting. This may even be accomplishing by delaying the overall time required for the passenger's car to reach their destination while giving the passenger the impression that the ride is actually more efficient.
  • Existing ETA based systems may allow any suitable proportion of estimated waiting time (ETW) and estimated travel time (ETT) needed to reduce a passenger's overall estimated time to destination (ETD), which is ETW plus ETT, as much as possible.
  • ETW estimated waiting time
  • ETT estimated travel time
  • an ETA based system may increase a passenger' ETW, the time a passenger waits for an elevator car to arrive, to 35 seconds in order to reduce the passenger's overall ETD.
  • ETW may be 35 seconds
  • ETT may be 60 seconds
  • the total ETD may be 95 seconds.
  • passengers likely would have become impatient waiting more than 30 seconds for their car to arrive. Passing the 30 second threshold may give them the impression that the elevator system is slow and inefficient.
  • Elevator systems described herein may seek to determine whether a scenario is available that gives a passenger the perception that the elevator system is timely and efficient. For example, rather than selecting the scenario described previously, it may be possible to reduce the ETW to 25 seconds, increase the ETT to 75 seconds, for a total ETD of 100 seconds. Although this is a longer overall travel time for the passenger, the ETW is below the 30 second threshold and the ETT is below the 90 second threshold. Thus, it is likely that the passenger will actually experience the latter scenario as being more efficient than what was actually the faster scenario. An ETA based system likely would not select what the passenger would perceive as the better ride due to the longer overall wait time.
  • Fig. 1 depicts one version of an elevator system (10).
  • the elevator system (10) includes multiple elevator cars (12) positioned within a plurality of elevator shafts (14).
  • the elevator cars (12) travel vertically within the respective shafts (14) and stop at a plurality of landings (16).
  • each of the various landings (16) includes an external destination entry device (18).
  • the elevator cars (12) include internal destination entry devices (20). Examples of destination entry devices include interactive displays, computer touch screens, or any combination thereof. Still, other structures, components, and techniques for destination entry devices are well known and may be used. Yet further, traditional up/down call signals may be used at a landing.
  • an elevator (10) is shown that is governed by a controller (30). It will be appreciated that versions of the controller (30) and the elevator (10) are described by way of example only and that various suitable systems, techniques, and components may be used to govern the movement of the elevator cars (12).
  • the controller (30) is a computer-based control system configured to assign new hall calls to one of a plurality of elevator cars.
  • the controller (30) may receive a plurality of suitable inputs from an information database (32) to aid in governing the assignment of hall calls.
  • the controller (30) is configured to receive inputs from a plurality of destination entry devices (18), (20) to aid in governing the movement of the elevator cars (12).
  • Examples of such inputs received by the controller (30) may include, but are not limited to, new destination calls from passengers, the status of each elevator, the current time, an average speed for an elevator, elevator load sensor information, elevator acceleration, and a designated handling capacity value. Values may be preprogrammed, measured, or include combinations thereof. For example, average elevator speed may be pre-programmed and elevator weight may be measured by a load sensor during operation. It will be appreciated that any suitable configuration of the controller (30) with various entry devices (18), (20) is contemplated.
  • the controller (30) may also include pre-programmed data-handling information and algorithms to facilitate management of the data received.
  • the controller (30) may receive information from a load cell indicating the overall passenger weight of an elevator car.
  • the controller (30) may be pre-programmed to estimate the number of individuals within an elevator car based upon total weight and/or the approximate available capacity.
  • the controller may also contain pre-programming associated with ETW, ETT, ETD, system degradation factors (SDF), elevator handling capacity (HC), and/or any other suitable factors.
  • Fig. 3 illustrates an alternate configuration of the controller (30).
  • the controller (30) sends and receives input from the information database (32).
  • the information database (32) receives inputs from the sensors (24) and the destination entry devices (18), (20).
  • the information database (32) sends data to the controller (30).
  • the controller (30) is tasked with assigning elevator cars (12) to a call signal based upon a calculated Call Cost ("CC") for each elevator car.
  • the controller (30) calculates the CC for each elevator car whenever a new call signal is activated to determine which elevator to assign to the call. CC calculations may be made at regular intervals, upon initiation of a hall call, during an elevator car's travel, and/or at any other suitable time.
  • the controller (30) sends the elevator car (12) with the lowest CC to respond to the call signal.
  • One method of calculating a CC is described in U.S. Patent 6,439,349 , the disclosure of which is incorporated herein by reference in its entirety.
  • SDFs System Degradation Factors
  • the SDF for an existing hall call is a function of the delay that one or more passengers traveling on the elevator car will experience as a result of the car's acceptance of the new hall call.
  • Each passenger is assigned a value for SDF.
  • Other waiting passengers, who have already been assigned to an elevator and will be riding the elevator when the waiting passenger who activated the call signal is picked up, may also be assigned a value for SDF.
  • an SDF value may be assigned to the waiting passenger who activated the call signal particularly where the waiting passenger would be subject to being delayed by current or known future passengers departing or entering the elevator.
  • the term passenger may be used to define a single passenger or a group of passengers. For example, if three individuals enter a single elevator car at the 19 th floor after selecting the 32 nd and 41 st floors on the external destination device, the controller (30) may separate the passengers into a passenger group for the 32 nd floor and a passenger group for the 41 st floor. Therefore, it is possible in some versions of this system that the term passenger refers to more than one passenger when referring to the value calculated for SDF.
  • ETD references the estimated time to the actual destination for the waiting passenger.
  • the value for ETD includes the Estimated Waiting Time ("EWT”) and the Estimated Traveling Time ("ETT”) as shown below in equation (2).
  • EWT Estimated Waiting Time
  • ETT Estimated Traveling Time
  • EWT the time that elapses from the registration of a destination call by a passenger until an elevator arrives to pick up the waiting passenger.
  • the value of ETT equals the time period lasting from the end of the EWT period (i.e. when the elevator doors open to pick up the waiting passenger) until the passenger arrives at the destination.
  • the destination selected by the waiting passenger will be used when calculating a value for ETD.
  • ETID is substituted for ETD.
  • ETID is referred to as the estimated time to the inferred destination. Destinations may be inferred from statistical data including the time of the day, floor of departure, and so on. The values for EWT and ETT are calculated using this inferred destination. Any suitable data, such as algorithms to determine inferred destinations, may be incorporated into the controller (30).
  • the controller (30) receives the call signal and begins determining which elevator car to assign. Assuming each floor measures 4 meters in height, the distance between the 15 th floor and 30 th floor is 60 meters. The controller (30) begins calculating a CC for an elevator car ascending from the lobby with two passengers who have respectively selected the 20 th and 26 th floors as their destinations. The elevator car has an average velocity of 3 m/s. In this version, the CC value for this elevator is a combination of the values of SDF and ETD.
  • ETD when calculating CC for this car equals 60 seconds.
  • the value of ETD is equal to 60 seconds because the values for EWT and ETT respectively equal 20 seconds and 40 seconds.
  • EWT equals 20 seconds because this is the calculated time necessary for the elevator to travel from the lobby to the 15 th floor to pick up the waiting passenger.
  • ETT equals 40 seconds because this is the calculated time necessary for the waiting passenger to arrive at the 30 th floor after leaving the departure floor.
  • ETT includes the 20 seconds necessary to travel non-stop from the 15 th floor to the 30 th floor, as well as 10 seconds for each stop at the 20 th and 26 th floors to drop off the passengers who entered the elevator at the lobby.
  • different values may be used for variables such as the average velocity and the average time necessary to stop at a floor.
  • the value of SDF for this elevator car would equal 20 seconds.
  • a separate SDF value is calculated for each existing passenger.
  • Each passenger will be present on the elevator only when the waiting passenger is picked up, not when the waiting passenger is dropped off. Assuming each passenger will be delayed 10 seconds in order to pick up the waiting passenger, each current passenger's value of SDF is 10 seconds.
  • the controller (30) may calculate the remaining CC values for at least one other elevator.
  • the controller (30) may award the elevator with the lowest CC to respond to a call signal.
  • the controller (30) may automatically assign an elevator car to respond to a call signal if the calculated CC value is below a specified threshold.
  • the handling capacity of an elevator system generally refers to the capacity of the elevator equipment to handle various numbers of people, the efficiency of the control system, and the building characteristics such as the number of floors and distance between floors. Elevator systems have a maximum handling capacity, but the handling capacity can also be reduced based on the mode of operation selected by the controller (30). Maximum handling capacity may be necessary during peak operating periods, but during off-peak times it may be advantageous to reduce the overall handling capacity of the system. For example, in accordance with versions described herein, longer ETD periods may actually result in the perception of a more efficient ride. However, extending the overall length of a passenger's ride will decrease the overall handling capacity of the elevator system. This will only be advantageous during off-peak times. Thus, it would be advantageous to provide controller (30) with an algorithm to adjust the handling capacity of the system based upon the current traffic type.
  • HC x that may vary the emphasis placed on the various factors used to calculate CC based upon traffic type.
  • HC x represents a value associated with the handling capacity of an elevator car to reflect the current traffic conditions of an elevator system. It will be understood by those skilled in the art that any suitable value may be used for HC x . Likewise, it will be understood by those skilled in the art that a value for HC x may correspond to a particular condition related to handling capacity during the elevator's operation. For example, the values of HC x may vary from a value of 0 when there is no elevator traffic to a value of 1 when the elevator system is operating at full capacity. Incorporating a value for handling capacity will allow for the system to provide passengers with the perception of a highly efficient ride during off-peak hours and to maximize efficiency during peak hours when needed. Thus, the perception of efficiency may be sacrificed for actual efficiency during peak times.
  • Fig. 4 depicts a flowchart showing one version of the steps for assigning a hall call incorporating HC x into the CC calculation.
  • the controller (30) receives an input in the form of an activated call signal.
  • the controller (30) obtains data from the information database (32) regarding the elevator system (10) and the activated call signal.
  • the controller (30) may obtain data relating to the destination selected if the waiting passenger used an external destination entry device, or an inferred destination if the waiting passenger used an up/down call signal.
  • the controller (30) Upon obtaining the suitable inputs, the controller (30) would assign a value to HC x . This step may encompass situations where a value for HC x has already been assigned. In this situation, the controller (30) would merely obtain the pre-programmed value and use it as the value of HC x . In other versions, the controller (30) may use various inputs to assign a value to HC x . For example, the controller (30) may assign a value to HC x based on the time of day or the current status of elevators. The controller (30) may assign a higher value to HC x where the elevators are at a high capacity. It will be understood by those skilled in the art that various techniques and systems may be used to judge an elevator's system capacity such as evaluating the number of current hall calls, current passengers, and waiting passengers.
  • the controller (30) calculates a CC value for each elevator car using any suitable formula. For example, equations (3) and (4) (shown below) may be used. Once calculated, the controller (30) may then assign the elevator car with the lowest CC value to respond to the call signal.
  • HC x may correspond to particular times of the day and/or conditions under which the elevator is operating.
  • a classification system may include the following, where the value of (x) equals:
  • up-peak (U) defines when the elevator system is at or close to full capacity with passengers traveling in a generally upwards direction relative to the lobby.
  • An up peak situation is a weekday morning at a commercial building when almost all employees arrive at work and ride the elevators to their respective floors.
  • a value for HC U may range, for example, from 0.75 to 1. It will be understood by those skilled in the art that other suitable values may be used including those that are higher or lower than the ranges provided.
  • down-peak (D) defines when the elevator system is at or close to full capacity with passengers traveling in a generally downward direction.
  • a value of HC D may range, for example, from 0.75 to 1.
  • HC D may, for example, be the same as that of HC U .
  • Off-peak refers to when the elevator system is at or close to zero capacity.
  • An off peak environment may include a situation where at least one elevator is idling.
  • One particular example of an off peak situation is a weekend at a commercial building where almost no employees are in the building using an elevator.
  • a value of HC o may range, for example, from 0.00 to 0.25.
  • HC s may be used that reflects the handling capacity of an elevator system during certain events or circumstances.
  • HC I may be used that reflects that interfloor activity of passengers in selecting different call signals during the ride and/or the activation of new call signals during the ride.
  • the value of SDF is multiplied by HC x .
  • the designation of which elevator car would respond to a call signal would be based solely on the waiting time of the passenger in accordance with perceived efficiencies. For example, the elevator car that could respond to the waiting passenger below thresholds above which passenger inconvenience occurs would be dispatched.
  • Fig. 5 illustrates a scenario where a number of passengers (A, B-1, B-2, C-1, C-2, and D) are already traveling on Elevators A-D.
  • Figs. 6-10 illustrate how a new passenger selecting a particular destination may be assigned different elevators depending on numerous factors considered by the controller.
  • Figs. 5-10 describe how an elevator system may respond differently to the same request depending on factors such as the amount of traffic experienced by the elevator system.
  • the controller is configured to assign the Elevator A-D with the lowest CC value to respond to the call signal from the new waiting passenger.
  • the controller calculates a CC value for each elevator car using a pre-programmed equation and, based upon this calculation, will assign the new passenger the elevator car having the lowest CC value.
  • the tables of Figs. 6-10 show data related to the calculation of CC for each elevator in the elevator system during a variety of different circumstances.
  • Equation (3) is used to calculate the CC for each elevator car in a variety of different circumstances.
  • Equation (4) is used to calculate the CC for each elevator car.
  • the value of HD x used when calculating the data shown in Figs. 6-10 varies from a minimum value of 0 to a maximum value of 1.
  • a new passenger may encounter the scenario shown in Fig. 5 and activate a call signal at the 15 th floor. Using an external destination device the passenger may indicate that they wish to travel from the 15 th floor to the 26 th floor.
  • the controller calculates a CC for each elevator using a pre-programmed equation and will assign the elevator car with the lowest CC value to respond to the call signal.
  • Elevator A traveling upwards from the lobby to the 30 th floor after picking up Passenger A. Elevator A is not currently assigned to address any call signals. Elevator B is traveling upwards from the 3 rd floor to the 9 th floor with Passenger B-1. Elevator B is assigned to respond to a call signal from Passenger B-2 at the 9 th floor to travel to the 28 th floor. Elevator C is at the 7 th floor traveling upwards with Passengers C-1 and C-2 to the 18 th floor. Elevator C is not currently assigned to address any call signals. Elevator D is at the 18 th floor traveling downwards to drop off Passenger D at the lobby. Elevator D is not currently assigned to address any call signals.
  • Modified ETD as used in Figs. 7-10 references the value of ETD as lowered by using a lower HC x coefficient compared to the value of ETD where HC x equals 1.
  • Modified SDF K as used in Fig. 10 references the value of SDF K as lowered by using a lower HC x coefficient compared to when HC x equals 1 when using Equation (4) to calculate CC.
  • Fig. 6 illustrates one set of data input into Equation (3) in accordance with the scenario described in Fig. 5 , where a new passenger is attempting to travel from the 15 th floor to the 26 th floor.
  • HC x equals 1, which is a value associated with operation during a peak time period.
  • the CC equals 45.8 seconds, which is calculated by combining the value of SDF k , EWT, and ETT, when HC x equals 1.
  • the value of EWT for Elevator A equals 12 seconds, which is the estimated time allotted for Elevator A to travel the 60 meters from the lobby to the 15 th floor at a speed of 5 m/s.
  • ETT is 23.8 seconds, which is the time necessary for Elevator A to travel non-stop from the 15 th floor to the 26 th floor (8.8 seconds), the time to allow the new passenger to board the elevator after the doors open until Elevator A resumes traveling to the 18 th floor (5 seconds), and the time to allow Elevator A to drop off Passenger A at the 18 th floor (10 seconds).
  • SDF k for Elevator A is 10 seconds, which represents the delay that would be experienced by Passenger A when picking up the new passenger.
  • the CC is 43.4 seconds, which is calculated in the same manner as for elevator A.
  • the value of EWT for Elevator B is 19.6 seconds, which is the time for Elevator B to drop off Passenger B-1 and pick up Passenger B-2 at the 9 th floor (10 seconds), and the time allotted for Elevator B to travel non-stop from the 3 rd floor to the 15 th floor (9.6 seconds).
  • the value of ETT is 13.8 seconds, which is the time allotted for Elevator B to travel non-stop from the 15 th floor to the 26 th floor (8.8 seconds) and the time period to allow the new passenger to board Elevator B after the doors open until Elevator B resumes traveling to the 26 th floor (5 seconds).
  • the value of SDF is 10 seconds, which is the time allotted for the delay experienced by Passenger B-2 when waiting for the new passenger to board Elevator B.
  • the value of CC is 48.6 seconds.
  • the value of EWT equals 4.8 seconds. This is the shortest waiting time of any elevator. This value represents the time needed for Elevator C to travel non-stop from the 7 th floor to the 15 th floor.
  • the value of ETT equals 23.8 seconds, which is the time needed for Elevator C to travel from the 18 th floor nonstop to the 26 th floor (8.8 seconds), the time to allow the new passenger to board Elevator C after the doors open until it resumes traveling to the 18 th floor (5 seconds), and the time to allow the elevator to drop off Passengers C-1 and C-2 at the 18 th floor (10 seconds).
  • the value of SDF k for Elevator C is 20 seconds. This represents the individual delay that would be suffered by Passengers C-1 and C-2 (10 seconds each) when picking up Passenger W.
  • Elevator D For Elevator D, the value of CC equals 50.2 seconds.
  • EWT equals 36.4 seconds, which is the longest waiting time of any elevator in this scenario. This value represents the time allotted for Elevator B to travel from the 18 th floor to the lobby (14.4 seconds), drop off Passenger D at the lobby (10 seconds), and travel nonstop from the lobby to the 15 th floor where the new passenger is waiting (12 seconds).
  • the value of ETT equals 13.8 seconds, which is the time needed for Elevator C to travel nonstop from the 15 th floor to the 26 th floor (8.8 seconds), and the time to allow the new passenger to board the elevator after the doors open until the elevator resumes traveling to the 18 th floor (5 seconds).
  • SDF k for Elevator D is zero because no current passengers of Elevator D would experience any delay if Elevator D were to respond to the new passenger's call signal.
  • Elevator B has the lowest CC at a value of 43.4 seconds using Equation (3).
  • one version of a system where the value of HD x may equal 1 is where the elevator system is performing at an Up Peak (U) period or a Down Peak (D) period.
  • U Up Peak
  • D Down Peak
  • Elevator C which has the lowest ETD, is not chosen because of the relatively high SDF k associated with inconveniencing multiple passengers.
  • Fig. 7 shows the difference between the calculated values of ETD when the value of HC x equals 1 and when the value of HC x equals 0.75.
  • the value of ETD where HC X equals 1 is labeled the "Original ETD.”
  • the value of ETD used to calculate CC in Fig. 7 where HC X equals 0.75 is referred to as the "Modified ETD.” As shown in Fig.
  • Elevator A would remain assigned to respond to the call signal as shown in Fig. 8 because the Elevator A would have the lowest CC value of 33.9 seconds.
  • Elevator A would be made if the value of HD x were to be reduced to zero as shown in Fig. 9 .
  • An HD x of zero would reflect an off-peak time period.
  • Fig. 10 illustrates the application of Equation (4) to the scenario of Fig. 5 .
  • the controller would assign Elevator C to respond to the call signal.
  • Elevator C's CC value is the lowest by having a value of 26.7 seconds.
  • the next closest CC value is 28.9 seconds for Elevator A.
  • Modified SDF K refers to the value of SDF K as affected by multiplying the original value by HC x . Equation (4) reduces the emphasis placed on SDF K when calculating CC as shown in Fig. 10 when comparing the respective values for SDF K and the modified SDF K for Elevators A, B, and C.
  • the value of SDF K for Elevator D was unaffected by adjusting the value of HD x as its value was zero.
  • Elevator C's original value for SDF K is the highest due to Passengers C-1 and C-2 being burdened by stopping at the 15 th floor to pick up Passenger W. Therefore, reducing the emphasis placed on SDF K when calculating CC substantially impacts the CC value for Elevator C.
  • the value of EWT is multiplied by HC x where HC x could range from 0-1 depending upon the emphasis to be placed on EWT when calculating an elevator's CC.
  • SDF k may include whether a waiting passenger will experience degradation in service.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)
  • Electrolytic Production Of Metals (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Claims (7)

  1. Procédé destiné à attribuer un nouvel appel de hall à l'une d'une pluralité de cabines d'ascenseur dans un système d'ascenseur, comprenant les étapes consistant à :
    (a) fournir une commande, la commande étant configuré de façon à commander le système d'ascenseur ;
    (b) recevoir un signal d'appel de hall, le signal d'appel de hall provenant d'un palier d'ascenseur ;
    (c) transmettre l'appel de hall à la commande ;
    (d) programmer la commande avec un seuil de temps d'attente estimé (EWT), dans lequel le seuil de temps d'attente estimé (EWT) est une valeur de temps au-delà de laquelle un passager est susceptible de s'impatienter en attendant l'arrivée de l'une de la pluralité de cabines d'ascenseur ;
    (e) programmer la commande avec un seuil de temps de trajet estimé (EWT), dans lequel le seuil de temps de trajet estimé (EWT) est une valeur de temps au-delà de laquelle un passager est susceptible de s'impatienter en attendant l'arrivée de la cabine d'ascenseur à sa destination ;
    (f) calculer un temps d'attente estimé (EWT) pour chacune de la pluralité de cabines d'ascenseur ;
    (g) calculer un temps de trajet estimé (ETT) pour chacune de la pluralité de cabines d'ascenseur ;
    (h) déterminer si le temps d'attente estimé (EWT) pour chacune de la pluralité de cabines d'ascenseur se situe en deçà du seuil de temps d'attente estimé (EWT) ;
    (i) déterminer si le temps de trajet estimé (ETT) pour chacune de la pluralité de cabines d'ascenseur se situe en deçà du seuil de temps de trajet estimé (ETT) ; et
    (j) attribuer l'une de la pluralité de cabines d'ascenseur à l'appel de hall en prenant en compte le fait que le temps d'attente estimé (EWT) et le temps de trajet estimé (ETT) pour chacune de la pluralité de cabines d'ascenseur se situent en deçà du seuil de temps d'attente estimé (EWT) et du seuil de temps de trajet estimé (ETT).
  2. Procédé selon la revendication 1, dans lequel l'étape consistant à attribuer l'une de la pluralité de cabines d'ascenseur à l'appel de hall comprend une étape consistant à attribuer celle de la pluralité de cabines d'ascenseur à l'appel de hall qui se situe en deçà du seuil de temps d'attente estimé (EWT), en deçà du seuil du temps de trajet prévu (ETT), et qui présente le temps estimé le plus court pour atteindre sa destination (ETD).
  3. Procédé selon la revendication 1, dans lequel l'étape consistant à attribuer l'une de la pluralité de cabines d'ascenseur à l'appel de hall comprend une étape consistant à attribuer celle de la pluralité de cabines d'ascenseur à l'appel de hall qui se situe en deçà du seuil de temps d'attente estimé (EWT), et qui présente le temps estimé le plus court pour atteindre sa destination (ETD).
  4. Procédé selon la revendication 1, dans lequel l'étape consistant à attribuer l'une de la pluralité de cabines d'ascenseur à l'appel de hall comprend une étape consistant à attribuer celle de la pluralité de cabines d'ascenseur à l'appel de hall qui se situe en deçà du seuil de temps de trajet estimé (ETT), et qui présente le temps estimé le plus court pour atteindre sa destination (ETD).
  5. Procédé selon la revendication 1, dans lequel l'étape consistant à attribuer l'une de la pluralité de cabines d'ascenseur à l'appel de hall comprend les étapes consistant à :
    (i) attribuer une valeur à un coefficient de capacité d'acheminement (HCx) de façon à refléter les conditions de trafic actuel du système d'ascenseur ; et
    (ii) prendre en compte le coefficient de capacité d'acheminement (HCx) de façon à déterminer celle de la pluralité de cabines d'ascenseur à attribuer à l'appel de hall.
  6. Procédé selon la revendication 5, dans lequel le coefficient de capacité d'acheminement (HCx) est une valeur qui, au cours des heures de pointe du système d'ascenseur, met moins l'accent sur le fait que chacune de la pluralité de cabines d'ascenseur se situe en deçà du seuil de temps de trajet estimé (ETT) et du seuil ETW et qui met plus l'accent sur le temps estimé le plus court pour atteindre la destination (ETD).
  7. Procédé selon la revendication 5, dans lequel le coefficient de capacité d'acheminement (HCx) est une valeur qui, en dehors des heures de pointe du système d'ascenseur, met plus l'accent sur le fait que chacune de la pluralité de cabines d'ascenseur se situe en deçà du seuil de temps de trajet estimé (ETT) et du seuil de temps d'attente estimé (ETW) et qui met moins l'accent sur le temps estimé le plus court pour atteindre la destination (ETD).
EP08798845A 2007-08-28 2008-08-28 Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination Not-in-force EP2183177B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP10005426A EP2213604B1 (fr) 2007-08-28 2008-08-28 Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US96837407P 2007-08-28 2007-08-28
PCT/US2008/074563 WO2009029697A1 (fr) 2007-08-28 2008-08-28 Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination

Related Child Applications (1)

Application Number Title Priority Date Filing Date
EP10005426.1 Division-Into 2010-05-25

Publications (2)

Publication Number Publication Date
EP2183177A1 EP2183177A1 (fr) 2010-05-12
EP2183177B1 true EP2183177B1 (fr) 2012-03-21

Family

ID=40076743

Family Applications (2)

Application Number Title Priority Date Filing Date
EP10005426A Not-in-force EP2213604B1 (fr) 2007-08-28 2008-08-28 Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination
EP08798845A Not-in-force EP2183177B1 (fr) 2007-08-28 2008-08-28 Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination

Family Applications Before (1)

Application Number Title Priority Date Filing Date
EP10005426A Not-in-force EP2213604B1 (fr) 2007-08-28 2008-08-28 Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination

Country Status (7)

Country Link
US (2) US8104585B2 (fr)
EP (2) EP2213604B1 (fr)
AT (2) ATE550282T1 (fr)
BR (1) BRPI0816080A2 (fr)
CA (2) CA2824814C (fr)
ES (2) ES2384695T3 (fr)
WO (1) WO2009029697A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9896305B2 (en) 2015-05-07 2018-02-20 International Business Machines Corporation Personalized elevator dispatch

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5220114B2 (ja) * 2008-08-25 2013-06-26 三菱電機株式会社 エレベータの群管理制御装置
JPWO2010032623A1 (ja) * 2008-09-19 2012-02-09 三菱電機株式会社 エレベーター群管理装置
US8925689B2 (en) 2011-01-19 2015-01-06 Smart Lifts, Llc System having a plurality of elevator cabs and counterweights that move independently in different sections of a hoistway
US9365392B2 (en) 2011-01-19 2016-06-14 Smart Lifts, Llc System having multiple cabs in an elevator shaft and control method thereof
US8430210B2 (en) 2011-01-19 2013-04-30 Smart Lifts, Llc System having multiple cabs in an elevator shaft
JP6162702B2 (ja) 2011-09-08 2017-07-12 オーチス エレベータ カンパニーＯｔｉｓ Ｅｌｅｖａｔｏｒ Ｃｏｍｐａｎｙ 動的交通量分布解法を備えたエレベータシステム
WO2013053648A1 (fr) * 2011-10-14 2013-04-18 Inventio Ag Système d'ascenseur à cabines multiples
US8712682B1 (en) * 2012-03-29 2014-04-29 Google Inc. Estimating travel time
US9440818B2 (en) 2014-01-17 2016-09-13 Thyssenkrupp Elevator Corporation Elevator swing operation system and method
CN107074480B (zh) * 2014-09-12 2020-06-12 通力股份公司 电梯系统中的呼叫分配
US10217174B2 (en) * 2015-09-23 2019-02-26 International Business Machines Corporation Real-time wait estimation and prediction via embedded sensors
CN107010496B (zh) * 2015-12-22 2020-11-13 奥的斯电梯公司 包括动态电梯轿厢呼叫调度的电梯系统
EP3560870A3 (fr) 2018-04-24 2019-11-20 Otis Elevator Company Analyse cognitive automatique d'ascenseurs pour réduire le temps d'attente des passagers
CN110950197B (zh) * 2019-12-12 2022-04-01 中国联合网络通信集团有限公司 一种智能电梯的选择方法及智能电梯控制装置

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CH658852A5 (de) * 1982-04-08 1986-12-15 Inventio Ag Gruppensteuerung fuer aufzuege mit einer einrichtung fuer die steuerung des abwaertsspitzenverkehrs.
US5024295A (en) * 1988-06-21 1991-06-18 Otis Elevator Company Relative system response elevator dispatcher system using artificial intelligence to vary bonuses and penalties
ATE102166T1 (de) * 1990-02-22 1994-03-15 Inventio Ag Verfahren und einrichtung zur sofortigen zielrufzuteilung bei aufzugsgrupppen, aufgrund von bedienungskosten und von variablen bonus/malus-faktoren.
FI88789C (fi) * 1990-05-10 1993-07-12 Kone Oy Foerfarande foer val av en hiss i en hissgrupp
JP2583700B2 (ja) * 1991-09-18 1997-02-19 三菱電機株式会社 エレベータの割当装置
EP0676356A3 (fr) * 1994-04-07 1996-09-18 Otis Elevator Co Système de répartition pour ascenseurs.
US5865274A (en) * 1995-10-24 1999-02-02 Kabushiki Kaisha Toshiba Elevator group management control apparatus and elevator group management control method
WO1999050164A1 (fr) * 1998-03-30 1999-10-07 Mitsubishi Denki Kabushiki Kaisha Organe de commande d'ascenseur
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
US6935467B1 (en) * 2001-02-23 2005-08-30 Kone Corporation Method for controlling an elevator group
US6672431B2 (en) * 2002-06-03 2004-01-06 Mitsubishi Electric Research Laboratories, Inc. Method and system for controlling an elevator system
FI113163B (fi) * 2002-10-01 2004-03-15 Kone Corp Hissiryhmän ohjausmenetelmä
US6976560B2 (en) * 2003-04-12 2005-12-20 William Newby Service/equipment equalization destination system for elevators
US7475757B2 (en) * 2003-06-23 2009-01-13 Otis Elevator Company Elevator dispatching with balanced passenger perception of waiting
FI115130B (fi) * 2003-11-03 2005-03-15 Kone Corp Menetelmä ja laite hissiryhmän ohjaamiseksi
FI115396B (fi) * 2004-04-15 2005-04-29 Kone Corp Hissijärjestelmän ohjausmenetelmä
CN1972858B (zh) * 2004-06-21 2011-07-06 奥蒂斯电梯公司 在竖井内包括多个轿厢的电梯系统及其控制方法
US7743890B2 (en) * 2007-06-12 2010-06-29 Mitsubishi Electric Research Laboratories, Inc. Method and system for determining instantaneous peak power consumption in elevator banks

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9896305B2 (en) 2015-05-07 2018-02-20 International Business Machines Corporation Personalized elevator dispatch

Also Published As

Publication number Publication date
CA2824814A1 (fr) 2009-03-05
CA2696913C (fr) 2014-08-12
ATE550282T1 (de) 2012-04-15
EP2183177A1 (fr) 2010-05-12
BRPI0816080A2 (pt) 2017-06-06
CA2824814C (fr) 2015-02-03
ES2384670T3 (es) 2012-07-10
ES2384695T3 (es) 2012-07-11
CA2696913A1 (fr) 2009-03-05
WO2009029697A1 (fr) 2009-03-05
US8276715B2 (en) 2012-10-02
US20120090923A1 (en) 2012-04-19
US8104585B2 (en) 2012-01-31
US20090133967A1 (en) 2009-05-28
EP2213604B1 (fr) 2012-03-21
ATE550281T1 (de) 2012-04-15
EP2213604A1 (fr) 2010-08-04

Similar Documents

Publication Publication Date Title
EP2183177B1 (fr) Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination
JP2935854B2 (ja) エレベーター制御装置及びエレベーター制御方法
JP4098366B2 (ja) エレベータ群の制御
EP2195270B1 (fr) Système d'ascenseur
US5663538A (en) Elevator control system
EP2183178B1 (fr) Maitrise de la saturation pour systemes d'envoi a destination
JP3042904B2 (ja) エレベータ配送システム
US8800723B2 (en) Elevator system having floors locked from receiving service
US6439349B1 (en) Method and apparatus for assigning new hall calls to one of a plurality of elevator cars
WO2019087250A1 (fr) Système et procédé d'opération d'évitement de congestion
GB2324170A (en) Elevator dispatch system
JPH08198529A (ja) ダブルデッキエレベーターの制御装置
CN115057308A (zh) 电梯调配方法

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

17P Request for examination filed

Effective date: 20100215

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 HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA MK RS

DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

RIN1 Information on inventor provided before grant (corrected)

Inventor name: PETERS, RICHARD, D.

Inventor name: SMITH, RORY, S.

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

Ref country code: CH

Ref legal event code: NV

Representative=s name: E. BLUM & CO. AG PATENT- UND MARKENANWAELTE VSP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 550281

Country of ref document: AT

Kind code of ref document: T

Effective date: 20120415

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602008014314

Country of ref document: DE

Effective date: 20120516

REG Reference to a national code

Ref country code: NL

Ref legal event code: T3

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2384670

Country of ref document: ES

Kind code of ref document: T3

Effective date: 20120710

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

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120621

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

LTIE Lt: invalidation of european patent or patent extension

Effective date: 20120321

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

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120622

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

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

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

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

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120721

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

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

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120723

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

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

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

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

26N No opposition filed

Effective date: 20130102

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 FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

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

Ref country code: MC

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

Effective date: 20120831

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602008014314

Country of ref document: DE

Effective date: 20130102

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

Effective date: 20130430

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

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

Ref country code: IE

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

Effective date: 20120828

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120621

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

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

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

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

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20120321

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

Ref country code: LU

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

Effective date: 20120828

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

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20080828

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

Ref country code: AT

Payment date: 20150820

Year of fee payment: 8

Ref country code: NL

Payment date: 20150830

Year of fee payment: 8

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

Ref country code: GB

Payment date: 20160819

Year of fee payment: 9

REG Reference to a national code

Ref country code: NL

Ref legal event code: MM

Effective date: 20160901

REG Reference to a national code

Ref country code: AT

Ref legal event code: MM01

Ref document number: 550281

Country of ref document: AT

Kind code of ref document: T

Effective date: 20160828

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

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

Ref country code: NL

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

Effective date: 20160901

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

Effective date: 20170828

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

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

Ref country code: DE

Payment date: 20180823

Year of fee payment: 11

Ref country code: ES

Payment date: 20180921

Year of fee payment: 11

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

Ref country code: FI

Payment date: 20180822

Year of fee payment: 11

Ref country code: CH

Payment date: 20180822

Year of fee payment: 11

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602008014314

Country of ref document: DE

REG Reference to a national code

Ref country code: FI

Ref legal event code: MAE

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

Ref country code: FI

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

Effective date: 20190828

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

Ref country code: CH

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

Effective date: 20190831

Ref country code: LI

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

Effective date: 20190831

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

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20210108

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