WO2005100223A2 - Methode pour commander un systeme d'ascenseur - Google Patents

Methode pour commander un systeme d'ascenseur Download PDF

Info

Publication number
WO2005100223A2
WO2005100223A2 PCT/FI2005/000181 FI2005000181W WO2005100223A2 WO 2005100223 A2 WO2005100223 A2 WO 2005100223A2 FI 2005000181 W FI2005000181 W FI 2005000181W WO 2005100223 A2 WO2005100223 A2 WO 2005100223A2
Authority
WO
WIPO (PCT)
Prior art keywords
elevator
time
call
floor
passengers
Prior art date
Application number
PCT/FI2005/000181
Other languages
English (en)
Other versions
WO2005100223A3 (fr
Inventor
Marja-Liisa Siikonen
Jari Ylinen
Original Assignee
Kone Corporation
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 Kone Corporation filed Critical Kone Corporation
Priority to EP05730844A priority Critical patent/EP1735229B1/fr
Priority to DE602005019866T priority patent/DE602005019866D1/de
Publication of WO2005100223A2 publication Critical patent/WO2005100223A2/fr
Publication of WO2005100223A3 publication Critical patent/WO2005100223A3/fr

Links

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B1/00—Control systems of elevators in general
    • B66B1/24—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration
    • B66B1/2408—Control systems with regulation, i.e. with retroactive action, for influencing travelling speed, acceleration, or deceleration where the allocation of a call to an elevator car is of importance, i.e. by means of a supervisory or group controller
    • B66B1/2458—For elevator systems with multiple shafts and a single car per shaft
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/10—Details with respect to the type of call input
    • B66B2201/103—Destination call input before entering the elevator car
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B66—HOISTING; LIFTING; HAULING
    • B66B—ELEVATORS; ESCALATORS OR MOVING WALKWAYS
    • B66B2201/00—Aspects of control systems of elevators
    • B66B2201/20—Details of the evaluation method for the allocation of a call to an elevator car
    • B66B2201/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/235—Taking into account predicted future events, e.g. predicted future call inputs

Definitions

  • the present invention relates to control of an eleva- tor group .
  • An elevator system can be controlled by two different principal methods, of which the more traditional and more widely used method is up-down call buttons at the elevator landing floors and a car call panel inside the elevator car.
  • This traditional call system requires that the elevator passenger give two successive calls: a landing call (ordering an elevator to the particular departure floor) and a car call (indicating the target floor to the elevator system) .
  • the elevator to serve the call can be announced either immediately after the elevator control system has allocated the call (decided which elevator is to serve the call), or e.g. only after an arriving elevator starts braking to stop at the departure floor of the person having issued the call .
  • the other call system is so-called destination con- trol, in which the elevator customer gives only one call.
  • the call is given like a car call at the elevator landing floor by inputting destination floor information via a floor button panel or e.g. using a numeric keypad.
  • the al- location of elevators can be accomplished in a more sensible way because the system learns the information relating to each passenger (departure floor and destination floor) at an earlier stage and the passengers' destination floors can already be taken into account when a suitable elevator is being allocated. In the case of large elevator systems and large numbers of passengers, it is thus possible e.g. to assign the same elevator to customers traveling to the same floor.
  • the cost function may comprise summed passenger waiting times, traveling times, electric energy consumption of the system, num- bers of times the elevator car has stopped at different floors, or the aforesaid or other desired quantities may be weighted with desired weighting coefficients .
  • the most optimal ele-vator is found e.g. by the ESP method (Enhanced Spacing Principle) .
  • ESP Enhanced Spacing Principle
  • the issued calls are observed and the passenger waiting times are optimized.
  • the number of passengers associated with each landing call and waiting on the floor in question is estimated as far as possible on the basis of statistical data.
  • Those landing calls that the system assumes to be associated with the largest number of elevator customer's are served fastest .
  • Another method for allocating elevators on the basis of calls is to use genetic algorithms, especially in large elevator systems. Genetic algorithms are described e.g. in patent specification FI112856B. Ge- netic algorithms do not guarantee that the absolutely most optimal value is found, but the results obtained in practical applications are quite close to it.
  • the routes of the elevators in the system can be encoded in different chromosomes, in which one gene defines an elevator customer and the elevator to serve him/her.
  • the system starts the process e.g. from a randomly selected route alternative and applies to it various genetic procedures, such as proliferation, crossbreeding and mutation.
  • One genera- tion at a time a number of new chromosomes are generated via these genetic procedures and at the same time the chromosomes thus obtained are examined to determine whether they are viable for further processing. Viability may mean e.g. that the waiting time falls below a given value.
  • Crossbreeding means that two route alternatives are combined at random to create one new route alternative.
  • the values of the genes of the chromosome are changed arbitrarily.
  • the chromosome results given by the algorithm converge at some stage, and from the last processed set of chromosomes the one having the best viability is selected.
  • the passengers are allocated to elevators according to the genes of the best chromosome.
  • R E is the number of intermediate floor calls issued between the floor of current location of the elevator and the floor where the customer is to be picked up
  • R c is the numbeir of car calls given between the floor of current location of the elevator and the floor where the customer is to be picked up
  • ki is the num- ber of passengers entering the elevator for one landing call as estimated on the basis of the prevailing traffic situatzLon
  • k 2 is the number of passengers leaving the elevator for one car call as estimated on the basis of tlie prevailing traffic situation
  • m is the number of floor-to-floor intervals between the floor of current location of the elevator and the floor where the customer is to be picked up
  • t m is average journey t ⁇ me for one floor-to-floor interval
  • R E C is the number of coincident car calls and lainding calls between the floor of current location of the elevator and trie floor where the customer is to be picked up
  • Z is a additional factor
  • the cost function optimizes the waiting time, which is obtained as the sum of the waiting time spent in the lobby and the waste time spent in the elevator car due to stops.
  • Coincident calls (which here means that an active landing call addressed to the elevator is simultaneously a destination floor given as an active car call) are taken into account in the method .
  • Patent specification US4991694 deals with immediate allocation of destination calls.
  • This specification defines the cost function K as follows:
  • K rs is tb_e waiting time of new passengers at the call input floor
  • K rz is the traveling time of new passengers
  • K ps is the length of the waste time spent by car passengers due to an intermediate stop caused by a landing call
  • - pz is the length of the waste time spent by car passengers due to an intermediate stop caused by a car call
  • K ws is the waiting time of all passengers entering the elevator between the call input floor and the destination floor
  • K W2 is the waiting" time of all passengers entering the elevator after ar- rival at a floor requested by an active destination floor call.
  • the costs are optimized on the basis of passenger waiting times.
  • waiting time is accumulated from waiting in the elevator lobby and from intermediate stops due to landing calls and car calls.
  • prior-art elevator control algorithms optimize passenger waiting times in the elevator lobby and car and do not take the actual traveling time in the elevator car accurately into ac- count. Precisely speaking, prior-art methods do not optimize passengers' traveling time, because they do not take the time losses resulting from the car calls given by new passengers entering the car at intermediate stops accurately into account.
  • the object of the present invention is to overcome some of the above- mentioned problems in elevator control.
  • the aim is to create a control method in which both the waiting time and the traveling time of passen- gers are optimized.
  • the present invention deals with a method for allocating elevators on the basis of call data, and the method is especially intended for use in a destination call system, wherein both the source floor and the destination floor of the customer are already known after the customer has given a call in an elevator lobby.
  • Source floor refers to the floor where the customer gives a landing call or destination call and where the customer en- ters the elevator. The source floor is thus the same as the customer's departure floor. Based on active calls and the location and operational condition of the elevators at the instant under consideration, all possible elevator route alternatives are calculated.
  • a cost function is calculated wherein passenger-specific average total traveling time, i.e. the time from the instant the person gives a destination floor call to the instant he/she leaves the elevator at the destination call floor, is minimized.
  • the procedure takes into account the waiting time spent at the elevator landing floor, besides the traveling time spent in the elevator car as well as the delays caused by intermediate stops that, as far as known, are to be made during the journey. Intermediate stops may be due to active destination floor calls or source floor calls given by new passengers along the route of the elevator. Further delays arise in consequence of destination floor calls given by new customers boarding at intermediate stops.
  • OOP panel Device for inputting a destination floor call
  • the method of the present invention can be combined with the use genetic algorithms to determine the most advantageous route alternative.
  • the route alternatives processed by the algorithm can also be created in other ways. If only traditional landing call buttons and a car call panel are in use, it is necessary to weight the traveling time associated with a given landing call by the relevant predicted number of passengers . Further, measured traffic statistics can be utilized to estimate passengers' destination floors at a given instant of time from a given source floor. Ttie results of the forecast can be further utilized when the algorithm of the present invention is used.
  • a feature characteristic of the method of the present invention is that it employs passenger-specific calculation instead of call-specific calculation.
  • the capacity of the elevator system can be better utilized as compared to the control algorithms used in the traditional up-down call system.
  • Another significant advantage of the present invention is that the same control system can be used to control both systems using destination calls and systems using traditional up-down calls.
  • the traveling times are optimized and the serving elevator is immediately signaled to the customer.
  • the number of intermediate stops can be effectively reduced and the elevator capacity can be more efficiently utilized.
  • Immediate signaling can also be used in a system comprising up- down call buttons. The signaling can be given automatically or it can be set manually to a suitable value with respect to usability.
  • the control system also permits the destination operating mode to be set into an active state e.g. only during peak traffic hours while at other times traditional call buttons are in operation.
  • the desti- nation operating mode may be continuously in use.
  • Fig. 1 presents the components of a cost function generated in elevator control according to the present invention.
  • Fig. 2 presents the components of an elevator system associated with the present invention. DETAILED DESCRIPTION OF THE INVENTION
  • the present invention is applied in -so-called destination call control, wherein the elevator system control receives the information regarding the customer's source and target floors at an early stage.
  • the present invention is also applicable for use i n a traditional elevator system provided with up-down call buttons.
  • Fig. 1 presents in a simple form the time terms needed in the generation of the cost function .
  • the object of optimization 11 is the passenger's average traveling time.
  • the traveling time contains the passenger's wait- ing time on his/her source floor 10, which means the time interval from the input of a landing call to the arrival of the elevator car. Further, the traveling time contains the ride time in the elevator car 12.
  • the car calls 14 given by new passengers boarding the elevator car have to be taken into account in the traveling time (provided that the system already knows of these calls as destination calls), because they have a similar effect of increasing the traveling time of the passengers already in the car.
  • a cost function 11 is created which, based on the above considerations, can be expressed in a simple form e.g. as
  • J av is the passenger's average traveling time when a new passen- ger uses the optimal elevator.
  • JT f _ ent er,ii ft is the sum of passenger waiting times associated with a given destination floor or, in the case of a desti- nation call, the traveling time of the person having input the call .
  • JTj nC ⁇ ij ft is the length of the waste time that, for different reasons, is summed in the traveling time of the passengers riding in the car.
  • optimization 11 can be performed immediately and the most advantageous elevator obtained as a final result 15 of the optimization can be notified to the elevator customer. If the elevator is originally located at floor 'liftpos' (which is different from the elevator customer's source floor), the journey time for a passenger starting a ride on the elevator in question from floor 'f_enter' and giving floor 'f exit' as the destination floor will be obtained as follows:
  • ETAiift P os,f_enter,iift is the waiting time of the new passenger or passengers at the entry floor and ETAf_ en ter,f_e ⁇ iUift ' s the ride time- from the entry floor to the destination floor.
  • T x i >X2 d riv e is the elevator journey time at a constant travel speed from floor x to floor x 2 .
  • the sum term represents the extra time resulting from stops due to landing and car calls, which is spent during the trip before floor x 2 is reached.
  • Njjn ift and Nj ⁇ 0U .,iift are the numbers of passengers entering and leaving the elevator, respectively.
  • T paS s is the average time required for a passenger to step into or out of the elevator.
  • T d oor.nft is the additional time consumed by the door opening and closing operations
  • T ac c,dec represents the delay resulting from the acceleration and braking of the elevator as compared to travel at an even travel speed.
  • the traveling time of the elevator customers already riding in the elevator car is increased by new elevator customers giving new landing calls (destination calls) on their entry floor and by the stops required to drop these new customers off at their destination floors when the destination floor is between x-i ... x 2 .
  • the magnitude of this additional delay caused by new passengers to those already riding on the elevator is
  • the average traveling time can be determined from the statistics when the time of the day and the source floor are known. In this way, the calculation can be executed efficiently immediately upon input of a landing call in a traditional system provided with up- down call buttons and it is not strictly necessary to await a destination call given by the customer in the elevator car.
  • the summed total journey time for passengers arriving to the elevator upon a single landing call is:
  • nc i f t contains the additional time consumption caused by new passengers in the traveling time of the passengers al- ready in the car:
  • the cost function minimizes the average passenger-specific traveling time, which 5 comprises the time spent while waiting for an elevator, the actual ride time and additionally the delays caused by passengers subsequently entering the elevator.
  • each passenger is directed to his/her right elevator according to the elevator allocation consistent with the shortest traveling time.
  • the elevator system control0 naturally performs calculations continuously so that new calls entered and the continually changing positions of the elevators in the system are properly taken into account in the control of the elevators. Since the total traveling time is the object of optimization in the case of intensive traffic, the elevator capacity can be effectively reused after the customer's eleva-5 tor trip.
  • the algorithm minimizes passenger-specific average waiting time.
  • the elevator arrives quickly to the call input floor, but the elevator is allowed to make even several interme- o diate stops if necessary.
  • the car loads are balanced by the algorithm so that the given car load limits are not exceeded.
  • the control method allows the cars to be filled to the upper limit of the number of persons if people enter the elevator from5 the same source floor. In practice, this limit is only reached when a special peak traffic condition prevails in the system. Peak traffic again can be identified e.g. from measured statistical traffic data or from traffic forecasts made.
  • Fig. 2 presents an example of an actual elevator system employing the above-described method, showing the essential parts of the system.
  • the building is provided with an elevator system comprising elevators 20.
  • the call input equipment 21 includes both traditional up-down call buttons and a car call panel placed in the car. Furthermore, the call input equipment 5 21 contains the buttons required in a destination call system on each floor.
  • the intelligence of the system is located in a control system 22 comprising a microprocessor (not shown in the figures) as an essential part of it.
  • the microprocessor contains a memory, in which a computer program capable of executing the method of the present invention (or a part of it) is stored. The memory may also be implemented as an external part connected to the computer.
  • the microprocessor runs the program code comprised in the computer program, thus executing the various stages of the method of the present invention (or part of them).
  • the traveling time is calculated by a time counter 23.
  • the control system 22 performs the required optimization operations by using the input data and method of the present invention.
  • Previously measured traffic statistics 24 can be utilized when an optimization algorithm is used.
  • the traffic statistics 24 may be stored in a separate memory block.
  • the control system 22 calculates the optimal elevator route alternative that minimizes the average traveling time.

Landscapes

  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Elevator Control (AREA)

Abstract

L'invention concerne une méthode et un système pour attribuer des ascenseurs en fonction d'appels, dans un système d'ascenseur. Cette méthode produit, pour différents itinéraires alternatifs, une fonction de coût dans laquelle la durée de transport de chaque passager est calculée. Le calcul de la durée de transport s'effectue en prenant en compte la durée passée à attendre l'ascenseur à un étage, la durée de transport dans la cabine d'ascenseur, l'effet de retard d'un arrêt actif et d'appels de cabine sur la durée de transport, et l'effet de retard d'appels de cabine effectués par les nouveaux passagers entrant à des arrêts intermédiaires. La méthode de l'invention est avantageuse au niveau du système d'appel de destination, cependant, dans un système d'appel classique bidirectionnel, il est possible d'utiliser des informations fournies par des statistiques de transport, pour prédire l'étage de destination. Des itinéraires alternatifs peuvent être créés, par exemple, au moyen d'algorithmes génétiques. Une fois que l'itinéraire alternatif présentant la durée de transport moyenne la plus courte a été calculée, les ascenseurs sont commandés selon cet itinéraire. Dans des conditions de transport intenses, la durée de transport est optimisée, et dans des conditions de transport calmes, la durée d'attente du passager est optimisée.
PCT/FI2005/000181 2004-04-15 2005-04-12 Methode pour commander un systeme d'ascenseur WO2005100223A2 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP05730844A EP1735229B1 (fr) 2004-04-15 2005-04-12 Methode pour commander un systeme d'ascenseur
DE602005019866T DE602005019866D1 (fr) 2004-04-15 2005-04-12

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FI20040544A FI115396B (fi) 2004-04-15 2004-04-15 Hissijärjestelmän ohjausmenetelmä
FI20040544 2004-04-15

Publications (2)

Publication Number Publication Date
WO2005100223A2 true WO2005100223A2 (fr) 2005-10-27
WO2005100223A3 WO2005100223A3 (fr) 2006-03-02

Family

ID=32104188

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/FI2005/000181 WO2005100223A2 (fr) 2004-04-15 2005-04-12 Methode pour commander un systeme d'ascenseur

Country Status (5)

Country Link
EP (1) EP1735229B1 (fr)
DE (1) DE602005019866D1 (fr)
ES (1) ES2340689T3 (fr)
FI (1) FI115396B (fr)
WO (1) WO2005100223A2 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009029697A1 (fr) * 2007-08-28 2009-03-05 Thyssenkrupp Elevator Capital Corporation Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination
WO2014041242A1 (fr) * 2012-09-11 2014-03-20 Kone Corporation Système d'ascenseur
CN110171753A (zh) * 2019-06-03 2019-08-27 日立楼宇技术（广州）有限公司 一种电梯调度策略处理方法、装置、设备和存储介质
CN112441481A (zh) * 2019-08-28 2021-03-05 崇友实业股份有限公司 电梯的智能控制系统与方法
CN114104887A (zh) * 2021-11-23 2022-03-01 上海三菱电梯有限公司 电梯目的层建议系统与方法以及电梯系统和建筑物管理系统
US11753273B2 (en) * 2015-11-16 2023-09-12 Kone Corporation Method and an apparatus for determining an allocation decision for at least one elevator

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4991694A (en) * 1988-09-01 1991-02-12 Inventio Ag Group control for elevators with immediate allocation of destination calls
EP0568937A2 (fr) * 1992-05-07 1993-11-10 KONE Elevator GmbH Procédure pour commander un groupe d'ascenseurs
US6293368B1 (en) * 1997-12-23 2001-09-25 Kone Corporation Genetic procedure for multi-deck elevator call allocation
US20020112922A1 (en) * 2000-12-21 2002-08-22 Rory Smith Method and apparatus for assigning new hall calls to one of a plurality of elevator cars
WO2004031062A1 (fr) * 2002-10-01 2004-04-15 Kone Corporation Logique de commande de groupe d'ascenseurs
WO2004050522A1 (fr) * 2002-11-29 2004-06-17 Kone Corporation Procede d'affectation

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4991694A (en) * 1988-09-01 1991-02-12 Inventio Ag Group control for elevators with immediate allocation of destination calls
EP0568937A2 (fr) * 1992-05-07 1993-11-10 KONE Elevator GmbH Procédure pour commander un groupe d'ascenseurs
US6293368B1 (en) * 1997-12-23 2001-09-25 Kone Corporation Genetic procedure for multi-deck elevator call allocation
US20020112922A1 (en) * 2000-12-21 2002-08-22 Rory Smith Method and apparatus for assigning new hall calls to one of a plurality of elevator cars
WO2004031062A1 (fr) * 2002-10-01 2004-04-15 Kone Corporation Logique de commande de groupe d'ascenseurs
WO2004050522A1 (fr) * 2002-11-29 2004-06-17 Kone Corporation Procede d'affectation

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009029697A1 (fr) * 2007-08-28 2009-03-05 Thyssenkrupp Elevator Capital Corporation Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination
EP2213604A1 (fr) * 2007-08-28 2010-08-04 Thyssenkrupp Elevator Capital Corporation Procédé et appareil permettant de réduire les temps d'attente pour des systèmes de répartition fondée sur la destination
US8104585B2 (en) 2007-08-28 2012-01-31 Thyssenkrupp Elevator Capital Corporation Method of assigning hall calls based on time thresholds
US8276715B2 (en) 2007-08-28 2012-10-02 Thyssenkrupp Elevator Capital Corporation Method and apparatus for assigning elevator hall calls based on time metrics
US10071879B2 (en) 2012-09-11 2018-09-11 Kone Corporation Method for controlling an elevator system
CN104640799A (zh) * 2012-09-11 2015-05-20 通力股份公司 电梯系统
WO2014041242A1 (fr) * 2012-09-11 2014-03-20 Kone Corporation Système d'ascenseur
US11753273B2 (en) * 2015-11-16 2023-09-12 Kone Corporation Method and an apparatus for determining an allocation decision for at least one elevator
CN110171753A (zh) * 2019-06-03 2019-08-27 日立楼宇技术（广州）有限公司 一种电梯调度策略处理方法、装置、设备和存储介质
CN110171753B (zh) * 2019-06-03 2021-09-21 日立楼宇技术（广州）有限公司 一种电梯调度策略处理方法、装置、设备和存储介质
CN112441481A (zh) * 2019-08-28 2021-03-05 崇友实业股份有限公司 电梯的智能控制系统与方法
CN114104887A (zh) * 2021-11-23 2022-03-01 上海三菱电梯有限公司 电梯目的层建议系统与方法以及电梯系统和建筑物管理系统
CN114104887B (zh) * 2021-11-23 2023-06-06 上海三菱电梯有限公司 电梯目的层建议系统与方法以及电梯系统和建筑物管理系统

Also Published As

Publication number Publication date
FI20040544A0 (fi) 2004-04-15
WO2005100223A3 (fr) 2006-03-02
ES2340689T3 (es) 2010-06-08
FI115396B (fi) 2005-04-29
EP1735229B1 (fr) 2010-03-10
EP1735229A2 (fr) 2006-12-27
DE602005019866D1 (fr) 2010-04-22

Similar Documents

Publication Publication Date Title
EP2029466B1 (fr) Système d'ascenseur
JP4098366B2 (ja) エレベータ群の制御
US8387756B2 (en) Method and system for allocation of destination calls in elevator system
EP1483190B1 (fr) Procede de ventilation de passagers dans un groupe d'ascenseurs
JP5351510B2 (ja) 乗り場行先階予約式群管理エレベーターの制御装置
US9033112B2 (en) Elevator group control system
EP2437995A1 (fr) Système d'ascenseurs
JP5705704B2 (ja) エレベータ群管理システムおよびその制御方法
WO2005100223A2 (fr) Methode pour commander un systeme d'ascenseur
US9580271B2 (en) Elevator system configured to decentralize allocation of hall calls
WO1999021787A1 (fr) Procede de commande d'un groupe d'ascenseurs generant un trafic de passagers virtuel
WO2005092762A1 (fr) Systeme de commande d'un groupe d'ascenseurs
JP7018846B2 (ja) 循環型マルチカーエレベーター及び循環型マルチカーエレベーター制御方法
US10071879B2 (en) Method for controlling an elevator system
WO2005121002A1 (fr) Contrôleur de groupe d'ascenseurs
JPH01275382A (ja) エレベーター・カーへのホール・コール割り当て方法
JP6079874B2 (ja) エレベータ制御システム
KR20070088519A (ko) 엘리베이터 그룹 관리 제어 장치
JP4634043B2 (ja) エレベータ運行管理システム
JP4569197B2 (ja) エレベータの群管理装置
JP4357248B2 (ja) エレベータの群管理制御装置
JPS6247787B2 (fr)
JP2017030941A (ja) エレベータ装置及びエレベータ装置の制御方法

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KM KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2005730844

Country of ref document: EP

NENP Non-entry into the national phase in:

Ref country code: DE

WWW Wipo information: withdrawn in national office

Country of ref document: DE

WWP Wipo information: published in national office

Ref document number: 2005730844

Country of ref document: EP