[go: up one dir, main page]

WO2005016810A1 - Attribution de secteurs durant la pointe en descente d'un ascenseur avec reponse d'appels a longue duree d'attente - Google Patents

Attribution de secteurs durant la pointe en descente d'un ascenseur avec reponse d'appels a longue duree d'attente Download PDF

Info

Publication number
WO2005016810A1
WO2005016810A1 PCT/US2003/022673 US0322673W WO2005016810A1 WO 2005016810 A1 WO2005016810 A1 WO 2005016810A1 US 0322673 W US0322673 W US 0322673W WO 2005016810 A1 WO2005016810 A1 WO 2005016810A1
Authority
WO
WIPO (PCT)
Prior art keywords
car
sector
call
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.)
Ceased
Application number
PCT/US2003/022673
Other languages
English (en)
Inventor
Zuhair Bahjat
Theresa Christy
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.)
Otis Elevator Co
Original Assignee
Otis Elevator Co
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 Otis Elevator Co filed Critical Otis Elevator Co
Priority to JP2005507824A priority Critical patent/JP4417330B2/ja
Priority to HK07100022.5A priority patent/HK1093333B/xx
Priority to US10/555,531 priority patent/US7434665B2/en
Priority to AU2003268006A priority patent/AU2003268006A1/en
Priority to PCT/US2003/022673 priority patent/WO2005016810A1/fr
Publication of WO2005016810A1 publication Critical patent/WO2005016810A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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/02—Control systems without regulation, i.e. without retroactive action
    • B66B1/06—Control systems without regulation, i.e. without retroactive action electric
    • B66B1/14—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements
    • B66B1/18—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages
    • B66B1/20—Control systems without regulation, i.e. without retroactive action electric with devices, e.g. push-buttons, for indirect control of movements with means for storing pulses controlling the movements of several cars or cages and for varying the manner of operation to suit particular traffic conditions, e.g. "one-way rush-hour traffic"

