EP0032213B1 - Commande d'un groupe d'ascenseurs - Google Patents

Commande d'un groupe d'ascenseurs Download PDF

Info

Publication number
EP0032213B1
EP0032213B1 EP80107888A EP80107888A EP0032213B1 EP 0032213 B1 EP0032213 B1 EP 0032213B1 EP 80107888 A EP80107888 A EP 80107888A EP 80107888 A EP80107888 A EP 80107888A EP 0032213 B1 EP0032213 B1 EP 0032213B1
Authority
EP
European Patent Office
Prior art keywords
cabin
storey
scanner
storage
call
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired
Application number
EP80107888A
Other languages
German (de)
English (en)
Other versions
EP0032213A2 (fr
EP0032213A3 (en
Inventor
Joris Dr. Ing. Schröder
Hans Dipl. Ing. Eth Bosshard
Jiri Dipl. El.-Ing. Kiml
Miroslav Dipl. El.-Ing. Kostka
Walter Dipl.-El.-Ing. Eth Zimmermann
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 AT80107888T priority Critical patent/ATE6620T1/de
Publication of EP0032213A2 publication Critical patent/EP0032213A2/fr
Publication of EP0032213A3 publication Critical patent/EP0032213A3/de
Application granted granted Critical
Publication of EP0032213B1 publication Critical patent/EP0032213B1/fr
Expired 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/102—Up or down call input
    • 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

Definitions

  • the invention relates to a group control for elevators with at least one floor call memory that can be controlled by floor call transmitters, with each car of the group assigned, can be controlled by car call transmitters, with each elevator assigned to the group, and each floor that selectively indicates the floor on which the car could stop Load measuring devices assigned to each cabin and with a scanning device having at least one position for each floor, whereby a computing device having an adder is provided for each elevator, based on at least the distance between a floor under consideration and the selector position, the number of intermediate stops to be expected within this distance existing car and assigned floor calls as well as the current car load show a time-proportional sum corresponding to the operational capability of a car in the group with regard to the floor under consideration et, and wherein at least one comparison device is provided, by means of which the cabin with the lowest operating costs corresponding to the smallest previously calculated loss time and therefore optimal usability can be allocated to the floor under consideration.
  • a call arrester having a ring counter brings the floor calls contained in the floor call memory into an order in which they are successively allocated to the individual cabins of an elevator group by a call distributor.
  • the call distributor examines all booths at the same time and selects the booth which has an optimal operational capability for the relevant call, the operational capability being expressed by a signal which is dependent on time and is dependent on several factors.
  • the call distributor contains a finder, for example in the form of another ring counter, which has search positions corresponding to the floors. If there is a call selected by the call arrester, the searcher starts from the floor in question, the floors being searched step by step.
  • a number corresponding to the distance between the call location and the cabin is stored in a distance register, taking into account whether the route is subject to direction commands or a free cabin.
  • the determined number is converted into an analog signal that corresponds to the time that the cabin needs for the corresponding route. This signal is fed to a summation circuit which determines the operational capability of the cabin.
  • the number of intermediate stops is determined by means of the coincidence of search creation and the floor for which a floor or cabin call is stored and is accumulated in an intermediate stop counter.
  • the counter converts this number into an analog time signal, which is also fed to the summation circuit.
  • the total number of stops is determined during the complete seeker cycle and a corresponding analog time signal is fed to the summation circuit at the end of the search process.
  • a fourth time signal which is proportional to the cabin load, is generated in a load-fixing device and likewise fed into the summation circuit.
  • the output signal of the summation circuit formed from the above four signals is fed to a comparator.
  • a ramp signal which is generated by a ramp signal generator at the end of the search process and which increases over time is likewise fed to the comparison element. If the signals of a comparator of a car agree, the allocation is made by storing the selected floor call in a request memory assigned to the car, the match being achieved in each case with the smallest time-proportional output signal of the summation circuit and therefore optimal usability.
  • the selected floor call is not served for a period of time controlled by a call timer, it is deleted in the request memory of the cabin concerned and, for the purpose of reallocation, is fed to the call holder and from there to the call distributor.
  • the loss of time caused by the travel time of the cabin and by the intermediate stops is recorded for the calculation of the loss of time of a passenger waiting on a floor in question.
  • the time lost by the passengers in the cabin due to the stop on this floor is only insufficiently taken into account, since the cabin load determined at the time of the calculation but no longer available at the time of operation due to possible future boarding and alighting is used as the basis for the loss time calculation.
  • it is difficult to optimize the allocation of calls because the changes in load that are likely to occur as the cabin approaches the floor under consideration by these boarding and alighting passengers are not recorded in the calculation of the lost times.
  • the floor calls can only be allocated if they are supplied to the call distributor to be carried out in accordance with the sequence determined by the call holder, which can result in delays in the allocation.
  • US-A-4 030 371 has disclosed a group controller in which the incoming floor call is provisionally assigned to each cabin in the group.
  • the calculation begins in order to determine the cheapest car, whereby two separate calculations are carried out. Firstly, the determination of the waiting time of the passengers waiting on a target floor and secondly, the determination of the cabin load which is likely to be present on arrival at the target floor. For example, ultrasound monitoring devices or TV cameras are provided to determine the passengers waiting on the floors.
  • the cabin load presumably present in the destination floor is calculated by means of a device which has resistances which can be set for each floor and which are set in accordance with a number of presumably disembarking passengers.
  • the first result is compared with a waiting time limit and the second result with a load limit in two comparisons. Two decisions must then be made, firstly, the waiting time limit and / or load limit exceeded for an elevator, yes or no, and secondly, the waiting time limit and load limit for which elevator is not exceeded.
  • the floor call finally assigned to a car based on these decisions can no longer be assigned to another car.
  • the aim of the invention is to propose an improved group control for elevators compared to the above-described elevator control, whereby the object achieved by the invention characterized in the claims is to improve the optimization of the assignments of cars to the floor calls under consideration and to immediately assign incoming floor calls.
  • This is achieved in particular in that when calculating the loss times that arise for the passengers in the cabin when stopping in the call storey in question, hereinafter referred to as internal service costs K, the number of passengers likely to be present in the cabin at this stop by extrapolating from the Existing instantaneous load is determined on the basis of consideration.
  • an estimated number of boarders is used, which is statistically derived from the number of boarders in the past.
  • a number of dropouts is assumed, which is calculated from the current cabin load divided by the number of cabin calls in front of the cabin. Furthermore, the operating state of the cabin and the estimated number of boarders are also taken into account when calculating the lost times arising for passengers waiting on the call floor in question, hereinafter referred to as external service costs K A.
  • the lowest operating costs ascertained by comparison and denoting the most operable cabin are stored, a different cabin being able to be assigned to the same floor based on a new comparison result after a new calculation cycle.
  • the advantages achieved by the invention are essentially to be seen in the fact that, by more precisely recording the total service costs, an improved optimization of the assignments of cabin floor calls takes place, the total transportation time of all passengers consisting of the travel time and the stay times inside and outside the cabin being minimized can and an increased output of the elevator group can be achieved. Furthermore, calculating in advance the most optimally usable cabin on each floor, regardless of whether there is a floor call or not, and storing the corresponding assignment helps to avoid further loss times, since an incoming floor call can be allocated immediately.
  • a further advantage is achieved that after a change in the traffic conditions caused by immediate recalculation of the change in service costs - K N and subsequent cost comparison, a reassignment of the cabin floor call can take place, with the progressive approach to the floor under consideration being the basis for the service charge calculation Data become more accurate.
  • An additional advantage achieved with the invention is that the internal service costs K determined by extrapolation can serve for the timely detection of the traffic-related saturation of the elevator group. This saturation is characterized in that the anticipated loads of all cabins corresponding to the internal service costs Ki would exceed a limit value during a stop on the floor in question, so that a floor call available there cannot be served.
  • the group control according to the invention is designed in such a way that it does not have a central part, so that more reliable work and cost savings can be achieved as further advantages.
  • A, B and C are the cabins of an elevator group consisting of three elevators
  • Each cabin of the group has a cabin call memory 20 which can be controlled via cabin call transmitter 21, a load measuring device 22, a load store 23 connected to the latter, which stores the current cabin load P M, and a device 24 which stores the number Rc of all cabin calls lying in the direction of travel of the cabin.
  • Each elevator in the group is assigned a floor call memory 25 which can be controlled via floor call transmitter 26, a device 27 storing the operating state Z of the respective car, a cost memory 28, two cost share stores 29, 30 and an allocation store 31.
  • the car call memory 20, the floor call memory 25, the cost memory 28 and the cost share memory 29, 30 are connected to a first scanner 32, the cost memory 28 additionally being connected to a second scanner 33 connected to the allocation memory 31.
  • the memories 20, 23, 24, 25 and 27 to 31 are read-write memories which are connected to a microprocessor 35 via an external system bus 34.
  • the microprocessors 35 assigned to the individual elevators of the group are connected to a common line 36, via which, for example, all floor call memories 25 can be connected to one another.
  • the scanners 32, 33 are memory locations or registers which contain addresses corresponding to the floor numbers, which are each newly formed by incrementing when scanning the floors in the upward direction or decrementing when scanning in the downward direction. Each floor has two scanning positions, with the exception of the end floors, which only have one each.
  • Allocation instructions are stored in the allocation memory 31 of a cabin, each indicating the floor to which the cabin in question is optimally assigned.
  • An assignment instruction is always stored when the operating costs K contained in the cost storage 28 of the same cabin are lower than those of the other cabins.
  • the cost comparison takes place at each position of the second scanner 33 by means of a comparison device 37 which is connected to the cost and allocation memories 28, 31 of the cabin A, B, C in question.
  • a comparison device 37 for example, a device can be used as described in the control CH-PS 463 741 on which the prior art is based.
  • a selector connected to the floor call memory 25 and the car call memory 20 is designated by 38, which, when the car is moving, indicates the floor on which the car can still stop if a stop command is present.
  • the selector 38 is a memory location or register containing an address, the addresses assigned to the floors being formed by incrementing or decrementing, depending on the direction of travel.
  • a stop command is generated in a stop initiation device of a drive control, which is not explained in greater detail and is partially integrated in the microcomputer system described above, when the selector 38 points to a floor for which a call has been stored and the car has reached a specific speed limit value. If no call has been received until the speed limit value has been reached, the selector 38 is switched on by one floor.
  • the I / O modules required for entering the floor and cabin calls, the load values and the operating state Z of the cabin as well as the signaling of the respective operating state Z, such as "open door”, “closing door” or “cabin in full motion” external modules are not shown. It goes without saying that the above-mentioned data as well as the operating costs and the allocation instructions, as required in digital computing systems, are processed in the form of multi-bit words of the binary number system. In the example shown in FIG. 1, the assignment instructions and the floor calls are symbolically designated with "1", and nonexistent assignment instructions and floor calls are accordingly designated with "0".
  • the calculation of the operating costs K is carried out recursively, the results of the previous scanning being used in each case and only the changes in the data which have occurred in the meantime being taken into account.
  • the cost comparison cycle KVZ which takes place simultaneously in all elevators
  • the operating costs K contained in the cost memories 28 are fed to the comparison device 37 and the comparison is carried out each time the scanner is set, an allocation instruction being stored in the allocation memory 31 of that elevator whose cost storage 28 has the lowest operating costs K.
  • the elevator group becomes saturated in terms of traffic technology; This means that an existing floor call in this scanning position cannot be served, since the limit value of the internal service costs K almost corresponds to the expected full load condition of the cabins.
  • the floor call is fed to a waiting list (not described in more detail) in the form of a storage device, from which it can be called up again after the saturation has been removed, taking into account further floor calls present there in the chronological order of the input.
  • Fig. 3 the cabins A, B and C are stationary on floors 1, 3 and 10. If a call R occurs on floor 6, car B is assigned to this call since it has the shortest distance and thus also the lowest operating costs in relation to the scanning position corresponding to the call.
  • cabins A and B are at a standstill on floors 10 and 9.
  • Cabin C which is also located on floor 9, is in the process of descending, the selector 38 may point to floor 7. If a downward call R occurs on floor 6, car C is assigned to this call since the selector position which is decisive for the respective car location has the lowest operating costs K in relation to the scanning position corresponding to the call.
  • FIG. 5 the cabins A, B and C which are at a standstill are stationed on floors 1, 3 and 9.
  • the booths B and C have the same service costs K with respect to floor 6. If a call R is now entered on this floor, then the cabin B is assigned to this call, since a priority rule determines that, for example, the cabin preceding in the identification each Takes precedence.
  • the group control characterized in claims 1 to 5 can also be implemented by other means.
  • So analog arithmetic elements can, for example, the computing device will be used, for which the number R E assigned hall calls and the number R c of the car calls counting means as a voltage follower-connected operational amplifier, and a differential amplifier are used for the subtractor.
  • the scanning device 32, 33 and the selector 38 can be mechanical or also electronic step switching devices.
  • the comparison device 37 can consist of comparators assigned to each elevator in the form of operational amplifiers operating as switches, the inputs of which are connected to the computing device and the outputs of which are connected to allocation memories which each have a memory cell in the form of a bistable multivibrator for each scanning position.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)
  • Lift-Guide Devices, And Elevator Ropes And Cables (AREA)
  • Preparation Of Compounds By Using Micro-Organisms (AREA)
  • Electromagnets (AREA)
  • Diaphragms For Electromechanical Transducers (AREA)
  • Compositions Of Oxide Ceramics (AREA)
  • Aiming, Guidance, Guns With A Light Source, Armor, Camouflage, And Targets (AREA)
  • Indicating And Signalling Devices For Elevators (AREA)

Claims (15)

1. Commande d'un groupe d'ascenseurs ayant au moins une mémoire d'appels d'étages (25) commandée au moyen d'un transmetteur d'appels d'étages (26), des mémoires d'appels de cabine (20) respectivement associées à chaque cabine (A, B, C) du groupe et commandées au moyen de transmetteurs d'appels de cabine (21), des sélecteurs (38) respectivement associées à chaque ascenseur du groupe et indiquant chaque fois celui des étages auquel la cabine pourrait encore s'arrêter, des dispositifs de mesure de charge (22) associés à chaque cabine (A, B, C), ainsi qu'un dispositif d'exploration (32, 33) présentant au moins une position d'exploration pour chaque étage, commande dans laquelle à chaque ascenseur est prévue une installation de calcul (35) pourvue d'un additionneur qui, à partir d'au moins distance entre un étage considéré et la position de sélecteur, du nombre d'arrêts intermédiaires escomptés à l'intérieur de cette distance sur la base d'appels de cabine existants et d'appels d'étages attribués, aussi bien que de la charge momentanée de la cabine, forme une somme proportionelle en temps qui correspond à l'aplitude au service d'une cabine du groupe en respect de l'étage considéré, au moins un dispositif comparateur (37) étant prévu, au moyen duquel la cabine ayant les coûts de service les plus bas correspondant à la somme la plus petite calculée auparavant et disposant de ce fait de l'aptitude au service optimale peut être affectée à l'étage considéré, caractérisée en ce que la détermination des coûts de service (K) en secondes/passager est effectuée par l'installation de calcul (35) pour une cabine quelconque (N) du groupe d'ascenseurs lors de chaque position (n) du dispositif d'exploration (32, 33) selon la formule:
Figure imgb0010
dans laquelle:
tv désigne le temps de retard lors d'un arrêt intermédiaire,
PM désigne la charge instantanée au moment du calcul,
RE désigne le nombre d'appels d'étages attribués à une cabine entre position de sélecteur et position n d'explorateur et
Rc le nombre d'appels de cabine entre position de sélecteur et position n d'explorateur,
ki désigne un nombre probable de passagers entrant dans la cabine par appel d'étage, déterminé en fonction des conditions du trafic, et
k2 un nombre probable de passagers sortants par appel de cabine, déterminé en fonction des conditions du trafic,
m désigne le nombre de distances d'étages entre position de sélecteur et position n d'explorateur et
tm le temps de marche moyen par distance entre étages,
REα désigne le nombre de coïncidences d'appels de cabine et d'appels d'étages attribués entre position de sélecteur et position d'explorateur,
Z désigne un supplément dépendant des conditions de service de la cabine,
tv(PM+k1· RE-k2· Rc) représente des coûts de service intérieurs (Ki) qui correspondent aux pertes de temps de passagers se trouvant probablement dans la cabine et se produiraient durant un arrêt à un étage défini par la position n d'explorateur, et
k1[m. tm+tv(RE+RC-REc+Z)] représente des coûts de service extérieurs (KA) correspondant aux pertes de temps de passagers attendant probablement à un étage défini par la position n d'explorateur,

et en ce qu'une installation de mémorisation (28,31), reliée à l'installation de calcul (35) et au dispositif d'exploration (32, 33) et capable d'être remplie par ce dernier, est prévue et contient les affectations de la cabine (A, B, C) momentanément d'aptitude au service optimale qui présente les coûts de service les plus bas en respect de la position du dispositif d'exploration (32, 33).
2. Commande d'un groupe d'ascenseurs selon la revendication 1, caractérisée en ce que, pour chaque ascenseur, l'installation de mémorisation (28, 31) contenant les affectations optimales cabine/position d'explorateur comporte une mémoire de coûts (28), capable d'être remplie durant une révolution d'un premier explorateur (32) du dispositif d'exploration, et une mémoire d'attribution (31), capable d'être remplie durant une révolution d'un second explorateur (33) du dispositif d'exploration, les coûts de service (K) calculés lors de chaque position d'explorateur pouvant être mémorisés dans les mémoires de coûts (28) et les instructions d'attribution correspondant aux affectations optimales pouvant être mémorisées dans les mémoires d'attribution (31).
3. Commande d'un groupe d'ascenseurs selon la revendication 1 ou la revendication 2, caractérisée en ce qu'il est prévu une mémoire de charge (23) dans laquelle peuvent être mémorisées la charge (PM) de cabine déterminée dans le dispositif de mesure de charge (22) et les différences de charge (Λ L, A L' ...) constatées lors de chaque arrêt correspondant à un appel d'étage, le nombre probable de passagers entrants (ki) étant la moyenne arithmétique
Figure imgb0011
calculée, lors de chaque arrêt correspondant à un appel d'étage, à partir des différences de charge L, A L') de l'arrêt instantané et de l'arrêt précédent.
4. Commande d'un groupe d'ascenseurs selon la revendication 1, caractérisée en ce qu'est prévu un dispositif (35, 24) compant et mémorisant le nombre de tous les appels de cabine (Rc') qui se trouvent dans la direction de déplacement de la cabine et existent dans la mémoire d'appels de cabine (20), le nombre probable de passagers sortants (k2) pouvant être calculé en divisant la charge instantanée (PM) de la cabine par le nombre (Rc') de tous les appels de cabine se trouvant dans la direction de déplacement de la cabine.
5. Commande d'un groupe d'ascenseurs selon la revendication 1, caractérisée en ce que l'installation de calcul comporte au moins un microprocessor (35).
6. Commande d'un groupe d'ascenseurs selon la revendication 1, caractérisée en ce que pour chaque ascenseur est prévue une mémoire d'appels d'étages (25) sous la forme d'une mémoire écriture-lecture dont l'adressage peut être effectué au moyen d'un premier explorateur (32) du dispositif d'exploration et du sélecteur (38), chaque mémoire d'appel d'étages (25) étant (25) étant reliée à un microprocesseur respectif (35) de l'installation de calcul au moyen d'un bus de système externe (34), et toutes les mémoires d'appels d'étages (25) pouvant être reliées l'une à l'autre par l'intermédiaire d'une ligne commune (36) assignée à tous les microprocesseurs (35).
7. Commande d'un groupe d'ascenseurs selon la revendication 1 ou la revendication 2, caractérisée en ce les mémoires de coûts et d'attribution (28, 31) sont connectées au dispositif comparateur (37) et que la comparaison des coûts de service s'opère, pour chaque position d'explorateur, durant une révolution du second explorateur (33), une instruction d'attribution pouvant être inscrite dans la mémoire d'attribution (31) de la cabine (A, B, C) présentant les coûts de service (K) les plus bas.
8. Commande d'un groupe d'ascenseurs selon la revendication 1 ou la revendication 2, caractérisée en ce que la mémoire d'appels de cabine (20) est une mémoire écriture-lecture dont l'adressage peut être effectué au moyen du premier explorateur (32) et du sélecteur (38), la mémoire de coûts (28) est une mémoire écriture-lecture dont l'adressage peut être effectué au moyen des premier et second explorateurs (32, 33) et la mémoire d'attribution (38) une mémoire écriturelecture dont l'adressage peut être effectué au moyen du second explorateur (33), lesdites mémoires étant reliées par l'intermédiaire d'un bus de système externe (34) à un microprocesseur (35) de l'installation de calcul qui évalue le nombre (m) de distances d'étages entre les places de mémoire adressées par le premier explorateur (32) et le sélecteur (38), qui compte, entre ces places de mémoire, le nombre d'appels de cabine (Rc) et le nombre de ceux des appels d'étages mémorisée (RE) pour lesquels existe une instruction d'attribution dans la mémoire d'attribution (31), et qui détermine le nombre de coïncidences (REc) de tels appels (RE, Rc).
9. Commande d'un groupe d'ascenseurs selon la revendication 1 ou la revendication 2, caractérisée en ce qu'à la mémoire de coûts (28) sont associées des mémoires de partie de coûts (29, 30) qui sont prévues sous forme de mémoires écriture-lecture dont l'adressage peut être effectué au moyen du premier explorateur (32) et qui mémorisent respectivement les coûts de service intérieurs (Ki) et les coûts de service extérieurs (KA) de tous les étages, et en ce que, lors d'une position du premier explorateur (32) présentant un appel de cabine, les coûts de service extérieurs (KA) exclusivement peuvent être extraits de la mémoire de partie de coûts respective (30) et être inscrits dans la mémoire de coûts (28).
10. Commande d'un groupe d'ascenseurs selon la revendication 1, caractérisée en ce que pour chaque ascenseur est prévu un dispositif (27) qui mémorise sous forme de valeur numérique les conditions de service (Z) de la cabine (A, B, C) et qui est constitué d'une mémoire écriture-lecture reliée à un composant d'entrée externe signalant les conditions de service instantanées (Z) ainsi qu'à un microprocesseur (35) de l'installation de calcul.
11. Commande d'un groupe d'ascenseurs selon la revendication 4, caractérisée en ce le dispositif compant et mémorisant le nombre (Rc') de tous les appels de cabine se trouvant dans la direction de marche comporte une mémoire écriture-lecture (28) reliée à un microprocesseur (35) de l'installation de calcul.
12. Commande d'un groupe d'ascenseurs selon la revendication 3, caractérisée en ce que la mémoire de charge (23) est une mémoire écriture-lecture qui est connectée au dispositif de mesure de charge (22) par l'intermédiaire d'un composant d'entrée externe et est reliée à un microprocesseur (35) de l'installation de calcul.
13. Commande d'un groupe d'ascenseurs selon la revendication 2, caractérisée en ce que le premier explorateur (32), le second explorateur (33) et le sélecteur (38) sont des places de mémoires ou des registres contenant des adresses, l'adressage du premier explorateur (32), après évaluation de tous les coûts de service (K) pour un étage, et celui du second explorateur (33), après la comparaison de tous les coûts de service (K) dudit étage, s'effectuant par incréments ou décréments, et l'adressage du sélecteur (38) s'effectuant par incréments ou décréments en dépendance de la marche.
14. Commande d'un groupe d'ascenseurs selon la revendication 1 ou la revendication 9, caractérisée en ce qu'il est prévu une liste d'attente sous forme d'un dispositif de mémorisation dans lequel peuvent être mémorisés dans l'ordre chronologique et être exclus de l'attribution ceux des appels d'étages pour lesquels les coûts de service intérieurs (KI) contenus dans les mémoires de parties de coûts (28) de tous les ascenseurs excèdent une valeur limite, les appels d'étages, après élimination de cet état de saturation, pouvant être séparément rappelés depuis la liste d'attente dans l'ordre chronologique de leur introduction.
15. Commande d'un groupe d'ascenseurs selon la revendication 1 ou la revendication 2, caractérisée en ce qu'elle est pourvue d'un dispositif qui engendre des appels d'étages fictifs et au moyen duquel des cabines inoccupées, dont les mémoires d'attribution (31) contiennent une instruction d'attrigution pour l'appel d'étage fictif, peuvent être appelées à au moins un étage de stationnement.
EP80107888A 1979-12-21 1980-12-13 Commande d'un groupe d'ascenseurs Expired EP0032213B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AT80107888T ATE6620T1 (de) 1979-12-21 1980-12-13 Gruppensteuerung fuer aufzuege.

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CH11396/79A CH648001A5 (de) 1979-12-21 1979-12-21 Gruppensteuerung fuer aufzuege.
CH11396/79 1979-12-21

Publications (3)

Publication Number Publication Date
EP0032213A2 EP0032213A2 (fr) 1981-07-22
EP0032213A3 EP0032213A3 (en) 1981-08-05
EP0032213B1 true EP0032213B1 (fr) 1984-03-14

Family

ID=4373118

Family Applications (1)

Application Number Title Priority Date Filing Date
EP80107888A Expired EP0032213B1 (fr) 1979-12-21 1980-12-13 Commande d'un groupe d'ascenseurs

Country Status (13)

Country Link
US (2) US4355705A (fr)
EP (1) EP0032213B1 (fr)
JP (1) JPS5699178A (fr)
AT (1) ATE6620T1 (fr)
AU (1) AU541642B2 (fr)
BR (1) BR8008404A (fr)
CH (1) CH648001A5 (fr)
DE (1) DE3067056D1 (fr)
ES (1) ES498035A0 (fr)
FI (1) FI73650C (fr)
HU (1) HU181768B (fr)
MX (1) MX149594A (fr)
ZA (1) ZA807696B (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0624540A1 (fr) 1993-05-12 1994-11-17 Inventio Ag Système d'ascenseur pour opération à zones

Families Citing this family (52)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5762179A (en) * 1980-09-27 1982-04-15 Hitachi Ltd Arithmetic device for cage calling generation probability at every destination of elevator
CH651950A5 (de) * 1980-10-20 1985-10-15 Inventio Ag Multiprozessoranordnung.
JPS5811479A (ja) * 1981-07-15 1983-01-22 株式会社日立製作所 エレベ−タ群管理制御装置
CH658852A5 (de) * 1982-04-08 1986-12-15 Inventio Ag Gruppensteuerung fuer aufzuege mit einer einrichtung fuer die steuerung des abwaertsspitzenverkehrs.
IT1155187B (it) * 1982-05-07 1987-01-21 Fiat Auto Spa Apparatogeneratore modulare per la produzione combinata di energia elettrica e calore ed impianto comprendente una pluralita di tali apparati generatori
JPS5936080A (ja) * 1982-08-24 1984-02-28 三菱電機株式会社 需要推定装置
JPS5982280A (ja) * 1982-11-01 1984-05-12 三菱電機株式会社 エレベ−タ制御装置
JPS59118666A (ja) * 1982-12-22 1984-07-09 三菱電機株式会社 エレベ−タの制御装置
DE3490005D2 (en) * 1983-01-11 1985-02-07 Maschf Augsburg Nuernberg Ag Control system for elevator devices
CH660585A5 (de) * 1983-08-12 1987-05-15 Inventio Ag Gruppensteuerung fuer aufzuege mit doppelkabinen.
JPH0610069B2 (ja) * 1984-12-05 1994-02-09 三菱電機株式会社 エレベータの群管理装置
ATE37015T1 (de) * 1985-04-22 1988-09-15 Inventio Ag Einrichtung zur lastabhaengigen steuerung eines aufzuges.
ATE51386T1 (de) * 1986-04-11 1990-04-15 Inventio Ag Gruppensteuerung fuer aufzuege.
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
ATE82560T1 (de) * 1987-12-18 1992-12-15 Inventio Ag Auf den stockwerken angeordnete rufregistrierund anzeigeeinrichtungen fuer aufzuege.
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
US4793443A (en) * 1988-03-16 1988-12-27 Westinghouse Electric Corp. Dynamic assignment switching in the dispatching of elevator cars
US4782921A (en) * 1988-03-16 1988-11-08 Westinghouse Electric Corp. Coincident call optimization in an elevator dispatching system
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.
DE4112626A1 (de) * 1991-04-18 1992-10-22 Fraunhofer Ges Forschung Ueberwachungseinrichtung fuer eine steuervorrichtung
US5248860A (en) * 1991-04-29 1993-09-28 Otis Elevator Company Using fuzzy logic to determine elevator car assignment utility
US5243155A (en) * 1991-04-29 1993-09-07 Otis Elevator Company Estimating number of people waiting for an elevator car based on crop and fuzzy values
US5260526A (en) * 1991-04-29 1993-11-09 Otis Elevator Company Elevator car assignment conditioned on minimum criteria
US5252789A (en) * 1991-04-29 1993-10-12 Otis Elevator Company Using fuzzy logic to determine the traffic mode of an elevator system
US5260527A (en) * 1991-04-29 1993-11-09 Otis Elevator Company Using fuzzy logic to determine the number of passengers in an elevator car
JP2589932B2 (ja) * 1992-06-15 1997-03-12 インターナショナル・ビジネス・マシーンズ・コーポレイション 装置の割り当てのグローバルな最適化方法とシステム
JP3454899B2 (ja) * 1993-04-07 2003-10-06 オーチス エレベータ カンパニー エレベータシステムの負荷重量側路しきい値の自動選択装置及び方法
FI108716B (fi) * 1993-11-11 2002-03-15 Kone Corp Menetelmä hissiryhmän ohjaamiseksi
US5841084A (en) * 1995-11-30 1998-11-24 Otis Elevator Company Open loop adaptive fuzzy logic controller for elevator dispatching
US5714725A (en) * 1995-11-30 1998-02-03 Otis Elevator Company Closed loop adaptive fuzzy logic controller for elevator dispatching
US5786550A (en) * 1995-11-30 1998-07-28 Otis Elevator Company Dynamic scheduling elevator dispatcher for single source traffic conditions
US5767460A (en) * 1995-11-30 1998-06-16 Otis Elevator Company Elevator controller having an adaptive constraint generator
US5767462A (en) * 1995-11-30 1998-06-16 Otis Elevator Company Open loop 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
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
CN1093834C (zh) * 1996-04-03 2002-11-06 因温特奥股份公司 用终点呼号进行多组电梯的控制
US5883343A (en) * 1996-12-04 1999-03-16 Inventio Ag Downpeak group optimization
AU9444098A (en) * 1997-10-10 1999-05-03 Kone Corporation Control method for an elevator group
US6619436B1 (en) * 2000-03-29 2003-09-16 Mitsubishi Denki Kabushiki Kaisha Elevator group management and control apparatus using rule-based operation control
US7032715B2 (en) * 2003-07-07 2006-04-25 Thyssen Elevator Capital Corp. Methods and apparatus for assigning elevator hall calls to minimize energy use
CN101506076B (zh) * 2005-04-15 2011-06-15 奥蒂斯电梯公司 使用事先的交通信息的分组电梯调度
US8047333B2 (en) 2005-08-04 2011-11-01 Inventio Ag Method and elevator installation for user selection of an elevator
WO2009024853A1 (fr) 2007-08-21 2009-02-26 De Groot Pieter J Système de commande d'ascenseur de destination intelligent
WO2013012410A1 (fr) 2011-07-15 2013-01-24 Otis Elevator Company Stratégie d'attribution de cabines d'ascenseur limitant le nombre d'arrêts par passager
CN115246607B (zh) * 2021-06-08 2023-03-14 菱王电梯有限公司 乘梯信息的管理方法、装置及电梯管理设备

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US2290714A (en) * 1940-10-24 1942-07-21 Westinghouse Elec Elevator Co Elevator dispatching system
US3256958A (en) * 1961-03-10 1966-06-21 Westinghouse Electric Corp Elevator control wherein the closest available car serves demand
CH430988A (de) * 1962-05-03 1967-02-28 Thomas B Thrige Fa Anordnung für die gemeinsame elektrische Steuerung einer Anzahl Aufzüge
US3315765A (en) * 1959-01-20 1967-04-25 Toledo Scale Corp Program computer for elevator system
US3443668A (en) * 1965-10-08 1969-05-13 Reliance Electric & Eng Co Plural car elevator system for developing hall call assignments between individual cars and registered hall calls
US3474885A (en) * 1967-01-20 1969-10-28 Reliance Electric Co Queueing controls for a group of elevators
US3614997A (en) * 1969-12-16 1971-10-26 Otis Elevator Co Plural car conveyor system controlled by performance times between cars
DE2151272A1 (de) * 1970-10-19 1972-04-20 Hitachi Ltd Steuerungssystem fuer eine Vielzahl von Lastaufnahmemitteln
US4030571A (en) * 1974-04-22 1977-06-21 Hitachi, Ltd. Elevator control system
US4037688A (en) * 1974-09-04 1977-07-26 Westinghouse Electric Corporation Elevator system
US4081059A (en) * 1975-10-11 1978-03-28 Hitachi, Ltd. Elevator control system
US4124102A (en) * 1969-04-24 1978-11-07 Otis Elevator Company Elevator control system

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3739880A (en) * 1971-06-10 1973-06-19 Reliance Electric Co Elevator control for optimizing allotment of individual hall calls to individual cars
JPS5179449A (fr) * 1975-01-06 1976-07-10 Hitachi Ltd
US4149613A (en) * 1975-11-04 1979-04-17 Hitachi, Ltd. Elevator control system
JPS598621B2 (ja) * 1976-07-30 1984-02-25 株式会社日立製作所 並設エレベ−タ制御装置

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US2290714A (en) * 1940-10-24 1942-07-21 Westinghouse Elec Elevator Co Elevator dispatching system
US3315765A (en) * 1959-01-20 1967-04-25 Toledo Scale Corp Program computer for elevator system
US3256958A (en) * 1961-03-10 1966-06-21 Westinghouse Electric Corp Elevator control wherein the closest available car serves demand
CH430988A (de) * 1962-05-03 1967-02-28 Thomas B Thrige Fa Anordnung für die gemeinsame elektrische Steuerung einer Anzahl Aufzüge
US3443668A (en) * 1965-10-08 1969-05-13 Reliance Electric & Eng Co Plural car elevator system for developing hall call assignments between individual cars and registered hall calls
US3474885A (en) * 1967-01-20 1969-10-28 Reliance Electric Co Queueing controls for a group of elevators
US4124102A (en) * 1969-04-24 1978-11-07 Otis Elevator Company Elevator control system
US3614997A (en) * 1969-12-16 1971-10-26 Otis Elevator Co Plural car conveyor system controlled by performance times between cars
DE2151272A1 (de) * 1970-10-19 1972-04-20 Hitachi Ltd Steuerungssystem fuer eine Vielzahl von Lastaufnahmemitteln
US4030571A (en) * 1974-04-22 1977-06-21 Hitachi, Ltd. Elevator control system
US4037688A (en) * 1974-09-04 1977-07-26 Westinghouse Electric Corporation Elevator system
US4081059A (en) * 1975-10-11 1978-03-28 Hitachi, Ltd. Elevator control system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0624540A1 (fr) 1993-05-12 1994-11-17 Inventio Ag Système d'ascenseur pour opération à zones

Also Published As

Publication number Publication date
ATE6620T1 (de) 1984-03-15
AU6561880A (en) 1981-06-25
DE3067056D1 (en) 1984-04-19
MX149594A (es) 1983-11-29
AU541642B2 (en) 1985-01-17
JPS636469B2 (fr) 1988-02-09
EP0032213A2 (fr) 1981-07-22
ES8202760A1 (es) 1982-02-16
US4355705A (en) 1982-10-26
CH648001A5 (de) 1985-02-28
HU181768B (en) 1983-11-28
FI803952L (fi) 1981-06-22
ZA807696B (en) 1981-11-25
ES498035A0 (es) 1982-02-16
US4411337A (en) 1983-10-25
JPS5699178A (en) 1981-08-10
EP0032213A3 (en) 1981-08-05
FI73650C (fi) 1987-11-09
BR8008404A (pt) 1981-07-14
FI73650B (fi) 1987-07-31

Similar Documents

Publication Publication Date Title
EP0032213B1 (fr) Commande d'un groupe d'ascenseurs
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
EP0440967B1 (fr) Commande de groupes pour ascenseurs avec distribution directe d'appels d'une entrée d'appels située sur l'étage
DE3738891C2 (de) Fahrstuhlanlage mit adaptiver Kabinenrufzuweisung
EP0246395B1 (fr) Commande d'un groupe d'ascenceur
DE69632750T2 (de) Verfahren und Vorrichtung zur Aufzugsgruppensteuerung
DE3300263C2 (fr)
EP0365782B1 (fr) Dispositif et méthode de commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
DE3611173C2 (de) Fahrstuhlanlage mit mehreren Doppelabteil-Kabinen
EP0356731B1 (fr) Commande groupée avec attribution immédiate des appels
DE69923002T2 (de) Aufzugs-gruppesteuerung
EP0312730A1 (fr) Commande de groupe pour ascenceurs avec commande des cabines dépendant de leur charge
EP0248997B1 (fr) Dispositif de commande de la répartition des cabines à un palier principal pour un groupe d'ascenseurs
EP0134892B1 (fr) Commande d'un groupe d'ascenseurs pour cabines à compartiments doubles
DE2946705C2 (fr)
EP0378834B1 (fr) Commande d'un groupe d'ascenseurs avec attribution immédiate des appels
DE2517514A1 (de) Aufzugssteuersystem
DE2512950A1 (de) Aufzugssteuerung
DE2411824C2 (de) Verfahren zum Betreiben einer Aufzugsanlage
EP0308590B1 (fr) Commande d'un groupe d'ascenceurs avec attribution immédiate des appels
DE1556333A1 (de) Aufzugssteuerung
DE2931155C2 (fr)
DE2538871A1 (de) Interface-anordnung fuer den verkehr eines aufzugs in einer aufzugsanlage mit einem zentralen leitwerk
DE2538873A1 (de) Gruppensteuerung fuer eine aufzugsanlage
DE1556335A1 (de) Aufzugssteuerung

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

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Designated state(s): AT BE DE FR GB IT NL

AK Designated contracting states

Designated state(s): AT BE DE FR GB IT NL

17P Request for examination filed

Effective date: 19810821

ITF It: translation for a ep patent filed

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

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Designated state(s): AT BE DE FR GB IT NL

REF Corresponds to:

Ref document number: 6620

Country of ref document: AT

Date of ref document: 19840315

Kind code of ref document: T

REF Corresponds to:

Ref document number: 3067056

Country of ref document: DE

Date of ref document: 19840419

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

26N No opposition filed
ITTA It: last paid annual fee
PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: AT

Payment date: 19981123

Year of fee payment: 19

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

Ref country code: GB

Payment date: 19991112

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

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

Year of fee payment: 20

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

Ref country code: AT

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

Effective date: 19991213

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

Ref country code: BE

Payment date: 19991216

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

Year of fee payment: 20

BE20 Be: patent expired

Free format text: 20001213 *INVENTIO A.G.

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

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

Effective date: 20001212

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

Effective date: 20001213