Patent Grant
11383954
The subject matter disclosed herein relates generally to the field of elevator systems, and specifically to a method and apparatus for coordinating the operation of multiple elevator cars.
Commonly, elevator cars are organized into elevator groups serving range of landings of a building rather than each elevator car serving the overall length of an elevator shaft to service every floor of a building. Once established, range of landings typically remain unchanged due to physical constraints in the elevator system. In conventional elevator systems, elevator calls may be served by elevator cars in multiple different groups, however the decision of which group would serve the elevator call is based on group wide operating conditions and not on the elevator call destination, which may lead to a non-optimal elevator car being sent to serve the elevator call.
According to an embodiment, a method of operating a building elevator system having a plurality of elevator systems organized into multiple elevator groups is provided. The method including: receiving an elevator call from a destination entry device in communication with the building elevator system; obtaining a favorability score from each of the multiple elevator groups of the building elevator system; determining an elevator group of the multiple elevator groups with the highest favorability score; and routing the elevator call to the elevator group of the multiple elevator groups with the highest favorability score.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include: obtaining a best elevator car of the elevator group of the multiple elevator groups with the highest favorability score to answer the elevator call.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that a dispatcher of the elevator group of the multiple elevator groups with the highest favorability score is configured to determine the best elevator car of the elevator group of the multiple elevator groups with the highest favorability score to answer the elevator call.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that obtaining a favorability score from multiple elevator groups of the building elevator system further comprises: transmitting to a dispatcher of each elevator group a favorability score query in response to the elevator call; and receiving a favorability score from each elevator group in response the favorability score query and the elevator call.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that obtaining a favorability score from multiple elevator groups of the building elevator system further comprises: continuously requesting a favorability score query to a dispatch of each elevator group of the multiple elevator groups; receiving potential favorability scores from each elevator group for potential elevator calls; and determining a favorability score from the potential favorability scores in response to the elevator call.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include: displaying the best elevator car on the destination entry device.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that the multiple elevator groups comprises a first elevator group serving a first range of landings and a second elevator group serving a second range of landings, wherein the second range of landings includes at least one landing not included in the first range of landings.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that the multiple elevator groups further comprises a third elevator group serving a third range of landings, wherein the third range of landings includes at least one landing included in the first range of landings and at least one landing included in the second range of landings.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include: obtaining a best elevator car of the elevator group of the multiple elevator groups with the highest favorability score to answer the elevator call.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that a dispatcher of the elevator group of the multiple elevator groups with the highest favorability score is configured to determine the best elevator car of the elevator group of the multiple elevator groups with the highest favorability score to answer the elevator call.
According to another embodiment, a building elevator system having a plurality of elevator systems organized into multiple elevator groups is provided. The building elevator system including: a processor; a memory comprising computer-executable instructions that, when executed by the processor, cause the processor to perform operations, the operations comprising: receiving an elevator call from a destination entry device in communication with the building elevator system; obtaining a favorability score from each of the multiple elevator groups of the building elevator system; determining an elevator group of the multiple elevator groups with the highest favorability score; and routing the elevator call to the elevator group of the multiple elevator groups with the highest favorability score.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that the operations further comprise: obtaining a best elevator car of the elevator group of the multiple elevator groups with the highest favorability score to answer the elevator call.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that a dispatcher of the elevator group of the multiple elevator groups with the highest favorability score is configured to determine the best elevator car of the elevator group of the multiple elevator groups with the highest favorability score to answer the elevator call.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that obtaining a favorability score from multiple elevator groups of the building elevator system further comprises: transmitting to a dispatcher of each elevator group a favorability score query in response to the elevator call; and receiving a favorability score from each elevator group in response the favorability score query and the elevator call.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that obtaining a favorability score from multiple elevator groups of the building elevator system further comprises: continuously requesting a favorability score query to a dispatch of each elevator group of the multiple elevator groups; receiving potential favorability scores from each elevator group for potential elevator calls; and determining a favorability score from the potential favorability scores in response to the elevator call.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that the operations further comprise: displaying the best elevator car on the destination entry device.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that the multiple elevator groups comprises a first elevator group serving a first range of landings and a second elevator group serving a second range of landings, wherein the second range of landings includes at least one landing not included in the first range of landings.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that the multiple elevator groups further comprises a third elevator group serving a third range of landings, wherein the third range of landings includes at least one landing included in the first range of landings and at least one landing included in the second range of landings.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that the operations further comprise: obtaining a best elevator car of the elevator group of the multiple elevator groups with the highest favorability score to answer the elevator call.
In addition to one or more of the features described herein, or as an alternative, further embodiments may include that a dispatcher of the elevator group of the multiple elevator groups with the highest favorability score is configured to determine the best elevator car of the elevator group of the multiple elevator groups with the highest favorability score to answer the elevator call.
Technical effects of embodiments of the present disclosure include organizing elevator systems into groups serving a range of landings and determining the optimal elevator car and elevator group to serve the elevator call in response to the destination of the elevator call.
The foregoing features and elements may be combined in various combinations without exclusivity, unless expressly indicated otherwise. These features and elements as well as the operation thereof will become more apparent in light of the following description and the accompanying drawings. It should be understood, however, that the following description and drawings are intended to be illustrative and explanatory in nature and non-limiting.
The present disclosure is illustrated by way of example and not limited in the accompanying figures in which like reference numerals indicate similar elements.
The tension member 107 engages the machine 111, which is part of an overhead structure of the elevator system 101. The machine 111 is configured to control movement between the elevator car 103 and the counterweight 105. The position reference system 113 may be mounted on a fixed part at the top of the elevator shaft 117, such as on a support or guide rail, and may be configured to provide position signals related to a position of the elevator car 103 within the elevator shaft 117. In other embodiments, the position reference system 113 may be directly mounted to a moving component of the machine 111, or may be located in other positions and/or configurations as known in the art. The position reference system 113 can be any device or mechanism for monitoring a position of an elevator car and/or counter weight, as known in the art. For example, without limitation, the position reference system 113 can be an encoder, sensor, or other system and can include velocity sensing, absolute position sensing, etc., as will be appreciated by those of skill in the art.
The controller 115 is located, as shown, in a controller room 121 of the elevator shaft 117 and is configured to control the operation of the elevator system 101, and particularly the elevator car 103. For example, the controller 115 may provide drive signals to the machine 111 to control the acceleration, deceleration, leveling, stopping, etc. of the elevator car 103. The controller 115 may also be configured to receive position signals from the position reference system 113 or any other desired position reference device. When moving up or down within the elevator shaft 117 along guide rail 109, the elevator car 103 may stop at one or more landings 125 as controlled by the controller 115. Although shown in a controller room 121, those of skill in the art will appreciate that the controller 115 can be located and/or configured in other locations or positions within the elevator system 101. In one embodiment, the controller may be located remotely or in the cloud.
The machine 111 may include a motor or similar driving mechanism. In accordance with embodiments of the disclosure, the machine 111 is configured to include an electrically driven motor. The power supply for the motor may be any power source, including a power grid, which, in combination with other components, is supplied to the motor. The machine 111 may include a traction sheave that imparts force to tension member 107 to move the elevator car 103 within elevator shaft 117.
Although shown and described with a roping system including tension member 107, elevator systems that employ other methods and mechanisms of moving an elevator car within an elevator shaft may employ embodiments of the present disclosure. For example, embodiments may be employed in ropeless elevator systems using a linear motor to impart motion to an elevator car. Embodiments may also be employed in ropeless elevator systems using a hydraulic lift to impart motion to an elevator car.
Referring now to
Further, the elevator systems 101a-101f illustrated in
Each floor 80a-80i in the building 102 of
The redirector 110 is in communication with the controller 115a-115f of each elevator system 101a-101f through a dispatcher 210a-210c and a server 212a-212c, as shown in
The controllers 115a-115f can be combined, local, remote, cloud, etc. The redirector 110 is configured to control and coordinate operation of multiple elevator systems 101a-101f. The redirector 110 may be an electronic controller including a processor and an associated memory comprising computer-executable instructions that, when executed by the processor, cause the processor to perform various operations. The processor may be, but is not limited to, a single-processor or multi-processor system of any of a wide array of possible architectures, including field programmable gate array (FPGA), central processing unit (CPU), application specific integrated circuits (ASIC), digital signal processor (DSP) or graphics processing unit (GPU) hardware arranged homogenously or heterogeneously. The memory may be but is not limited to a random access memory (RAM), read only memory (ROM), or other electronic, optical, magnetic or any other computer readable medium.
The redirector 110 is in communication with each of the elevator destination entry devices 89a-89i of the building elevator system 100, which are shared by more than one group 112a-112c. The redirector 110 is configured to receive each elevator call 310 transmitted from the elevator destination entry devices 89a-89i. The redirector 110 is configured to manage the elevators calls 310 coming in from each destination entry device 89a-89i and allow any elevator systems 101 to respond to elevator calls 310. Conventional destination entry devices 89a-89i may be assigned to specific elevator groups 112a-112c however, the redirector 110 of the present disclosure is configured to allow destination entry devices 89a-89i to transmit elevator calls 310 to any group 112a-112c.
When an elevator call 310 is received from any of the destination entry devices 89a-89i, which are shared by more than one group 112a-112c, the redirector 110 is configured to obtain a favorability score 330 of each elevator group 112a-112c for the specific elevator call 310. In an embodiment, the redirector 110 may obtain the favorability scores 330 by transmitting a favorability score query 320 to a dispatcher 210a-210c of each elevator group 112a-112c in response to each elevator call 310 received. The favorability score query 320 may be transmitted from the redirector 110 to the dispatcher 210a-210c through the server 212a-212c of each elevator group 112a-112c. In another embodiment, the redirector 110 may obtain the favorability scores 330 by continuously collecting data from all elevator groups 112a-112c regarding the favorability score 330 for all possible elevator calls 310 (each elevator call including a destination request) for each elevator group 112a-112c. A favorability score 330 represents how well the best elevator car for this elevator call 310 in the elevator group could serve the demand. A favorability score 330 can consist of multiple pieces of data (i.e., variables) that can contribute to the favorability score 330, which may include but is not limited to a spare capacity of a group 112a-112c (i.e., how busy the group currently is), the source floor's waiting time, if there is an elevator car 103 available to serve this elevator call 310 immediately, if the source/destination elevator call 130 is already assigned to an elevator car 103 in this group (e.g., coincident call), if the destination is part of a group of destinations already assigned to this group (e.g., sectoring), building management preferences (e.g., time of day, external sensors detecting crowds), a current position of the elevator car 103, current commitments of the elevator car 103, a number of stops each passenger assigned to the elevator car 103 will make prior to reaching their destination, how long it will take the elevator car 103 to serve the elevator call 310, and the impact of adding this elevator call 310 to this elevator car 103 on the other elevator call 310 already assigned to the wait time of the elevator car 103 Once the favorability scores 330 from each elevator group 112a-112c are obtained, the redirector 110 will route the elevator call 310 to the elevator group 112a-112c with the best favorability score 330 and the elevator group 112a-112c will return to the redirector 110 which elevator car 103 in the elevator group 112a-112c is assigned to the request so that the redirector can display this information for the passenger. The information may be displayed on the destination entry device 89a-89i.
Referring now to
At block 406, a favorability score 330 is obtained from each of the multiple elevator groups 112a-112c of the building elevator system 100. At block 408, an elevator group of the multiple elevator groups 112a-112c with the highest favorability score 330 is obtained. For example, the elevator group of the multiple elevator groups 112a-112c with the highest favorability score 330 may be the second elevator group 112b. It is understood that the elevator group 112a-112c with the highest favorability score 330 may vary depending on the elevator call 310 and is not limited to the second elevator group 112b but may also be the first elevator group 112a or the third elevator group 112c.
The highest favorability score 330 may be obtained by: transmitting to a dispatcher 210a-210c of each elevator group 112a-112c a favorability score query 320 in response to the elevator call 320; and receiving a favorability score 330 from each elevator group 112a-112c in response the favorability score query 320 and the elevator call 310. The highest favorability score 330 may also be obtained by: continuously requesting a favorability score query 320 to a dispatch 210a-210c of each elevator group 112a-112c of the multiple elevator groups 112a-112c; receiving potential favorability scores 330 from each elevator group 112a-112c for potential elevator calls 310; and determining a favorability score 330 from the potential favorability scores in response to the elevator call. The potential favorability scores are continuously trying to predict what a favorability score 330 may be for different elevator calls 310 that include different destinations.
At block 410, the elevator call 310 is routed to the elevator group with the highest favorability score 330. Once the elevator call 310 is routed to the elevator group with the highest favorability score 330, a best elevator car 103 of the elevator group with the highest favorability score 330 to answer the elevator call 310 may be obtained by the redirector 110. A dispatcher 210b of the elevator group with the highest favorability score 330 is configured to determine the best elevator car 103 of the elevator group with the highest favorability score 330 to answer the elevator call 310. The method 400 may further comprise that the best elevator car 103 may be displayed on the destination entry device 89a-89i so that the passenger may see which elevator car 103a-103f of each group 112a-112c they will be boarding.
While the above description has described the flow process of
As described above, embodiments can be in the form of processor-implemented processes and devices for practicing those processes, such as processor. Embodiments can also be in the form of computer program code containing instructions embodied in tangible media, such as network cloud storage, SD cards, flash drives, floppy diskettes, CD ROMs, hard drives, or any other computer-readable storage medium, wherein, when the computer program code is loaded into and executed by a computer, the computer becomes a device for practicing the embodiments. Embodiments can also be in the form of computer program code, for example, whether stored in a storage medium, loaded into and/or executed by a computer, or transmitted over some transmission medium, loaded into and/or executed by a computer, or transmitted over some transmission medium, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation, wherein, when the computer program code is loaded into an executed by a computer, the computer becomes a device for practicing the embodiments. When implemented on a general-purpose microprocessor, the computer program code segments configure the microprocessor to create specific logic circuits.
The term “about” is intended to include the degree of error associated with measurement of the particular quantity and/or manufacturing tolerances based upon the equipment available at the time of filing the application.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the present disclosure. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, element components, and/or groups thereof.
Those of skill in the art will appreciate that various example embodiments are shown and described herein, each having certain features in the particular embodiments, but the present disclosure is not thus limited. Rather, the present disclosure can be modified to incorporate any number of variations, alterations, substitutions, combinations, sub-combinations, or equivalent arrangements not heretofore described, but which are commensurate with the scope of the present disclosure. Additionally, while various embodiments of the present disclosure have been described, it is to be understood that aspects of the present disclosure may include only some of the described embodiments. Accordingly, the present disclosure is not to be seen as limited by the foregoing description, but is only limited by the scope of the appended claims.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4991694 | Friedli | Feb 1991 | A |
| 5065846 | Schroder | Nov 1991 | A |
| 5168136 | Thangavelu et al. | Dec 1992 | A |
| 5427206 | Powell | Jun 1995 | A |
| 5612519 | Chenais | Mar 1997 | A |
| 5625176 | Davis | Apr 1997 | A |
| 7117980 | Wyss | Oct 2006 | B2 |
| 7128190 | Kostka | Oct 2006 | B2 |
| 7328775 | Zaharia | Feb 2008 | B2 |
| 9296588 | Christy | Mar 2016 | B2 |
| 10099892 | Suihkonen | Oct 2018 | B2 |
| 20020129994 | Kostka et al. | Sep 2002 | A1 |
| 20030000776 | Kostka | Jan 2003 | A1 |
| 20080006485 | Kocher et al. | Jan 2008 | A1 |
| 20090283368 | Yoshikawa et al. | Nov 2009 | A1 |
| 20100282543 | Hsu et al. | Nov 2010 | A1 |
| 20120325589 | Christy | Dec 2012 | A1 |
| 20130168190 | Christy et al. | Jul 2013 | A1 |
| 20150096843 | Siddiqui et al. | Apr 2015 | A1 |
| 20170291795 | Scoville et al. | Oct 2017 | A1 |
| 20170313546 | King | Nov 2017 | A1 |
| 20190382236 | Halingale | Dec 2019 | A1 |
| 20200031615 | Hsu | Jan 2020 | A1 |
| Number | Date | Country |
|---|---|---|
| 101403891 | Apr 2009 | CN |
| 101837911 | Sep 2010 | CN |
| 101983169 | Mar 2011 | CN |
| 102762475 | Oct 2012 | CN |
| 102897613 | Jan 2013 | CN |
| 103130050 | Jun 2013 | CN |
| 10429569 | Dec 2014 | CN |
| 104291170 | Jan 2015 | CN |
| 107235392 | Oct 2017 | CN |
| 1767484 | Mar 2007 | EP |
| 2014001037 | Jan 2014 | JP |
| 2009132698 | Nov 2009 | WO |
| 2011106010 | Sep 2011 | WO |
| Entry |
|---|
| EP Search Report dated Oct. 25, 2019; Application No. 19182634.6-1017; 9 pages. |
| First Chinese Office Action for Application No. 201910554367.0; Office Action dated Apr. 27, 2021; Office Action; 11 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20190389688 A1 | Dec 2019 | US |