Definitions

  • This invention relates to assigning elevator cars during down peak to sectors, cars serving calls in an assigned sector, additional cars being assigned to the sector when needed, cars with unused capacity responding to calls outside the assigned sector which have been waiting for a long time.
  • a car serves a sector that includes floors 5, 6 and 7 but there are only a few passengers waiting for service in that sector, it may travel all the way to the lobby without considering passengers on floors 2, 3 or 4 who have been waiting for service. If the demand for service on those floors is very heavy, then the car assigned to that sector may not be able to keep up with the demand.
  • Disclosure of Invention Objects of the invention include: an effective way to serve calls during down peak without calls at the lower ends of the sectors having to wait excessively long times due to assigned cars being full before reaching such calls, and without heavy traffic at some particular floors causing excessively long waits; and improved elevator dispatching during down peak.
  • the floors of the building are assigned in groups called sectors, cars having no further calls to answer within an assigned sector can look in other sectors for calls that are likely to become long waiting calls, and additional cars being capable of assignment to a sector, when the traffic in that sector justifies it.
  • the invention combines the benefits of sectoring while considering calls in other sectors that have been waiting for a long enough time that they are in danger of becoming unacceptably long calls.
  • the invention also provides for assignment of additional cars to a sector if the demand justifies it, thus serving both calls above sector cars and calls below a sector.
  • This invention provides balanced service to passengers on all floors of the building requiring transportation down to the lobby, by fully utilizing elevator capacity.
  • the invention causes each car to serve the sector of the hoistway to which it is assigned but also to examine other sectors for calls that are in danger of becoming unacceptably long; if there are such calls and if the car has extra capacity, then the car will be assigned to serve one or more of the calls in danger of becoming unacceptably long, even if that call is in a sector being served by another car; if there are calls above the car serving a sector, another car may be assigned thereto.
  • Fig. 1 is a schematic diagram of a conventional computer arrangement interfacing with elevators, as an example of a system in which the present invention may be practiced.
  • Fig. 2 is a simplified logic flow diagram which is exemplary of processes that may be utilized to practice down peak sectoring of the present invention.
  • Fig. 3 is a simplified logic flow diagram which is exemplary of processes that may be utilized to practice long call assignments of the present invention.
  • a signal processor 1 1 is illustrative of group controllers that may allocate cars to respond to hall calls, utilizing aspects of the present invention.
  • the processor 1 1 is responsive to a plurality of sensors 1 2, such as car weight sensors, and data signals 1 3, such as car direction and door condition, provided to an input/output (I/O) port 1 5 of the processor 1 1 .
  • I/O port 1 8 is connected to a plurality of hall call buttons 1 9 resident on the various floors of the building, a plurality of car call button panels 20, one resident in each car, and a plurality of hall lanterns 21 , of which there are typically one or more at each floor landing.
  • the processor 1 1 includes a data bus 24, an address bus 25, a central processing unit (CPU) 26, a random access memory (RAM) 27, a flash memory (not shown), and a read only memory (ROM) 28 for storing the requisite elements of programs or routines that can carry out the present invention.
  • a simplified expression of a routine for carrying out the present invention is set forth in Fig. 2. Therein, a down peak dispatching routine 29 is reached through an entry point 30 and a test 32 determines if traffic in the down direction has reached the down peak magnitude, or not, which is determined in a conventional way. If not, other parts of the program are reverted to through a return point 33.
  • an affirmative result of test 32 reaches a subroutine 38 which will determine the sectors in any one of a variety of ways, all of which are conventional. The easiest way to group floors is to do so based on the number of cars in the group and the number of floors in the hoistway. When this method of determining sectors is used, one elevator car will be assigned to each of the sectors and a remaining "free" car will be used to serve counterflow traffic or to help out wherever traffic is heaviest. In a different method of defining sectors, the building population is the main component of the sectoring and the goal is to have approximately equal numbers of people in each sector. One car is kept free to serve counterflow traffic or to help out the assigned sector cars in areas of heaviest demand.
  • each sector may have a different number of floors in it, depending on building population.
  • the basis of determining the sectors may be the number of people left on each floor, as determined by keeping track of how many people have left, then it may be desirable to change the sectoring based on how many people are left on each floor since this will change as people start to leave, herein called dynamic sectoring in which the sectoring is periodically re-calculated by the group controller based on the number of people left per floor.
  • the sectors will be used to determine which cars should be assigned to which hall calls. Then a car pointer, C, is set to ONE in a step 42 and a sector point, S, is set equal to the highest sector in a step 43.
  • test 44 An affirmative result of test 44 reaches a step 48 to increment the car pointer, modulo the number of cars assigned to sectors; in that way, each car is continually treated in turn, and test 44 is reached once again to determine if the next car in turn has an outstanding call.
  • a test 50 determines if car C is empty. If it is not empty, it is not available to be newly assigned to this sector, but a test 51 may determine that it has previously been assigned to this sector, and may respond to another call in its assigned sector, provided it is not already full as determined by a test 52. If car C is full, an affirmative result of test 52 reaches a step 55 to reset the assignment of car C to sector S, such assignment being described hereinafter.
  • step 48 is again reached to increment C, thereby pointing to the next car in turn.
  • the routine of Fig. 2 it is assumed that floors are poled from top to bottom, so each call is assigned in a high to low sequence. Assume the car under consideration, C, has no outstanding call, is not empty, is assigned to the current sector, and is not full. A negative result of test 52 will reach a test 56 to determine if the floor of the next successive down hall call in sector S is below the committable floor of car C.
  • a step 57 will assign the next down call of sector S to car C, and then a step 58 will set a flag indicating an outstanding call for car C, so that car C will not be considered for any further service until it has answered that call and the then current capacity of the car can be determined.
  • a test 61 determines if down peak is still in process, or not. Initially, it will be, so a positive result of test 61 will reach a step 62 to decrement the sector pointer, modulo the number of sectors in the building. Then, the car currently identified by the car pointer, C, will be examined with respect to this sector. In the example here, car C has just had a call assigned to it so that test
  • test 44 will be affirmative reaching step 48 to increment the car pointer. Assume now that the car indicated by the car pointer, C, is empty. It won't have an outstanding call so test 44 is negative but test 50 will be affirmative reaching a test 62.
  • test 62 the floor number of the highest outstanding down call in sector S is compared with the committable floor for whatever is designated as the high car assigned to sector S. If there is no assigned car in sector S, then there is no highest assigned car in sector S. In this case, the committable floor for high car of S is set equal to zero, so that test 62 will automatically be affirmative.
  • test 62 will be affirmative. If there is a call above the high car in this sector, or if there is no car in this sector, an affirmative result of test 62 reaches a step 63 to set the assignment of car C to sector S, and to set the high car in this sector to car C in a step 64. Then, a step 65 will assign the highest down call in sector S to car C and the step 58 will set the outstanding call flag for car C.
  • the test 60 is reached to see if down peak is still in process.
  • step 61 is reached to decrement the sector pointer, and the next sector in turn will be tested as against whatever car is being pointed to by the car pointer, C.
  • car C does not have an outstanding call, is not empty and is assigned to this sector so that test 52 is reached.
  • car C is not full, and therefore has excess capacity.
  • car C can now look for any calls that may be in danger of having been outstanding for an excessive period of time.
  • a negative result of test 56 reaches a long call's subroutine 67, illustrated in Fig. 3. In Fig.
  • test 70 determines if there is a down call for floor F. If not, a negative result of test 70 reaches a step 74 to decrement the F pointer. Then, test 70 is repeated. If there is a down call at floor F, a test 75 determines if the elapsed time of the down call at floor F exceeds a call waiting time limit, which may take into account a reasonable amount of time for the elevator to reach a call, which may, on average, be on the order of one minute or so.
  • this is a settable limit which may be adjusted depending upon current traffic density (calls per minute) which is easily monitored in ways that are well known in the art. If the call at floor F is in danger of becoming an excessively long-waiting call, an affirmative result of test 75 reaches a step 76 which assigns the down call at floor F to car C, and a step 77 which sets the outstanding call flag for car C. And then the routine ends at a point 79, causing the routine of Fig. 2 to be resumed at step 48 to increment the car pointer.
  • any outstanding call flag will be reset when a car leaves a landing, for instance, when the car is given the run command. Whenever a car approaches the lobby, if any high car (S) is set to C, that will be reset to zero (meaning no car). Also, if the sector (C) is equal to some sector number, it too is reset to zero.
  • routine of Fig. 2 can be passed through every so often, and other programming could be reverted to prior to reaching either or both of the increment steps 48, 61 .
  • other suitable accommodation can be made in a manner which is conventional and within the skill of the art.

