EP0378834B1 - Commande d'un groupe d'ascenseurs avec attribution immédiate des appels - Google Patents

Commande d'un groupe d'ascenseurs avec attribution immédiate des appels Download PDF

Info

Publication number
EP0378834B1
EP0378834B1 EP89123605A EP89123605A EP0378834B1 EP 0378834 B1 EP0378834 B1 EP 0378834B1 EP 89123605 A EP89123605 A EP 89123605A EP 89123605 A EP89123605 A EP 89123605A EP 0378834 B1 EP0378834 B1 EP 0378834B1
Authority
EP
European Patent Office
Prior art keywords
store
call
calls
ram
inputs
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
EP89123605A
Other languages
German (de)
English (en)
Other versions
EP0378834A1 (fr
Inventor
Joris Dr. Schröder
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 AT89123605T priority Critical patent/ATE81101T1/de
Publication of EP0378834A1 publication Critical patent/EP0378834A1/fr
Application granted granted Critical
Publication of EP0378834B1 publication Critical patent/EP0378834B1/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/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/233—Periodic re-allocation of call inputs

Definitions

  • the invention relates to a group control for elevators with immediate assignment of destination calls according to the preamble of claim 1.
  • EP-A-0 246 395 discloses a group control similar to group control according to the preamble, in which the destination can already be entered on the floor.
  • the control registers a call for the input floor and a call for the destination floor, so that, in contrast to the group control described in the previous section, the operating costs of calls from the third half-round trip of the cabin could be sensed more effectively.
  • the service costs corresponding to the lost times of passengers who are likely to be in the cabin when a new call is served can only be recorded inaccurately.
  • EP-PA 88106273.1 proposes to improve the allocation criteria, particularly with a view to avoiding overload in a floor to be allocated replace likely entry and exit numbers 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 being interpreted in the calculation as the number of passengers who depart from concerned floor would be in the cabin.
  • the invention has for its object to improve the group control according to the preamble such that destination calls entered in the same direction in the direction of travel behind a cabin on a floor can be allocated immediately after the call is input and do not have to be added to a queue.
  • the call memory consists of a first memory for calls of the same direction entered in the direction of travel in front of the cabin, a second memory for calls from the opposite direction, and a third memory for calls of the same direction entered in the direction of travel behind the cabin, only the assigned calls of the first Memory are captured by the selector.
  • a control circuit that is operatively connected to the call memory and the load memory is activated each time a call is input in such a way that, depending on the position and direction of travel of the cabin, a call of the same direction is written into the first or third memory, and only those to correct the load values Memory cells of the load memory are released, which are assigned either to the destination calls entered before or after the cabin.
  • the control circuit is operatively connected to the call memory in such a way that the assigned calls from the third memory are transferred to the second memory when the direction of travel changes for the first time and to the first memory when the direction of travel is changed second.
  • 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 one of the waiting times of all passengers from elevator-specific data corresponding sum, also called service costs, which is the basis of the call allocation procedure.
  • 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 an input device 9 similar to a device according to 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 group control according to the invention.
  • 13 denotes a load memory and 14 a control circuit, 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 which consists of a first, a second and a third memory RAM1.1, RAM1.2, RAM1.3, the first Memory RAM1.1 the calls of the same direction in front of cabin 2 (first half-round trip), in the second memory RAM1.2 the opposite direction calls (second half-round trip) and in third memory RAM1.3 those behind in the direction of travel Calls 2 lying calls of the same direction (third half-round trip) can be saved.
  • the memories RAM1.1, RAM1.2 and RAM1.3 each consist of two memory parts E, Z, which have one memory cell on each floor.
  • the calls characterizing the input floors are stored in the one memory part E, and the calls characterizing the destination floors are stored in the other memory parts Z.
  • Allocation memories are assigned to the memories RAM1.1, RAM1.2, RAM1.3, in which allocation instructions characterizing assigned calls are stored, as is known, for example, from EP-A-0 246 395.
  • R1 denotes a cost register intended for the storage of the operating costs and
  • R2 denotes a selector in the form of a further register which forms the addresses corresponding to the floor numbers, by means of which the memory locations of the first memory RAM1.1 and the assigned allocation memory can be queried.
  • the first, second and third memories RAM1.1, RAM1.2, RAM1.3, as well as the assigned allocation memories, not shown, are read-write memories which are connected to the bus SB of the microcomputer system 5.
  • the calls stored in the call memory RAM1 according to example Fig. 2 and the allocation instructions stored in the allocation memories (Fig. 3) are symbolically marked with "1", with the floors E8, E10 and E12 being allocated and E4 and E7 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.
  • the Load memory 13 stores load values in the form of a number of people who are located in cabin 2 when they depart from or drive past a floor. For a more detailed explanation, it is assumed in FIG. 2, for example, that the car 2 is in the upward travel in the area of the floor E5 and upward calls have been entered on the floors E4 and E8.
  • 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 connected to the load measuring device 7 of the cabin 2 via the microcomputer system 5 (FIG. 1). In the first case, as many of the same destination calls as the difference between the stored ones are deleted on the relevant floor Load value and the actually measured cabin load. Then 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 control circuit 14 comprises a car position register 15, a call register 16, a comparator 17 having three outputs a1, a2, a3, a first, two second and two third OR gates 18, 19, 20, each having two inputs, a first, a second, two third, two fourth and two fifth, AND inputs 21, 22, 23, 24, 25, each having two inputs, a first and second NOT gate 26, 27 and an EXOR gate 28.
  • the comparator 17 is stationary on the input side with the car position register 15 and the call register 16, which are connected to the bus SB.
  • the comparator 17 can be formed by the microprocessor of the microcomputer system 5, the third output a3 associated with the relationship “position ⁇ call” being connected to the one input of the first OR gate 18 instead of the first output a1 when the direction of travel changes (dashed line).
  • the output of the first OR gate 18 is connected to one input of the first AND gate 21, the other input of which via the second NOT gate 27, at the output of the EXOR gate 28 and at the other input of the second AND gate 22 connected.
  • the output of the first OR gate 18 is also connected via the first NOT gate 26 to the one input of the second AND gate 22, the output of which is connected to the one inputs of the third AND gate 23.
  • the one inputs of the fourth AND gates 24 are connected to the output of the EXOR gate 28, and the one inputs of the fifth AND gates 25 are connected to the output of the first AND gate 21.
  • the inputs of the EXOR element 28 are connected to a conductor FR carrying a direction signal and to a conductor RR carrying a call direction signal.
  • the outputs of the fourth AND gates 24 are connected to the one inputs of the second OR gates 19 and the outputs of the fifth AND gates 25 are connected to the one inputs of the third OR gates 20.
  • the other inputs of the third AND gates 23 are on address decoders, not shown, for the purpose of supplying module enable signals CS1 , CS2 connected, the other inputs of each of the third, fourth and fifth AND elements 23, 24, 25 assigned to one memory part E, and the other inputs of the third, fourth and fifth AND elements 23, 24 respectively assigned to the other memory part Z, 25 are connected.
  • the outputs of the third AND elements 23 are with the release connections of the memory parts E, Z of the first memory RAM1.1, that of the second OR elements 19 with the release connections of the memory parts E, Z of the second memory RAM1.2, and those of the third OR gates 20 connected to the release terminals of the memory parts E, Z of the third memory RAM1.3.
  • the other inputs of the second and third OR elements 19, 20 and the enable connections of the columns S1-S3 of the load memory 13 are also connected to the address decoders (not shown) for the purpose of supplying further component enable signals.
  • the control circuit 14 is activated in each case in the transmission of the car position and the address corresponding to the floor number of a new call into the registers 15, 16 and has the task of generating one of the Cabin position, position and direction of the call, as well as the direction-dependent signal to control the registration of the destination calls in the first, second or third memory RAM1.1, RAM1.2, RAM1.3, and access to the relevant columns S1, S2 To enable S3 of the load accumulator 13.
  • RAM2.2 each denotes an allocation memory for the memory parts E, Z of the second memory RAM1.2
  • RAM2.3 each denotes an allocation memory for the memory parts E, Z of the third memory RAM1.3.
  • a circuit 30 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 30 consists of a register 31 containing a maximum value K max of the operating costs, first and second tri-state buffers 32, 33, a NOT gate 34, a two-input OR gate 35 and a first and second, each having three inputs AND gate 36, 37.
  • the first AND gate 36 is connected on the input side to the outputs of the memory cells of the memory part E of the third memory RAM1.3 and the assigned allocation memory RAM2.3 and to the cost register R1.
  • the second AND gate 37 is connected on the input side to the memory cells of the memory part E of the second memory RAM1.2 and the assigned allocation memory RAM2.2 and also to the cost register R1.
  • the outputs of the AND gates 36, 37 are connected to the inputs of the OR gate 35, the output of which is connected to the activation connections of the first tristate buffer 32 and via the NOT gate 34 to the activation connections of the second tristate buffer 33 .
  • the register 31 is connected via the first tri-state buffers 32 to the data inputs of the comparison device 11, those via the second Tristate buffers 33 are connected to cost register R1.
  • the circuit 30 formed by the microcomputer system 5, for example on the basis of a program, is activated each time the operating costs are transferred to the cost register R1 for the floor in question.
  • FIG. 2 it may be assumed that a floor was entered on floor E4 for floor E7 and that car 2 of elevator A is in the upward direction in the area of floor E5, around the assigned calls for floors E8, E10 and E12 to use.
  • the call registration devices 8 (FIG. 1) are scanned for new incoming calls, the cabin position is initially queried and transferred to the cabin position register 15.
  • a device known from DE 28 32 973 can be used for the formation of the cabin position in binary-coded form.
  • the call identifying the input floor E4 has been found, its address is transferred to the call register 16 of all the lifts.
  • the relevant output a1 of the comparator 17 may also be logic "1".
  • the second and third memories RAM1.2, RAM1.3 can also be enabled for the calculation.
  • the operating costs are transferred to the cost register R1 and also by means of the comparison device 11 proposed according to EP-B-0 050 304 compared to the operating costs of the other elevators.
  • the Cabin 2 could therefore after the end of the descent (second half-round trip) and a further triggered transmission of the calls from the second memory (RAM1.2) to the first memory (RAM1.1), during the subsequent upward travel (third half-round trip) the calls of the floors Operate E4 and E7.
  • the output of the second AND gate 37 of the circuit becomes when the service costs are transferred to the cost register R1 30 (FIG. 3) is raised so that the first tristate buffers 32 are released, but the second tristate buffers 33 are blocked.
  • the comparison device 11 is supplied with the maximum value K max contained in the register 31 rather than the operating costs in the cost register R1, so that the elevator A cannot be assigned the new call from floor E4 to floor E7 in this situation.
  • the cost register R1 of all elevators is deleted and is available for recording the service costs of a further new call. If it is determined during the allocation process of a new call from the same floor that elevator A does not have the lowest operating costs, the allocation instructions written in the assigned allocation memories of elevator A are prevented from being deleted again can, which can be achieved for example by means of a device known from EP-A-0 308 590.

Landscapes

  • Automation & Control Theory (AREA)
  • Engineering & Computer Science (AREA)
  • Elevator Control (AREA)
  • Indicating And Signalling Devices For Elevators (AREA)
  • Exchange Systems With Centralized Control (AREA)
  • Transplanting Machines (AREA)
  • Sorption Type Refrigeration Machines (AREA)
  • Table Devices Or Equipment (AREA)
  • Telephonic Communication Services (AREA)
  • Electrostatic Spraying Apparatus (AREA)
  • Devices For Checking Fares Or Tickets At Control Points (AREA)
  • Electrophonic Musical Instruments (AREA)
  • Display Devices Of Pinball Game Machines (AREA)
  • Electrotherapy Devices (AREA)
  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)

