EP0356731A1 - Commande groupée avec attribution immédiate des appels - Google Patents

Commande groupée avec attribution immédiate des appels Download PDF

Info

Publication number
EP0356731A1
EP0356731A1 EP89114078A EP89114078A EP0356731A1 EP 0356731 A1 EP0356731 A1 EP 0356731A1 EP 89114078 A EP89114078 A EP 89114078A EP 89114078 A EP89114078 A EP 89114078A EP 0356731 A1 EP0356731 A1 EP 0356731A1
Authority
EP
European Patent Office
Prior art keywords
floor
call
time
input
memory
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.)
Granted
Application number
EP89114078A
Other languages
German (de)
English (en)
Other versions
EP0356731B1 (fr
Inventor
Paul Dr. Friedli
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 AT89114078T priority Critical patent/ATE94847T1/de
Publication of EP0356731A1 publication Critical patent/EP0356731A1/fr
Application granted granted Critical
Publication of EP0356731B1 publication Critical patent/EP0356731B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B66B1/24—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration
    • B66B1/2408—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration where the allocation of a call to an elevator car is of importance, i.e. by means of a supervisory or group controller
    • B66B1/2458—For elevator systems with multiple shafts and a single car per shaft
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/10—Details with respect to the type of call input
    • B66B2201/103—Destination call input before entering the elevator car
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/211—Waiting time, i.e. response time
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/212—Travel time
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/222—Taking into account the number of passengers present in the elevator car to be allocated

Definitions

  • the invention relates to a group control for elevators with immediate assignment of destination calls, with call registration devices arranged on the floors, by means of which calls for desired destination floors can be entered, with the store assigned to the elevators of the group, which are connected to the call registration devices, with the entry of calls on one floor a call characterizing the input floor and the calls characterizing the target floors are stored in the call memories, and with load measuring devices provided in the cabins of the elevator group, which are actively connected to load memories, associated with each elevator of the group, each floor of a possible stopping indicating selectors and with a device by means of which the entered calls are allocated to the cabins of the elevator group, according to the preamble of claim 1.
  • the car call memory of an elevator of this group control consists of a first memory, which has already been allocated, and contains further memories assigned to the floors, in which the calls which have been entered on the floors concerned for desired destination floors and have not yet been allocated to a car are stored.
  • a device by means of which the entered calls are allocated to the cabins of the elevator group has a computer in the form of a microprocessor and a comparison device.
  • the computer calculates one immediately after the registration of a call during a scanning cycle of a first scanner Scanning device for each floor from at least the distance between the floor and the cabin position indicated by a selector, the intermediate stops to be expected within this distance and the current cabin load, a sum proportional to the time lost by waiting passengers on the floors and in the cabin.
  • the cabin load at the time of the calculation is corrected by factors that correspond to the anticipated number of passengers boarding and alighting at future stops and that are derived from the number of passengers boarding and disembarking in the past. If the first scanner encounters an as yet unallocated floor call, then the calls entered on this floor for the desired destination floors and stored in the further memories of the cabin call memory must also be taken into account.
  • An additional sum proportional to the time lost by the passengers in the cabin is therefore determined using the factors mentioned above, and a total sum is formed.
  • This total also called operating costs, is stored in a cost memory.
  • the operating costs of all elevators are compared with one another by means of the comparison device, an allocation instruction being stored in an allocation memory of the elevator with the lowest operating costs, which indicates the floor to which the relevant car is optimally assigned in terms of time.
  • the operation cost formula the allocation method of the aforementioned publication underlying has, in addition to the aforementioned factors for the calculation of likely supply and dropout numbers in a future maintenance still a factor Verzögerungszei t v at an intermediate stop and a factor driving time MT m of a lift which are also only approximate averages.
  • the travel times of the individual elevators can differ more or less from one another with the same number of floors to be traversed, which is due to unevenly operating drives, inaccuracies in the floor distances or, in the case of high-performance elevators with a leading selector, in the different speeds that occur.
  • the operating costs are also only determined over a limited area of the route, which is, however, completely sufficient for the comparison of the elevators with one another, but does not provide any information about the actual waiting times of all passengers taking part in traffic at the time of the calculation.
  • EP-OS 0 301 173 proposes to replace the likely numbers of people entering and exiting with those actually expected.
  • a sum is formed from the number of calls entered on a floor and the number of calls designating this floor as a destination and stored as a load value in a load memory, the Load value is calculated when calculating the floor in question. If the load values are no longer changed in the time between the receipt of a new call and the transfer of this call to the drive control of the elevator in question, the allocation can be regarded as optimal.
  • EP-OS 0 308 590 proposes for group controls of the type mentioned at the outset to definitely leave a call assigned to a cabin for the first time.
  • the assigned cabin can be signaled to the passengers on the floors practically immediately after the call has been entered. Since it can be considered unlikely that the load values will be changed in the very short period between call entry and allocation, the allocation is optimal here, at least with regard to the future cabin load, at the time of allocation.
  • the assignment can no longer be considered optimal, at least in such cases .
  • the object of the invention is to improve the group control mentioned above and its modifications in such a way that the waiting times of the passengers are recorded more precisely and more accurate comparison results can be achieved for an optimal call allocation and less computing time and storage capacity is required.
  • the invention characterized in claim 1.
  • the service costs are only calculated for the input and destination floor of the new call and transferred to a cost register. This is followed immediately by a comparison of those in the cost registers of all cabins operating costs, the resulting call allocation is final.
  • the service charge calculation extends to all road users located in the cabins and on the floors, the computer using a time table in which the travel times between a particular floor and every other floor are stored.
  • the door opening and closing times of the elevators are stored in door time tables, which the computer also takes into account when calculating the service life of a cabin.
  • a and B are two elevators of an elevator group, with each elevator a car 2 guided in an elevator shaft 1 is driven by a conveyor 3 via a conveyor cable 4 and fifteen floors E0 to E14 are served.
  • the carrier 3 is controlled by a drive control known from EP-B-0 026 406, the setpoint generation, the control functions and the initiation of the stop being implemented by means of a microcomputer system 5 which is connected to measuring and actuating elements 6 of the drive control.
  • the microcomputer system 5 also calculates from elevator-specific data a sum corresponding to the waiting time of all passengers, also called service costs, which is used as the basis for the call allocation process.
  • the cabin 2 has a load measuring device 7, which is also connected to the microcomputer system 5.
  • call registration devices 8 known from EP-A-0 246 395 are provided in the form of 10 keyboards, by means of which calls can be entered for trips to the desired destination floors.
  • the call registration devices 8 are connected via an address bus AB and a data input conductor CRUIN to the microcomputer system 5 and to an input device 9 which has become known from EP-B-0 062 141.
  • the call registration devices 8 can be assigned to more than one elevator of the group, wherein, for example, those of the elevator A are connected to the microcomputer system 5 and the input device 9 of the elevator B via coupling links in the form of multiplexers 10.
  • the microcomputer systems 5 of the individual elevators in the group are connected to one another via a comparison device 11 known from EP-B-0 050 304 and a party line transmission system 12 known from EP-B-0 050 305 and form together with the call registration and input devices 8, 9 and the components listed below the inventive Group control.
  • Numeral 13 denotes a load memory, 14 a door time table and 15 a time table, which are connected to the bus SB of the microcomputer system 5 and are explained in more detail below.
  • the part of the microcomputer system 5 which is schematically shown in FIG. 2 and is assigned to elevator A, for example, has a call memory RAM1 and a first and second allocation memory RAM2, RAM3 which have memory locations corresponding to the number of floors for each direction of travel, only those assigned to the upward calls Memory are shown.
  • the call memory RAM1 consists of a first and a second memory RAM1.1, RAM1.2, wherein in the first memory RAM1.1 the calls denoting the respective input storey and in the second memory RAM1.2 the calls identifying the destination storeys are stored, and wherein the first memory RAM1.1 is assigned to the first allocation memory RAM2 and the second memory RAM1.2 to the second allocation memory RAM3.
  • R1 denotes a cost register intended for the storage of the operating costs and R2 denotes a cabin position register.
  • a selector R3 in the form of a further register forms addresses corresponding to the floor numbers, by means of which the memory locations of the memories RAM1.1, RAM1.2, RAM2 and RAM3 can be addressed. While the selector R3 in each case indicates the floor on which the moving car 2 could still stop, the car position register R2 in each case shows the floor in the area of which the car 2 is actually located.
  • the call memory RAM1 and the first and second allocation memories RAM2, RAM3 are read-write memories which are connected to the bus SB of the microcomputer system 5.
  • the calls stored in the call memory RAM1 in accordance with example FIG. 2 and the allocation instructions stored in the allocation memories RAM2, RAM3 are symbolically marked with "1", the floors E1, E8, E9, E10 and E12 assigned (dashed connecting line) and E4 and E7 are new, not yet assigned calls (hatched fields).
  • the load memory 13 consists of a read-write memory in the form of a matrix which has exactly as many rows as floors and three columns S1, S2, S3.
  • the first column S1 of the matrix is assigned to the calls of the same direction lying in front of the cabin 2, the second column S2 to the opposite direction calls and the third column S3 to the calls of the same direction lying behind the cabin 2 in the direction of travel.
  • Load values are stored in the storage locations of the load storage device 13 in the form of a number of people who are located in the cabin 2 when they depart from or drive past a floor.
  • FIG. 2 for example, that the car 2 is in the upward travel in the area of the floor E2 and that upward calls have been entered on the floors E1, E4 and E10.
  • the computer can call up the number of passengers in the cabin 2 at a future stop from the load store 13. In addition, it can be determined on the basis of the stored load values whether an overload 2 would occur if a certain floor were allocated to a cabin.
  • the load storage device 13 is created, the entered calls are used to infer the future passengers entering and exiting the cabin 2 and the resulting loads.
  • the saved load values must be corrected.
  • the load storage device 13 is connected to the load measuring device 7 of the cabin 2 via the microcomputer system 5 (FIG. 1).
  • the load storage device 13 is connected to the load measuring device 7 of the cabin 2 via the microcomputer system 5 (FIG. 1).
  • the load measuring device 7 of the cabin 2 via the microcomputer system 5 (FIG. 1).
  • the load storage device 13 is connected to the load measuring device 7 of the cabin 2 via the microcomputer system 5 (FIG. 1).
  • the load storage device 13 is connected to the load measuring device 7 of the cabin 2 via the microcomputer system 5 (FIG. 1).
  • As many of the same destination calls are deleted on the respective floor as the difference between the stored load value and the actually measured cabin load.
  • all stored load values between the entry floor and the destination floor of the call entered more than once are corrected.
  • the stored load values must be increased, it being assumed that the passenger who has not entered a call wants to drive to a destination which is characterized by a call already entered by another passenger. If several calls have been entered, it is assumed that the conscious passenger wants to drive to the most distant destination.
  • the door time table 14 consists of a read-write memory in which the door opening and closing times determined in real time by the microcomputer system 5 of the elevator in question are stored. It is assumed that the door opening and closing times are subject to certain fluctuations from floor to floor, which can be recorded in this way and taken into account when calculating the service costs. For each stop, the computer calculates from the table values t in question , t to and the door hold-open time t off, which depends on the number of people entering or exiting, in accordance with the relationship defined in claim 2, the service life t h of the cabin in question.
  • the travel time table 15 also consists of a read-write memory, in which the travel times of the elevator in question between a particular floor and every other floor are stored separately according to the upward and downward travel direction.
  • the time table 15 is created during the initial start-up by learning trips from each floor to each floor and is correct if all possible trips have been carried out at least once. In this way, the travel times of the individual elevators in the group, which deviate more or less from one another over the same uninterrupted route, can be recorded, whereby the deviations can lie in unevenly operating drives, inaccuracies in the floor distances or, in the case of high-performance elevators, in the distance-dependent variable limit speeds.
  • the table values assigned to the routes in question can be used directly.
  • the table values are also used to calculate the time losses ⁇ t s , ⁇ t z caused by a new call from calls already allocated to road users.
  • the time loss ⁇ t s or ⁇ t z of the passengers in the cabin during the intermediate stop is dependent on the standing time t h and the difference resulting from the travel times, in accordance with the relationships defined in claim 3 with intermediate stop and the travel time without intermediate stop.
  • the time loss ⁇ t s caused by an intermediate stop at the input floor of a new call must be taken into account according to claim 1 when calculating the waiting time of all incoming calls between the input and destination floors. For those who have already been allocated calls beyond the input and destination floor of the new call, the time loss ⁇ t z that arises during an intermediate stop at the destination floor must also be taken into account.
  • the standing time t h here consists only of the door hold-open time t ' off or t ⁇ off, which is calculated from the number of people entering or leaving the new call in accordance with the relationships defined in claim 4.
  • a circuit 16 connecting the memory cells of the upward and downward memories has the task of suppressing the allocation of a new call if a reverse direction call has already been allocated to the same input floor for the elevator in question. In this way it can be prevented that the newcomers are taken along in the wrong direction.
  • the circuit 16 consists of a register 17 containing a maximum value K max of the operating costs K, first and second tristate buffers 18, 19, a NOT gate 20, a two-input OR gate 21 and a first and second , AND inputs 22, 23 each having three inputs.
  • the first AND gate 22 is connected on the input side to the outputs of the memory cells of the first memory RAM1.1u and of the first allocation memory RAM2u in the upward direction, and to the cost register R1.
  • the second AND gate 23 is connected on the input side to the memory cells of the first memory RAM1.1d and the first allocation memory RAM2d of the downward direction and also to the cost register R1.
  • the outputs of the AND gates 22, 23 are connected to the inputs of the OR gate 21, the output of which with the Activation connections of the first tristate buffers 18 and via the NOT link 20 with the activation connections of the second tristate buffers 19 in connection.
  • the register 17 is connected via the first tristate buffers 18 to the data inputs of the comparison device 11, which are connected to the cost register R1 via the second tristate buffers 19.
  • the circuit 16 formed by the microcomputer system 5, for example on the basis of a program, is activated each time the operating costs K are transferred to the cost register R1 for the floor in question.
  • a call characterizing the input floor is transferred to the first memory RAM1.1 and a call characterizing the target floor is transferred to the second memory RAM1.2 of the call memory RAM1 of all elevators .
  • the load memories 13 of all elevators are created or corrected in the case of already existing load values, the number of calls entered on one floor remaining stored separately until the passengers in question have entered. For the time being, it is checked for each elevator whether the load value for the floor to be allocated would exceed a certain load limit. If so, then, as described in EP-OS 0 301 173, the elevator in question is excluded from the allocation process.
  • the computer takes the door times from the door time table 14 and the travel times from the time table 15, the floor in the car position register R2 being relevant in each case for the latter.
  • the number of passengers already in the cabin is taken from the load store 13.
  • the number of separately stored calls is used for the number of boarders waiting on the floors.
  • the time loss ⁇ t s caused by the stopover on floor E4 of the two passengers on floor E1 would have to be taken into account.
  • the service costs K are transferred to the cost register R1 and compared with the service costs K of the other elevators by means of the comparator 11 proposed, for example, in accordance with EP-B-0 050 304. It may be assumed that elevator A has the lowest service costs K, so that an allocation instruction is written in the first allocation memory RAM2 on floor E4 and in the second allocation memory RAM3 on floor E7 (dashed arrows, FIG. 2).
  • the assignment of the assignment instruction in the second assignment memory RAM3 can be achieved, for example, by the address of the destination floor also having an address part characterizing the input floor in addition to the selection code, so that all destination calls are always considered to have been assigned whose address is an address part characterizing the common, assigned input floor exhibit.
  • the output of the second AND gate 23 of the circuit 16 (FIG. 3) is increased when the service costs K are transferred to the cost register R1, so that the first tristate buffers 18 are released, but the second tristate buffers 19 are blocked.
  • the comparison device 11 is not supplied with the operating costs K located in the cost register R1, but rather with the maximum value K max contained in the register 17, so that the elevator A cannot be assigned the new call from floor E4 in this situation.
  • the cost registers R1 of all elevators are deleted and are available for recording the service costs K of another new call. If it is determined in the allocation process of a new call from the same floor that elevator A does not have the lowest operating costs K, then it is prevented that the allocation instructions written in the first and second allocation memories RAM2, RAM3 of elevator A can be deleted again, which can be done, for example, by means of a device known from EP-OS 0 308 590 can be achieved.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)
  • Indicating And Signalling Devices For Elevators (AREA)
  • Maintenance And Inspection Apparatuses For Elevators (AREA)
  • Exchange Systems With Centralized Control (AREA)
  • Types And Forms Of Lifts (AREA)
  • Lift-Guide Devices, And Elevator Ropes And Cables (AREA)
  • Low-Molecular Organic Synthesis Reactions Using Catalysts (AREA)
  • Sorption Type Refrigeration Machines (AREA)
  • Transplanting Machines (AREA)
  • Steering Control In Accordance With Driving Conditions (AREA)
  • Debugging And Monitoring (AREA)
  • Mechanical Coupling Of Light Guides (AREA)
  • Structure Of Telephone Exchanges (AREA)
