Abstract:
In an approach for determining an optimal path for an elevator, a processor receives information, wherein the information includes social media data associated with a user and calendar entries associated with the user, indicating one or more locations within a building. A processor analyzes the received information. A processor determines a location to send an elevator within the building to minimize movement of the elevator, based on the analyzed information. A processor causes the elevator to move to the location.
Abstract:
An elevator control system including an elevator management system obtaining meeting information from at least one of a calendar system and a user interface; the elevator management system generating a control command in response to the meeting information; and an elevator controller controlling destinations of one or more elevator cars in response to the control command.
Abstract:
A method for the call allocation in an elevator group uses a call allocation unit of an elevator group control. In the call allocation unit, passenger flow data of the elevator group is used to adapt call allocation parameters to improve the performance of the elevator group. The public traffic data is retrieved from at least one public transportation system, and is used to supplement expected passenger flow data for the adaption of call allocation parameters.
Abstract:
The present invention discloses a method for controlling an elevator system. In the method, hints relating to potential elevator passengers are received from at least one observation point connected to the elevator system. Based on the hints, forecasts relating to potential elevator passengers are prepared, on the basis of which forecasts one or more anticipatory control actions are executed.
Abstract:
The invention relates to a method for controlling an elevator installation with at least one shaft and a number of cars, it being possible to make at least two cars travel separately up and down along a common traveling path and a passenger being able to enter a destination call by means of an input unit disposed outside the shaft and the destination call being allocated to a car in dependence on an allocation assessment. To develop the method in such a way that the transporting capacity can be increased, with the cars which can be made to travel along a common traveling path hindering one another as little as possible, it is proposed according to the invention that, in the case of allocation of the destination call to one of the cars which can be made to travel along the common traveling path, the portion of the traveling path required for serving the destination call is assigned to this car and blocked for the time of the assignment for the other cars. Furthermore, an elevator installation for carrying out the method is proposed.
Abstract:
A method schedules cars of an elevator system in a building. The method begins execution whenever a newly arrived passenger presses an up or down button to generate a call for service. For each car, determine a first waiting time for all existing passengers if the car is assigned to service the call, based on future states of the elevator system. For each car, determine a second waiting time of future passengers if the car is assigned to service the call, based on a landing pattern of the cars. For each car, combine the first and second waiting times to produce an adjusted waiting time, The method ends by assigning a particular car having a lowest adjusted waiting time to service the call and minimize an average waiting time of all passengers.
Abstract:
An elevator system for a multistory structure having a plurality of elevator shafts is shown which includes at least one independently movable elevator car in each elevator shaft. A digital computer with memory is used to control elevator cars including the dispatch of cars from terminal floors. A daily control parameter table in memory identifies a plurality of different methods of scheduling dispatch of elevator cars from terminal floors, groups of floors to be serviced by each elevator car, and cars in a shaft to be coupled for tandem operation. The memory is periodically read for selecting for each elevator car one of said methods of scheduling dispatch and for identifying the group of floors to be serviced by the cars. The selected method of scheduling the dispatch of cars is implemented and cars are limited to servicing the selected group of floors. One method of scheduling dispatch includes obtaining a measure of estimated passenger demand for travel in one direction that is incapable of being met by cars currently in service. A passenger loading threshold limit for travel in the one direction is selected which may range from zero to maximum capacity of the elevator car to be dispatched. When the measure of estimated passenger demand for travel in the one direction that is incapable of being met by cars currently in service equals the passenger loading threshold limit a car dispatch signal is issued for dispatch of a car from the terminal floor. Where a plurality of independently-operated cars are included in a hoistway, operation in either a coupled or decoupled manner is provided.
Abstract:
A system and method for controlling an elevator group including several elevators and related call devices which controls each elevator in a manner determined by the calls entered and the existing control instructions. When the control system has to decide between two or more control alternatives, a systematic decision analysis is performed by studying the effects resulting from each alternative decision, the effects resulting from each alternative decision, the effects being estimated by simulating by a Monte-Carlo type method the future behavior of the elevator system in the case of each alternative decision. To carry out the simulation, realizations are generated at random for the unknown quantities associated with the current state of the elevator system and for new external future events, and a control decision is made on the basis of the results of the decision analysis.
Abstract:
An elevator system is shown that includes an elevator shaft (12) in building (10) and a plurality of elevator cars (C.sub.1, C.sub.2 and C.sub.3) that are movable up and down within the shaft along vertical axis (20). The elevator cars are independently movable by drive motors (D.sub.1, D.sub.2 and D.sub.3) attached to the cars through hoisting cables (24, 28 and 34). The motors are controlled by motor controllers (MC.sub.1, MC.sub.2 and MC.sub.3) which, in turn are controlled by a computer (62) having as inputs service and destination requests, load weight and car location. Different operating modes are shown (FIGS. 5-8) including one in which serviced floors (F.sub.1 through F.sub.16) are serviced by no more than one elevator car at a time, and the cars travel sequentially from one end floor to the other end floor (FIGS. 5 and 6). Simultaneous servicing of a plurality of different floors is shown (FIGS. 7 and 8) and travel of empty elevator cars to a designated floor without responding to floor calls also is shown (FIGS. 6 and 8). Counterweights (CW.sub.1, CW.sub.2 and CW.sub.3) are attached by cables to the respective elevator cars (C.sub.1, C.sub.2 and C.sub.3), which counterweights travel along a vertical axis (38) laterally displaced from the elevator car axis (20). Shock absorbers (54) are provided for absorbing impact of accidental collision between adjacent counterweights (FIG. 3 ) which shock absorbers include coil springs (58) and dashpots (60).
Abstract:
A method of controlling a group of elevators allocates target calls definitively and immediately to the individual elevators for serving the call according to higher rank and lower rank function requirements and these allocations are indicated immediately at the call input floors. A weighted sum corresponding to higher rank function requirements is formed from partial operating costs, this sum is modified into operating costs in the sense of lower rank function requirements by means of variable bonus and penalty point factors and a target call is allocated to the elevator with the lowest operating costs. A target call allocation algorithm with subordinate algorithms for the bonus and penalty point tracking and the costs computation implements this method in a computer. The bonus and penalty point factors are continuously made to follow the traffic volume or the car load group by group or elevator by elevator with the tracking algorithm. The computation of the operating costs takes place in the costs computation algorithm according to a special costs formula, wherein the readjusted bonus and penalty point factors act multiplicatively on a six term partial costs sum.