EP3728094B1 - Fahrtplanung aufgrund erwarteter passagieranzahl - Google Patents

Fahrtplanung aufgrund erwarteter passagieranzahl Download PDF

Info

Publication number
EP3728094B1
EP3728094B1 EP18814970.2A EP18814970A EP3728094B1 EP 3728094 B1 EP3728094 B1 EP 3728094B1 EP 18814970 A EP18814970 A EP 18814970A EP 3728094 B1 EP3728094 B1 EP 3728094B1
Authority
EP
European Patent Office
Prior art keywords
call
destination
passengers
floor
destination call
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP18814970.2A
Other languages
German (de)
English (en)
French (fr)
Other versions
EP3728094A1 (de
Inventor
Lukas Finschi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Inventio AG
Original Assignee
Inventio AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Inventio AG filed Critical Inventio AG
Priority to PL18814970T priority Critical patent/PL3728094T3/pl
Publication of EP3728094A1 publication Critical patent/EP3728094A1/de
Application granted granted Critical
Publication of EP3728094B1 publication Critical patent/EP3728094B1/de
Active 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
    • 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/2416—For single car elevator systems
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B66B1/34—Details, e.g. call counting devices, data transmission from car to control system, devices giving information to the control system
    • B66B1/3415—Control system configuration and the data transmission or communication within the control system
    • B66B1/3446—Data transmission or communication within the control system
    • B66B1/3461—Data transmission or communication within the control system between the elevator control system and remote or mobile stations
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B66B1/34—Details, e.g. call counting devices, data transmission from car to control system, devices giving information to the control system
    • B66B1/46—Adaptations of switches or switchgear
    • B66B1/468—Call registering systems
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B5/00—Applications of checking, fault-correcting, or safety devices in elevators
    • B66B5/0006—Monitoring devices or performance analysers
    • B66B5/0012—Devices monitoring the users of the elevator system
    • 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
    • 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/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/23—Other aspects of the evaluation method
    • 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/46—Switches or switchgear
    • B66B2201/4607—Call registering systems
    • B66B2201/4615—Wherein the destination is registered before boarding
    • 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/46—Switches or switchgear
    • B66B2201/4607—Call registering systems
    • B66B2201/463—Wherein the call is registered through physical contact with the elevator system

Definitions

  • the technology described here generally relates to an elevator system with a destination call controller, in particular its design for call allocation and journey planning. Embodiments of the technology also relate to a method for operating such an elevator system.
  • elevator systems which have either a floor terminal for entering the desired direction of travel (e.g. "up” and “down” buttons) or a floor terminal for entering the desired destination floor.
  • the latter enable elevator systems with a destination call controller that allocates an elevator car to a passenger's elevator call in order to transport the passenger to a desired destination floor.
  • An embodiment of an elevator system with a destination call controller is in the document EP 0 443 188 B1 disclosed; the destination call controller allocates elevator calls based on calculated service costs and variable bonus/penalty factors.
  • U.S. 2017/158459 A1 discloses a method for allocating an elevator in which a passenger batch size distribution is determined for each pair of floors in a building based on passenger batch trips, each passenger batch trip containing at least the boarding and destination floors of the trip, the number of passengers relative to the trip, and the time included in the journey.
  • the number of passengers waiting behind an elevator call is estimated based on passenger batch size distributions.
  • the elevator call is assigned to an elevator capable of serving the estimated number of passengers.
  • U.S. 2010/326773 A1 discloses an elevator group control system for good operational efficiency even when an elevator is used by a group of people.
  • the number of people in the group is previously stored in a number of people storage section.
  • An elevator is assigned based on the number of people stored in the number of people memory area.
  • WO 2014/111127 A1 describes an elevator allocation system in which at least one passenger detector is provided on at least one floor, the passenger detector being configured to detect the number of passengers in the lobby.
  • a computing device uses the signals from the passenger detector to determine a passenger number signal, which is fed to the call assignment system.
  • One aspect of such improved technology relates to a method of operating an elevator system in a building according to claim 1.
  • Another aspect relates to an elevator system in a building according to claim 6.
  • the destination call controller makes an assumption during call allocation about a number of additional passengers who would like to be transported together with a calling passenger without having entered a destination call themselves and who have a corresponding space requirement in the elevator car. Based on data stored in a database about passenger behavior on the floors, the technology deviates from the usual approach of planning a space requirement for a passenger for each destination call. This allows more realistic assumptions to be made about the actual space requirements, which e.g. results in the elevator system being able to operate with improved efficiency, which also enables optimization of waiting times for passengers.
  • the database is stored in a storage device, with a large number of data records being stored in the database.
  • Each record has predefined ones describing a call situation
  • Data fields a first data field indicating the call input floor, a second data field a time window, a third data field the destination floor and a fourth data field the number of additional passengers for the call situation described in the data set.
  • the technology described here uses such a database to determine whether a number of additional passengers can be assigned to the first destination call. For this purpose, the database is accessed and it is determined whether the first destination call corresponds to a call situation stored in the database. If this is the case, this results in the number of additional passengers for this call situation given by the first destination call. Generating additional space requirement information therefore includes reading the fourth data field to determine the number of additional passengers.
  • the elevator system includes a sensor system coupled to the destination call control device and the memory device.
  • the sensor system determines information on a number of passengers boarding the elevator car on a floor.
  • the sensor system can e.g. B. be used to determine the number of additional passengers that are specified in the fourth data field.
  • the sensor system comprises sensors arranged on the floors, which are coupled to the destination call control device and the memory device via a line.
  • a sensor of the sensor system includes a camera, and the sensor system is designed to determine the number of passengers from images recorded by the camera.
  • people can observe and record the behavior of the passengers depending on the time of day and the day of the week in order to obtain the data for the database.
  • the destination call control device is also designed to adapt the generated information about the additional space requirement using the information determined by the sensor system about the number of boarding passengers and to use the adapted information about the number of passengers to serve passengers to use additional space.
  • the planning of the operating sequence of passengers can be improved because z. B. the (assumed) additional space requirement can be increased or decreased by means of the number of passengers actually boarding.
  • the space requirement of the first passenger is increased by the space requirement of the additional passengers for the allocation of the first destination call.
  • the resulting total space requirement is fed to the allocation algorithm. It is an advantage here that the allocation algorithm does not have to be expanded or otherwise changed compared to known methods, since the space requirement is modified independently of the allocation algorithm.
  • the additional space requirement information is kept separate from the first destination call; both are fed separately to the allocation algorithm.
  • the allocation algorithm can be supplemented or modified with simpler or more complicated rules in order to take into account the additional space requirement in different planning steps. Typical planning steps are the calculation of the space requirement for passengers waiting on a floor, or the calculation of the space requirement for passengers who could be transported together in the elevator car at the same time. In both cases, the individual normal and the individual additional space requirements can be taken into account for each of the passengers under consideration.
  • a space requirement is assumed for allocating the destination calls, which, with one passenger per destination call, results from the number of destination calls and a maximum number of additional passengers .
  • a number of additional passengers is determined for each destination call and, from this, that destination call to which the maximum number of additional passengers is assigned. This allows the maximum number of additional passengers to be determined. For example, if there are three destination calls, with two of these destination calls being assigned an additional passenger and one of the destination calls being assigned three additional passengers, the maximum number of additional passengers is three. This has the advantage that at if too few calls require more space, but if there are enough calls, no unnecessary additional space is taken into account.
  • a space requirement is assumed for allocating the destination calls, which, with one passenger per destination call, per destination floor, consists of the number of destination calls and a maximum number of additional passengers.
  • a number of additional passengers is determined for each destination call and each destination floor, and a maximum value of the additional space requirement is determined therefrom for each destination floor; the resulting maximum values are added.
  • the building 2 can be any type of multi-story building (e.g. residential building, hotel, office building, sports station, etc.) or a ship. Components and functions of the elevator system 1 are explained below insofar as they appear helpful for understanding the technology described here.
  • the building 2 shown has several floors L1, L2, L3, which are served by the elevator system 1, ie a passenger 4 can use the elevator system 1 from a boarding floor to a Destination floor are transported.
  • the boarding floor is also referred to as the call input floor.
  • the elevator system 1 has an elevator car 10 that can be moved in an elevator shaft 18 and is connected to a drive unit (DR) 14 via a suspension element 16 (cables or belts) and is suspended from this drive unit 14 .
  • This can be a traction elevator, with further details such as a counterweight and guide rails in 1 are not shown.
  • the elevator controller (EC) 12 is connected to the drive unit 14 and controls the drive unit 14 in order to move the elevator car 10 in the shaft 18 .
  • the function of a traction elevator, its components and the tasks of an elevator control 12 are well known to those skilled in the art.
  • the elevator system 1 may include a hydraulic elevator. Those skilled in the art will also recognize that elevator system 1 may include multiple cars, or one or more groups of elevators.
  • the elevator system 1 shown is equipped with a destination call control device, the function of which is implemented in the control device (CTRL) 8 in the exemplary embodiment shown.
  • the control device 8 is also referred to below as destination call controller 8 or destination call controller 8 .
  • the control device 8 can be implemented in whole or in part in the elevator control 12 . If the elevator system 1 includes one or more groups of elevators, the destination call controller 8 or its function can be implemented in an elevator group controller.
  • the destination call controller 8 allocates one of possibly several elevator cars 10 to a destination call entered at a floor terminal 5 from a passenger 4 and communicates the corresponding allocation information via a communication bus 24 to the elevator controller 12.
  • the basic function of a destination call controller and the call assignment carried out by it are known, for example from the book by Barney GC et al., Elevator Traffic Analysis Design and Control, Rev. 2nd Ed., 1985, pp. 135-147 , or the patent document referenced above EP 0 443 188 B1 .
  • This patent document describes, for example, that a computer at any time for each elevator in the elevator system, the load, the location and the operating status of an elevator car, the Knows the operating status of a drive and has additional information about the previous traffic volume and currently valid bonus/penalty factors.
  • the destination call allocation algorithm described allocates newly entered destination calls to the elevators as optimally as possible in the sense of predetermined criteria. These criteria are essentially functional requirements for call operation.
  • the basis for destination call allocation are calculations of the service costs. The individually calculated service costs are compared with one another for each call and the elevator with the lowest service costs is determined to serve the destination call. Further details on the structure of the elevator system 1 are given elsewhere in this description.
  • the destination call control device 8 comprises a number of functional units, e.g. B. a destination call evaluation unit 26, which is connected to the floor terminals 5, a call allocation unit 36, a memory device 34 with a database 28 and a processor 30, which controls the destination call control unit 8.
  • the processor 30 has an output 32 which is connected to the communication bus 24 .
  • the technology described here can be used in an advantageous manner in order to operate the elevator system 1 with the highest possible efficiency and the best possible comfort for the passengers 4 (especially with regard to the waiting time).
  • the operation of the elevator system 1 according to one exemplary embodiment is summarized briefly and by way of example as follows: If a passenger 4 ("calling passenger 4") on a floor L1, L2, L3 calls an elevator car 10 by entering a destination call, the destination call controller 8 makes an assumption a number of passengers 4 who would like to be transported together with the calling passenger 4 and who require a corresponding amount of space in the elevator car 10 .
  • This assumption is based on stored data which indicate for each floor L1, L2, L3 how many passengers 4 are usually to be expected at the time the call is input in addition to the calling passenger 4.
  • the data can be obtained from observations of the behavior of the passengers 4 (empirical values) or using a self-learning system and z. B. for each Storey L1, L2, L3 depending on the time of day and the day of the week.
  • the destination call controller 8 makes such an assumption for each further destination call that is entered on a different floor L1, L2, L3 and can possibly be served together with the previously entered destination call. Since each elevator car 10 can only accommodate a limited number of passengers 4, the destination call controller uses the assumptions made for call assignment and planning a journey.
  • destination call control uses assumptions based on stored data in one embodiment.
  • This data is in the in 2 shown database 28 of the storage device 34 is stored.
  • the database 28 stores a plurality of records, each record having predefined data fields describing a call situation. In 2 four data fields are shown as an example, the number of which may be greater or smaller in other exemplary embodiments.
  • a first data field indicates the call input floor, a second data field a time window, a third data field the destination floor and a fourth data field the number of additional passengers (4) for the call situation described in the data record.
  • the data contained in the database 28 can be organized, for example, according to the example structure shown in the following table (Table 1).
  • the table may be referred to as a look-up table.
  • Table 1 Floor (1) time slot (2) destination floor (3) number add. passengers (4) 1 L1 7:00 - 7:30 L3 5 2 L1 7:30 - 8:30 L2 2 3 L2 7:00 - 7:30 L3 4 4 L3 11:30 - 12:30 L1 7
  • Some of the exemplary call situations shown in Table 1 are described below by way of example. According to one of these call situations (line 1 in Table 1). a passenger 4 on floor L1 makes a (first) call to floor L3 between 7:00 and 7:30. According to Table 1, the destination call controller makes the assumption that not only the calling passenger 4 (basic assumption) would like to be transported to floor L3, but also five additional passengers 4. This destination call thus corresponds to a total of six passengers 4. Such a situation can arise, for example. B. arise when these passengers 4 between 7:00 and 7:30 are to be present at their workplaces.
  • the target call controller can assign an elevator car 10 to the target call in a known manner (e.g. after a cost analysis), which takes the journey from Floor L1 runs to floor L3.
  • a second destination call e.g. B. a destination call entered on the floor L1 to the floor L2, and Table 1 does not contain information on the number of additional passengers (ie the number of additional passengers is zero)
  • the destination call control can proceed from the basic assumption (one passenger per destination call) to carry out the call allocation .
  • the destination call controller 8 can allocate the destination call of this passenger 4 to the elevator car 10 that is used to transport the six passengers 4 (first destination call) to floor L3 was assigned. Seven passengers 4 thus enter the elevator car 10 on floor L1.
  • the destination call controller makes the assumption that the calling passenger 4 and four additional passengers 4 would like to be transported.
  • the elevator car 10 with a capacity of eight people assigned to the first destination call (six passengers 4) can no longer accommodate the five passengers 4 (third destination call) waiting on the floor L2.
  • the destination call controller 8 can allocate the first and the third destination call to the same elevator car 10 and plan the trips so that the elevator car 10 is first moved from floor L1 to floor L3 in order to make the first destination call serve, and then from floor L3 to floor L2 to serve the third destination call.
  • the bypass function can only be used under certain circumstances (if no passengers, e.g. from going from floor L1 to floor L2) will prevent the car from stopping at floor L2, where there is not enough space for the passengers waiting there to board, and will also result in significantly increased waiting times for passengers waiting on floor L2.
  • the method described here does not have these disadvantages, since in any case a stop of the already overcrowded car on floor L2 is avoided and the waiting times of the passengers on all floors can already be taken into account and minimized during the planning.
  • Table 1 also shows a situation (line 4) that can arise in an office building around midday.
  • line 4 For a destination call to floor L1 entered on floor L3 in a time window between 11:30 and 12:30, it is assumed that in addition to the calling passenger 4, seven additional passengers 4 would like to travel from floor L3 to floor L1. In this case, the elevator car 10 with a capacity of eight passengers is fully occupied. The destination call controller 8 does not plan any further stops for this trip.
  • the call situations specified in Table 1 can be determined from observations of the behavior of the passengers 4 within a specified period of time.
  • the specified period can be, for example, one or two months (or longer), with the observations e.g. B. at intervals of one week (ie observe 7 days, pause 7 days).
  • the observations can be recorded, for example, by one or more people who document the passenger behavior per floor L1, L2, L3 depending on the time of day and the day of the week.
  • the observations can possibly be supplemented by questioning the passengers 4 .
  • the time window can be determined and the number of additional passengers 4 (e.g. by determining the average) are determined.
  • Such observations can be documented for all floors L1, L2, L3 or only for selected floors L1, L2, L3.
  • time-dependent behavioral patterns with regard to elevator use can be determined for each floor L1, L2, L3. If Table 1 is complete, the elevator system 1 can be configured accordingly. Those skilled in the art will recognize that Table 1 can be updated as the use of the building 2 and hence behavioral patterns change, e.g. B. when a previously unused floor L1, L2, L3 is used by a company with a large number of people.
  • passenger behavior can be determined using a sensor system.
  • the sensor system is represented by sensors 6, with a sensor 6 connected to a line 22 being arranged on each floor L1, L2, L3.
  • the sensor system can supplement or replace the observations mentioned by people (it can be designed as a self-learning system).
  • the sensor system comprises z. B. a counting device that determines the passengers 4 entering the elevator car 10 on a floor L1, L2, L3.
  • the counting device can include a camera (e.g. for recording images in the visible optical spectrum or in the infrared range) in connection with an image processing device that determines the number of passengers 4 from the recorded images.
  • the counting device can use a load measuring device of the elevator car 10 in order to determine the number of passengers 4 boarding on the relevant floor L1, L2, L3.
  • the sensor system can use information about the destination call or calls entered on the relevant floor L1, L2, L3.
  • the sensor system is communicatively connected to the destination call controller 8 .
  • the destination call controller 8 can use the information recorded by the sensor system in order to further improve the planning of operation, e.g. B. by increasing or reducing the additional space required by passengers currently waiting or being transported in an elevator.
  • the destination call control according to Table 1 initially makes the assumption that with a (first) destination call on floor L1 between 7:00 and 7:30 a.m. on destination floor L3 with five additional passengers 4, i.e.
  • the destination call controller can reduce the additional space requirement from five to one additional passenger and reassess the situation, e.g. B. plan an intermediate stop on floor L2 if there is now enough space for passengers boarding there.
  • the terminator controller 8 there is no connection to the terminator controller 8, but information collected separately from the sensor system and the terminator controller 8 can later be brought together and examined, e.g. B. in a computer system used for this purpose.
  • the passenger behavior per floor L1, L2, L3 can be determined by the sensor system during a fixed period of time; with this, the complete table 1 can be determined.
  • the table 1 can be updated by the sensor system, for example when required or according to a fixed schedule.
  • FIG 3 shows an exemplary flow chart of a method for allocating a destination call to an elevator car 10 of the elevator system 1.
  • the method according to FIG 3 begins in a step S1 and ends in a step S8.
  • the process initially waits for receipt of a destination call (steps S2 and S3). If a passenger 4 enters a destination call at a floor terminal 5 , this is received by the destination call evaluation unit 26 of the destination call controller 8 .
  • the destination call evaluation unit 26 can receive several destination calls at the same time or within a short period of time.
  • a step S4 the received destination call is evaluated in order to determine call information.
  • each target call is evaluated. Criteria according to which the evaluation takes place are, for example, the call input floor, the destination floor or the time of the destination call, or combinations thereof. Point of time of the destination call is z. B. recorded as time and calendar date.
  • the call information includes, for example, the call input floor and/or the destination floor.
  • an additional space requirement in the elevator car 10 is determined using the call information. This determination of the additional space requirement uses the data stored in the database 28, which is organized according to Table 1 in one exemplary embodiment.
  • the processor 30 checks whether the received destination call (or its criteria) corresponds to a call situation documented in Table 1. If this is the case, the additional space requirement results from the number of additional passengers 4 specified in Table 1 for this call situation.
  • the information on the destination call is modified with the additional space requirement determined in step S5 (variant A).
  • Each destination call results in implicit or explicit information about the space required in the elevator car 10 for the destination call in question.
  • the "normal" space requirement is e.g. B. space for one passenger per destination call.
  • step S6 the information about the destination call is supplemented with the additional space requirement determined in step S5 (variant B).
  • the information about the normal space requirement of the input destination call and the determined information about additional space requirement are kept separately and both are passed on for the call allocation (step S7).
  • step S7 the method determines the allocation of the destination call.
  • the method runs an allocation algorithm for this; such allocation algorithms are known to those skilled in the art, see for example the document cited above EP 0 443 188 B1 or the book by GC Barney et al.
  • the call allocation is based on the assumption that a destination call has been entered that requires space of z. B. has three passengers, so the space requirement corresponds to the information modified in step S6.
  • This destination call is allocated in a known manner by the implemented allocation algorithm; the allocation algorithm must are not expanded or otherwise changed compared to known methods, since the modification of the space requirement already takes place in the preceding step S6 and is therefore independent of the allocation algorithm.
  • Variant B differs from Variant A in the call allocation in that the call allocation is not simply based on the space requirement in the elevator car 10, which results from adding the normal space requirement and the additional space requirement. This difference arises, for example, when a destination call is to be assigned to a passenger 4 on a floor L1, L2, L3 on which one or more other passengers 4 have already been assigned to the elevator car 10.
  • the normal and additional space requirements of the calling passengers 4 are not simply added together in step S7, but are treated separately.
  • the normal seating requirements can be added together (e.g., four destination calls equals a normal seating requirement for four passengers 4), but the passenger space requirements can be limited to the maximum additional space requirements of a single passenger. This has the advantage that if there are too few calls, more space is required, but if there are enough calls, no unnecessary additional space is taken into account.
  • the allocation algorithm can be supplemented or modified with simpler or more complicated rules in order to take into account the additional space requirement in various planning steps.
  • Typical planning steps are the calculation of the space requirement for passengers 4 waiting on a floor L1, L2, L3, or the calculation of the space requirement for passengers who could be transported together in the elevator car 10 at the same time.
  • the individual normal and the individual additional space requirements can be taken into account for each of the passengers 4 under consideration.
  • the space requirements of all passengers considered were determined in such a way that the sum of the normal space requirements of the passengers and the maximum of the additional space requirements of the passengers are added together.
  • the maximum of the additional space requirement could first be determined for each destination and these values could be added together for all destinations; this has the advantage that no unnecessary additional space is planned for passengers with the same destination when there are several calls, but for passengers with different destinations, additional passengers are expected and sufficient space is planned.
  • the floor terminals 5 arranged on the floors L1, L2, L3 are z. B. arranged in the vicinity of elevator doors 6 and communicatively connected to the control device 8 via the line 22 .
  • the building 2 has three floors L1, L2, L3 and there is a floor terminal 5 on each floor. But there can also be only two or more than three floors; it is also possible that there is more than one floor terminal 5 on a floor L1, L2, L3.
  • the destination call control device 8 is communicatively connected to the elevator control 12 and the floor terminals 5 .
  • a communicative connection is to be understood in this description as a direct or indirect connection that enables unidirectional or bidirectional communication between two units. In this case, data signals and/or control signals are transmitted in a manner known per se.
  • Such a connection can be made by an electrical line system (either as a system of point-to-point connections or as a bus system, with the units connected to the bus system being addressable), a radio system or a combination of a radio system and a line system.
  • the communicative connection is shown by way of example by lines 20, 22, the line 20 existing between the communication bus 24 and the car 10 and the line 22 connecting the floor terminals 5 to the control device 8.
  • the line 22 can be a communication bus system to which the floor terminals 5 are connected.
  • the line 20 can also be a communication bus system.
  • At least one floor terminal 5 can be communicatively connected to the destination call control device 8 via a radio system.
  • a mobile electronic device e.g. mobile phone, smartphone, smartwatch, tablet PC
  • the mobile device can also display a message (e.g. "Elevator A") about the elevator assigned to this destination call.
  • the mobile electronic device has a radio module, for example a Bluetooth, an RFID and/or an NFC module.
  • the destination call control device 8 or its functionality can also be part of the elevator control 12 or a floor terminal 5 . In such a case, for example, the separate representation of the control device 8 in 1 omitted. If the destination call control device 8 or its functionality is integrated into the elevator control 12, the elevator control 12 represents the control device. The implementation of the communicative connections therefore also changes depending on the configuration. 1 is thus to be understood as a basic representation of an exemplary embodiment of the elevator system 1 .
  • a floor terminal 5 is arranged on each floor L1, L2, L3, for example in the area of access to an elevator car 10.
  • the floor terminal 5 includes a keyboard or a touch-sensitive screen (touch screen), so that a passenger 4 a Destination floor (ie a destination call) can enter.
  • the floor terminal 5 includes a device for recognizing an authorization parameter that is assigned to a passenger 4 .
  • this device is a reading device for an information carrier carried by a passenger 4 . If the passenger 4 presents the information carrier to the reading device, the reading device reads information from the information carrier, which is used, for example, to recognize an operating authorization. The passenger 4 can only make an entry if the passenger 4 is authorized to operate the input terminal 5 .
  • a destination call can also be triggered with the information read without any further action on the part of the passenger 4 .
  • the information carrier is designed like a card, for example in the form of a credit card or an employee ID card.
  • a memory chip that can be contacted from the outside, an RFID transponder in connection with a memory chip or a code that can be (optically) read from the outside, e.g. B. alphanumeric characters, a QR code or a bar code (barcode).
  • the functionality of the information carrier can also be carried out on a portable electronic device (e.g. B. mobile phone or smartphone) can be realized.
  • a portable electronic device e.g. B. mobile phone or smartphone
  • alphanumeric characters, QR codes, barcodes or color pattern codes can be shown on the displays of such devices.
  • Such devices also enable a radio connection to other electronic devices, for example via known radio technologies such as Bluetooth, WLAN/WiFi or NFC.
  • the reader of the floor terminal 5 is compatible with the information carrier technology used. Those skilled in the art will also recognize that the reader may be configured for more than one technology.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Elevator Control (AREA)
EP18814970.2A 2017-12-21 2018-12-13 Fahrtplanung aufgrund erwarteter passagieranzahl Active EP3728094B1 (de)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PL18814970T PL3728094T3 (pl) 2017-12-21 2018-12-13 Planowanie przejazdu na podstawie przewidywanej liczby pasażerów

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP17209784 2017-12-21
PCT/EP2018/084784 WO2019121329A1 (de) 2017-12-21 2018-12-13 Fahrtplanung aufgrund erwarteter passagieranzahl

Publications (2)

Publication Number Publication Date
EP3728094A1 EP3728094A1 (de) 2020-10-28
EP3728094B1 true EP3728094B1 (de) 2022-03-09

Family

ID=60781963

Family Applications (1)

Application Number Title Priority Date Filing Date
EP18814970.2A Active EP3728094B1 (de) 2017-12-21 2018-12-13 Fahrtplanung aufgrund erwarteter passagieranzahl

Country Status (7)

Country Link
US (1) US12297073B2 (pl)
EP (1) EP3728094B1 (pl)
CN (1) CN111386236B (pl)
AU (1) AU2018389637B2 (pl)
ES (1) ES2915498T3 (pl)
PL (1) PL3728094T3 (pl)
WO (1) WO2019121329A1 (pl)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102023109190A1 (de) * 2023-04-12 2024-05-16 Tk Elevator Innovation And Operations Gmbh Verfahren zum Generieren von wartezeitschwellwertabhängigen Haltevorgaben sowie entsprechende Aufzuganlage und Verwendung

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2015412518B2 (en) * 2015-10-19 2021-07-22 Kone Corporation Smartwatch and elevator and guide system

Family Cites Families (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3973649A (en) * 1974-01-30 1976-08-10 Hitachi, Ltd. Elevator control apparatus
US4149613A (en) * 1975-11-04 1979-04-17 Hitachi, Ltd. Elevator control system
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.
GB2266602B (en) * 1992-04-16 1995-09-27 Inventio Ag Artificially intelligent traffic modelling and prediction system
FI98720C (fi) * 1992-05-07 1997-08-11 Kone Oy Menetelmä hissiryhmän ohjaamiseksi
JP2003221169A (ja) * 2002-01-29 2003-08-05 Mitsubishi Electric Corp エレベータ制御装置
WO2005009879A1 (en) * 2003-06-23 2005-02-03 Otis Elevator Company Elevator dispatching with balanced passenger perception of waiting
EP1522518B1 (de) 2003-10-10 2013-06-19 Inventio AG Aufzugsanlage und Verfahren zur Steuerung einer Aufzugsanlage
FI115297B (fi) * 2004-01-26 2005-04-15 Kone Corp Hissijärjestely
FI118381B (fi) * 2006-06-19 2007-10-31 Kone Corp Hissijärjestelmä
JP4388546B2 (ja) * 2006-12-28 2009-12-24 株式会社日立製作所 エレベータ群管理システムおよびそのサービスエレベータ案内表示方法
FI119686B (fi) * 2007-10-11 2009-02-13 Kone Corp Hissijärjestelmä
WO2009078834A1 (en) * 2007-12-17 2009-06-25 Otis Elevator Company Elevator system traffic profile generator
ES2578524T3 (es) * 2008-01-17 2016-07-27 Inventio Ag Procedimiento para la asignación de llamadas de una instalación de ascensor, e instalación de ascensor con una asignación de llamadas según este procedimiento
WO2009123602A1 (en) * 2008-03-31 2009-10-08 Otis Elevator Company Elevator car assignment control strategy
EP2277815B1 (en) * 2008-05-21 2014-12-24 Mitsubishi Electric Corporation Elevator group management system
JP5504060B2 (ja) * 2010-06-08 2014-05-28 株式会社日立製作所 行先階予約群管理エレベーターの制御装置
US8950555B2 (en) * 2011-04-21 2015-02-10 Mitsubishi Electric Research Laboratories, Inc. Method for scheduling cars in elevator systems to minimize round-trip times
WO2014111127A1 (en) * 2013-01-15 2014-07-24 Kone Corporation Elevator group
JP2014189338A (ja) * 2013-03-26 2014-10-06 Hitachi Ltd エレベーターシステム
EP3191391B1 (en) * 2014-09-12 2020-11-04 KONE Corporation Call allocation in an elevator system
US10239728B2 (en) 2015-04-09 2019-03-26 Carrier Corporation Intelligent building system for providing elevator occupancy information with anonymity
JP6445401B2 (ja) * 2015-07-03 2018-12-26 株式会社日立製作所 エレベータ群管理システム
CN107176511B (zh) * 2016-03-09 2021-03-16 奥的斯电梯公司 呼梯控制装置、呼梯控制系统及其呼梯控制方法
EP3472083A4 (en) * 2016-06-17 2020-04-29 KONE Corporation CALCULATION OF ASSIGNMENT DECISIONS IN AN ELEVATOR SYSTEM
US10308477B2 (en) * 2016-10-24 2019-06-04 Echostar Technologies International Corporation Smart elevator movement

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102023109190A1 (de) * 2023-04-12 2024-05-16 Tk Elevator Innovation And Operations Gmbh Verfahren zum Generieren von wartezeitschwellwertabhängigen Haltevorgaben sowie entsprechende Aufzuganlage und Verwendung

Also Published As

Publication number Publication date
AU2018389637A1 (en) 2020-05-07
AU2018389637B2 (en) 2021-11-04
WO2019121329A1 (de) 2019-06-27
US20210047144A1 (en) 2021-02-18
CN111386236B (zh) 2022-04-22
US12297073B2 (en) 2025-05-13
CN111386236A (zh) 2020-07-07
PL3728094T3 (pl) 2022-06-27
ES2915498T3 (es) 2022-06-22
EP3728094A1 (de) 2020-10-28

Similar Documents

Publication Publication Date Title
DE112009002258B4 (de) Fahrstuhlgruppen-Verwaltungssystem
EP3307666B2 (de) Aufzugsystem mit prädiktiver ruferzeugung
DE112016001246T5 (de) System und Steuerung für eine Raumzuteilung in Aufzugkabinen
EP2421782B1 (de) Verfahren zum ortsabhängigen personenmanagement in einem gebäude
EP0246395A1 (de) Gruppensteuerung für Aufzüge
EP2209729A1 (de) Verfahren zur festlegung eines zielrufes zur benutzung einer aufzugsanlage und eine aufzugsanlage
DE102014220966A1 (de) Verfahren zum Betreiben einer Transportanlage sowie entsprechende Transportanlage
DE112016004137T5 (de) Fahrstuhlsystem
EP3728094B1 (de) Fahrtplanung aufgrund erwarteter passagieranzahl
DE3631621C2 (pl)
EP0459169A1 (de) Gruppensteuerung für Aufzüge mit Doppelkabinen mit Sofortzuteilung von Zielrufen
EP1666398B1 (de) Verfahren zur Beförderung von Personen in einem Gebäude
EP2820624B1 (de) Verfahren zum identifizieren einer person
DE2411824C2 (de) Verfahren zum Betreiben einer Aufzugsanlage
DE69933889T2 (de) Rufregistrier- und anzeigeeinrichtung sowie führungsverfahren für passagiere in einem passagierbeförderungssystem
DE2151272A1 (de) Steuerungssystem fuer eine Vielzahl von Lastaufnahmemitteln
DE102017219744A1 (de) Personenfördervorrichtung mit Überwachungseinrichtung
EP4046098B1 (de) Verfahren zur platzvergabe in einem landfahrzeug
WO2017016878A1 (de) Aufzugsanlage mit mehrdeckkabinenaufzug
WO2023117329A1 (de) Aufzugsanlage mit für gemischt genutzte gebäude angepasster bedienung von aufzugsrufen
WO2016128091A1 (de) Datenerfassungssystem zur bestimmung von passagierzahlen in öffentlichen verkehrsmitteln
EP4347467B1 (de) Aufzugsbedieneinrichtung für eine aufzugsanlage mit zielrufsteuerung
DE102006046062B4 (de) Verfahren zum Steuern eines Aufzug- oder ähnlichen Beförderungssystems
DE102018215739A1 (de) Verwendung einer Benutzerschnittstelle eines Fahrgastinformationssystems und/oder Unterhaltungssystems
DE102014114821A1 (de) Verfahren zum Verarbeiten eines Rufes für ein Aufzugsystem sowie entsprechendes Aufzugsystem

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

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

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

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

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

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20200403

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAV Request for validation of the european patent (deleted)
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

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

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20211022

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

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

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

Ref country code: AT

Ref legal event code: REF

Ref document number: 1474006

Country of ref document: AT

Kind code of ref document: T

Effective date: 20220315

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 502018009062

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Free format text: LANGUAGE OF EP DOCUMENT: GERMAN

REG Reference to a national code

Ref country code: NL

Ref legal event code: FP

REG Reference to a national code

Ref country code: SE

Ref legal event code: TRGR

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2915498

Country of ref document: ES

Kind code of ref document: T3

Effective date: 20220622

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

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

Ref country code: RS

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

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

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

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

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

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

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

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

Ref country code: FI

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

RAP4 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: INVENTIO AG

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

Ref country code: SM

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

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

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

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

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

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

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

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

Ref country code: AL

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 502018009062

Country of ref document: DE

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

26N No opposition filed

Effective date: 20221212

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

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

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230521

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

Effective date: 20221213

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

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

Ref country code: GB

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

Effective date: 20221213

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

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

Ref country code: MK

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

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; INVALID AB INITIO

Effective date: 20181213

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

Effective date: 20220309

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

Effective date: 20220309

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

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

Ref country code: CH

Payment date: 20250101

Year of fee payment: 7

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

REG Reference to a national code

Ref country code: CH

Ref legal event code: U11

Free format text: ST27 STATUS EVENT CODE: U-0-0-U10-U11 (AS PROVIDED BY THE NATIONAL OFFICE)

Effective date: 20260101

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

Ref country code: AT

Payment date: 20251218

Year of fee payment: 8

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

Ref country code: IT

Payment date: 20251218

Year of fee payment: 8

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

Ref country code: NL

Payment date: 20251222

Year of fee payment: 8

Ref country code: FR

Payment date: 20251230

Year of fee payment: 8

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

Ref country code: SE

Payment date: 20251222

Year of fee payment: 8

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

Ref country code: PL

Payment date: 20251205

Year of fee payment: 8

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

Ref country code: ES

Payment date: 20260122

Year of fee payment: 8

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

Ref country code: DE

Payment date: 20251229

Year of fee payment: 8

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

Ref country code: BE

Payment date: 20260109

Year of fee payment: 8