Landscapes

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

Abstract

Selon cette invention, durant la pointe en descente, des étages du bâtiment sont divisés en secteurs (38), des cabines vides (50) sont attribuées (63, 64) au secteur et reçoivent (65) le plus élevé des appels vers le bas dans le secteur, à condition que cet appel vers le bas soit situé au-dessus de l'étage auquel peut être engagée n'importe quelle cabine déjà attribuée à ce secteur, ou à condition qu'il n'y ait aucune cabine attribuée à ce secteur. Si une cabine n'est pas pleine (52), elle recevra des appels supplémentaires (56). S'il n'y a aucun appel dans le secteur situé au-dessous d'un secteur de cabine qui n'est pas pleine une routine d'appels à longue durée d'attente (67) détermine s'il y a un appel vers le bas (75) qui risque de devenir un appel à longue durée d'attente, en avant d'une cabine (69) et si c'est le cas, attribue cet appel à la cabine (76).
PCT/US2003/022673 2003-07-21 2003-07-21 Attribution de secteurs durant la pointe en descente d'un ascenseur avec reponse d'appels a longue duree d'attente Ceased WO2005016810A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
JP2005507824A JP4417330B2 (ja) 2003-07-21 2003-07-21 長いコールに対応するエレベーターの下りピーク時のセクタ分け
HK07100022.5A HK1093333B (en) 2003-07-21 Elevator down peak sectoring with long call response
US10/555,531 US7434665B2 (en) 2003-07-21 2003-07-21 Elevator down peak sectoring with long call response
AU2003268006A AU2003268006A1 (en) 2003-07-21 2003-07-21 Elevator down peak sectoring with long call response
PCT/US2003/022673 WO2005016810A1 (fr) 2003-07-21 2003-07-21 Attribution de secteurs durant la pointe en descente d'un ascenseur avec reponse d'appels a longue duree d'attente

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/US2003/022673 WO2005016810A1 (fr) 2003-07-21 2003-07-21 Attribution de secteurs durant la pointe en descente d'un ascenseur avec reponse d'appels a longue duree d'attente

Publications (1)

Publication Number Publication Date
WO2005016810A1 true WO2005016810A1 (fr) 2005-02-24

Family

