Patent Application
20210047144
The technology described herein generally pertains to an elevator system with a destination call control, particularly its configuration for call allocation and route planning. Exemplary embodiments of the technology also pertain to a method for operating such an elevator system.
In order to enable a passenger to call an elevator, known elevator systems either have a floor terminal for inputting the desired transport direction (e.g. “up” and “down” buttons) or a floor terminal for inputting the desired destination floor. The latter makes it possible to realize elevator systems with a destination call control, which allocates an elevator car to an elevator call of a passenger in order to transport the passenger to a desired destination floor. An exemplary embodiment of an elevator system with a destination call control is disclosed in document EP 0 443 188 B1; the destination call control allocates elevator calls based on calculated operating costs and variable bonus/malus factors.
Such allocation methods are based on the assumption that each passenger inputs an elevator call. However, such disciplined behavior is not always encountered in realistic situations as explained in EP 1 522 518 B1; in a group of persons with the same destination floor, it can occur that one person calls the elevator and all persons board the allocated elevator car. Subsequently, only relatively little space may remain in the elevator car depending on the size of the group, wherein the remaining space may under certain circumstances be so small that a passenger on another floor, who was already scheduled to be transported with this elevator car, can no longer board the elevator car (or wants to board the elevator car because it is excessively crowded). In such instances, it is known, e.g. from EP 1 552 518 B1 or US 2016/0297642 A1, to omit the scheduled stop on the floor and to travel past the floor; this is referred to as bypass in these publications. According to EP 1 552 518 B1 and US 2016/0297642 A1, the criterion for the activation of the bypass function is the measured load in the elevator car. However, the bypass function cannot be activated if the floor is the destination of a passenger in the elevator car.
Although the aforementioned solutions with bypass function potentially prevent an already full elevator car from stopping on a floor, on which no additional passengers can board the elevator car, they may lead to a significantly increased waiting time for the waiting passengers. In a destination call control, the aforementioned elevator car has to return to this floor because it was allocated to the passengers; it is not possible to simply select another elevator car that potentially could pick up the passengers earlier. The bypass function therefore may lead to a significant delay that can frustrate the passengers; the waiting passengers consequently may input new elevator calls, possibly also to destinations that do not correspond to their actual destination, just to be able to finally board an elevator car. This may result in additional disadvantages for other passengers. Consequently, there is a demand for a technology that handles the elevator calls in an improved manner and enhances the efficiency of the elevator system.
One aspect of such an improved technology concerns a method for operating an elevator system in a building, wherein the elevator system comprises a destination call control device and an elevator car, which can travel between floors of the building and has a defined passenger capacity. A first destination call being input on a floor by a first passenger at a first point in time is evaluated in order to determine first call information from the first destination call. The first call information contains data on a call input floor and/or a destination floor. The first call information is used for determining if a number of additional passengers are to be assigned to the first destination call, wherein the number of additional passengers results in an additional space requirement in an elevator car handling the first destination call. Information on the additional space requirement is generated if a number of additional passengers are to be assigned to the first destination call. If a number of additional passengers are to be assigned to the first destination call, the first destination call is allocated with the aid of an allocation algorithm by using information on the additional space requirement in order to transport the first passenger from the call input floor to the destination floor.
Another aspect concerns an elevator system in a building. The elevator system comprises an elevator car that can travel between floors of the building and has a defined passenger capacity. A destination call control device is configured for evaluating a first destination call being input on a floor by a first passenger at a first point in time in order to determine first call information from the first destination call, wherein the first call information contains data on a call input floor and/or a destination floor. The destination call control device is also configured for determining if a number of additional passengers are to be assigned to the first destination call based on the first call information, wherein the number of additional passengers results in an additional space requirement in an elevator car handling the first destination call. The destination call control device is furthermore configured for generating information on the additional space requirement if a number of additional passengers are to be assigned to the first destination call and, if a number of additional passengers are to be assigned to the first destination call, for allocating the first destination call with the aid of an allocation algorithm by using information on the additional space requirement in order to transport the first passenger from the call input floor to the destination floor.
The exemplary embodiments of the technology described herein take into account the above-described situations, in which additional unscheduled passengers with the same destination board an elevator car after a destination call of a passenger. According to the technology, the destination call control makes during the call allocation an assumption about a number of additional passengers, who would like to be transported together with a calling passenger without having input a destination call themselves and have a corresponding space requirement in the elevator car. The technology deviates from the conventional approach, in which a space requirement for a passenger has to be included for each destination call, based on data on the passenger behavior on the floors that is stored in a database. This makes it possible to make more realistic assumptions about the actual space requirement such that the elevator system can be operated with improved efficiency and the waiting times for the passengers can in turn also be optimized.
The data stored in the database may be organized in different ways. In an exemplary embodiment, the database is stored in a storage device, wherein a plurality of datasets are stored in the database. Each dataset has predefined data fields, wherein a first data field indicates the call input floor, a second data field indicates a time window, a third data field indicates the destination floor and a fourth a data field indicates the number of additional passengers for the call situation described in the dataset.
The technology described herein determines if a number of additional passengers are to be assigned to the first destination call with the aid of such a database. According to an exemplary embodiment, this is achieved by resorting to the database and determining if the first destination call corresponds to a call situation stored in the database. If this is the case, the number of additional passengers for this call situation defined by the first destination call is obtained. The generation of information on the additional space requirement therefore comprises reading the fourth data field in order to determine the number of additional passengers.
The data stored in the database can be determined in different ways. In an exemplary embodiment, the elevator system comprises a sensor system that is linked to the destination call control device and the storage device. The sensor system determines information on a number of passengers, who board the elevator car on a floor. The sensor system can be used, for example, for determining the number of additional passengers indicated in the fourth data field. In an exemplary embodiment, the sensor system comprises sensors that are arranged on the floors and linked to the destination call control device and the storage device via a line. A sensor of the sensor system comprises in an exemplary embodiment a camera and the sensor system is configured for determining the number of passengers from images recorded by the camera. As an alternative to such a self-learning system, persons may also observe and record the behavior of the passengers in dependence on the time of day and the day of the week in order to thereby obtain data for the database.
In an exemplary embodiment, the destination call control device is also configured for adapting the generated information on the additional space requirement by means of the information on the number of boarding passengers determined by the sensor system, as well as for using the adapted information on the additional space requirement for handling passengers. In this way, the scheduling of the handling sequence of passengers can be improved, e.g., because the (assumed) additional space requirement can be increased or decreased based on the number of actually boarding passengers.
In an exemplary embodiment, the space requirement of the first passenger is increased by the space requirement of the additional passengers for the allocation of the first destination call. The resulting overall space requirement is fed to the allocation algorithm. In this context, it is advantageous that the allocation algorithm does not have to be expanded or otherwise altered in comparison with known methods because the modification of the space requirement takes place independently of the allocation algorithm.
In an exemplary embodiment, the information on the additional space requirement is kept separate from the first destination call for the allocation of the first destination call; both are separately fed to the allocation algorithm. In this context, it is advantageous that the allocation algorithm can be respectively supplemented or altered with simpler or more complex rules in order to take into account the additional space requirement in different planning steps. Typical planning steps are the calculation of the space requirement for passengers waiting on a floor or the calculation of the space requirement for passengers, who would like to be jointly and simultaneously transported in the elevator car. In both instances, the individual normal space requirement and the individual additional space requirement can be taken into account for each of the respective passengers.
If a number of destination calls essentially are input by different passengers at the first point in time, for example, the allocation of the destination calls is based on a space requirement that, for one passenger per destination call, results from the number of destination calls and a maximum number of additional passengers. The maximum number of additional passengers can thereby be determined. For example, if three destination calls are input and one additional passenger is respectively assigned to two of these destination calls and three additional passengers are assigned to one of these destination calls, the maximum number of additional passengers is equal to three. This has the advantage that more space requirement is included if too few calls are input, but no unnecessary additional space requirement is any longer included at a sufficient number of calls.
In another example, in which a number of destination calls essentially are input by different passengers at the first point in time, the allocation of the destination calls is based on a space requirement that, for one passenger per destination call, results from the number of destination calls and a maximum number of additional passengers per floor. In this case, a number of additional passengers is determined for each destination call and each floor in order to thereby determine a maximum value of the additional space requirement per floor; the resulting maximum values are added. This has the advantage that no unnecessary additional space requirement is included if multiple calls are input by passengers with the same destination, but the calculation for passengers with different destinations is respectively based on additionally traveling passengers in order to thereby include sufficient space.
Different aspects of the enhanced technology are described in greater detail below with reference to exemplary embodiments in connection with the figures. Identical elements are identified by the same reference symbols in the figures. In these figures:
In the exemplary embodiment shown, the elevator system 1 has an elevator car 10 that can be displaced in an elevator shaft 18, wherein said elevator car is connected to a drive unit (DR) 14 with the aid of supporting means 16 (cables or belts) and suspended on this drive unit 14. The elevator may be a traction elevator, wherein additional details such as a counterweight and guide rails are not illustrated in
The elevator system 1 illustrated in
In an exemplary embodiment, the control device 8 may be entirely or partially implemented in the elevator control 12. If the elevator system 1 comprises one or more groups of elevators, the destination call control 8 or its function may be respectively implemented in an elevator group control. The destination call control 8 allocates one of potentially multiple elevator cars 10 to a destination call of a passenger 4, which is input on a floor terminal 5, and communicates the corresponding allocation information to the elevator control 12 via a communication bus 24.
The basic function of a destination call control and the call allocation carried out thereby are known, for example, from the book by G. C. Barney et al., Elevator Traffic Analysis Design and Control, Rev. 2nd Ed, 1985, pp. 135-147, or above-cited patent document EP 0 443 188 B 1. According to this patent document, for example, a computer knows the load, the position and the operating status of an elevator car and the operating status of a drive for each elevator of the elevator system at any point in time and has additional data on the previous traffic volume and currently applicable bonus/malus factors. Based on this information, the described destination call allocation algorithm allocates newly input destination calls as optimally as possible in accordance with predefined criteria. These criteria essentially concern functional requirements for the call handling. The destination call allocation is based on calculations of the operating costs. The individually calculated operating costs are compared with one another call-by-call and the elevator with the lowest operating costs is selected for handling the destination call. Additional details on the structure of the elevator system 1 are provided at a different point of this description.
In the situation illustrated in
As mentioned above, the destination call control utilizes assumptions that in a first embodiment are based on stored data. This data is stored in the database 28 of the storage device 34 illustrated in
A few of the exemplary call situations illustrated in table 1 are described below. According to one of the call situations (line 1 in table 1), a passenger 4 inputs a (first) destination call to the floor L3 on the floor L1 between 7:00 and 7:30. According to table 1, the destination call control makes the assumption that not only the calling passenger 4 would like to be transported to the floor L3 (basic assumption), but rather also five additional passengers 4. Consequently, a total of six passengers 4 correspond to this destination call. Such a situation may arise, e.g., if these passengers 4 should be present at their workstations between 7:00 and 7:30.
If no additional destination call is input approximately at the time of the (first) destination call in the time window between 7:00 and 7:30, the destination call control can allocate an elevator car 10, which carries out the transport from the floor L1 to the floor L3, to the destination call conventionally (e.g. based on a cost analysis). However, if another (second) destination call is input, e.g. on the floor L1 to the floor L2, and the table 1 contains no data on the number of additional passengers (i.e. the number of additional passengers is zero), the destination call control can carry out the call allocation based on the basic assumption (one passenger per destination call). If the elevator car 10 in this example has a capacity of eight persons or passengers, the destination call control 8 can allocate the destination call of this passenger 4 to the elevator car 10, which was allocated to the transport of the six passengers 4 (first destination call) to the floor L3. Seven passengers 4 therefore board the elevator car 10 on the floor L1.
However, the allocation takes place differently if a third destination call to the floor L3 (line 3 in table 1) is input on the floor L2 approximately at the time of the first destination call. According to table 1, the destination call control makes the assumption that the calling passenger 4 and four additional passengers 4 would like to be transported. The elevator car 10 allocated to the first destination call (six passengers 4) has a capacity of eight persons and therefore can no longer accommodate the five passengers 4 waiting on the floor L2 (third destination call). With respect to the call allocation, this means that the destination call control 8 does not allocate the third destination call to the elevator car 10 scheduled for the transport from the floor L1 to the floor L3 because there is insufficient space for the scheduled additional passengers in the elevator car. Instead, the destination call control 8 can allocate another elevator car 10 to the third destination call. This makes it possible to prevent that the elevator car has insufficient space for allowing the expected additional passengers waiting on the floor L2 to board during the stop on this floor. In addition, this may potentially also lead to a minimized waiting time for the passengers 4 waiting on the floor L2. If no passengers are transported, e.g. from the floor L1 to the floor L2, the destination call control 8 may alternatively allocate the first and the third destination call to the same elevator car 10 and plan the routes in such a way that the elevator car 10 initially travels from the floor L1 to the floor L3 in order to handle the first destination call and subsequently from the floor L3 to the floor L2 in order to handle the third destination call. Although the sequence of the floors being served may in this case be identical to systems with the above-described bypass function, the method and its effect are different: the bypass function can only prevent the elevator car from stopping on the floor L2, on which the elevator car has insufficient space for allowing the passengers waiting on this floor to board, under certain circumstances (e.g. when no passengers are traveling from the floor L1 to the floor L2) and furthermore leads to significantly increased waiting times for the passengers waiting on the floor L2. These disadvantages are eliminated with the method described herein because a stop of the already heavily occupied elevator car on the floor L2 is prevented in any case and the waiting times for the passengers on all floors are already taken into account and minimized in the route planning.
Table 1 furthermore shows a situation (line 4) that may arise in an office building around lunchtime. With respect to a destination call to the floor L1, which is input on the floor L3 in a time window between 11:30 and 12:30, it is assumed that seven additional passengers 4 would like to be transported from the floor L3 to the floor L1 in addition to the calling passenger 4. In this case, the elevator car 10 with a capacity of eight passengers is fully occupied. The destination call control 8 schedules no additional stops for this transport.
The call situations indicated in table 1 can be determined from observations of the behavior of the passengers 4 within a defined time period. The defined time period may amount, for example, to one or two months (or longer), wherein the observations are carried out, e.g., with intervals of one week (i.e. 7 days of observations followed by a break of 7 days). For example, the observations may be recorded by one or more persons, who document the passenger behavior on each floor L1, L2, L3 in dependence on the time of day and the day of the week.
The observations can potentially be supplemented by questioning the passengers 4. These observations make it possible to define the time windows and to determine the number of additional passengers 4 (e.g. by means of averaging). Such observations may be documented for all floors L1, L2, L3 or only for selected floors L1, L2, L3. In this way, time-dependent behavior patterns with respect to the elevator utilization can be determined for each floor L1, L2, L3. The elevator system 1 can be correspondingly configured once the complete table 1 has been generated. A person skilled in the art is aware of the fact that the table 1 can be updated if the utilization of the building 2 and therefore the behavior pattern change, e.g. when a previously unused floor L1, L2, L3 is used by a firm with a large number of employees.
In another exemplary embodiment, the passenger behavior can be determined with the aid of a sensor system. In
In addition to this information made available by the counter, the sensor system may also utilize information on the destination call or destination calls being input on the respective floor L1, L2, L3. In this case, the sensor system is communicatively linked to the destination call control 8. In another embodiment, the destination call control 8 may in this case utilize the information acquired by the sensor system in order to additionally improve the service schedule, e.g. by increasing or decreasing the additional space requirement of actually waiting passengers or passengers being transported in an elevator. For example, the elevator control according to table 1 initially makes the assumption that five additional passengers 4 are expected for a (first) destination call to the floor L3, which is input on the floor L1 between 7:00 and 7:30, i.e. that a total of six passengers 4 are expected; however, if the sensor system determines that only a total of two passengers 4 have actually boarded the elevator car, the destination call control can reduce the additional space requirement from five additional passengers to one additional passenger and evaluate the situation anew, e.g. schedule an intermediate stop on the floor L2 because sufficient space for the passengers boarding on this floor is now available.
Alternatively, no connection to the destination call control 8 is provided, but the information acquired separately by the sensor system and the destination call control 8 can be subsequently combined and analyzed, e.g. in a computer system used for this purpose. Analogous to the observations by persons, the passenger behavior per floor L1, L2, L3 during a defined time period can be determined by means of the sensor system; the complete table 1 can thereby be generated. In addition, table 1 can be updated by the sensor system, for example, when necessary or in accordance with a defined schedule.
An exemplary embodiment of a method for operating the elevator system 1, particularly a method for allocating a destination call, is described below with reference to
The method initially waits for the reception of a destination call (steps S2 and S3). When a passenger 4 inputs a destination call at a floor terminal 5, this destination call is received by the destination call evaluation unit 26 of the destination call control 8. A person skilled in the art is aware of the fact that the destination call evaluation unit 26 may receive multiple destination calls simultaneously or within a short time period depending on the traffic volume.
In step S4, the received destination call is evaluated in order to determine call information. In the case of multiple destination calls, each of these destination calls is evaluated. Exemplary criteria, according to which the evaluation is carried out, are the call input floor, the destination floor, the point in time of the destination call or combinations thereof. The point in time of the destination call is acquired, for example, in the form of the time of day and the calendar date. For example, the call information comprises the call input floor and/or the destination floor.
In step S5, an additional space requirement in the elevator car 10 is determined based on the call information. This determination of the additional space requirement utilizes the data stored in the database 28, which in an exemplary embodiment is organized in accordance with table 1. In an exemplary embodiment, the processor 30 checks if the received destination call (or its criteria) corresponds to one of the call situations documented in table 1. If this is the case, the additional space requirement results from the number of additional passengers 4 indicated in table 1 for this call situation.
In step S6, the information of the destination call is in an exemplary embodiment modified with the additional space requirement determined in step S5 (variation A). Each destination call implicitly or explicitly results in information on the space requirement in the elevator car 10 for the respective destination call. For example, the “normal” space requirement per destination call is space for one passenger. The information is modified, for example, in such a way that the determined additional space requirement (e.g. +2 passengers) is added to the normal space requirement ((new) space requirement: 1+2=3 passengers). This modified information is forwarded to the subsequent call allocation (step S7).
According to another exemplary embodiment, the information on the destination call is in step S6 supplemented with the additional space requirement determined in step S5 (variation B). In this exemplary embodiment, the information on the normal space requirement of the destination call being input and the determined information on the additional space requirement are kept separate and both forwarded to the call allocation (step S7).
The method determines the allocation of the destination call in step S7. This is achieved in that the method carries out an allocation algorithm; a person skilled in the art is familiar with such allocation algorithms, for example, based on above-cited document EP 0 443 188 B1 or the above-cited the book by G. C. Barney et al. According to variation A, the call allocation is based on the assumption that a destination call, which has an exemplary space requirement of three passengers, has been input, i.e. the space requirement corresponds to the information modified in step S6. This destination call is conventionally allocated by the implemented allocation algorithm; the allocation algorithm does not have to be expanded or otherwise altered in comparison with known methods because the modification of the space requirement is already carried out in preceding step S6 and therefore takes place independently of the allocation algorithm.
Variation B differs from the call allocation according to variation A in that the call allocation is not simply based on the space requirement in the elevator car 10, which results from adding the normal space requirement and the additional space requirement. This difference is relevant, for example, when a destination call of a passenger 4 is to be allocated on a floor L1, L2, L3, on which one or more other passengers 4 were already allocated to the elevator car 10. According to variation B, the normal space requirement and the additional space requirement of the calling passengers 4 are not simply added in step S7, but rather treated separately. For example, the normal space requirement may be added (e.g. four destination calls result in a normal space requirement for four passengers 4), but the additional space requirement of the passengers may be limited to the maximum additional space requirement of one individual passenger. This has the advantage that more space requirement is included if too few calls are input, but no unnecessary additional space requirement is any longer included at a sufficient number of calls.
In variation B, the allocation algorithm can be respectively supplemented or altered with simpler or more complex rules in order to take into account the additional space requirement in different planning steps. Typical planning steps are the calculation of the space requirement for passengers 4 waiting on a floor L1, L2, L3 or the calculation of the space requirement for passengers, who would like to be jointly and simultaneously transported in the elevator car 10. In both instances, the individual normal space requirement and the individual additional space requirement can be taken into account for each of the respective passengers 4. In the above-described example, the space requirement of all respective passengers was determined by adding the sum of the normal space requirement of the passengers and the maximum additional space requirement of the passengers. Instead of determining the maximum additional space requirement of all passengers, it would in another example also be possible to initially determine the maximum additional space requirement per destination and to add these values across all destinations; this has the advantage that no unnecessary additional space requirement is included for passengers with the same destination if multiple calls are input, but additionally traveling passengers and therefore sufficient space are respectively included for passengers with different destinations.
The following description of other components and functions of the elevator system 1 once again refers to
The destination call control device 8 is communicatively linked to the elevator control 12 and the floor terminals 5 as described above. In this description, the term communicative link refers to a direct or indirect link that allows a unidirectional or bidirectional communication between two units. Data signals and/or control signals are conventionally transmitted in this case. Such a link may be realized in the form of an electric line system (either in the form of a system of point-to-point connections or a bus system, in which the units connected to the bus system are addressable), a wireless system or a combination of a wireless system and a line system. In
In another exemplary embodiment, at least one floor terminal 5 may be communicatively linked to the destination call control device 8 via a wireless system. In another exemplary embodiment, a mobile electronic device (e.g. mobile telephone, smartphone, smartwatch, tablet PC) may be used for inputting a destination floor instead of a floor terminal 5. The mobile device may also display a notification concerning the elevator allocated to this destination call (e.g. “elevator A”). The mobile electronic device has a wireless module such as a Bluetooth module, an RFID module or an NFC module for the wireless communication with the elevator system 1.
A person skilled in the art is aware of the fact that the destination call control device 8 or its functionality may also be part of the elevator control 12 or a floor terminal 5. In such an instance, for example, the separate illustration of the control device 8 in
In an exemplary embodiment, a floor terminal 5 is arranged on each floor L1, L2, L3, for example, in the region of the access to an elevator car 10. In an exemplary embodiment, the floor terminal 5 comprises a keypad or a touch-sensitive screen (touchscreen) such that a passenger 4 can input a destination floor (i.e. a destination call). In another exemplary embodiment, the floor terminal 5 comprises a device for detecting an authorization parameter that is assigned to a passenger 4. In an exemplary embodiment, this device is a reader for an information carrier that is carried along by a passenger 4. When the passenger 4 presents the information carrier to the reader, the reader reads information that serves, e.g., for detecting an operating authorization from the information carrier. The passenger 4 can only input a call if the passenger 4 is authorized to operate the input terminal 5. Depending on the respective design, a destination call may also be triggered based on the read information without further action of the passenger 4.
In an exemplary embodiment, the information carrier is realized similar to a card, e.g. in the form of a credit card or an employee identification badge. A memory chip that can be contacted from the outside, an RFID transponder in connection with a memory chip or a code that can be (optically) read from the outside such as alphanumeric symbols, a QR code or a barcode may be located in or the information carrier depending on the respective design. The functionality of the information carrier may alternatively also be realized in a wearable electronic device (e.g. mobile telephone or smartphone). For example, alphanumeric symbols, QR codes, barcodes or color pattern codes can be displayed on the display unit of such devices. Devices of this type also make it possible to establish a wireless link with other electronic devices, e.g. by means of conventional wireless technologies such as Bluetooth, WLAN/Wi-Fi of NFC. The reader of the floor terminal 5 is compatible with the technology of the information carrier used. A person skilled in the art furthermore is aware of the fact that the reader may also be configured for more than one technology.
| Number | Date | Country | Kind |
|---|---|---|---|
| 17209784.2 | Dec 2017 | EP | regional |
This application is the national phase application under 35 U.S.C. § 371 claiming the benefit of priority based on International Patent Application No. PCT/EP2018/084784, filed on Dec. 13, 2018, which claims the benefit of priority based on European Patent Application No. 17209784.2, filed on Dec. 21, 2017. The contents of each of these applications are herein incorporated by reference.
| Filing Document | Filing Date | Country | Kind |
|---|---|---|---|
| PCT/EP2018/084784 | 12/13/2018 | WO | 00 |