Claims (3)

  1. Commande de groupe pour ascenseurs avec attribution immédiate d'appels de destination, comportant des dispositifs d'enregistrement d'appels (8) disposés aux étages et à l'aide desquels des appels pour des étages de destination souhaités peuvent être entrés, comportant des mémoires d'appels (RAM1) associées aux ascenseurs du groupe et reliées aux dispositifs d'enregistrement d'appels (8), moyennant quoi, lors de l'entrée d'appels à un étage, un appel caractérisant l'étage d'entrée et les appels caractérisant les étages de destination sont mis en mémoire dans lesdites mémoires d'appels (RAM1), comportant des dispositifs de mesure de charge (7) qui sont prévus dans les cabines (2) du groupe d'ascenseurs et qui sont en relation fonctionnelle avec des mémoires de charge (13) dans lesquelles sont mises en mémoire des valeurs de charge correspondant aux personnes présentes dans la cabine (2) lors d'un arrêt futur, comportant des sélecteurs (R2) associés à chaque ascenseur du groupe et indiquant respectivement l'étage d'un arrêt possible, et comportant un dispositif à l'aide duquel les appels entrés sont attribués aux cabines (2) du groupe d'ascenseurs immédiatement après leur enregistrement, étant précisé que ce dispositif possède pour chaque ascenseur un ordinateur et un dispositif comparateur (11) et que l'ordinateur calcule, à partir de données propres aux ascenseurs, des coûts de desserte correspondant aux temps d'attente de passagers, et étant précisé que des mémoires d'attribution sont associées aux mémoires d'appels (RAM1), que les coûts de desserte de toutes les cabines sont comparés entre eux à l'aide du dispositif comparateur (11) et que l'appel concerné est attribué de façon fixe, par inscription d'une instruction d'attribution dans la mémoire d'attribution associée, à la cabine (2) qui présente les coûts de desserte minimum, caractérisée
    - en ce que la mémoire d'appels (RAM1) se compose d'une première mémoire (RAM1.1) pour les appels entrés avant la cabine (2), dans le sens de marche, et de même sens, d'une seconde mémoire (RAM1.2), connue en soi, pour les appels en sens inverse, et d'une troisième mémoire (RAM1.3) pour les appels entrés après la cabine (2), dans le sens de marche, et de même sens,
    - en ce que le sélecteur (R2) n'est relié, pendant l'opération d'analyse, qu'aux cellules de la première mémoire (RAM1.1) et de la mémoire d'attribution associée,
    - en ce que la mémoire de charge (13), comme il est connu en soi, possède au moins deux colonnes (S1, S3), les valeurs de charge résultant des appels entrés avant la cabine (2), dans le sens de marche, étant mises en mémoire dans les cellules de l'une (S1) de ces colonnes, tandis que les valeurs de charge résultant des appels entrés après la cabine (2), dans le sens de marche, sont mises en mémoire dans les cellules de l'autre colonne (S3),
    - en ce qu'il est prévu un circuit de commande (14) qui est relié à la mémoire d'appel (RAM1) et à un indicateur de position de cabine, et qui est en relation fonctionnelle avec la mémoire de charge (13),
    - étant précisé que le circuit de commande (14) est activé, lors de l'entrée d'un appel, de telle sorte que, suivant la position et le sens de marche de la cabine (2), un appel de même sens soit inscrit dans la première ou la troisième mémoire d'appel (RAM1.1, RAM1.3) et que l'accès à l'une ou l'autre des colonnes (S1, S3) de la mémoire de charge (13) soit libéré, et
    - étant précisé que les appels de la troisième mémoire (RAM1. 3) sont transférés dans la seconde mémoire (RAM1. 2), lors du premier changement de sens, et dans la première mémoire (RAM1.1), lors du second changement de sens.
  2. Commande de groupe selon la revendication 1, caractérisée en ce que les première, seconde et troisième mémoires (RAM1.1, RAM1.2, RAM1.3) se composent chacune de deux éléments de mémoire (E, Z), les appels caractérisant les étages d'entrée étant mis en mémoire dans les premiers éléments de mémoires (E) tandis que les appels caractérisant les étages de destination sont mis en mémoire dans les seconds éléments de mémoires (Z).
  3. Commande de groupe selon la revendication 2, caractérisée
    - en ce que le circuit de commande (14) se compose d'un registre de position de cabine (15), d'un registre d'appels (16), d'un comparateur (17), d'un premier, de deux seconds et de deux troisièmes éléments OU (18, 19, 20) possédant chacun deux entrées, d'un premier, d'un second, de deux troisièmes, de deux quatrièmes et de deux cinquièmes éléments ET (21, 22, 23, 24, 25) possédant chacun deux entrées, d'un premier et d'un second élément NON (26, 27) et d'un élément OU exclusif (28),
    - en ce que le comparateur (17) est relié, côté entrée, au registre de position de cabine (15) et au registre d'appels (16), et est relié, par l'intermédiaire d'une première et d'une seconde sortie (a1, a2), aux entrées du premier élément OU (18),
    - en ce que la sortie du premier élément OU (18) est reliée à la première entrée du premier élément ET (21) dont la seconde entrée est raccordée, par l'intermédiaire du second élément NON (27), à la sortie de l'élément OU exclusif (28) et à la seconde entrée du second élément ET (22),
    - en ce que la sortie du premier élément OU (18) est reliée, par l'intermédiaire du premier élément NON (26), à la première entrée du second élément ET (22) dont la sortie est reliée aux premières entrées des troisièmes éléments ET (23),
    - en ce que les premières entrées des quatrièmes éléments ET (24) sont reliées à la sortie de l'élément OU exclusif (28) tandis que les premières entrées des cinquièmes éléments ET (25) sont reliées à la sortie du premier élément ET (21), les entrées de l'élément OU exclusif (28) étant raccordées à des conducteurs (FR, RR) transmettant respectivement un signal de sens de marche et un signal de sens d'appel,
    - en ce que les secondes entrées des troisièmes éléments ET (23) sont raccordées à des décodeurs d'adresses en vue de la transmission de signaux de déblocage de blocs fonctionnels (CS1, CS2), les secondes entrées des troisièmes, quatrièmes et cinquièmes éléments ET (23, 24, 25) associés chacun au premier élément de mémoire (E), et les secondes entrées des troisièmes, quatrièmes et cinquièmes éléments ET (23, 24, 25) associés chacun au second élément de mémoire (Z) étant reliées entre elles,
    - en ce que les sorties des quatrièmes éléments ET (24) sont reliées aux premières entrées des seconds éléments OU (19) tandis que les sorties des cinquièmes éléments ET (25) sont reliées aux premières entrées des troisièmes éléments OU (20), et
    - en ce que les sorties des troisièmes éléments ET (23) sont reliées à des connexions de déblocage des éléments (E, Z) de la première mémoire (RAM1.1), les sorties des seconds éléments OU (19) sont reliées à des connexions de déblocage des éléments (E, Z) de la seconde mémoire (RAM1.2) et les sorties des troisièmes éléments OU (20) sont reliées à des connexions de déblocage des éléments (E, Z) de la troisième mémoire (RAM1.3).
