Abstract:
In a multi-deck-elevator-equipped building control system, operating modes of an elevator control portion include a double operating mode. In the double operating mode, only a first cage is permitted to stop at first cage stop floors, and only a second cage is permitted to stop at second cage stop floors that are distinct from the first cage stop floors. A building fixture control portion has a first group control portion for associatively controlling an electrical fixture on the first cage stop floors and a second group control portion for associatively controlling an electrical fixture on the second cage stop floors.
Abstract:
Elevator cars move in two vertical hoistways each having at least one crossing-point to a third vertical parking hoistway arranged between the two hoistways to allow transfer of the elevator cars between adjacent ones of the hoistways. A control system and a drive move empty elevator cars through the crossing-points for parking and for responding to calls for service.
Abstract:
The invention concerns a method for solving an optimization task consisting of a plurality of sub-functions in the control of the operation of an apparatus. In the method, a set of a plurality of solution alternatives is generated and, according to the method, each sub-function is normalized. Normalized cost functions of the sub-functions are generated for each solution alternative for solving the optimization task, and based on the normalized cost functions of the sub-functions, a set of solutions to the optimization task is formed. From the set of solutions, the best solution is selected and the apparatus is controlled in accordance with the solution thus selected.
Abstract:
An elevator group control method for allocating landing calls and car calls to elevators so that the objectives set are met. In the method, a car-specific energy consumption file is generated to describe the energy consumption occurring during each trip of the elevator from each floor to each one of the other floors with different loads, and the calls are so allocated that the energy consumption resulting from serving all the active calls is minimized.
Abstract:
A method controls the distribution of free cars in an elevator system. First, the number of free cars in the elevator system are counted whenever this number changes. At the same time, the arrival/destination rates of passengers at each of the floor is determined. The rates are used to identify up-peak and down-peak traffic patterns. The floors of the building are then assigned to zones. The number of floors in each zone is determined according to the arrival rates, and the free cars are then parked in the zones so that the expected waiting time of the next arriving passenger is minimized.
Abstract:
A method controls an elevator system including multiple elevator cars and multiple floors. A new passenger at one of the floors signals a hall call. In response to receiving the hall call, the method determines, for each car, a set of all possible future states of the elevator system. The future states depend on the current state of the system, which is defined by passengers already assigned to cars, the direction of travel, position and velocity of the cars. A cost function is evaluated to determine a cost for each set of all possible future states. Then, the car associated with the set having a least cost is assigned to service the hall call. The method is applicable to any type of traffic. It is particularly well-suited for up-peak traffic because it handles efficiently the uncertainty in passenger destinations.
Abstract:
An elevator system controller for efficient group supervisory control while avoiding collisions between two elevator cars in service in a single elevator shaft. The elevator system controller includes a risk calculating unit for calculating a risk of a collision between elevator cars in the same shaft when the elevator cars are responding to a new call for service, a car assigning unit for assignment of an elevator car to respond to the new call based on the risk of collision, and an operation control unit for controlling operation of the elevator cars based on the assignment by the car assigning unit. The risk of collision is calculated for each car, and the risk is recalculated based on a possibility of a withdrawal of one of the elevator cars to a position in the shaft where no collision can occur, based on a predicted arrival time of a car at the floor requiring service. Cars that have high risks of collision when the remaining cars in the same shaft cannot be withdrawn in time to a safe spot are removed as candidates for assignment to respond to the new call. An evaluation is carried out using several evaluation indexes, in addition to the risk of collision, to decide which car is to be assigned to respond to the new call. If a determination of a traffic condition indicates low usage of the elevator cars, one car in each shaft is forwarded to a rest position and paused.
Abstract:
As elevator group including at least two elevator cars is controlled using a group control unit which allocates the calls to different elevators. Based on statistical data and/or statistical forecasts, virtual passenger traffic is generated and used in a simulation that creates events in the virtual passenger traffic, on the basis of which an elevator-specific cost is computed for each call to be allocated. Based on the costs, the best elevator is selected to serve the call. This allocation of a best elevator to answer a specific landing call may be reallocated as the simulation is updated to update the best elevator to answer a specific floor call.
Abstract:
A procedure for allocating the calls entered via landing call devices of the elevators in an elevator bank forms several allocation options. Each allocating option contains, for each active landing call, a call data item and an elevator data item which together are used to determine which elevator should service the call. The value of a cost function is calculated for each allocation option; one or more of the allocation options is repeatedly changed with respect to at least one data item, and the values of the cost functions of the new allocation options are calculated. Based on the values of the cost functions, the best allocation option is selected and the active elevator calls are allocated to the elevators in the elevator bank accordingly.
Abstract:
A method for adapting to observed special use patterns a neural network used to estimate quantities needed by an elevator dispatching system responsible for assigning the elevator or another elevator to a hall call. Rather than simply refining values of existing connection weights to train the neural network to provide acceptable outputs for predetermined inputs, the method analyzes use information to determine whether additional inputs to the neural network might be advantageous and what those inputs might be. If so, the method alters the neural network architecture by providing new input nodes and corresponding connection weights, the connection weights having initially relatively small values. All connection weights can then be adjusted during actual operation of the elevator to accommodate the new input nodes.