EP89114078A 1988-09-01 1989-07-31 Commande groupée avec attribution immédiate des appels Expired - Lifetime EP0356731B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AT89114078T ATE94847T1 (de) 1988-09-01 1989-07-31 Gruppensteuerung mit sofortzuteilung von zielrufen.

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CH3275/88 1988-09-01
CH327588 1988-09-01

Publications (2)

Publication Number Publication Date
EP0356731A1 true EP0356731A1 (fr) 1990-03-07
EP0356731B1 EP0356731B1 (fr) 1993-09-22

Family

ID=4252469

Family Applications (1)

Application Number Title Priority Date Filing Date
EP89114078A Expired - Lifetime EP0356731B1 (fr) 1988-09-01 1989-07-31 Commande groupée avec attribution immédiate des appels

Country Status (17)

Country Link
US (1) US4991694A (fr)
EP (1) EP0356731B1 (fr)
JP (1) JP2706151B2 (fr)
CN (1) CN1011300B (fr)
AT (1) ATE94847T1 (fr)
AU (1) AU618122B2 (fr)
BR (1) BR8904393A (fr)
CA (1) CA1315900C (fr)
DE (1) DE58905667D1 (fr)
DK (1) DK174631B1 (fr)
ES (1) ES2046395T3 (fr)
FI (1) FI97050C (fr)
HK (1) HK144294A (fr)
HU (1) HU210405B (fr)
MX (1) MX172137B (fr)
NO (1) NO175092C (fr)
ZA (1) ZA895579B (fr)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0456265A2 (fr) * 1990-05-10 1991-11-13 KONE Elevator GmbH Procédure pour la sélection d'une cabine d'ascenseur dans un groupe d'ascenseurs
EP0459169A1 (fr) * 1990-06-01 1991-12-04 Inventio Ag Commande de groupes pour ascenseurs avec deux cabines superposées avec distribution directe d'appels
US6065570A (en) * 1996-04-03 2000-05-23 Inventio Ag Control system for a plurality of groups of lifts with destination call control system
WO2004031062A1 (fr) * 2002-10-01 2004-04-15 Kone Corporation Logique de commande de groupe d'ascenseurs
US7083027B2 (en) 2002-10-01 2006-08-01 Kone Corporation Elevator group control method using destination floor call input
US8701839B2 (en) 2008-01-17 2014-04-22 Inventio Ag Allocation of calls in a lift installation
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
CN110171752A (zh) * 2018-02-20 2019-08-27 东芝电梯株式会社 电梯系统及电梯系统的运用方法