EP89123605A 1989-01-19 1989-12-21 Commande d'un groupe d'ascenseurs avec attribution immédiate des appels Expired - Lifetime EP0378834B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AT89123605T ATE81101T1 (de) 1989-01-19 1989-12-21 Gruppensteuerung fuer aufzuege mit sofortzuteilung von zielrufen.

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CH169/89 1989-01-19
CH16989 1989-01-19

Publications (2)

Publication Number Publication Date
EP0378834A1 EP0378834A1 (fr) 1990-07-25
EP0378834B1 true EP0378834B1 (fr) 1992-09-30

Family

ID=4180832

Family Applications (1)

Application Number Title Priority Date Filing Date
EP89123605A Expired - Lifetime EP0378834B1 (fr) 1989-01-19 1989-12-21 Commande d'un groupe d'ascenseurs avec attribution immédiate des appels

Country Status (17)

Country Link
US (1) US5065846A (fr)
EP (1) EP0378834B1 (fr)
JP (1) JP2825299B2 (fr)
CN (1) CN1014968B (fr)
AT (1) ATE81101T1 (fr)
AU (1) AU622753B2 (fr)
BR (1) BR9000192A (fr)
CA (1) CA2005026C (fr)
DE (1) DE58902382D1 (fr)
ES (1) ES2035509T3 (fr)
FI (1) FI97127C (fr)
HK (1) HK121893A (fr)
HU (1) HU205883B (fr)
MX (1) MX173520B (fr)
NO (1) NO176512C (fr)
PT (1) PT92888B (fr)
ZA (1) ZA898837B (fr)

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5714725A (en) * 1995-11-30 1998-02-03 Otis Elevator Company Closed loop adaptive fuzzy logic controller for elevator dispatching
US5786551A (en) * 1995-11-30 1998-07-28 Otis Elevator Company Closed loop fuzzy logic controller for elevator dispatching
US5841084A (en) * 1995-11-30 1998-11-24 Otis Elevator Company Open loop adaptive fuzzy logic controller for elevator dispatching
US5808247A (en) * 1995-11-30 1998-09-15 Otis Elevator Company Schedule windows for an elevator dispatcher
US5750946A (en) * 1995-11-30 1998-05-12 Otis Elevator Company Estimation of lobby traffic and traffic rate using fuzzy logic to control elevator dispatching for single source traffic
US5767462A (en) * 1995-11-30 1998-06-16 Otis Elevator Company Open loop fuzzy logic controller for elevator dispatching
US5767460A (en) * 1995-11-30 1998-06-16 Otis Elevator Company Elevator controller having an adaptive constraint generator
US5786550A (en) * 1995-11-30 1998-07-28 Otis Elevator Company Dynamic scheduling elevator dispatcher for single source traffic conditions
JPH09315708A (ja) * 1996-05-29 1997-12-09 Otis Elevator Co 群管理エレベーター
AU2006275280B2 (en) * 2005-08-04 2012-01-19 Inventio Ag Method for assigning a user to an elevator system
US8151943B2 (en) 2007-08-21 2012-04-10 De Groot Pieter J Method of controlling intelligent destination elevators with selected operation modes
JP5495871B2 (ja) 2010-03-15 2014-05-21 東芝エレベータ株式会社 エレベータの制御装置
CN101837911B (zh) * 2010-04-27 2012-10-31 天津大学 混合式电梯目的层站选择器
CN105775941A (zh) * 2014-12-26 2016-07-20 三菱电机上海机电电梯有限公司 带层站信息反馈的电梯轿厢操纵箱的控制方法
US11383954B2 (en) 2018-06-26 2022-07-12 Otis Elevator Company Super group architecture with advanced building wide dispatching logic
US11542120B2 (en) * 2018-10-24 2023-01-03 Otis Elevator Company Associated mobile elevator calls

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB1172521A (en) * 1965-11-05 1969-12-03 Dover Corp Canada Ltd Method and means for Controlling Elevator Cars
US4046228A (en) * 1975-05-05 1977-09-06 Westinghouse Electric Corporation Elevator system
CH649517A5 (de) * 1979-09-27 1985-05-31 Inventio Ag Antriebssteuereinrichtung fuer einen aufzug.
CH648001A5 (de) * 1979-12-21 1985-02-28 Inventio Ag Gruppensteuerung fuer aufzuege.
ATE51386T1 (de) * 1986-04-11 1990-04-15 Inventio Ag Gruppensteuerung fuer aufzuege.

