EP1276691B1 - Commande d'appel cible pour ascenseurs - Google Patents

Commande d'appel cible pour ascenseurs Download PDF

Info

Publication number
EP1276691B1
EP1276691B1 EP01914940A EP01914940A EP1276691B1 EP 1276691 B1 EP1276691 B1 EP 1276691B1 EP 01914940 A EP01914940 A EP 01914940A EP 01914940 A EP01914940 A EP 01914940A EP 1276691 B1 EP1276691 B1 EP 1276691B1
Authority
EP
European Patent Office
Prior art keywords
lift
elevator
destination call
job
registered
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.)
Revoked
Application number
EP01914940A
Other languages
German (de)
English (en)
Other versions
EP1276691A1 (fr
Inventor
Jana Koehler
Kilian Schuster
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
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=26070754&utm_source=***_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=EP1276691(B1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Inventio AG filed Critical Inventio AG
Priority to EP01914940A priority Critical patent/EP1276691B1/fr
Publication of EP1276691A1 publication Critical patent/EP1276691A1/fr
Application granted granted Critical
Publication of EP1276691B1 publication Critical patent/EP1276691B1/fr
Anticipated expiration legal-status Critical
Revoked 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

Definitions

  • the invention relates to a destination call control for elevators as defined in the claims.
  • an elevator control is used to Cabin calls on the different floors of a building to use.
  • the drive of an elevator knows as commands just the instructions - drive up -, - drive to below -, - door open - and - door closed -.
  • a Destination call control give the passengers already before the Entering an elevator, or an elevator car her desired destination floor, for example via a telephone-like keyboard, a so-called terminal. Out the position of the terminal is the access floor for the Destination call control known. After entering the Destination floor, determines an allocation algorithm of Control the elevator of the elevator group, which for the passenger the fastest and most comfortable transport his goal. The terminal shows the passenger this elevator the group of elevators and the passenger can now rest in the appropriate marked elevator issued. If the elevator stops to get in, the destination will be of the passenger, for example via a display device confirmed in the door frame. In the cabin itself are no Buttons for entering targets more available. To this Way, by using a destination call control Passengers with identical transport destination are grouped and thereby increases the transport capacity of the elevator system become.
  • An example known from EP 0 699 617 A1 Destination call control is also capable of individual Identify passengers. For each identified Passengers are granted access to one Information store additional information regarding Entry and exit position, its space requirements and possibly additional service requirements, in which Determination of the optimal transport option considered.
  • the invention is based on the object Specify destination call control for elevator systems, which are next to an increase in transport performance also flexible and is robust and in particular individual and / or collective transport needs of passengers considered.
  • the invention is given by a Method for sequence planning with the in claim 1 given characteristics, which in particular thereby that is a situation-based Search method for determining the optimal driving sequence is provided.
  • a device-based solution is through a destination call control according to the definition of claim 6 given, which is an organization of traffic using a so-called planning system.
  • the planning system works according to one situation-based search method and determined destination call based on the current operating state of Elevator installation and the target state to be produced Elevator installation the situation-specific optimum driving sequence.
  • the inventive application of a situation-based Search method essentially offers the advantage that at any relevant change in the current situation, such as upon registration of a new trip request, errors in Execution of a sequence or the like, in extreme cases after each running sequence a completely new one current driving sequence is determined, and the elevator drive then do this.
  • each of the current operating status and the desired Target operating state of the elevator system on the basis of Facts in a state description declarative summarized.
  • This in the description of the condition shown to be reached state change of Elevator system is in translated form as part of a Situation diagram, which is described below, the Planning system forwarded.
  • the determined driving sequence plan is determined by the planning system designed so that the desired state change in Execution of the driving sequence plan can be achieved.
  • each invention leads exclusively for the current planning situation represents the optimum Drive sequence.
  • the optimization can be based on that very different criteria, whereby the Objectives of optimization from increasing the performance of the Elevator, reducing the waiting and / or operating and Travel times of the passengers or the improvement of a balanced ride management and the like.
  • the planning process advantageously takes time thereby limiting that computing power and memory requirements are limited.
  • the search method finds the optimal or nearly optimal driving sequence.
  • the expert is for it so-called anytime algorithms known for such Search method can be used.
  • the state description is preferred together with an operator description in the Presentation of the situation in translated form to the planning system fed.
  • the operator description becomes the configuration time, preferably when installing the system at the customer communicated the inventive destination call control.
  • she contains operators, which elementary state transitions of Specify lift system.
  • the operators form as Elementary building blocks for the to be constructed Road trip solution the basis of the determined Driving sequence plan.
  • the planning system chooses the Operators to be used in the solution Operators description off, determines concrete values for Operator parameter as well as an arrangement order in which Operators occur in the driving sequence plan. These Order of arrangement specifies the Execution order of the operators in the plan, that is, the Ride a row.
  • the embedding of a planning system as the core of Destination call control is either in a central concept or in a decentralized concept or a combination of centralized and decentralized concept possible.
  • the communication between the terminals and the elevators is easy to organize because all communication via a central office, the central job manager, runs.
  • the Jobs are organized by a central job manager in a queue, a so-called “first in-first out "data structure. This organization is simple and ensures a clear processing order.
  • the terminals have only the Destination call input of the passenger and the display of the central Jobmanager booked elevator to process and All you need is a simple software. What the use simpler and cheaper terminals.
  • the Terminals equipped with intelligent booking software.
  • the communication between the terminals and the job managers the individual elevators are preferably made use of of contract network protocols.
  • the job manager of the individual Elevators themselves are able to parallel jobs organize and manage their status correctly.
  • the central and decentralized concept of the job manager can also combined with each other in a destination call control become. Any number of job managers can work in a network present, which control one or more elevators.
  • the elevator can be a any number of elevators with any layout include. So can several elevators with one different number of decks in a group, one so-called heterogeneous multidecker group, work together.
  • the structure as a multi-agent system enables a modular Implementation of destination call control, in which individual Components, the so-called agents, e.g. Planning system, doors, drive, taxi driver arbitrary can be exchanged without affecting the overall system must be changed.
  • agents e.g. Planning system, doors, drive, taxi driver arbitrary
  • An event-driven activation of the agents in one Multi-agent system makes the control much more robust against occurring errors. For example, one falls Landing door on a floor due to a faulty Contact, the job manager can either Arrange evacuation drive or the taxi driver first have the plan still running. For further passenger requests may be the error Configuration Manager will be notified, all affected components of the system informed that this Floor of this elevator temporarily unattended can be. Failure of components does not mean that immediate failure of the overall system, as long as the Safety of passengers is ensured.
  • Figure 1 shows schematically the structure of a inventive destination call control 1 with situational sequence planning of the traffic volume a single lift.
  • the destination call control is as a multi-agent system built up. Basis of the multi-agent system makes a powerful communication network 2, over which three distributed in the building facilities for Destination call input, so-called terminals 3.1,3.2,3.3, with a decentralized job manager 4.
  • a communication network 2 is a Architecture chosen for spontaneous networking. At this Execution is a well-known ad-hoc network with the Designation IRON provided. IRON supports a spontaneous Networking and is therefore a crucial requirement for a configuration control.
  • any number of components can be in the network Sign in.
  • the traditional group concept of elevators is thus superfluous and in particular can be in a group any number of elevators with whole different layout be present.
  • Agents can inform each other about changes and prepare information and your own flow logic integrate.
  • An agent can find out via broadcast which other agents have logged into the network as well Send messages to other agents. Furthermore, a Subscribe agent information to another agent.
  • the individual components of this multi-agent system is next to the terminals mentioned above the job manager 4, which has all the components necessary for the logical and physical control of an elevator are necessary integrated.
  • a planning system or planner 5 5 a broker 6, a door manager 7, a taxi driver 8, the Drive 9 of the elevator and an observer 10.
  • the terminals 3.1.3.2.3.3 are more intelligent Equipped booking software and ask directly at Job Manager 4 for a transport offer for each registered destination call.
  • the communication between Terminals and job managers 4 takes place by means of Contract network protocols.
  • Each of the terminals is 3.1.3.2.3.3 with a device for the identification of passengers equipped to which a configuration manager 11 belongs.
  • each terminal can Interrogate passenger data from configuration manager 11 and on forward the broker 6. So every terminal can be used for Example check whether the currently registered passenger has a Has access permission to the desired destination floor. Is the Checking successfully, the terminal asks the job manager 4 of the elevator after his transport offer.
  • the planner 5 plans the optimal operation of the new one Passengers taking into account the current, lift-specific traffic situation and generates one optimal plan, which then to control the drive. 9 the elevator is passed on to broker 6, which continues is described below. Starting point for the planner 5 is an always present situation representation, in the broker enters 6 new passengers during the Observer removed 10 passengers carried.
  • the broker 6 communicates over a two-stage Contract network protocol with the three terminals 3.1.3.2.3.3. He accepts the entries of the terminals 3.1.3.2.3.3, carries she in the situation representation of the planner 5, checks The generated optimal plan then, how the new scheduled passenger on the transport already booked passengers affects and tells the terminal that Transport offer with. No plan could be found because the problem for example due to insoluble Conflicts between the passenger groups for this elevator insoluble, so informed the broker 6 the corresponding Terminal also above. If the passenger is booked, send the broker 6 the taxi driver 8 the current driving sequence plan. The terminal will now display on the display.
  • the observer 10 monitors the condition of the elevator installation and follows up the situation representation for the planner 5. Thus, if he finds that the elevator has stopped on one floor and the doors have been opened correctly, then all passengers are marked as " served ", to whom boarded is valid and whose destination corresponds to this floor. Passengers waiting there will be marked -boarded as they board when the elevator arrives.
  • the observer 10 has no knowledge of the plan or activities of the taxi driver 8, but relies solely on the information he has subscribed to the drive 9 and the door manager 7. This is a prerequisite in order to ensure that the situation representation is tracked correctly according to the actually occurring state changes even when a special operation, such as triggering the fire control, which takes over the control of the drive 9 and interrupts the taxi driver normal operation.
  • the taxi driver 8 moves his current plan, i.e. he sends the appropriate commands to the drive 9 the elevator and the drives of the doors. He knows from his current plan, where the elevator next scheduled to keep should and how long the doors need to be opened so that all passengers have enough time to get in and out. How many passengers at a stop change state, was already determined by the planner 5. Does that have Taxi driver 8 no plan, so he releases the elevator, so that it can be parked. In any Situation allows the taxi driver 8 his current timetable against the current plan sent to him by broker 6 will, replace. How this change takes place depends on it in which execution state the taxi driver 8 located. For example, a once started Stop process from the old plan has to be finished first, before the taxi driver 8 the first stop from the new plan can start.
  • the drive 9 executes the drive and stop commands that he From the taxi driver 8 receives, he also learns the travel times the elevator between each floor. Created the time table to the optimizer 5 for the optimization Available and also reports where the elevator is currently located and in which direction he drives or whether he is straight stops.
  • the door manager 7 manages all the doors of the elevator and monitors that the doors open and close correctly. It can doors on different sides of a cabin to be available. He also determines the door opening and Close the doors and tell the planner 5 for the doors Optimizing the service times of passengers with.
  • Each of the components is as an independent agent implemented when certain events occur independently carries out actions. In particular, can thereby superimposing various events. So can to Example of the broker 6 at the same time the inquiries various terminals 3.1.3.2.3.3 accept and the Planner 5 submit.
  • the decentralized job manager 4 can be parallel make an offer for several jobs while posting other jobs is still pending. The jobs are only then binding when the corresponding terminal books.
  • Figure 2 shows a pool of requested and offered Jobs Job1 to Job4 for a decentralized job manager 4.
  • Each Terminal 1, 2 usually only has a specific Job Job X or Job Y, who wants to book it on a lift. It sends Therefore this job to all known Jobmanager 4 of the Group of elevators, of which it is the drive data knows if the associated elevator is both on and off Exit landing of the passenger. unnecessary Requests to elevators, which are not in principle for transport come into question are avoided.
  • the decentralized job manager 4 has two types of jobs: On the one hand, these are jobs, the jobs X, which have been requested and for which job manager 4 must calculate an offer, On the other hand, the jobs Y for which the job manager is 4 has already made an offer, but does not yet know whether the terminal will really book with him.
  • Embodiment is only a single elevator available.
  • the elevator can also be part of an elevator group.
  • the invention is without limitation to such elevator groups applicable.
  • Even with an elevator group ask the terminals 3.1,3.2,3.3 directly to the job managers 4 of the individual Lifts after a transport offer.
  • the terminals 3.1.3.2.3.3 self-collect these offers, compare these and calculate the optimal booking of the Passenger.
  • Each requested elevator counts independently of the other taking into account the current, lift-specific traffic situation its optimal Road sequence plan for serving the new passenger.
  • the Offer of each requested elevator is sent to the terminal who chooses the best offer and the corresponding elevator with the transport of the passenger instructed.
  • Job manager 4 confirms the booking the terminal from which the transport offer has been requested is, the booking becomes binding and becomes the passenger displayed on the terminal. If a job manager does not answer more, so the terminal responds to it and does not wait endless on the missing offer.
  • Terminals 3.1.3.2.3.3 in conjunction with the Configuration Manager 11 will be the properties of Passengers P1, P2 and in particular the destination calls, the Passengers P1, P2 as input variables of the destination call control 1 forwarded to the broker 6, who in the Presenting situation representation of the planner 5, as in Figure 2 shown.
  • any planning operation e.g. by Registration of a destination call is started, which determined Operating state and the desired target state, ie the too reaching state change of the elevator in one for the Planning system understandable state description 14 declaratively assembled, which is shown in Figure 3.
  • the state description 14 shown here in FIG. 3 is in the Plandar einstician PDDL after McDermott he al. 1998, expressed.
  • the skilled person is also others Modeling languages known in terms of their To distinguish expressiveness, and which he to Description of the situation representation can use, without that changes the essence of the invention. However, that is When choosing a planning system, make sure that this powerful according to the modeling Planning algorithms provides.
  • the planning system 3 is first informed of the registered passengers P1, P2 and the floors f1 to f7 of the building in an object declaration 15. For each object, a typed constant is introduced. For the elevator considered here, these are the waiting passenger P1, the passenger P2 already in the cabin, and all seven floors f1 to f7. (: Objects (p1 - passenger) (p2 - passenger) (f1, f2, f3, f4, f5, f6, f7 - floor))
  • topology description 16 the (upper? Fi,? Fj) Specifications, respectively, that the floor fj above the Floor fi lies.
  • the representation of the building topology is not mandatory.
  • other versions of the procedure also on the explicit Topology description 16 of the building under the assumption be dispensed with that from each floor of each other Floor can be served by the elevator.
  • the current transport order 17 with the destination calls of the passengers P1 and P2 consists of entry floors, origin, and destination floors, destin, as (: init (origin p1 f2) (origin p2 f1) (destin p1 f7) (destin p2 f5) (boarded p2).
  • the transport order 17 contains a previously planned Sequence also the information, boarded P2, namely, that passenger P2 has already boarded and is in the Cabin is located. This information was provided by the observer 10 used in the description of the condition.
  • the observer 10 sets the current position 18 of the elevator car as (lift-at f4)) is expressed in the state description 14.
  • the goal 19 for the planning system 5 is formulated in the state description 14 as: (: goal (forall (? p - passenger) (served? p)).
  • the planning system 3 is also given an operator description.
  • a stop operator and an operator for ascending -up- and an operator for descending -down- for modeling the state transitions between the initial state and the destination state of the elevator are transferred in the operator description.
  • the expert also knows other operators with which the desired change in the elevator state can be achieved. If necessary, this does not change the essence of the invention if the parameters are correspondingly defined.
  • PDDL syntax according to McDermott et al.
  • the uphill operator -up- appears as: (: action up : parameters (? f1 - floor? f2 - floor) : precondition (and (lift-at? f1) (upper? f1? f2)) : effect (and (lift-at? f2) (not (lift-at? f1)))))
  • the down-down operator is expressed as: (: action down : parameters (? f1 - floor? f2 - floor) : precondition (and (lift-at? f1) (upper? f2? f1)) : effect (and (lift-at? f2) (not (lift-at? f1)))))
  • the stop operator signals the control of the drive 9 the elevator that holds the cabin on a specific floor f1 to f7 has to stop.
  • the stop operator is in here illustrated first embodiment defined that he includes the opening and closing of the doors.
  • the Opening and closing of the car doors can also as separate additional basic instruction to the door manager 7 an elevator can be considered or it can be the stop operator be refined so that an elevator too the doors can open and close.
  • the up-and-down operators - down- give the control-technical instruction to the Drive control, the drive 9 in the corresponding To set the direction in motion.
  • a change in the passenger condition is basically only possible with a stop of the cabin. outgoing of rational behavior of the passengers, join in a scheduled stop the elevator car on a Floor all passengers on this floor - originally waiting to be transported to the cabin and All passengers leave the cabin when they are on their way Destination floor - arrives.
  • the thereby occurred Change is here with the help of the observer 10 in the stop operator registered and thus during the sequence planning considered by the planning system 5.
  • the stop operator becomes an instruction for the drive 9 effective when the in-effect coded Criteria are all met or have occurred. Will in the example described here in the stop operator?
  • P2 increases according to the state description 14 and of the behavioral model when, as in the stop operator as - effective- the operator instance stop (f5) described, -boarded p2 and -destin p2 f5- apply.
  • Planning systems 5 are already known from other technical fields.
  • the planning system 5 selects when entering the 14 independently based on the over the Operator description provided operators Instances and also determines the order in determined travel sequence plan 20.
  • the planning system 5 determines the parameters for the three operators -stop-, -up-, -down-, which cause a desired state change.
  • This calculated optimal plan 13 is sent to the broker 6 passed.
  • the broker 6 checks the generated optimal Plan to see how the newly scheduled passenger P1 on the transport of the already booked passenger and informs the terminal about the transport offer.
  • the taxi driver 8 drives this current driving sequence plan 20 from, i. he sends the appropriate commands in the form of respective operators to the drive 9 of the elevator and the Drive the door.
  • This sequence of operations 20 causes the elevator car in the Step 0 from the current floor f4 on which they are is the next stop on floor f5 -stop f5-drives. There, the elevator car stops according to step 1 stop f5- and the car door opens in a given time and closes so that the passenger exits P2 and thus served, served, is.
  • step 2 the elevator car moves down from f5 to f2 -down f5 f2- and stop in step 3 on floor f2 -stop f2-.
  • There passenger P1 climbs.
  • the Step 4 the elevator moves upwards from floor f2 Floor f7 -up f2 f7- and stops in the last step 5 on Floor f7 -stop f7-.
  • This sequence 13 all passengers P1, P2 transferred to the state -served- and the Goal formulation 10 of the driving sequence planning is thus reached.
  • the observer 10 monitors the condition of the elevator installation and continuously updates the situation representation for the planner 5. In step 1, he therefore states that the elevator has stopped on the floor f5 and the doors have been opened correctly; he marks the passengers P2 as -served. At step 2, the observer 10 marks the passenger P1 waiting there for floor f2 as boarded. Finally, the elevator car stops on the floor f7 and after the doors have been opened correctly, the observer 10 also sets the passenger P1 in the situation description as served and the current position 9 of the elevator car in the status display 5 on floor f7.
  • This created driving sequence plan 20 will not now mandatory completely executed, but when state, or the characteristics of passengers and / or the facility change relevant before it is completely executed According to the invention, a next planning cycle is started and an optimal driving sequence plan for the new planning situation 20 created. There is therefore no plan modification.
  • FIG. 5 shows schematically the structure and the basic structure a second embodiment of the inventive Destination call.
  • the destination call controller 25 includes a central job manager 26 and two decentralized job managers, a configuration manager 29 and representative of all existing terminals a terminal 30, which via a Communication network 31 communicate with each other.
  • the structure and function of decentralized job managers 27,28 correspond essentially to those of the decentralized one Job Manager 4 from the first embodiment.
  • the destination call control organizes here as so-called Group control the traffic of an elevator group with two Elevators A and B in a building with stops on seven floors.
  • the planning task arises as follows:
  • the elevator car A momentarily moves upwards; she is currently on floor f2 and can be the floor f3 still reach.
  • the elevator car B is currently up Floor f1. Elevator A transports a passenger P1 Access restriction on floors 3 and 4, the target Floor f7 is specified while elevator B is empty. In In this situation, a new passenger P2 appears, who as VIP be promoted in front of all other passengers got to. Passenger P2 has just got his transport order from Floor 3 to floor f7 delivered.
  • the central job manager 26 collects the requests of the Terminals together with the respectively recorded personal data from the configuration manager 29 as so-called jobs, here job 1 to job 4, in one Queue, as shown in Figure 6. He chooses the first job 1 out of the queue and sends it to the decentralized job manager 27,28 of each elevator. Everyone the decentralized job manager 27,28 of the lifts A, B determined independent of the other with the help of his planning system his best driving sequence solution based on the given Optimization criteria and sends them as an offer to the central job manager 26 back. The central job manager 26 Check all offers, choose from these the best offer and book the passenger on the elevator with the best Offer. The identification of the best elevator will follow sent a successful assignment to the terminal 30, on which the job was originally initiated. The Terminal 30 only functions as a display. The job 1 is done and will be canceled. The process again only picks up job 2, and so on, until all the jobs of the Warteschlage are processed.
  • the situation representation contains a State Description 32 and an operator description.
  • the service requirements are each within the framework of Passenger detection from the configuration manager 29 known and are provided by the central job manager 26 as part of a Jobs, or a request for quotation, to the decentralized Job Manager 27,28 of each elevator A, B forwarded.
  • Certain service requirements for all or any selected passengers may vary depending on the condition the elevator system or the building also time of day be provided activated.
  • a flexible weighting of individual service requirements, in particular the VIP requirement, in Dependence of the traffic volume can be displayed.
  • P1 can not drive alone in the elevator here and heard at the same time to the passenger group A.
  • the object declaration 33 contains the already-traveling passenger P1, a normal passenger, the new passenger P2, a VIP, and all 7 floors f1 to f7. (: Objects (p1 - passenger) (p2 - vip) (f1, f2, f3, f4, f5, f6, f7 - floor))
  • the current registered transfer order 34 of the passengers P1 and P2 appears as (: init (origin p1 f1) (origin p2 f3) (destin p1 f7) (destin p2 f7) (boarded p1)
  • the transport order 34 is based on the standard assumption that passengers wait on the floor if there is no corresponding boarded information. True, this means that passenger P2 is waiting on the floor.
  • the access restriction for passenger P1 presents itself as (no-access p1 f3) (no-access p1 f4)
  • the current position 35 of the elevator car 2 of the elevator A is as (lift-at f2)) expressed in the state description 32. All listed facts are considered true, all others as wrong.
  • the goal 36 for the planning system is called (: goal (forall (? p - passenger) (served? p)) formulated.
  • the planning system receives only a so-called stop operator 37, from which there is a construct a valid travel sequence plan.
  • Fig. 9 is an example of a stop operator 37 is shown.
  • the stop operator 37 contains a Specifications 38 in which is described when a Stop an elevator A, B on a floor f1 to f7 is permissible.
  • Planning systems work independently of the actual one Planning problem.
  • Such planning systems are different technical areas already known.
  • Other planning systems may be used as long as they are capable of capturing and processing the current situation representation as a whole.
  • this selects Planning system to be used in the following sequence Operators of the operator description, here the stop operator 37. If service requirements, such as VIP, going_direct, etc., in the state description 32, so the planning system independently checks the corresponding Prerequisite of the function statement 39 of the operator 37. Missing one contained in operator 37 as a precondition Service request in the call-relevant State Description 32, then this will be superfluous Precondition of the operator 37 automatically ignored.
  • One Example of a service request not considered here is the precondition -attendant-. Then determines the concrete values for operator parameters as well as a Arrangement sequence in which operators in the travel sequence plan occur. This order of arrangement specifies the Execution order of the operators in the drive sequence plan and so that the sequence of operations for the operation of the respective destination call.
  • the situation 42 can be solved by the planning system without any problem since elevator B does not know the passenger P1 at all because he is traveling in elevator A and only the new passenger P2 is notified.
  • the object declaration 43 for elevator B to the planning system consequently also includes only the new passenger P2 typed by the service request VIP and all 7 floors f1 to f7. (: Objects (p2 - vip) (f1, f2, f3, f4, f5, f6, f7 - floor))
  • the current transport order 44 of the passenger P2 presents itself as (: Init (origin p2 f3) (destin p2 f7).
  • the current position description 45 of the elevator car B is in the status description 42 as (lift-at f1) expressed.
  • the target formulation 46 for the Planning system identical to that of the elevator A. Sie is combined with the object declaration 43 and the above described stop operator 37 as part of Situation representation 42 of the elevator B to the planning system to hand over.
  • To plan the route of the elevator B is only the operator precondition: Stop on a floor below the presence of VIP, relevant because the 32 for elevator B only the service request Passing VIP to the planning system.
  • the rest in the form of specifications 33 and preconditions of Function statement 39 of the STOP operator 37 provided Service requirements remain with this planning sequence disregarded and therefore without effect on the Travel sequence plan.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)
  • Indicating And Signalling Devices For Elevators (AREA)
  • Telephonic Communication Services (AREA)
  • Exchange Systems With Centralized Control (AREA)
  • Pinball Game Machines (AREA)
  • Maintenance And Inspection Apparatuses For Elevators (AREA)
  • Valve-Gear Or Valve Arrangements (AREA)
  • Unwinding Webs (AREA)
  • Cephalosporin Compounds (AREA)

Claims (12)

  1. Procédé pour la planification de séquence de trajet d'une installation d'ascenseur avec au moins un ascenseur, comprenant
    a. l'enregistrement d'appels de destination à l'aide d'un système de capteurs (3.1, 3.2, 3.3) disposé aux étages de l'installation d'ascenseur,
    caractérisé par les étapes suivantes :
    b. l'inscription d'appels de destination dans une représentation de situation (12) pour chaque ascenseur, laquelle représentation de situation (12) définit l'état de fonctionnement momentané (18) et la situation de trafic (15, 17) de l'ascenseur,
    c. le calcul d'une séquence de trajet optimale pour chaque représentation de situation (12) compte tenu d'un critère d'optimisation présélectionné comme les temps d'attente et/ou de desserte et/ou de trajet minimaux pour les passagers, et
    d.la réservation de l'ascenseur qui correspond à la meilleure séquence de trajet optimale, pour satisfaire l'appel de destination.
  2. Procédé selon la revendication 1, caractérisé en ce que les appels de destination sont enregistrés dans une installation d'ascenseur avec plusieurs ascenseurs,
       en ce que ces appels de destination enregistrés sont transmis à un gestionnaire de travaux centralisé (26),
       en ce que chaque ascenseur comporte un gestionnaire de travaux (27, 28) auquel le gestionnaire de travaux centralisé (26) demande une offre de transport pour chaque appel de destination enregistré,
       en ce que les gestionnaires de travaux (27, 28) transmettent au gestionnaire de travaux centralisé (26) des offres de transport correspondant à la demande, et
       en ce que le gestionnaire centralisé (26), à partir des offres de transport transmises, réserve pour un appel de destination enregistré une séquence de trajet optimale par rapport au critère d'optimisation.
  3. Procédé selon la revendication 1, caractérisé en ce que les appels de destination sont enregistrés dans une installation d'ascenseur avec plusieurs ascenseurs,
       en ce que chaque ascenseur comporte un gestionnaire de travaux (4), les gestionnaires de travaux (4) recevant pour chaque appel de destination enregistré une demande d'offre de transport,
       en ce que les gestionnaires de travaux (4) font des offres de transport correspondant à la demande, et
       en ce qu'à partir de ces offres de transport pour un appel de destination enregistré, une séquence de trajet optimale par rapport au critère d'optimisation est réservée.
  4. Procédé selon l'une des revendications 1 à 3, caractérisé en ce que les appels de destination sont enregistrés sur des dispositifs d'enregistrement (3.1, 3.2, 3.3) des étages, et
       en ce qu'un ascenseur qui correspond à une séquence de trajet réservée est indiqué au dispositif d'enregistrement (3.1, 3.2, 3.3) qui a enregistré l'appel de destination.
  5. Procédé selon l'une des revendications 1 à 4, caractérisé en ce que la représentation de situation contient des opérateurs qui spécifient des passages d'état élémentaires (16) de l'installation d'ascenseur,
       en ce que les opérateurs à utiliser sont sélectionnés par rapport au critère d'optimisation,
       en ce que des valeurs concrètes pour ces opérateurs sont définies pour des paramètres d'opérateurs, et
       en ce qu'une suite de dispositions dans laquelle ces opérateurs apparaissent dans la planification de séquence de trajet est définie.
  6. Procédé selon la revendication 5, caractérisé en ce que des opérateurs qui contiennent des instructions techniques de commande relatives à des exigences de service sont sélectionnés.
  7. Commande d'appels de destination pour une installation d'ascenseur, destinée à définir la séquence de trajet d'un ou plusieurs ascenseurs de ladite installation, comportant des dispositifs d'enregistrement (3.1, 3.2, 3.3) aux étages de l'installation, pour enregistrer les appels de destination,
       caractérisée en ce qu'il est prévu une unité de traitement (4) qui comprend pour chaque ascenseur une représentation de situation (12) et un planificateur (5), la représentation de situation (12) définissant l'état de fonctionnement momentané (18) et la situation du trafic (15, 17) de l'ascenseur tandis que le planificateur (5) calcule pour chaque représentation de situation (12) une séquence de trajet optimale compte tenu d'un critère d'optimisation présélectionné tel que des temps d'attente et/ou de desserte et/ou de trajet minimaux pour les passagers.
  8. Commande d'appels de destination selon la revendication 7, caractérisée en ce que la représentation de situation contient des paramètres sur l'état de fonctionnement actuel de l'installation d'ascenseur et sur l'état de destination de l'installation d'ascenseur à réaliser, et
       en ce que la représentation de situation contient des paramètres qui spécifient les passages d'état élémentaires (16) de l'installation d'ascenseur.
  9. Commande d'appels de destination selon la revendication 7 ou 8, caractérisée en ce que l'installation d'ascenseur comporte plusieurs ascenseurs,
       en ce qu'il est prévu un gestionnaire centralisé (26) qui reçoit à partir des dispositifs d'enregistrement (3.1, 3.2, 3.3), par l'intermédiaire d'un réseau de communication, tous les appels de destination enregistrés,
       en ce que chaque ascenseur a un gestionnaire de travaux (27, 28),
       en ce que le gestionnaire de travaux centralisé (26) demande à ces gestionnaires de travaux (27, 28), par l'intermédiaire du réseau de communication (2), une offre de transport pour chaque appel de destination enregistré,    en ce que ces gestionnaires de travaux (27, 28) transmettent au gestionnaire de travaux centralisé (26), par l'intermédiaire du réseau de communication (2), des offres de transport correspondant à la demande, et
       en ce que le gestionnaire de travaux centralisé (26) réserve pour un appel de destination enregistré, à partir des offres de transport transmises, une séquence de trajet optimale par rapport au critère d'optimisation.
  10. Commande d'appels de destination selon la revendication 7 ou 8, caractérisée en ce que l'installation d'ascenseur comprend plusieurs ascenseurs,
       en ce que chaque ascenseur a un gestionnaire de travaux (4),
       en ce qu'un dispositif d'enregistrement (3.1, 3.2, 3.3) demande à ces gestionnaires de travaux, par l'intermédiaire d'un réseau de communication (2), une offre de transport pour chaque appel de destination enregistré,
       en ce que ces gestionnaires de travaux (4) transmettent au dispositif d'enregistrement demandeur (3.1, 3.2, 3.3), par l'intermédiaire du réseau de communication (2), des offres de transport correspondant à la demande, et
       en ce que ce dispositif d'enregistrement (3.1, 3.2, 3.3) réserve pour l'appel de destination enregistré, à partir de ces offres de transport, une séquence de trajet optimale par rapport au critère d'optimisation.
  11. Commande d'appels de destination selon la revendication 9 ou 10, caractérisée en ce qu'un dispositif d'enregistrement (3.1, 3.2, 3.3) qui a enregistré un appel de destination indique l'ascenseur qui correspond à une séquence de trajet réservée.
  12. Installation d'ascenseur composée d'au moins un ascenseur à un niveau et d'au moins un ascenseur à deux niveaux, et d'une commande d'appels de destination selon l'une des revendications 7 à 11.
EP01914940A 2000-03-29 2001-03-29 Commande d'appel cible pour ascenseurs Revoked EP1276691B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP01914940A EP1276691B1 (fr) 2000-03-29 2001-03-29 Commande d'appel cible pour ascenseurs

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
EP00106767 2000-03-29
EP00106768 2000-03-29
EP00106767 2000-03-29
EP00106768 2000-03-29
EP01914940A EP1276691B1 (fr) 2000-03-29 2001-03-29 Commande d'appel cible pour ascenseurs
PCT/CH2001/000205 WO2001072621A1 (fr) 2000-03-29 2001-03-29 Commande d'appel cible pour ascenseurs

Publications (2)

Publication Number Publication Date
EP1276691A1 EP1276691A1 (fr) 2003-01-22
EP1276691B1 true EP1276691B1 (fr) 2005-08-17

Family

ID=26070754

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01914940A Revoked EP1276691B1 (fr) 2000-03-29 2001-03-29 Commande d'appel cible pour ascenseurs

Country Status (13)

Country Link
US (1) US6793044B2 (fr)
EP (1) EP1276691B1 (fr)
JP (1) JP2003528785A (fr)
CN (1) CN1220614C (fr)
AT (1) ATE302158T1 (fr)
AU (2) AU2001242208B2 (fr)
BR (1) BR0109529A (fr)
DE (1) DE50107119D1 (fr)
DK (1) DK1276691T3 (fr)
ES (1) ES2248295T3 (fr)
HK (1) HK1054364B (fr)
MX (1) MXPA02009377A (fr)
WO (1) WO2001072621A1 (fr)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102006046062A1 (de) 2006-09-27 2008-04-03 Deutsches Zentrum für Luft- und Raumfahrt e.V. Verfahren zum Steuern eines Aufzug- oder ähnlichen Beförderungssystems
DE102014115999A1 (de) 2014-11-03 2016-05-04 K.A. Schmersal Gmbh & Co. Kg Bedienung eines Aufzugs mittels Touchscreen
EP2346766B1 (fr) 2008-10-24 2016-12-28 Kone Corporation Système d'ascenseurs
WO2019120899A1 (fr) 2017-12-21 2019-06-27 Inventio Ag Procédé et commande d'ascenseur permettant de commander un groupe d'ascenseurs comprenant une pluralité d'ascenseurs sur la base d'appels
WO2020161069A1 (fr) 2019-02-08 2020-08-13 Inventio Ag Installation d'ascenseur comportant des dispositifs d'actionnement d'ascenseur destinés à des passagers présentant des limitations corporelles
WO2022043371A1 (fr) 2020-08-31 2022-03-03 Inventio Ag Système d'ascenseur ayant des dispositifs de commande d'ascenseur pour passagers à mobilité limitée
DE102022110202A1 (de) 2022-04-27 2023-11-02 Tk Elevator Innovation And Operations Gmbh Aufzugsystem und Verfahren zum Betreiben eines Aufzugsystems
DE102022110209A1 (de) 2022-04-27 2023-11-02 Tk Elevator Innovation And Operations Gmbh Verfahren zum Betreiben einer Aufzuganlage

Families Citing this family (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4960585B2 (ja) 2003-10-10 2012-06-27 インベンテイオ・アクテイエンゲゼルシヤフト エレベータ装置の制御方法およびエレベータ装置
TW594510B (en) * 2003-11-05 2004-06-21 Ind Tech Res Inst Method and system of automatic service composition
FI115297B (fi) * 2004-01-26 2005-04-15 Kone Corp Hissijärjestely
FI117091B (fi) * 2005-03-15 2006-06-15 Kone Corp Menetelmä kuljetusjärjestelmän hallitsemiseksi
FI118381B (fi) * 2006-06-19 2007-10-31 Kone Corp Hissijärjestelmä
JP4388546B2 (ja) * 2006-12-28 2009-12-24 株式会社日立製作所 エレベータ群管理システムおよびそのサービスエレベータ案内表示方法
WO2009024853A1 (fr) 2007-08-21 2009-02-26 De Groot Pieter J Système de commande d'ascenseur de destination intelligent
FI119686B (fi) * 2007-10-11 2009-02-13 Kone Corp Hissijärjestelmä
JP5461522B2 (ja) * 2008-03-31 2014-04-02 オーチス エレベータ カンパニー エレベータかご割当制御戦略
WO2009141900A1 (fr) * 2008-05-21 2009-11-26 三菱電機株式会社 Système de gestion de groupe d’ascenseurs
KR101705910B1 (ko) 2008-07-31 2017-02-10 인벤티오 아게 신체 장애자 및 특권 사용자를 고려하는 엘리베이터 시스템을 제어하는 방법
CN102596777B (zh) 2009-11-10 2015-03-11 奥的斯电梯公司 具有分布式调度的电梯***
US9174823B2 (en) * 2009-12-11 2015-11-03 Mitsubishi Electric Corporation Elevator system which selects a group controller from a plurality of group controllers
JP5642797B2 (ja) 2010-09-10 2014-12-17 三菱電機株式会社 エレベータの運転装置
CN103466398B (zh) * 2013-09-25 2015-04-22 苏州爱立方服饰有限公司 一种基于遗传算法-神经网络算法的电梯对重调节方法
CN103601046B (zh) * 2013-11-28 2016-09-21 深圳市捷顺科技实业股份有限公司 一种电梯控制方法及***
EP3002242A1 (fr) 2014-09-30 2016-04-06 Inventio AG Procédé de commande pour un système d'élévation à cabines entraînées individuellement et de voie de circulation fermée
WO2016077520A1 (fr) 2014-11-13 2016-05-19 Otis Elevator Company Système de recouvrement de système de commande d'ascenseur
US20180099839A1 (en) * 2016-10-07 2018-04-12 Otis Elevator Company Elevator call system with mobile device
US10486938B2 (en) 2016-10-28 2019-11-26 Otis Elevator Company Elevator service request using user device
CN111492371B (zh) * 2017-12-14 2023-05-26 三菱电机株式会社 检索***和监视***
JP6628006B1 (ja) * 2018-09-26 2020-01-08 三菱電機ビルテクノサービス株式会社 エレベーターシステム及び携帯端末
CN109809262B (zh) * 2019-02-18 2021-10-22 南京亿数信息科技有限公司 一种电梯权限安全控制***
US11305964B2 (en) 2020-07-15 2022-04-19 Leandre Adifon Systems and methods for operation of elevators and other devices
US20220073316A1 (en) 2020-07-15 2022-03-10 Leandre Adifon Systems and methods for operation of elevators and other devices
CN115744921B (zh) * 2022-11-22 2024-01-09 安徽科昂纳米科技有限公司 一种基于甲基硅酸钠与硅酸钠混合硅源的二氧化硅气凝胶及其制备方法

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100202716B1 (ko) * 1996-12-17 1999-06-15 이종수 엘리베이터의 신호 전송장치
JPH0252875A (ja) * 1988-08-16 1990-02-22 Mitsubishi Electric Corp エレベーターの自動学習群管理装置
JPH07110748B2 (ja) * 1989-06-14 1995-11-29 株式会社日立製作所 エレベータの群管理制御装置
JP2608970B2 (ja) * 1990-06-15 1997-05-14 三菱電機株式会社 エレベータの群管理装置
JP2846102B2 (ja) * 1990-11-05 1999-01-13 株式会社日立製作所 群管理エレベーターシステム
US5767461A (en) * 1995-02-16 1998-06-16 Fujitec Co., Ltd. Elevator group supervisory control system
GB2311148B (en) * 1996-03-12 1998-03-11 Hitachi Ltd Elevator control system
FI111929B (fi) * 1997-01-23 2003-10-15 Kone Corp Hissiryhmän ohjaus
DE69923002T2 (de) * 1999-10-21 2005-12-01 Mitsubishi Denki K.K. Aufzugs-gruppesteuerung
JP4870863B2 (ja) * 2000-04-28 2012-02-08 三菱電機株式会社 エレベータ群最適管理方法、及び最適管理システム

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102006046062A1 (de) 2006-09-27 2008-04-03 Deutsches Zentrum für Luft- und Raumfahrt e.V. Verfahren zum Steuern eines Aufzug- oder ähnlichen Beförderungssystems
DE102006046062B4 (de) 2006-09-27 2018-09-06 Deutsches Zentrum für Luft- und Raumfahrt e.V. Verfahren zum Steuern eines Aufzug- oder ähnlichen Beförderungssystems
EP2346766B1 (fr) 2008-10-24 2016-12-28 Kone Corporation Système d'ascenseurs
EP2346766B2 (fr) † 2008-10-24 2024-06-19 Kone Corporation Système d'ascenseurs
DE102014115999A1 (de) 2014-11-03 2016-05-04 K.A. Schmersal Gmbh & Co. Kg Bedienung eines Aufzugs mittels Touchscreen
EP3015412A1 (fr) 2014-11-03 2016-05-04 K. A. Schmersal Holding GmbH & Co. KG Commande d'ascenseur par écran tactile
WO2019120899A1 (fr) 2017-12-21 2019-06-27 Inventio Ag Procédé et commande d'ascenseur permettant de commander un groupe d'ascenseurs comprenant une pluralité d'ascenseurs sur la base d'appels
WO2020161069A1 (fr) 2019-02-08 2020-08-13 Inventio Ag Installation d'ascenseur comportant des dispositifs d'actionnement d'ascenseur destinés à des passagers présentant des limitations corporelles
WO2022043371A1 (fr) 2020-08-31 2022-03-03 Inventio Ag Système d'ascenseur ayant des dispositifs de commande d'ascenseur pour passagers à mobilité limitée
DE102022110202A1 (de) 2022-04-27 2023-11-02 Tk Elevator Innovation And Operations Gmbh Aufzugsystem und Verfahren zum Betreiben eines Aufzugsystems
DE102022110209A1 (de) 2022-04-27 2023-11-02 Tk Elevator Innovation And Operations Gmbh Verfahren zum Betreiben einer Aufzuganlage

Also Published As

Publication number Publication date
AU2001242208B2 (en) 2006-02-16
ATE302158T1 (de) 2005-09-15
AU4220801A (en) 2001-10-08
HK1054364A1 (en) 2003-11-28
HK1054364B (zh) 2005-11-25
JP2003528785A (ja) 2003-09-30
EP1276691A1 (fr) 2003-01-22
DK1276691T3 (da) 2005-12-19
ES2248295T3 (es) 2006-03-16
MXPA02009377A (es) 2003-02-12
DE50107119D1 (de) 2005-09-22
BR0109529A (pt) 2003-06-10
US6793044B2 (en) 2004-09-21
WO2001072621A1 (fr) 2001-10-04
CN1420836A (zh) 2003-05-28
CN1220614C (zh) 2005-09-28
US20030085079A1 (en) 2003-05-08

Similar Documents

Publication Publication Date Title
EP1276691B1 (fr) Commande d'appel cible pour ascenseurs
DE69308639T2 (de) Zyklisch veränderliche Aufzugsgruppe
EP0312730B1 (fr) Commande de groupe pour ascenceurs avec commande des cabines dépendant de leur charge
DE69632750T2 (de) Verfahren und Vorrichtung zur Aufzugsgruppensteuerung
DE60308837T2 (de) Verfahren zur zuteilung von benutzern in einer aufzugsgruppe
EP1319625B1 (fr) Dispositif et méthode pour la modernisation d'ascenseur
DE60032605T2 (de) Verfahren zum Verarbeiten automatischer Aufzugrufe zu vorbestimmten Zielen
EP0356731B1 (fr) Commande groupée avec attribution immédiate des appels
EP0246395B1 (fr) Commande d'un groupe d'ascenceur
EP0440967B1 (fr) Commande de groupes pour ascenseurs avec distribution directe d'appels d'une entrée d'appels située sur l'étage
DE69000807T2 (de) Auf "kuenstlicher intelligenz" basierte vorrichtung zum abtasten des menschenstromes fuer aufzugskabinenzuteilung.
DE102014220966A1 (de) Verfahren zum Betreiben einer Transportanlage sowie entsprechende Transportanlage
DE3611173C2 (de) Fahrstuhlanlage mit mehreren Doppelabteil-Kabinen
EP0987211B1 (fr) Commande à distance pour installation d'ascenseur
DE69208427T2 (de) Aufzugssystem mit dynamischer Sektorzuteilung
EP3261971A1 (fr) Procédé permettant de faire fonctionner un système d'ascenseur comportant plusieurs cages et plusieurs cabines
EP1319624A1 (fr) Dispositif et méthode pour la modernisation d'ascenseur
DE2459887A1 (de) Steuervorrichtung fuer aufzuege
EP0459169B1 (fr) Commande de groupes pour ascenseurs avec deux cabines superposées avec distribution directe d'appels
EP0365782A1 (fr) Dispositif et méthode de commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
EP3218294A1 (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é
DE2517514A1 (de) Aufzugssteuersystem
EP0308590B1 (fr) Commande d'un groupe d'ascenceurs avec attribution immédiate des appels
EP3774627A1 (fr) Procédé permettant de faire fonctionner un système d'ascenseur
EP0508094B1 (fr) Procédé pour éviter le groupement local des cabines d'un groupe d'ascenseurs sous trafic varié

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

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

17Q First examination report despatched

Effective date: 20030310

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 CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

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

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Free format text: LANGUAGE OF EP DOCUMENT: GERMAN

REF Corresponds to:

Ref document number: 50107119

Country of ref document: DE

Date of ref document: 20050922

Kind code of ref document: P

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

Effective date: 20050919

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

REG Reference to a national code

Ref country code: HK

Ref legal event code: GR

Ref document number: 1054364

Country of ref document: HK

REG Reference to a national code

Ref country code: SE

Ref legal event code: TRGR

REG Reference to a national code

Ref country code: DK

Ref legal event code: T3

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

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2248295

Country of ref document: ES

Kind code of ref document: T3

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

ET Fr: translation filed
PLBI Opposition filed

Free format text: ORIGINAL CODE: 0009260

PLAX Notice of opposition and request to file observation + time limit sent

Free format text: ORIGINAL CODE: EPIDOSNOBS2

26 Opposition filed

Opponent name: OTIS ELEVATOR COMPANY

Effective date: 20060517

NLR1 Nl: opposition has been filed with the epo

Opponent name: OTIS ELEVATOR COMPANY

PLAF Information modified related to communication of a notice of opposition and request to file observations + time limit

Free format text: ORIGINAL CODE: EPIDOSCOBS2

PLBB Reply of patent proprietor to notice(s) of opposition received

Free format text: ORIGINAL CODE: EPIDOSNOBS3

PLAB Opposition data, opponent's data or that of the opponent's representative modified

Free format text: ORIGINAL CODE: 0009299OPPO

R26 Opposition filed (corrected)

Opponent name: OTIS ELEVATOR COMPANY

Effective date: 20060517

NLR1 Nl: opposition has been filed with the epo

Opponent name: OTIS ELEVATOR COMPANY

PLAB Opposition data, opponent's data or that of the opponent's representative modified

Free format text: ORIGINAL CODE: 0009299OPPO

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

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

Ref country code: IE

Payment date: 20110328

Year of fee payment: 11

Ref country code: DK

Payment date: 20110315

Year of fee payment: 11

Ref country code: MC

Payment date: 20110314

Year of fee payment: 11

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

Ref country code: FR

Payment date: 20110404

Year of fee payment: 11

Ref country code: NL

Payment date: 20110316

Year of fee payment: 11

Ref country code: SE

Payment date: 20110314

Year of fee payment: 11

Ref country code: AT

Payment date: 20110314

Year of fee payment: 11

Ref country code: FI

Payment date: 20110314

Year of fee payment: 11

Ref country code: TR

Payment date: 20110304

Year of fee payment: 11

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

Ref country code: GB

Payment date: 20110321

Year of fee payment: 11

Ref country code: CH

Payment date: 20110610

Year of fee payment: 11

Ref country code: DE

Payment date: 20110325

Year of fee payment: 11

Ref country code: BE

Payment date: 20110311

Year of fee payment: 11

Ref country code: ES

Payment date: 20110325

Year of fee payment: 11

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

Ref country code: IT

Payment date: 20110328

Year of fee payment: 11

REG Reference to a national code

Ref country code: DE

Ref legal event code: R103

Ref document number: 50107119

Country of ref document: DE

Ref country code: DE

Ref legal event code: R064

Ref document number: 50107119

Country of ref document: DE

RDAF Communication despatched that patent is revoked

Free format text: ORIGINAL CODE: EPIDOSNREV1

RDAG Patent revoked

Free format text: ORIGINAL CODE: 0009271

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: PATENT REVOKED

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

27W Patent revoked

Effective date: 20111213

GBPR Gb: patent revoked under art. 102 of the ep convention designating the uk as contracting state

Effective date: 20111213

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

Ref country code: LI

Free format text: LAPSE BECAUSE OF THE APPLICANT RENOUNCES

Effective date: 20050817

Ref country code: CH

Free format text: LAPSE BECAUSE OF THE APPLICANT RENOUNCES

Effective date: 20050817

REG Reference to a national code

Ref country code: DE

Ref legal event code: R107

Ref document number: 50107119

Country of ref document: DE

Effective date: 20121108

REG Reference to a national code

Ref country code: SE

Ref legal event code: ECNC

REG Reference to a national code

Ref country code: AT

Ref legal event code: MA03

Ref document number: 302158

Country of ref document: AT

Kind code of ref document: T

Effective date: 20111213

REG Reference to a national code

Ref country code: SE

Ref legal event code: ECNC

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 50107119

Country of ref document: DE