Families Citing this family (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5024295A (en) * 1988-06-21 1991-06-18 Otis Elevator Company Relative system response elevator dispatcher system using artificial intelligence to vary bonuses and penalties
EP0419802B1 (fr) * 1989-09-27 1994-03-09 Inventio Ag Méthode de traîtement des appels de destination faits en cabine d'ascenseur
EP0440967B1 (fr) * 1990-02-05 1994-03-16 Inventio Ag Commande de groupes pour ascenseurs avec distribution directe d'appels d'une entrée d'appels située sur l'étage
DE59003476D1 (de) * 1990-02-05 1993-12-16 Inventio Ag Einrichtung zur Auswahl einer Aufzugskabine für Körperbehinderte bei Aufzügen mit Sofortzuteilung von Zielrufen.
ES2052149T3 (es) * 1990-02-22 1994-07-01 Inventio Ag Procedimiento y dispositivo para la asignacion inmediata de llamadas de destino en grupos de ascensores.
KR940009984B1 (ko) * 1990-05-29 1994-10-19 미쓰비시덴키 가부시키가이샤 엘리베이터 제어장치
US5529147A (en) * 1990-06-19 1996-06-25 Mitsubishi Denki Kabushiki Kaisha Apparatus for controlling elevator cars based on car delay
JP2667042B2 (ja) * 1990-06-29 1997-10-22 株式会社東芝 エレベータ群管理システム
US5272288A (en) * 1990-09-11 1993-12-21 Otis Elevator Company Elevator traffic predictions using historical data checked for certainty
DE59201897D1 (de) * 1991-09-27 1995-05-18 Inventio Ag Auf den Stockwerken angeordnete Rufregistrier- und Anzeigeeinrichtungen für Aufzüge.
US5329076A (en) * 1992-07-24 1994-07-12 Otis Elevator Company Elevator car dispatcher having artificially intelligent supervisor for crowds
US5357064A (en) * 1992-12-21 1994-10-18 Otis Elevator Company Elevator hall call cross-cancellation device
JP3650150B2 (ja) * 1993-09-20 2005-05-18 オーチス エレベータ カンパニー 瞬時的なセクタ割り付け方法
JPH09315708A (ja) * 1996-05-29 1997-12-09 Otis Elevator Co 群管理エレベーター
US6439349B1 (en) * 2000-12-21 2002-08-27 Thyssen Elevator Capital Corp. Method and apparatus for assigning new hall calls to one of a plurality of elevator cars
JP4530673B2 (ja) * 2004-01-14 2010-08-25 東芝エレベータ株式会社 群管理エレベータ制御装置
FI115297B (fi) * 2004-01-26 2005-04-15 Kone Corp Hissijärjestely
FI115396B (fi) * 2004-04-15 2005-04-29 Kone Corp Hissijärjestelmän ohjausmenetelmä
AU2006275280B2 (en) * 2005-08-04 2012-01-19 Inventio Ag Method for assigning a user to an elevator system
US7546905B2 (en) * 2006-03-27 2009-06-16 Mitsubishi Electric Research Laboratories, Inc. System and method for scheduling elevator cars using pairwise delay minimization
WO2009021016A1 (fr) * 2007-08-06 2009-02-12 Thyssenkrupp Elevator Capital Corporation Commande pour limiter la pression sur le tympan du passager d'un ascenseur et son procédé
US8151943B2 (en) * 2007-08-21 2012-04-10 De Groot Pieter J Method of controlling intelligent destination elevators with selected operation modes
KR101775167B1 (ko) * 2009-01-27 2017-09-05 인벤티오 아게 엘리베이터 시스템 작동 방법
WO2011129803A1 (fr) * 2010-04-12 2011-10-20 Otis Elevator Company Commande de répartition pour ascenseurs afin d'éviter la confusion de passagers
US11383954B2 (en) 2018-06-26 2022-07-12 Otis Elevator Company Super group architecture with advanced building wide dispatching logic

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0032213A2 (fr) * 1979-12-21 1981-07-22 Inventio Ag Commande d'un groupe d'ascenseurs
EP0246395A1 (fr) * 1986-04-11 1987-11-25 Inventio Ag Commande d'un groupe d'ascenceur

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CH649517A5 (de) * 1979-09-27 1985-05-31 Inventio Ag Antriebssteuereinrichtung fuer einen aufzug.
CH651950A5 (de) * 1980-10-20 1985-10-15 Inventio Ag Multiprozessoranordnung.
CH651951A5 (de) * 1980-10-20 1985-10-15 Inventio Ag Einrichtung zur steuerung des zugriffes von prozessoren auf eine datenleitung.
CH653155A5 (de) * 1981-03-26 1985-12-13 Inventio Ag Schaltungsanordnung zur eingabe von steuerbefehlen in ein mikrocomputersystem.
DE3864625D1 (de) * 1987-07-28 1991-10-10 Inventio Ag Gruppensteuerung fuer aufzuege.
ES2037765T3 (es) * 1987-09-24 1993-07-01 Inventio Ag Control de grupo de ascensores con asignacion inmediata de llamadas de destino.
ATE68770T1 (de) * 1987-10-20 1991-11-15 Inventio Ag Gruppensteuerung fuer aufzuege mit lastabhaengiger steuerung der kabinen.
US4784240A (en) * 1988-03-16 1988-11-15 Westinghouse Electric Corp. Method for using door cycle time in dispatching elevator cars

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0032213A2 (fr) * 1979-12-21 1981-07-22 Inventio Ag Commande d'un groupe d'ascenseurs
EP0246395A1 (fr) * 1986-04-11 1987-11-25 Inventio Ag Commande d'un groupe d'ascenceur

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0456265A2 (fr) * 1990-05-10 1991-11-13 KONE Elevator GmbH Procédure pour la sélection d'une cabine d'ascenseur dans un groupe d'ascenseurs
EP0456265A3 (en) * 1990-05-10 1992-11-25 Kone Elevator Gmbh Procedure for the selection of an elevator in an elevator group
EP0459169A1 (fr) * 1990-06-01 1991-12-04 Inventio Ag Commande de groupes pour ascenseurs avec deux cabines superposées avec distribution directe d'appels
US6065570A (en) * 1996-04-03 2000-05-23 Inventio Ag Control system for a plurality of groups of lifts with destination call control system
WO2004031062A1 (fr) * 2002-10-01 2004-04-15 Kone Corporation Logique de commande de groupe d'ascenseurs
US7083027B2 (en) 2002-10-01 2006-08-01 Kone Corporation Elevator group control method using destination floor call input
US8701839B2 (en) 2008-01-17 2014-04-22 Inventio Ag Allocation of calls in a lift installation
US9556001B2 (en) 2008-01-17 2017-01-31 Inventio Ag Allocation of calls in a lift installation
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
CN110171752A (zh) * 2018-02-20 2019-08-27 东芝电梯株式会社 电梯系统及电梯系统的运用方法
CN110171752B (zh) * 2018-02-20 2021-10-15 东芝电梯株式会社 电梯系统及电梯系统的运用方法

Also Published As

Publication number Publication date
JPH02106572A (ja) 1990-04-18
HUT51999A (en) 1990-06-28
EP0356731B1 (fr) 1993-09-22
FI893943A0 (fi) 1989-08-23
NO893377L (no) 1990-03-02
NO175092B (no) 1994-05-24
NO175092C (no) 1994-08-31
JP2706151B2 (ja) 1998-01-28
MX172137B (es) 1993-12-06
US4991694A (en) 1991-02-12
AU4098189A (en) 1990-03-08
FI97050B (fi) 1996-06-28
CN1011300B (zh) 1991-01-23
CN1040769A (zh) 1990-03-28
AU618122B2 (en) 1991-12-12
ATE94847T1 (de) 1993-10-15
DK429889A (da) 1990-03-02
DK429889D0 (da) 1989-08-31
CA1315900C (fr) 1993-04-06
ZA895579B (en) 1990-04-25
FI97050C (fi) 1996-10-10
HU210405B (en) 1995-04-28
BR8904393A (pt) 1990-04-17
DE58905667D1 (de) 1993-10-28
DK174631B1 (da) 2003-07-28
NO893377D0 (no) 1989-08-22
FI893943A (fi) 1990-03-02
HK144294A (en) 1994-12-23
ES2046395T3 (es) 1994-02-01

Similar Documents

Publication Publication Date Title
EP0356731B1 (fr) Commande groupée avec attribution immédiate des appels
EP0440967B1 (fr) Commande de groupes pour ascenseurs avec distribution directe d'appels d'une entrée d'appels située sur l'étage
EP0312730B1 (fr) Commande de groupe pour ascenceurs avec commande des cabines dépendant de leur charge
EP0443188B1 (fr) Méthode et dispositif de distribution directe d'appels de groupes d'ascenseurs, basés sur des charges de service et sur des facteurs bonus/malus variables
EP0445419B1 (fr) Arrangement pour sélectionner une cabine d'ascenseur pour personnes handicapées dans des systèmes d'ascenseurs avec distribution directe d'appels
EP0246395B1 (fr) Commande d'un groupe d'ascenceur
EP0301173B1 (fr) Commande d'un groupe d'ascenceurs
EP0459169B1 (fr) Commande de groupes pour ascenseurs avec deux cabines superposées avec distribution directe d'appels
EP1276691B1 (fr) Commande d'appel cible pour ascenseurs
EP1418147B1 (fr) Contrôleur pour ascenseur avec cabine avec plusieurs compartiments
DE3611173C2 (de) Fahrstuhlanlage mit mehreren Doppelabteil-Kabinen
DE69818080T2 (de) Verfahren für aufzugsgruppe-steuerung in der virtueller personenverkehr erzeugt wird
DE60308837T2 (de) Verfahren zur zuteilung von benutzern in einer aufzugsgruppe
EP0091554B1 (fr) Commande d'un groupe d'ascenseurs comportant un dispositif pour la commande d'une pointe de trafic descendante
EP0365782B1 (fr) Dispositif et méthode de commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
CH677225A5 (fr)
EP0378834B1 (fr) Commande d'un groupe d'ascenseurs avec attribution immédiate des appels
DE2459887A1 (de) Steuervorrichtung fuer aufzuege
EP0177741B1 (fr) Dispositif de commande d'ascenseurs à cabines doubles
EP0134892B1 (fr) Commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
EP0308590B1 (fr) Commande d'un groupe d'ascenceurs avec attribution immédiate des appels
DE2517514A1 (de) Aufzugssteuersystem
EP1193207A1 (fr) Méthode de contrôle pour un ascenseur avec une cabine à plusieurs compartiments
EP0419802B1 (fr) Méthode de traîtement des appels de destination faits en cabine d'ascenseur
DE1556332A1 (de) Steuervorrichtung fuer ein Aufzugssystem

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE CH DE ES FR GB IT LI NL SE

17P Request for examination filed

Effective date: 19900716

17Q First examination report despatched

Effective date: 19911024

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE CH DE ES FR GB IT LI NL SE

REF Corresponds to:

Ref document number: 94847

Country of ref document: AT

Date of ref document: 19931015

Kind code of ref document: T

REF Corresponds to:

Ref document number: 58905667

Country of ref document: DE

Date of ref document: 19931028

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

Effective date: 19931019

ET Fr: translation filed
ITF It: translation for a ep patent filed

Owner name: MODIANO & ASSOCIATI S.R

REG Reference to a national code

Ref country code: ES

Ref legal event code: FG2A

Ref document number: 2046395

Country of ref document: ES

Kind code of ref document: T3

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
EAL Se: european patent in force in sweden

Ref document number: 89114078.2

REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

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

Ref country code: ES

Payment date: 20080729

Year of fee payment: 20

Ref country code: DE

Payment date: 20080722

Year of fee payment: 20

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

Ref country code: FR

Payment date: 20080715

Year of fee payment: 20

Ref country code: IT

Payment date: 20080725

Year of fee payment: 20

Ref country code: AT

Payment date: 20080715

Year of fee payment: 20

Ref country code: NL

Payment date: 20080716

Year of fee payment: 20

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

Ref country code: GB

Payment date: 20080722

Year of fee payment: 20

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

Ref country code: CH

Payment date: 20081016

Year of fee payment: 20

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

Ref country code: SE

Payment date: 20080714

Year of fee payment: 20

Ref country code: BE

Payment date: 20080814

Year of fee payment: 20

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20090730

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20090801

NLV7 Nl: ceased due to reaching the maximum lifetime of a patent

Effective date: 20090731

EUG Se: european patent has lapsed
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20090801

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

Ref country code: NL

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20090731

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20090730