Also Published As

Publication number Publication date
ZA898837B (en) 1990-08-29
HU896018D0 (en) 1990-02-28
PT92888B (pt) 1995-12-29
FI97127C (fi) 1996-10-25
CA2005026A1 (fr) 1990-07-19
HU205883B (en) 1992-07-28
NO900123L (no) 1990-07-20
NO900123D0 (no) 1990-01-10
CA2005026C (fr) 1999-08-10
AU622753B2 (en) 1992-04-16
ES2035509T3 (es) 1993-04-16
JP2825299B2 (ja) 1998-11-18
NO176512C (no) 1995-04-19
HUT53342A (en) 1990-10-28
JPH02239074A (ja) 1990-09-21
CN1045748A (zh) 1990-10-03
BR9000192A (pt) 1990-11-06
EP0378834A1 (fr) 1990-07-25
MX173520B (es) 1994-03-11
AU4853790A (en) 1990-07-26
US5065846A (en) 1991-11-19
FI900279A0 (fi) 1990-01-17
CN1014968B (zh) 1991-12-04
ATE81101T1 (de) 1992-10-15
HK121893A (en) 1993-11-12
DE58902382D1 (de) 1992-11-05
PT92888A (pt) 1990-07-31
FI97127B (fi) 1996-07-15
NO176512B (no) 1995-01-09

