Abstract:
An elevator control apparatus determines the time required for a call to reach a hall and controls an operation of the car using the obtained estimated travel time. The elevator control apparatus includes an input data conversion unit for converting traffic data, including car position, car direction data, and data regarding car calls and hall calls into data that can be used as input data to a neural network. An estimated travel time operation unit including an input layer is provided for taking in the input data. An output layer is provided for outputting the estimated travel time. An intermediate layer is provided between the input and output layers in which a weighting factor is set. The estimated travel time operation unit comprises a neural network and an output data conversion unit for converting the estimated travel time output from the output layer into data that can be used for a predetermined control operation.
Abstract:
Elevator group supervisory control method and system for group supervisory control of a plurality of elevators serving a plurality of floors. The method and apparatus of the invention permits the inputting of qualitative requests (guidance), from the user, concerning elevator operation into the group supervisory control system. Qualitative requests concerning elevator operation are set in the form of guidance (or request) targets. The thus set request, targets are converted into control targets for the elevators. Actual group supervisory control is executed using the control targets.
Abstract:
In a group-management control apparatus for an elevator system with plural elevators capable of serving plural floors, hall calls are allotted to adaptive elevators in accordance with a predetermined hall call allotment algorithm, for the purpose of achieving desired control targets. Plural kinds of the hall call allotment algorithm with different schemes are provided in advance, and the predetermined hall call allotment algorithm is selected therefrom by a reasoning operation, which is executed in accordance with a reasoning rule selected from among a plurality of reasoning rules empirically provided in advance on the basis of the desired control targets and an operating state of the elevators.
Abstract:
A method for operating an elevator installation includes receiving a destination call of a passenger at a control unit and selecting an elevator car from a set of available elevator cars for transporting the passenger. The elevator car is selected such that elevator car spacing rules are observed. The method further includes determining an arrival time of the selected elevator car at the boarding floor, and determining a first arrival time of the passenger at an elevator landing corresponding to the selected elevator car on the boarding floor. The method includes directing, under the proviso that the first arrival time of the passenger at the elevator landing precedes the arrival time of the selected elevator car by a defined margin, the passenger to a waiting zone of a set of available waiting zones. The waiting zone is selected such that waiting zone spacing rules are observed.
Abstract:
A method of controlling an intelligent destination elevator control system streamlines the control of two or more destination elevators. Operations of a group of destination elevators are monitored to gain experience about how the population is served by the group of destination elevators that serves a building or a building zone. The analysis of measured and/or modeled data and conditions with data about traffic patterns and traffic characteristics enables the system to dynamically control the destination elevators. The system may enhance passengers' experience through efficiency and/or with an improved comfort level.
Abstract:
One version of this disclosure includes a system for assigning an elevator car to respond to a call signal wherein a controller is responsible for determining which elevator car will respond to a call signal. This version includes the controller receiving a hall call signal, receiving information regarding the elevator system, determining whether the call assignment can be made in view of a first rule associated with a banned call assignment, and eliminating the rule against banned call assignments when necessary to avoid saturation of the elevator system.
Abstract:
A method for allocating destination calls in an elevator system, the system including at least one multi-deck elevator, where the passenger gives his/her destination floor by means of a destination call device at the beginning of the journey route, thereby defining the starting point and final point of the passenger's journey route in the elevator system. The method includes the steps of generating possible route alternatives from the starting point to the final point of the 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 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 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.
Abstract:
A method controls the elevators in an elevator group when destination floor call input is used and the traffic within the elevator group is to be optimized. According to the concept of the method, based on traffic intensity, a cost function is optimized by changing the number of cost criteria from one to several and back and weighting the criteria in different ways in the aforesaid cost function.