ID=34192500

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2003/022673 Ceased WO2005016810A1 (fr) 2003-07-21 2003-07-21 Attribution de secteurs durant la pointe en descente d'un ascenseur avec reponse d'appels a longue duree d'attente

Country Status (3)

Country Link
JP (1) JP4417330B2 (fr)
AU (1) AU2003268006A1 (fr)
WO (1) WO2005016810A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11027943B2 (en) * 2018-03-29 2021-06-08 Otis Elevator Company Destination dispatch sectoring

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3572470A (en) * 1969-09-08 1971-03-30 Otis Elevator Co Zoned elevator control system including an arrangement for controlling the operation of cars in response to the level of traffic in the zones
US3645361A (en) * 1970-05-05 1972-02-29 White & Co Inc K M Elevator control system with priority dispatching capability
US3831715A (en) * 1972-02-02 1974-08-27 Hitachi Ltd Elevator control process and system
US4836336A (en) * 1987-07-13 1989-06-06 Inventio Ag Elevator system floor call registering circuit

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3572470A (en) * 1969-09-08 1971-03-30 Otis Elevator Co Zoned elevator control system including an arrangement for controlling the operation of cars in response to the level of traffic in the zones
US3645361A (en) * 1970-05-05 1972-02-29 White & Co Inc K M Elevator control system with priority dispatching capability
US3831715A (en) * 1972-02-02 1974-08-27 Hitachi Ltd Elevator control process and system
US4836336A (en) * 1987-07-13 1989-06-06 Inventio Ag Elevator system floor call registering circuit

Also Published As

Publication number Publication date
JP4417330B2 (ja) 2010-02-17
AU2003268006A1 (en) 2005-03-07
HK1093333A1 (zh) 2007-03-02
JP2007521198A (ja) 2007-08-02

Similar Documents

Publication Publication Date Title
US8387757B2 (en) Elevator car assignment control strategy with passenger group separation and future serviceability features
US4323142A (en) Dynamically reevaluated elevator call assignments
US11724909B2 (en) Elevator car assignment based on a detected number of waiting passengers
JPH0380711B2 (fr)
US9365392B2 (en) System having multiple cabs in an elevator shaft and control method thereof
WO2002049950A1 (fr) Procede et appareil pour affecter de nouveaux appels d'ascenseur a l'une des nombreuses cabines d'ascenseurs
JP2825299B2 (ja) 目的階指定を即座に割り当てるエレベータ用群制御装置
JPH01271380A (ja) 隣接階呼び出し指定式エレベータ並びに該エレベータに用いる群制御装置及びそのエレベータかごの優先割り当て方法
US4869348A (en) Group control for elevators with immediate allocation of calls of destination
US7434665B2 (en) Elevator down peak sectoring with long call response
JPH07252033A (ja) 層間ホール呼びシステム
US5644110A (en) Elevator service for dual lobby during up-peak
CN106379781B (zh) 召梯方法及系统
CN115057308A (zh) 电梯调配方法
WO2005016810A1 (fr) Attribution de secteurs durant la pointe en descente d'un ascenseur avec reponse d'appels a longue duree d'attente
JPH07117941A (ja) エレベータの群管理制御装置
JPH0735228B2 (ja) エレベ−タ装置
CA1058778A (fr) Ascenseur
HK1093333B (en) Elevator down peak sectoring with long call response
EP0357936A1 (fr) Sélection dynamique de la direction du balayage de l'attribution d'appels d'ascenseurs
JPS61287672A (ja) エレベ−タ装置及びその運転方法
WO2004106208A1 (fr) Gestion de renvoi d'ascenseur a performance temporelle garantie a affectation de service en temps reel
JP3986132B2 (ja) ダブルデッキエレベータ群管理制御装置
JP3428522B2 (ja) ダブルデッキエレベーターの運行制御装置
JPH09156843A (ja) エレベータの群管理制御装置

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 03826823.X

Country of ref document: CN

AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PH PL PT RO RU SC SD SE SG SK SL 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: A1

Designated state(s): GH GM KE LS MW MZ 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 IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
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: 2006249336

Country of ref document: US

Ref document number: 10555531

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 2005507824

Country of ref document: JP

122 Ep: pct application non-entry in european phase
WWP Wipo information: published in national office

Ref document number: 10555531

Country of ref document: US