Similar Documents

Publication Publication Date Title
EP0312730B1 (fr) Commande de groupe pour ascenceurs avec commande des cabines dépendant de leur charge
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
EP0378834B1 (fr) Commande d'un groupe d'ascenseurs 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
EP0356731B1 (fr) Commande groupée avec attribution immédiate des appels
EP0301178B1 (fr) Système de commande d'ascenseur
EP0301173B1 (fr) Commande d'un groupe d'ascenceurs
EP0246395B1 (fr) Commande d'un groupe d'ascenceur
EP0320583B1 (fr) Clavier de destination et dispositif d'affichage à l'étage pour ascenseurs
EP0459169B1 (fr) Commande de groupes pour ascenseurs avec deux cabines superposées avec distribution directe d'appels
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
DE3820568C2 (fr)
EP0091554B1 (fr) Commande d'un groupe d'ascenseurs comportant un dispositif pour la commande d'une pointe de trafic descendante
EP1418147B1 (fr) Contrôleur pour ascenseur avec cabine avec plusieurs compartiments
DE3611173C2 (de) Fahrstuhlanlage mit mehreren Doppelabteil-Kabinen
EP0624540B1 (fr) Système d'ascenseur pour opération à zones
EP0365782B1 (fr) Dispositif et méthode de commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
EP0248997B1 (fr) Dispositif de commande de la répartition des cabines à un palier principal pour un groupe d'ascenseurs
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
EP0242520B1 (fr) Dispositif d'affichage pour ascenseur
EP0534123B1 (fr) Clavier de destination et dispositif d'affichage à l'étage pour ascenseurs
DE1556332A1 (de) Steuervorrichtung fuer ein Aufzugssystem
DE2151272A1 (de) Steuerungssystem fuer eine Vielzahl von Lastaufnahmemitteln

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

17Q First examination report despatched

Effective date: 19920128

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

Country of ref document: AT

Date of ref document: 19921015

Kind code of ref document: T

REF Corresponds to:

Ref document number: 58902382

Country of ref document: DE

Date of ref document: 19921105

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)
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: 2035509

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

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

Payment date: 20080317

Year of fee payment: 19

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

Ref country code: NL

Payment date: 20081216

Year of fee payment: 20

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

Ref country code: AT

Payment date: 20081215

Year of fee payment: 20

Ref country code: ES

Payment date: 20081217

Year of fee payment: 20

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

Ref country code: IT

Payment date: 20081223

Year of fee payment: 20

Ref country code: SE

Payment date: 20081212

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

Year of fee payment: 20

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

Ref country code: DE

Payment date: 20081219

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

Year of fee payment: 20

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

Ref country code: BE

Payment date: 20090130

Year of fee payment: 20

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

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

Ref country code: LI

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

Effective date: 20081231

Ref country code: CH

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

Effective date: 20081231

BE20 Be: patent expired

Owner name: *INVENTIO A.G.

Effective date: 20091221

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Expiry date: 20091220

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

Effective date: 20091221

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

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20091222

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

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20091220