Abstract:
Embodiments are directed to receiving, by a controller comprising a processor, data that is external to a conveyance device, processing, by the controller, the external data, and controlling, by the controller, the conveyance device based on the processed external data, wherein the external data comprises at least one of: security management data and emergency services data.
Abstract:
Die Erfindung betrifft ein Verfahren zur Steuerung einer Aufzugsanlage mit mehreren Aufzugskabinen (1, 1', 1'') pro Aufzugsschacht, wobei von mindestens einem Passagier auf einem Ruf eingabestockwerk ein Zielruf (T1) auf ein gewünschtes Zielstockwerk getätigt wird und von mindestens einer Zielrufsteuerung (3, 3', 3'') für den Zielruf (T1) mindestens eine günstigste Rufzuteilung (T6) für eine Beförderung des Passagiers durch die Aufzugskabine (1, 1', 1'') von einem Startstockwerk auf ein Zielstockwerk ermittelt wird. Falls mindestens ein Benachteiligungsparameter (T2) gesetzt ist, wird von der Zielrufsteuerung (3, 3', 3'') mindestens eine benachteiligungsfreie Rufzuteilung (T8) für eine Beförderung des Passagiers durch die Aufzugskabine (1, 1', 1'') von einem Startstockwerk auf ein Zielstockwerk ermittelt, bei der nach Möglichkeit Start- und Ruf eingabestockwerk bzw. Zielstockwerk und gewünschtes Ziel übereinstimmen.
Abstract:
The present invention discloses an extension to a prior-art genetic algorithm, with which the routing of elevators based on the calls given in an elevator system is formed. A new type of gene, a so-called run type gene, is connected to the chromosome of the genetic algorithm according to the invention, with which gene the desired speed profile for the elevator trip can be set. In this way e.g. an upper limit can be set for the acceleration or for the maximum travel speed of the elevator. By means of the run type gene a kinetic energy term is included in the optimization. The energy consumed by the system can thus be minimized more effectively by means of the algorithm, because the varying travel speeds of the elevators create more freedom of choice for the chromosomes of the algorithm.
Abstract:
The present invention provides a method and apparatus for use in elevator systems for assigning new hall calls to one of a plurality of available elevator cars. The method comprises calculating for each car a call cost for accepting the new hall call. The call cost is a function of the estimated time to the desired destination of the passenger requesting the new hall call and of the delay that other passagers who are using the elevator car will experience. In one embodiment, a destination is inferred for the passenger requesting the new hall call. In another embodiment, the passenger requesting the hall call may input a desired destination at the time the hall call request is made. The elevator system of the present invention allows for use of both standard up/down hall call entry devices and destination entry devices that allow a particular destination to be entered by a passenger at the time a hall call is requested.
Abstract:
The present invention provides a method and apparatus for use in elevator systems for assigning new hall calls to one of a plurality of available elevator cars. The method comprises calculating for each car a call cost for accepting the new hall call. The call cost is a function of the estimated time to the desired destination of the passenger requesting the new hall call and of the delay that other passagers who are using the elevator car will experience. In one embodiment, a destination is inferred for the passenger requesting the new hall call. In another embodiment, the passenger requesting the hall call may input a desired destination at the time the hall call request is made. The elevator system of the present invention allows for use of both standard up/down hall call entry devices and destination entry devices that allow a particular destination to be entered by a passenger at the time a hall call is requested.
Abstract:
An elevator swing operation system for use in a building includes a plurality of floors with landings that are grouped into zones. The elevator cars are allocated to service the zones with a default allocation setup or configuration. The allocation of elevator cars to zones can be modified by moving an elevator car from one zone to another in response to a maximum estimated time to arrival being exceeded and a maximum number of elevator cars allowed to change zones not being exceeded. Furthermore, the default configuration or allocation can be restored when the system is in swing operation, an elevator car is parked, and a minimum time for receiving no calls has been exceeded.
Abstract:
An intelligent destination elevator control system streamlines the efficiency and control of destination elevators. The system monitors a building's population and predicts elevator traffic conditions. The system may monitor attributes of the destination elevators. Based on the monitored data, the system may generate a data structure that renders time-tables and target elevator service quality parameters that may control the destination elevators. A time¬ table and target elevator service quality parameters may be selected to control destination elevators according to one or more customer selectable mode of operation parameters. The data structure may be processed to control UP and/or DOWN transportation capacities of the destination elevators while satisfying the one or more customer selectable mode of operation parameters. Some intelligent destination elevator control systems may control when elevator cars of a group service the floors of a building. Control of the elevator cars may be flexible to allow the system to increase or decrease traffic capacities of the elevator cars in accordance with anticipated traffic conditions.
Abstract:
A method for allocating destination calls in an elevator system, said elevator system comprising at least one multi-deck elevator, in which method the passenger gives his/her destination floor by means of a destination call device at the beginning of the journey route, defining the starting point and final point of the passenger's journey route in the elevator system, which method comprises the steps of generating possible route alternatives from the starting point to the final point of the passenger's journey route, determining a cost function containing at least one travel time term, determining the value of the travel time term corresponding to each route alternative in the cost function, calculating the total cost of each route alternative by using the cost function, allocating for the passenger the route alternative that gives the minimum total cost and guiding the passenger to a waiting lobby and/or elevator consistent with the route alternative allocated.
Abstract:
The present invention discloses a method for optimal routing of the elevators in an elevator system in a situation where the supply power received by the system is limited e.g. due to emergency power operation. In the invention, routes are optimized by using a cost function to which has been added a term containing the summed instantaneous power consumed. Power consumption is monitored in real time, and the elevators need a start permission from the control system. A route alternative that exceeds the power limit is penalized in the cost function by a so-called penal term. With the elevator routing obtained as a result, the instantaneous power consumed by the system remains continuously below the set power limit. Some call can thus be postponed to be served later. By the method of the invention, the number of elevators serving passengers in an emergency power situation can be varied dynamically .