Patent Grant
10526165
The disclosure relates to call allocation in an elevator system.
Elevators are normally allocated based on two allocation methods: continuous allocation or immediate allocation.
In continuous allocation a passenger places a call by pushing an up/down button. With continuous allocation one cannot know for sure how many passengers are actually waiting behind a single call. The number of passengers waiting behind a landing call may be estimated, for example, by multiplying the estimated time of arrival to the call with the passenger arrival intensity obtained from historical or forecasted traffic statistics. The result of the multiplication describes the number of passengers waiting behind the call when an elevator arrives to serve the call. Further, in continuous allocation, the allocation decisions can also be changed. For example, if the traffic situation and the estimated time of arrival to a call changes so that the number of passengers behind the call at the moment of serving the call exceeds the available space in the elevator that is currently allocated to the call, it can be allocated to another elevator.
In immediate allocation, a call is allocated to an elevator immediately after the call is registered and the serving elevator is signalized for the passenger or passengers who gave the call. This means that the allocation decision cannot be changed even if the traffic situation and the estimated time of arrival to the call would have changed so that the estimated number of passengers behind the call exceeds the available space in the elevator. Hence, the estimated time of arrival to the call and the historical passenger arrival intensity give a poor estimate for the number of passengers waiting behind the call. In immediate elevator call allocation, the amount of registered calls does not often correspond to the actual number of waiting passengers.
Based on the above, there is a need for a solution that would provide more accurate elevator allocation in a situation where there are multiple passengers behind a single call.
According to a first aspect there is provided a method for allocating an elevator in an elevator system. The method comprises constructing passenger batch size distributions for each pair of floors in a building based on passenger batch journeys, each passenger batch journey defining at least the origin and destination floor of the journey, the number of passengers relating to the journey and the time of the journey; receiving a call for an elevator; estimating the number of passengers waiting behind the call based on the passenger batch size distributions; and allocating the call to an elevator being able to serve the estimated number of passengers.
According to a second aspect there is provided a computer program comprising program code, which when executed by at least one processor, performs the method of the first aspect.
According to a third aspect there is provided an elevator control apparatus comprising at least one processor; and at least one memory comprising computer program code for one or more programs, the at least one memory and the computer program code operating together with the at least one processor to cause the apparatus to perform at least the following: construct passenger batch size distributions for each pair of floors in a building based on passenger batch journeys, each passenger batch journey defining at least the origin and destination floor of the journey, the number of passengers relating to the journey and the time of the journey; receive a call for an elevator; estimate the number of passengers waiting behind the call based on the passenger batch size distributions; and allocate the call to an elevator being able to serve the estimated number of passengers.
According to a fourth aspect there is provided an elevator system comprising a plurality of elevators and an elevator control apparatus according to the third aspect arranged to allocate a call to an elevator.
The accompanying drawings, which are included to provide a further understanding and constitute a part of this specification, illustrate embodiments and together with the description help to explain the principles. In the drawings:
At 100 constructing passenger batch size distributions for each pair of floors in a building based on passenger batch journeys. Each passenger batch journey defines at least the origin and destination floor of the journey, the number of passengers relating to the journey and the time of the journey. The construction of the passenger batch size distributions may be performed by recording actual journeys from one floor to another and the number of passengers relating to each journey. In other words, the passenger batch size distributions are based on real passenger data. The passenger batch size distributions thus give detailed information on how and when people use elevators in a building. For example, normally when an elevator system receives a call, it assumes that there is a single passenger behind the call. The passenger batch size distribution, however, reflects the real amount of passengers. For example, people often go for lunch in a social batch and only one member of the batch gives the destination call. When the journey has been made, the recorded passenger batch distributions take into account the real amount of passengers. One possible solution for constructing passenger batch sizes is disclosed in a granted Finnish patent 121464B.
At 102 a call for an elevator is received. When the elevator system uses immediate allocation, the elevator system knows that a call from a passenger is from a specific origin floor to a certain destination floor. When the elevator system uses continuous allocation, the elevator system knows that the call from the passenger is from a specific floor and that it is either an up or down direction call.
At 104 the number of passengers waiting behind the call is estimated based on the passenger batch size distributions and at 106 the call is allocated to an elevator being able to serve the estimated number of passengers.
If the call is a destination call, the elevator system knows the origin floor, the destination floor and the time when the call was received. The elevator system uses this information to estimate the number of passengers waiting behind the call. For example, the call may have been received at 11:30 on Monday (lunch time) from an office floor to a floor having a restaurant or being an exit floor. The elevator system checks the passenger batch size distributions and from there it can be learned that the number of passengers behind a call matching these circumstances is, for example, four.
The elevator system may, for example, have two alternatives when allocating an elevator to a call. An elevator A has room for two passengers and its waiting time is 25 s. An elevator B has room for five passengers and its waiting time is 35 s. Since in the estimation it was estimated that there are four passengers behind the call, the elevator B is allocated although its waiting time is longer than with the elevator A.
If the call is a call in a continuous allocation elevator system, the elevator system knows the origin floor, the direction of the call (up/down) and the time when the call was received. For example, the call may have been received at 11:30 on Monday (lunch time) from an office floor (origin floor) to a floor having a restaurant or being an exit floor. The elevator system checks the passenger batch size distributions and from there it can be learned that the number of passengers behind a call matching these circumstances is, for example, three. The elevator system may, for example, have two alternatives when allocating an elevator to a call. An elevator A is arriving at the origin floor but it has room only for two passengers. An elevator B will arrive at the origin floor soon after the elevator A and it has room for four passengers. Since in the estimation it was estimated that there are three passengers behind the call, the elevator B is allocated for the passengers.
In a further example embodiment of
In a further example embodiment of
At least one of the example embodiments provides an improvement over the earlier solutions since it can be used to estimate the number of passengers waiting behind a call independently of the estimated time of arrival to the call. This is important especially in immediate call allocation, where allocation decisions cannot be, changed even if it would be required by the changes in the traffic situation.
At least one of the example embodiments also provide an improvement in the allocation decisions made by the elevator control apparatus by estimating the space required by the passengers waiting behind a call. In particular, passenger service is improved, for example, at conference, restaurant and transfer floors where batch sizes vary throughout the day.
According to one example embodiment there is provided an apparatus comprising means for constructing passenger batch size distributions for each pair of floors in a building based on passenger batch journeys, each passenger batch journey defining at least the origin and destination floor of the journey, the number of passengers relating to the journey and the time of the journey; means for receiving a call for an elevator; means for estimating the number of passengers waiting behind the call based on the passenger batch size distributions; and means for allocating the call to an elevator being able to serve the estimated number of passengers.
The example embodiments can be included within any suitable device, for example, including any suitable servers, workstations, PCs, laptop computers, capable of performing the processes of the example embodiments, and which can communicate via one or more interface mechanisms. The example embodiments may also store information relating to various processes described herein.
Example embodiments may be implemented in software, hardware, application logic or a combination of software, hardware and application logic. The example embodiments can store information relating to various methods described herein. This information can be stored in one or more memories, such as a hard disk, optical disk, magneto-optical disk, RAM, and the like. One or more databases can store the information used to implement the example embodiments. The databases can be organized using data structures (e.g., records, tables, arrays, fields, graphs, trees, lists, and the like) included in one or more memories or storage devices listed herein. The methods described with respect to the example embodiments can include appropriate data structures for storing data collected and/or generated by the methods of the devices and subsystems of the example embodiments in one or more databases.
All or a portion of the example embodiments can be conveniently implemented using one or more general purpose processors, microprocessors, digital signal processors, micro-controllers, and the like, programmed according to the teachings of the example embodiments, as will be appreciated by those skilled in the computer and/or software art(s). Appropriate software can be readily prepared by programmers of ordinary skill based on the teachings of the example embodiments, as will be appreciated by those skilled in the software art. In addition, the example embodiments can be implemented by the preparation of application-specific integrated circuits or by interconnecting an appropriate network of conventional component circuits, as will be appreciated by those skilled in the electrical art(s). Thus, the example embodiments are not limited to any specific combination of hardware and/or software.
Stored on any one or on a combination of computer readable media, the example embodiments can include software for controlling the components of the example embodiments, for driving the components of the example embodiments, for enabling the components of the example embodiments to interact with a human user, and the like. Such software can include, but is not limited to, device drivers, firmware, operating systems, development tools, applications software, and the like. Such computer readable media further can include the computer program of an example embodiment for performing all or a portion (if processing is distributed) of the processing performed in implementing the example embodiments. Computer code devices of the example embodiments can include any suitable interpretable or executable code mechanism, including but not limited to scripts, interpretable programs, dynamic link libraries (DLLs), Java classes and applets, complete executable programs, and the like. Moreover, parts of the processing of the example embodiments can be distributed for better performance, reliability, cost, and the like.
As stated above, the components of the example embodiments can include computer readable medium or memories for holding instructions programmed according to the teachings and for holding data structures, tables, records, and/or other data described herein. In an example embodiment, the application logic, software or an instruction set is maintained on any one of various conventional computer-readable media. In the context of this document, a “computer-readable medium” may be any media or means that can contain, store, communicate, propagate or transport the instructions for use by or in connection with an instruction execution system, apparatus, or device, such as a computer. A computer-readable medium may include a computer-readable storage medium that may be any media or means that can contain or store the instructions for use by or in connection with an instruction execution system, apparatus, or device, such as a computer. A computer readable medium can include any suitable medium that participates in providing instructions to a processor for execution. Such a medium can take many forms, including but not limited to, non-volatile media, volatile media, transmission media, and the like.
While there have been shown and described and pointed out fundamental novel features as applied to preferred embodiments thereof, it will be understood that various omissions and substitutions and changes in the form and details of the devices and methods described may be made by those skilled in the art without departing from the spirit of the disclosure. For example, it is expressly intended that all combinations of those elements and/or method steps which perform substantially the same function in substantially the same way to achieve the same results are within the scope of the disclosure. Moreover, it should be recognized that structures and/or elements and/or method steps shown and/or described in connection with any disclosed form or embodiments may be incorporated in any other disclosed or described or suggested form or embodiment as a general matter of design choice. Furthermore, in the claims means-plus-function clauses are intended to cover the structures described herein as performing the recited function and not only structural equivalents, but also equivalent structures.
The applicant hereby discloses in isolation each individual feature described herein and any combination of two or more such features, to the extent that such features or combinations are capable of being carried out based on the present specification as a whole, in the light of the common general knowledge of a person skilled in the art, irrespective of whether such features or combinations of features solve any problems disclosed herein, and without limitation to the scope of the claims. The applicant indicates that the disclosed aspects/embodiments may consist of any such individual feature or combination of features. In view of the foregoing description it will be evident to a person skilled in the art that various modifications may be made within the scope of the disclosure.
This application is a Continuation of PCT International Application No. PCT/FI2014/050697, filed on Sep. 12, 2014, which is hereby expressly incorporated by reference into the present application.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5331121 | Tsuji | Jul 1994 | A |
| 5354957 | Robertson | Oct 1994 | A |
| 5612519 | Chenais | Mar 1997 | A |
| 5672853 | Whitehall | Sep 1997 | A |
| 5841084 | Thangavelu | Nov 1998 | A |
| 6325178 | Hikita | Dec 2001 | B2 |
| 6394232 | Iwata | May 2002 | B1 |
| 6553269 | Hikita | Apr 2003 | B1 |
| 6672431 | Brand | Jan 2004 | B2 |
| 6913117 | Tyni | Jul 2005 | B2 |
| 6945365 | Matela | Sep 2005 | B2 |
| 7014015 | Nikovski | Mar 2006 | B2 |
| 7546906 | Tyni | Jun 2009 | B2 |
| 8104585 | Smith | Jan 2012 | B2 |
| 20190106289 | Kuusinen | Apr 2019 | A1 |
| Number | Date | Country |
|---|---|---|
| 0 565 864 | Oct 1993 | EP |
| WO 2005070804 | Aug 2005 | WO |
| WO 2009122002 | Oct 2009 | WO |
| WO 2014111127 | Jul 2014 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20170158459 A1 | Jun 2017 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | PCT/FI2014/050697 | Sep 2014 | US |
| Child | 15433299 | US |
