EP0246395B1 - Commande d'un groupe d'ascenceur - Google Patents

Commande d'un groupe d'ascenceur Download PDF

Info

Publication number
EP0246395B1
EP0246395B1 EP87101844A EP87101844A EP0246395B1 EP 0246395 B1 EP0246395 B1 EP 0246395B1 EP 87101844 A EP87101844 A EP 87101844A EP 87101844 A EP87101844 A EP 87101844A EP 0246395 B1 EP0246395 B1 EP 0246395B1
Authority
EP
European Patent Office
Prior art keywords
call
floor
memory
assigned
calls
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
EP87101844A
Other languages
German (de)
English (en)
Other versions
EP0246395A1 (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 AT87101844T priority Critical patent/ATE51386T1/de
Publication of EP0246395A1 publication Critical patent/EP0246395A1/fr
Application granted granted Critical
Publication of EP0246395B1 publication Critical patent/EP0246395B1/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
    • 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
    • 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/214—Total time, i.e. arrival 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/235—Taking into account predicted future events, e.g. predicted future call inputs
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/40—Details of the change of control mode
    • B66B2201/403—Details of the change of control mode by real-time traffic data
    • 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 invention relates to a group control for elevators, with call registration devices arranged on the floors, with load measuring devices provided in the cabins of the elevator group, with each elevator assigned to the group, each indicating the floor of a possible stopping, with a scanning device having at least one position for each floor and with a control device, by means of which the calls entered on the floors are allocated to the cabins of the elevator group, according to the preamble of claim 1.
  • the assignments of the cars to the floor calls can be optimized in terms of time.
  • a computing device in the form of a microprocessor during a scanning cycle of a first scanner of a scanning device on each floor, whether there is a floor call or not, the distance between the floor and the car position indicated by a selector is used to determine the intermediate stops to be expected within this distance and the instantaneous cabin load is calculated as a sum proportional to the time lost by waiting passengers and the time lost by passengers in the cabin.
  • the cabin load at the time of the calculation is corrected in such a way that the expected boarding and disembarking operations, derived from the number of boarding and disembarking passengers in the past, are taken into account in future stops.
  • This total loss time also called operating costs, is stored in a cost memory.
  • the operating costs of all elevators are compared with one another via a cost comparison device, an allocation instruction being stored in an allocation memory of the elevator with the lowest operating costs, which designates the floor to which the relevant car is optimally assigned in terms of time.
  • the intermediate stops required for the calculation of the service costs result from the floor and cabin calls entered. Since the floor and cabin calls are usually entered by means of call buttons arranged on the floors or in the cabin, a passenger must dial twice in order to arrive at a destination, with access to the cabin panel often being difficult when the cabin is occupied. Under these circumstances, the control device finds the desired destination relatively late, which therefore cannot be billed for the optimization of the allocation.
  • the invention has for its object to provide a group control according to the preamble, in which the temporal optimization of the assignments cabin / call is improved compared to the first-mentioned prior art and the disadvantages of the last-mentioned prior art are avoided.
  • the call registration device has call buttons in the form of a 10-key keyboard and a number of call memories corresponding to the number of floors, it being possible for calls to be input for desired destination floors, as is known from the last-mentioned prior art.
  • the call memories are connected to the floor call memory and the car call memory, wherein if there is at least one call registered by a call registration device in the floor call memory, a call is stored for the floor identified by the call registration device in question.
  • the car call memory consists of a first, already assigned car calls containing memory and the storeys assigned further storeys, in which the calls entered for the desired storey floors, but not yet assigned to a car, are stored, which are taken into account in the calculation of the service costs .
  • the first memory, the further memories, the floor call memory and the allocation memory are linked to one another by means of a first coincidence circuit in such a way that when a floor call is allocated, the calls stored in the allocated further memory are transmitted to the first memory.
  • the advantages achieved by the invention are that the complete passenger data are available to the control at an early stage, so that the optimization of the cabin / call assignments is improved, with the waiting times becoming shorter and the conveying capacity increasing. Other advantages will be This means that passengers only have to press call buttons once and the obstacles that often occur when entering calls in the cabin are eliminated. Due to the lack of a cabin panel, fewer cables are required in the hanging cable. The use of the 1-Ger keyboard is also an advantage, as this saves space and lines, especially in systems with many floors, and it is possible to standardize the floor table.
  • 1, 1 denotes an elevator shaft of an elevator a of an elevator group consisting of, for example, three elevators a, b and c.
  • a conveyor machine 2 drives a car 4 guided in the elevator shaft 1 via a conveyor cable 3, n floors EO to En being served, of which only the top floors En-4 to En are shown.
  • the carrier 2 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 realized by means of a microcomputer system 5, and with 6 the measuring and actuating elements of the drive control which are symbolized are connected to the microcomputer system 5 via a first interface IF1.
  • the cabin 4 has a load measuring device 7 and a device 8 signaling the respective operating state Z of the cabin, which are likewise connected to the microcomputer system 5 via the first interface IF1.
  • Call registering devices 9 which are described in greater detail below with reference to FIGS. 2 and 3, are provided on the floors, by means of which calls can be entered for trips to desired target floors.
  • the call registration devices 9 are connected via an address bus AB and a data input conductor CRUIN of a serial input / output bus CRU to the microcomputer system 5 and to an input device which has become known from EP-B-0 062 141 and which consists of a comparison device 10 and a DMA module DMA.
  • the call registration devices 9 are also connected via lines 11 to the microcomputer systems and input devices of the elevators b and c.
  • the microcomputer system 5 consists of a storey call memory RAM1, a car call memory RAM2 described in more detail below with reference to FIG. 4, a memory RAM3 storing the current car load P M and the operating state Z of the car 4, and a cost memory RAM4 for the UP and DOWN directions of travel , an allocation memory RAM5 for UP and DOWN direction of travel, a program memory EPROM and a microprocessor CPU, which is connected via the address bus AB, a data bus DB and a control bus STB to the memories RAM1 to RAM5, EPROM.
  • R1 and R2 denote a first and a second scanner of a scanner, the scanner R1, R2 being registers by means of which addresses corresponding to the floor numbers and the direction of travel are formed.
  • R3 denotes a selector in the form of a further register which, when the car is moving, displays the address of the floor on which the car could still stop.
  • the selector addresses are assigned target paths which are compared with a target path generated in a setpoint generator. If the paths are identical and a stop command is present, the delay phase is initiated. If there is no stop command, the selector R3 is switched to the next floor.
  • the microcomputer systems 5 of the individual elevators a, b, c are comparator device 12 and a second interface IF2 known from EP-B-0 050 304 and a party line transmission system 13 and known from EP-B-0 050 305 a third interface IF3 connected to one another and in this way form the group control according to the invention.
  • the call registration device 9 which is designed, for example, for one- and two-digit calls, consists of a keyboard 20 which has ten keys for the digits 1 ... 9 and 0 for entering calls to desired destination floors.
  • an eleventh key labeled " " can be used as a pre-selection key for calls for floors below the ground floor, the ground floor being identified by the number 0.
  • a twelfth key labeled "C” could be used for other purposes such as
  • the keys of the numbers 1 ... 9 and 0 are connected to the first inputs of the first AND elements 21.1 ... 21.9, 21.0, the outputs of which have inputs S from key memories 23.1.
  • the keys of the digits 1 ... 9 and 0 are also connected to first inputs of second AND gates 22.1 ... 22.9, 22.0, the outputs of which are connected to inputs S of key memories 24.1 ... 24.9, 24.0 for storing a second entered digit in ver bond.
  • RS flip-flops for example, can be used as the key memory.
  • the outputs Q of all key memories are connected to the inputs of a combinatorial logic 25, the outputs of which are connected to first inputs of third AND gates 26.0, 26.1 ... 26.n, the output memories having call memories 27.0, 27.1 assigned to the floors on the output side ... 27.n, in the form of, for example, RS flip-flops.
  • the combinatorial logic 25 works in such a way that when a single-digit call is entered, one of the call memories 27.0, 27.1 ... 27.9 assigned to the floors EO, E1 ... E9, and when one two-digit call is entered, one of the floors E10 ... En assigned Call memory 27.10 ... 27.n is set. For example, if calls are entered for floors E1 and E13, combinational logic 25 must do the equations meet, where the input variables 1 ', 2', 3 ' Vietnamese mean the first digit entered and 1 ", 2", 3 "... the second digit entered and the output variables 1, 13 the selected destination floors E1, Designate E13.
  • the outputs Q of the call memory 27.0, 27.1 ... 27.n are connected to inputs of a multiplexer 28 and an OR gate 29, the output of which is connected to the first input of the multiplexer 28.
  • the multiplexer 28 is also connected to the address bus AB and is connected on the output side to the data input conductor CRUIN.
  • the outputs Q of the call memory 27.0, 27.1 ... 27.n are connected via lines 11 (FIG. 1) to the multiplexers 28 and OR gates 29 of the elevators b and c.
  • a time limit circuit for the call input which consists of a monoflop 31, a first and second delay element 32, 33, a first, second and third NOT element 34, 35, 36 and a first and second AND- each having two inputs Link 37, 38 exists.
  • the keys of the digits 1 ... 9 and 0 are connected to the input e of the monoflop 31 via an OR gate 39, a further delay gate 40 and a further AND gate 41 having two inputs.
  • the output a of the monoflop 31 is at the input of the first delay element 32, at second inputs of the second AND elements 22.1 ... 22.9, 22.0 and via a further NOT element 42 at second inputs of the first AND elements 21.1 ... 21.9 , 21.0 connected.
  • the output of the first delay element 32 is connected to the input of the second delay element 33, the output of which is connected via the first NOT element 34 to the second input of the further AND element 41.
  • Logic modules connected in series can be used as delay elements, the delay time resulting from the signal transit time.
  • the output a of the monoflop 31 is. connected via the second NOT gate 35 to an input of the first AND gate 37, the second input of which is connected to the output of the first delay element 32 and the output of which is connected to the second inputs of the third AND gate connected upstream of the call memories 27.0, 27.1 ... 27.n. 26.0, 26.1 ... 26.n is connected.
  • the output of the first delay element 32 is connected via the third NOT element 36 to an input of the second AND element 38, the second input of which is connected to the output of the second delay element 33 and the output of which is connected to reset connections R of the key memory.
  • the call registration device 9 described above operates as follows:
  • the falling edges of the output signals of the monoflop 31 and the first delay element 32 generate a pulse at the output of the first AND element 37, by means of which the third AND elements 26.0, 26.1 ... 26.n are released and that of the floor E13 assigned call memory 27.13 is set (time 111, FIG. 3).
  • a further pulse is generated by the falling edges of the output signals of the first and second delay elements 32 and 33 at the output of the second AND element 38, by means of which all the key memories are reset (time IV, FIG. 3).
  • the falling edge of the second delay element 33 With the falling edge of the second delay element 33, he is STE NOT gate 34 and the further AND gate 41, the monoflop 31 released, so that another call can be entered. (Time V, Fig. 3).
  • the call memories 27.0, 27.1 ... 27.n can be scanned via the multiplexer 28 and stored calls can be transmitted to the microcomputer system 5 of the elevator in question. If at least one call is present, the first input of the multiplexer 28 is activated via the OR gate 29 and the assigned address is interpreted as the address of a floor call.
  • the addresses assigned to the other inputs of multiplexer 28 are interpreted as addresses of car calls, with, for example, a first part of the address serving as the destination floor, and a second part of the address as the selection code of the multiplexer in question, and denoting the floor on which the call for the destination floor was entered.
  • the calls are transmitted to the microcomputer system 5 in such a way that the microprocessor CPU signals its readiness to accept interrupt requests CINT by means of an enable signal CIEN.
  • the DMA module is activated by the enable signal and takes control of the address bus AB and the serial input / output bus CRU.
  • the call memories 27.0, 27.1 ... 27.n of the call registration devices 9 and a read-write memory flag RAM of the comparison device 10 are queried by means of the addresses now generated by the DMA module.
  • the comparison device 10 the content of the call memories 27.0, 27.1 ... 27.n and the associated memory locations of the random access memory Flag-RAM are compared.
  • the microprocessor CPU now executes an interrupt program, which reads the data bit located on the data input line CRUIN and at the address located on the address bus AB in the floor call memory RAM1 or in the car call memory RAM2 and via a data line Do of the data bus DB in the read-write memory Register RAM flag.
  • the car call memory RAM2 consists of a first memory RAM2 ', which has memory locations corresponding to the number of floors, and in which calls which have already been allocated are stored.
  • RAM2.0, RAM2.1 ... RAM2.n designate further memories assigned to floors EO, E1 ... En, which also have memory locations corresponding to the number of floors.
  • RAM2.0, RAM2.1 ... RAM2.n only the calls entered on the relevant floors that have not yet been assigned to a specific cabin are transferred using the method described in the previous section.
  • the first memory RAM2 ', the further memories RAM2.0, RAM2.1 ... RAM2.n, the storey call memory RAM1 and the allocation memory RAM5 are linked to one another via a coincidence circuit symbolized by AND elements 50 and 51.
  • the coincidence circuit formed by the microprocessor CPU on the basis of a program at each position of the second scanner R2 has the effect that, if an assignment instruction determined in the manner described below and a floor call to the same floor coincide, the calls stored in the associated further memory are transmitted to the first memory RAM2 ' with which they are allocated and released for scanning by the selector R3. According to the selected example, only the allocation memory RAM5 for the UP direction of travel is shown in FIG. 4.
  • RAM4 ', RAM4 "and RAM4 "' are cost share stores, in which, as explained in more detail below, service cost shares K i , K A and K; ' are saved.
  • the cost share memory RAM4 ', RAM4 "and RAM4' ", the cost memory RAM4, the storey call memory RAM1 and the car call memory RAM2 are linked to each other at every position of the first scanner R1.
  • the link required for the operations described in more detail below is carried out by the microprocessor CPU on the basis of a program. According to the selected example, only the cost memory RAM4 and the cost share memory RAM4 ', RAM4 "and RAM4"' for the OPEN travel direction are shown in FIG. 5.
  • the first scanners R1 of the elevators a, b, c begin with one cycle, hereinafter referred to as the KBZ cost calculation cycle, starting from the selector position in the direction of travel of the relevant cabin (time 1, FIG. 6).
  • R E c the number of coincidences of car calls and assigned floor calls between selector and scanner position
  • the operating costs K, K l , K A determined according to the above equation are stored in the cost memory RAM4 or in the cost share memories RAM4 ', RAM4 ". If a car call Rc is present at the time of the calculation at the scanning position concerned, the operating costs K reduced by setting the internal service costs Ki to 0. By forming a new address, the scanner R1 is switched to the next floor and a new calculation is carried out.
  • the scanning takes place in the upward direction using the scanner R1 and when the scanner position E10 is reached it is established that the floor call which has not yet been allocated is stored with regard to the location of the RAM2.10 in the further memory for the floor E14 Call is an upward call, the service costs K are stored in the memory RAM4 assigned to the UP direction.
  • the second scanners R2 simultaneously begin one round for all elevators a, b, c, hereinafter referred to as the KVZ cost comparison cycle, starting from the floor EO (time III, FIG. 6).
  • the KVZ cost comparison cycles start five to ten times per second.
  • the operating costs K contained in the cost memories RAM4 of the elevators a, b, c are fed to the cost comparison device 12 and compared with one another, wherein in the allocation memory RAM5 of the elevator a, b, c with the lowest operating costs K, an allocation instruction in the form of a Logical "1" can be stored, which denotes the floor to which the elevator a, b, c in question is optimally assigned in terms of time.
  • a reassignment may take place by deleting an assignment instruction for elevator b and enrolling one for elevator a (FIG. 4).
  • a new cost calculation cycle KBZ is started for lifts a and b and the cost comparison cycle KVZ is interrupted because the former has priority.
  • a call is stored in the floor call memory RAM1 for floor E9, so that by activating the AND gates 51 of the coincidence circuit, the calls stored in the associated further memory RAM2.9, for example for floors E11 and E13, are stored in the first memory RAM2 'of the car call memory RAM2 are transmitted, and are therefore also assigned to the elevator a.
  • these calls are now taken into account as cabin calls Rc or floor calls R E in equation GL1.
  • the selector R3 is switched on and when the scanning position E9 is reached, it is determined that the allocation instruction is stored in the allocation memory RAM5 assigned to the UP direction of travel, so that the calls for the floors E9, E11 and E13 must be served by the elevator a, which according to the example is in the upward direction.
  • the deceleration phase is initiated and the car 4 of the elevator a on the floor E9 is stopped.
  • the microprocessor CPU of elevator a If, during the delay phase on floor E9, further calls are entered for destination floors lying in the direction of travel of cabin 4, the microprocessor CPU of elevator a, after these calls have been written into the further memory RAM2.9, causes them to be immediately transferred to the first memory RAM2 '. with which they are allocated to the elevator a without the allocation procedure described above.
  • the cost comparison is then continued from scanner position E10 in order to be interrupted again at scanner position E7 (downward) by the occurrence of an event in elevator c, for example a change in the selector position (time VI).
  • the cost comparison cycle KVZ continues and its termination when the scanner is set to E1 (downward).
  • a further cost calculation cycle KBZ for elevator a runs between times VIII and IX, whereupon the next cost comparison cycle KVZ is started at time X.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Elevator Control (AREA)
  • Compositions Of Oxide Ceramics (AREA)
  • Indicating And Signalling Devices For Elevators (AREA)
  • Glass Compositions (AREA)
  • Thermally Insulated Containers For Foods (AREA)
  • Lift-Guide Devices, And Elevator Ropes And Cables (AREA)
  • Dry Shavers And Clippers (AREA)
  • Electromagnets (AREA)
  • Sorption Type Refrigeration Machines (AREA)
  • Massaging Devices (AREA)

Claims (8)

1. Commande de groupe pour ascenseurs, comportant des dispositifs d'enregistrement d'appels (9) disposés au niveau des étages, des dispositifs de mesure de charge (7) prévus dans les cabines du groupe d'ascenseurs, des sélecteurs (R3) associés à chaque ascenseur du groupe et indiquant respectivement l'étage d'un arrêt possible, un dispositif d'exploration (R1, R2) comportant au moins une position pour chaque étage, et un dispositif de commande à l'aide duquel les appels déclenchés au niveau des étages sont affectés aux cabines du groupe d'ascenseurs, le dipositif de commande comportant, pour chaque ascenseur, un dispositif de calcul (CPU), une mémoire d'appels d'étage (RAM1) et une mémoire d'appels de cabine (RAM2), tandis que le dispositif de calcul (CPU) calcule, pour chaque position d'un premier circuit d'exploration (R1) du dispositif d'exploration (R1, R3), des coûts de fonctionnement (K) correspondant aux temps d'attente de passagers, conformément à la relation
K =tv(PM+K1.RE-k2.Rc) + k1[m.tm+tv(RE+RC-REC+Z)] dans laquelle:
tv retard lors d'un arrêt intermédiaire,
PM charge instantanée au moment du calcul,
RE nombre d'appels d'étage affectés entre la position du sélecteur et la position du circuit d'exploration Rc nombre d'appels de cabine entre la position du sélecteur et la position du circuit d'exploration
ki nombre prévisible, déterminé en fonction des conditions de trafic, de personnes montant pour chaque appel d'étage,
k2 nombre prévisible, déterminé en fonction des conditions de trafic, de personnes descendant pour chaque appel de cabine,
m nombre des distances entre étages entre la position du sélecteur et la position du circuit d'exploration
tm durée moyenne du trajet pour chaque distance entre étages
REC nombre de coïncidences d'appels de cabine et d'appels d'étage affectés, entre la position du sélecteur et la position du circuit d'exploration,
Z supplément qui dépend de l'état de service de la cabine.
tv(PM+k1RE-k2.RC) coûts internes de fonctionnement Kl, et k1(m.tm+tv(RE+Rc-REC+Z) coût externes de fontionnement KA,
une mémoire de coûts (RAM4) mémorisant les coûts de fonctionnement (K), des mémoires respectives de coûts partiels (RAM4', RAM4"') mémorisant les coûts internes et les coûts externes de fonctionnement (KI, KA), un dispositif comparateur de coûts (12) déterminant la cabine présentant les coûts de fonctionnement (K) les plus faibles pour chaque position d'un second circuit d'exploration (R2), et une mémoire d'affectations (RAM5) étant prévus, et une instruction d'affectation pour un appel d'étage de la position concernée du circuit d'exploration pouvant être enregistrée dans la mémoire d'affectations (RAM5) de la cabine présentant les coûts de fonctionnement (K) les plus faibles, caractérisée
- en ce que le dispositif d'enregistrement d'appels (9) comporte des boutons d'appel se présentant sous la forme d'un clavier décadique (20) et un nombre de mémoires d'appels (27.0, 27.1, ... 27.n) correspondant au nombre des étages, des appels pour des étages de destination désirés pouvant être introduits à l'aide des boutons d'appel,
- en ce que les mémoires d'appels (27.0, 27.1 ... 27.n) sont reliées à la mémoire d'appels d'étage (RAM1) et à la mémoire d'appels de cabine (RAM2), auquel cas, en présence d'au moins un appel enregistré par un dispositif d'enregistrement d'appels (9) dans la mémoire d'appels d'étage (RAM1), un appel est mémorisé pour l'étage caractérisé par le dispositif d'enregistrement d'appels (9) concerné,
- en ce que la mémoire d'appels de cabine (RAM2) d'un ascenseur est constituée par une première mémoire (RAM2') contenant des appels de cabine (RC) déjà affectés, et par d'autres mémoires (RAM2.0, RAM2.1 ... RAM2.n) associées aux étages, auquel cas, dans les autres mémoires, se trouvent mémorisés les appels qui sont déclenchés au niveau des étages de destination désirés, sans être encore affectés à une cabine, et qui sont pris en compte simultanément lors du calcul des coûts de fonctionnement (K) de la position du circuit d'exploration associée à l'étage considéré, et
- en ce que la première mémoire (RAM2'), les autres mémoires (RAM2.0, RAM2.1 ... RAM.n), la mémoire d'appels d'étage (RAM1) et la mémoire d'affections (RAM5) sont reliées entre elles au moyen d'un circuit à coïncidence (50, 51), de telle sorte que, dans le cas de l'affectation d'un appel d'étage, les appels mémorisés dans l'autre mémoire associée (RAM2.0, RAM2.1 ... RAM2.n) sont transférés dans la première mémoire (RAM2').
2. Commande de groupe selon la revendication 1, caractérisée en ce qu'en présence d'un appel d'étage non encore affecté, les coû ts de fonctionnement (K) de la position considérée du circuit d'exploration sont calculés conformément aux relations
K = Kj+KA+Ki,
K'l = tv(P' M+k1. R' E-k2 ' R' c) dans lesquelles
P'M charge attendue, obtenue à partir de la relation tv-P'M=Kl, lorsque l'appel d'étage affecté est obtenu,
K' coûts internes supplémentaires de fonctionnement provoqués par les appels mémorisés dans l'autre mémoire associée (RAM2.0, RAM2.1 ... RAM2.n),
R' nombre d'appels d'étage affectés entre l'étage de montée et l'étage de destination d'un appel non encore affecté, et
R'c nombre d'appels de cabine entre l'étage de montée et l'étage de destination de l'appel non encore affecté.
3. Commande de groupe selon la revendication 2, caractérisée en ce qu'il est prévu une autre mémoire de coûts partiels (RAM4") dans laquelle sont mémorisés les coûts internes supplémentaires de fonctionnement (K'l), et en ce que l'autre mémoire de coûts partiels (RAM4"), les mémoires de coûts partiels (RAM4", RAM4"), qui mémorisent les coûts internes et les coûts externes de fonctionnement (Ki, KA), la mémoire de coûts (RAM4) mémorisant d'étage (RAM1) et la mémoire d'appels de cabine (RAM2) sont combinées entre elles de telle sorte que, en présence d'un appel d'étage ou de cabine affecté et d'un appel de cabine non encore affecté pour la même position du circuit d'exploration, les coûts de fonctionnement (K) devant être mémorisés dans la mémoire de coûts (RAM4) ne sont pas augmentés des coûts internes supplémentaires de fonctionnement (K'l).
4. Commande de groupe selon la revendication 1, caractérisée
- en ce que les touches des chiffres 1 ... 9 et 0 du clavier décadique (20) sont reliées à des mémoires de touches (23.1 ... 23.9, 23.0) utilisées pour la mémorisation d'un chiffre introduit en premier lieu, et à des mémoires de touches (24.1 ... 24.9, 24.0) utilisées pour la mémorisation d'un second chiffre introduit,
- en ce que les sorties (Q) de toutes les mémoires des touches sont reliées à des entrées d'un circuit logique combinatoire (25) dont les sorties sont reliées par l'intermédiaire de circuits ET (26.0, 26.1 ... 26.n) à des entrées (S) des mémoires d'appels (27.0, 27.1 ... 27.n), et
- en ce qu'il est prévu un circuit (30) de limitation du temps qui est relié, côté entrée, aux touches des chiffres 1 ... 9 et 0 et côté sortie, aux bornes (R) de remise à zéro de toutes les mémoires des touches, ainsi que par l'intermédiaire des circuits ET (26.0, 26.1 ... 26.n), aux entrées (S) des mémoires d'appels (27.0, 27.1 ... 27.n),
- le circuit (30) de limitation du temps étant activé par l'introduction d'un chiffre pendant un intervalle de temps déterminé prévu pour l'introduction d'un second chiffre et, après l'écoulement de cet intervalle de temps, la mémoire d'appels (27.0, 27.1 ... 27.n) associée au premier chiffre ou éventuellement aux premier et second chiffres, étant positionnée et toutes les mémoires des touches étant ramenées à l'état initial.
5. Commande de groupe selon la revendication 4, caractérisée en ce que l'intervalle de temps déterminé prévu pour l'introduction d'un second chiffre est égal à une seconde.
6. Commande de groupe selon la revendication 4, caractérisée
- en ce que le circuit (30) de limitation du temps est constitué par une bascule monostable (31), par des premier et second circuits de retardement (32, 33), par des premier, second et troisième circuits NON (34, 35, 36) et par des premier et second circuits ET (37, 38) possédant chacun deux entrées,
- en ce que l'entrée (e) de la bascule monostable (31) est reliée, par l'intermédiaire d'un autre circuit ET (41) comportant deux entrées, d'un autre circuit de retardement (40) et d'un circuit OU (39), aux touches des chiffres 1 ... 9 et 0,
- en ce que la sortie (a) de la bascule monostable (31) est raccordée à l'entrée du premier circuit de retardement (32) et, par l'intermédiaire du second circuit NON (35), à une entrée du premier circuit ET (37) dont la seconde entrée est reliée à la sortie du premier circuit de retardement (32) et dont la sortie est reliée à des entrées des circuits ET (26.0, 26.1 ... 26.n) branchés en amont des mémoires d'appel (26.0, 27.1 ... 27.n),
- en ce que la sortie du premier circuit de retardement (32) est reliée à l'entrée du second circuit de retardement (33) et, par l'intermédiaire du troisième circuit NON (36) à une entrée du second circuit et (38) dont la seconde entrée est raccordée à la sortie du second circuit de retardement (33) et dont la sortie est raccordée aux bornes de remise à zéro (R) de toutes les mémoires des touches, et
- en ce que la sortie du second circuit de retardement (33) est reliée, par l'intermédiaire du premier circuit NON (34), à une entrée de l'autre circuit ET (41).
7. Commande de groupe selon la revendication 1, caractérisée en ce que les sorties (Q) des mémoires d'appels (27.0, 27.1 ... 27.n) sont raccordées aux entrées de données d'un multiplexeur (28) et aux entrées d'un circuit OU (29) dont la sortie est reliée à la première entrée de données du multiplexeur (28), et en ce que les entrées d'adresses du multiplexeur (28) sont reliées à un bus de transmission d'adresses (AB) du dispositif de commande, l'adresse associée à la première entrée de données étant interprétée par le dispositif de commande en tant qu'adresse d'un appel d'étage, tandis que les adresses associées aux entrées de données restantes sont interprétées en tant qu'adresses d'appels de cabine.
EP87101844A 1986-04-11 1987-02-10 Commande d'un groupe d'ascenceur Expired - Lifetime EP0246395B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AT87101844T ATE51386T1 (de) 1986-04-11 1987-02-10 Gruppensteuerung fuer aufzuege.

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CH1440/86 1986-04-11
CH144086 1986-04-11

Publications (2)

Publication Number Publication Date
EP0246395A1 EP0246395A1 (fr) 1987-11-25
EP0246395B1 true EP0246395B1 (fr) 1990-03-28

Family

ID=4210507

Family Applications (1)

Application Number Title Priority Date Filing Date
EP87101844A Expired - Lifetime EP0246395B1 (fr) 1986-04-11 1987-02-10 Commande d'un groupe d'ascenceur

Country Status (8)

Country Link
US (1) US4718520A (fr)
EP (1) EP0246395B1 (fr)
JP (1) JPH078706B2 (fr)
AT (1) ATE51386T1 (fr)
CA (1) CA1265631A (fr)
DE (1) DE3762040D1 (fr)
ES (1) ES2014264B3 (fr)
FI (1) FI82917C (fr)

Families Citing this family (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0301173B1 (fr) * 1987-07-28 1991-09-04 Inventio Ag Commande d'un groupe d'ascenceurs
EP0308590B1 (fr) * 1987-09-24 1993-01-13 Inventio Ag Commande d'un groupe d'ascenceurs avec attribution immédiate des appels
DE3865803D1 (de) * 1987-10-20 1991-11-28 Inventio Ag Gruppensteuerung fuer aufzuege mit lastabhaengiger steuerung der kabinen.
ATE82560T1 (de) * 1987-12-18 1992-12-15 Inventio Ag Auf den stockwerken angeordnete rufregistrierund anzeigeeinrichtungen fuer aufzuege.
US4793443A (en) * 1988-03-16 1988-12-27 Westinghouse Electric Corp. Dynamic assignment switching in the dispatching of elevator cars
US4790412A (en) * 1988-03-16 1988-12-13 Westinghouse Electric Corp. Anti-bunching method for dispatching elevator cars
US4784240A (en) * 1988-03-16 1988-11-15 Westinghouse Electric Corp. Method for using door cycle time in dispatching elevator cars
US4782921A (en) * 1988-03-16 1988-11-08 Westinghouse Electric Corp. Coincident call optimization in an elevator dispatching system
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
US5022497A (en) * 1988-06-21 1991-06-11 Otis Elevator Company "Artificial intelligence" based crowd sensing system for elevator car assignment
CA1315900C (fr) * 1988-09-01 1993-04-06 Paul Friedli Systeme centralise de commande d'ascenseurs avec attribution immediate de cabines-cibles
ES2047073T3 (es) * 1988-10-28 1994-02-16 Inventio Ag Procedimiento y dispositivo para el control de grupos de ascensores con cabinas dobles.
HU205883B (en) * 1989-01-19 1992-07-28 Inventio Ag Connection arrangement for grouped controlling elevators
EP0407731B1 (fr) * 1989-07-11 1993-08-18 Inventio Ag Méthode de traitement d'appels enregistrés en cabine d'ascenseur
ATE102578T1 (de) * 1989-09-27 1994-03-15 Inventio Ag Verfahren zur behandlung von in aufzugskabinen abgesetzten 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.
US5329076A (en) * 1992-07-24 1994-07-12 Otis Elevator Company Elevator car dispatcher having artificially intelligent supervisor for crowds
CH693065A5 (de) * 1994-08-30 2003-02-14 Inventio Ag Aufzugsanlage.
JPH09315708A (ja) * 1996-05-29 1997-12-09 Otis Elevator Co 群管理エレベーター
DE59711102D1 (de) * 1996-09-26 2004-01-22 Inventio Ag Steuerungseinrichtung für einen Aufzug
KR100218388B1 (ko) * 1996-11-28 1999-09-01 이종수 엘리베이터의 부름등록층 입력방법 및 회로
AU9444098A (en) * 1997-10-10 1999-05-03 Kone Corporation Control method for an elevator group
US6173816B1 (en) 1997-12-30 2001-01-16 Otis Elevator Company Hallway-entered destination information in elevator dispatching
WO1999050164A1 (fr) * 1998-03-30 1999-10-07 Mitsubishi Denki Kabushiki Kaisha Organe de commande d'ascenseur
TWI250964B (en) * 2001-12-17 2006-03-11 Inventio Ag Device and system for modernisation of a lift installation
TWI268906B (en) * 2001-12-17 2006-12-21 Inventio Ag Method of modernising a lift installation and computer readable storage medium recording computer program for modernising a lift installation
MY137800A (en) * 2001-12-19 2009-03-31 Inventio Ag Control panel and method for using a control panel in an elevator
EP1321414B1 (fr) * 2001-12-19 2006-03-01 Inventio Ag Tableau de commande et méthode pour l'utilisation d'un tableau de commande dans un ascenseur
EP1553038A1 (fr) * 2004-01-06 2005-07-13 Inventio Ag Procédé de commande d'un groupe d'ascenseurs économique au niveau énergétique et d'un group d'ascenseurs
JP5138864B2 (ja) 2004-01-06 2013-02-06 インベンテイオ・アクテイエンゲゼルシヤフト エネルギー節約型エレベータコントロール法、およびエレベータ設備
ATE547373T1 (de) 2004-08-04 2012-03-15 Otis Elevator Co Rillenscheibe zur verwendung in einem aufzugssystem
US8047333B2 (en) 2005-08-04 2011-11-01 Inventio Ag Method and elevator installation for user selection of an elevator
US7549517B2 (en) * 2005-08-29 2009-06-23 Otis Elevator Company Elevator car dispatching including passenger destination information and a fuzzy logic algorithm
WO2009024853A1 (fr) * 2007-08-21 2009-02-26 De Groot Pieter J Système de commande d'ascenseur de destination intelligent
EP2238065B1 (fr) * 2008-01-17 2016-03-30 Inventio AG Procédé d'attribution d'appels d'une installation d'ascenseur et installation d'ascenseur dotée d'une attribution d'appels selon ce procédé
WO2009090207A1 (fr) * 2008-01-17 2009-07-23 Inventio Ag Système d'ascenseur, procédé de commande d'un tel système d'ascenseur et procédé pour transformer ultérieurement un système d'ascenseur existant en un tel système d'ascenseur
WO2009132698A1 (fr) * 2008-04-29 2009-11-05 Inventio Ag Système d'ascenseur et commande d'appel pour l'utilisation d'un système d'ascenseur
WO2011129803A1 (fr) * 2010-04-12 2011-10-20 Otis Elevator Company Commande de répartition pour ascenseurs afin d'éviter la confusion de passagers
JP6431841B2 (ja) * 2012-09-11 2018-11-28 コネ コーポレイションＫｏｎｅ Ｃｏｒｐｏｒａｔｉｏｎ エレベータシステム
CN103708310B (zh) * 2014-01-14 2017-01-11 河海大学常州校区 一种内外称重智能电梯系统
CN114044415A (zh) * 2021-10-12 2022-02-15 深圳达实智能股份有限公司 一种首层门禁派送电梯的方法和系统

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3374864A (en) * 1964-02-06 1968-03-26 Port Leo Weiser Elevator control wherein car destination is registered by same switch which registers car call
US3493922A (en) * 1967-03-07 1970-02-03 Otis Elevator Co Car call signalling system
JPS5117777B1 (fr) * 1970-10-19 1976-06-04
US4363381A (en) * 1979-12-03 1982-12-14 Otis Elevator Company Relative system response elevator call assignments
CH648001A5 (de) * 1979-12-21 1985-02-28 Inventio Ag Gruppensteuerung fuer aufzuege.
CH658852A5 (de) * 1982-04-08 1986-12-15 Inventio Ag Gruppensteuerung fuer aufzuege mit einer einrichtung fuer die steuerung des abwaertsspitzenverkehrs.
JPS59227672A (ja) * 1983-06-07 1984-12-20 三菱電機株式会社 エレベ−タの運転装置
US4600087A (en) * 1983-07-22 1986-07-15 Mitsubishi Denki Kabushiki Kaisha Apparatus for registering elevator call
US4638889A (en) * 1985-06-10 1987-01-27 Westinghouse Electric Corp. Elevator system

Also Published As

Publication number Publication date
FI82917B (fi) 1991-01-31
EP0246395A1 (fr) 1987-11-25
FI871504A0 (fi) 1987-04-07
DE3762040D1 (de) 1990-05-03
ATE51386T1 (de) 1990-04-15
JPH078706B2 (ja) 1995-02-01
CA1265631A (fr) 1990-02-06
FI871504A (fi) 1987-10-12
FI82917C (fi) 1991-05-10
US4718520A (en) 1988-01-12
JPS62264179A (ja) 1987-11-17
ES2014264B3 (es) 1990-07-01

Similar Documents

Publication Publication Date Title
EP0246395B1 (fr) Commande d'un groupe d'ascenceur
EP0301178B1 (fr) Système de commande d'ascenseur
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
EP0091554B1 (fr) Commande d'un groupe d'ascenseurs comportant un dispositif pour la commande d'une pointe de trafic descendante
EP0891291B1 (fr) Systeme de commande pour plusieurs groupes d'ascenseurs a commande d'appel cible
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
DE112009002258B4 (de) Fahrstuhlgruppen-Verwaltungssystem
EP1418147B1 (fr) Contrôleur pour ascenseur avec cabine avec plusieurs compartiments
EP1565396B1 (fr) Procede pour commander un systeme d'ascenseurs et systeme d'ascenseurs pour mettre en oeuvre le procede
EP0199015B1 (fr) Dispositif de commande d'ascenseur en fonction de la charge
EP0459169B1 (fr) Commande de groupes pour ascenseurs avec deux cabines superposées avec distribution directe d'appels
EP0356731B1 (fr) Commande groupée avec attribution immédiate des appels
EP0301173B1 (fr) Commande d'un groupe d'ascenceurs
EP0365782B1 (fr) Dispositif et méthode de commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
EP0624540B1 (fr) Système d'ascenseur pour opération à zones
DE3611173A1 (de) Fahrstuhlanlage mit mehrabteilkabinen-rufzuweisung
EP0134892B1 (fr) 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
EP0378834B1 (fr) Commande d'un groupe d'ascenseurs avec attribution immédiate des appels
EP0308590B1 (fr) Commande d'un groupe d'ascenceurs avec attribution immédiate des appels
EP0242520B1 (fr) Dispositif d'affichage pour ascenseur
EP1193207A1 (fr) Méthode de contrôle pour un ascenseur avec une cabine à plusieurs compartiments
EP1491481B1 (fr) Méthode de contrôle d'un groupe d'ascenseur avec attribution de zone

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

17P Request for examination filed

Effective date: 19880331

17Q First examination report despatched

Effective date: 19890717

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

REF Corresponds to:

Ref document number: 51386

Country of ref document: AT

Date of ref document: 19900415

Kind code of ref document: T

REF Corresponds to:

Ref document number: 3762040

Country of ref document: DE

Date of ref document: 19900503

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

Owner name: MODIANO & ASSOCIATI S.R.L.

ET Fr: translation filed
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

ITTA It: last paid annual fee
26N No opposition filed
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: DE

Payment date: 20060214

Year of fee payment: 20

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

Ref country code: NL

Payment date: 20060215

Year of fee payment: 20

Ref country code: AT

Payment date: 20060215

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

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

Year of fee payment: 20

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

Ref country code: ES

Payment date: 20060227

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

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

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

Year of fee payment: 20

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

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20070209

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

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

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

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

Effective date: 20070210

REG Reference to a national code

Ref country code: ES

Ref legal event code: FD2A

Effective date: 20070212

BE20 Be: patent expired

Owner name: *INVENTIO A.G.

Effective date: 20070210