Abstract:
An elevator car dispatcher having an artificially intelligent supervisor which generates a crowd prediction signal associated with a particular floor, monitors a condition of a first elevator car which has serviced the predetermined floor and controls the remainder of elevator cars assigned to the predetermined floor dependent upon the condition of the first car.
Abstract:
An elevator control system for controlling movement of cages up and down in accordance with the situation of waiting persons in landing places or passengers in the cages detected by image pickup devices and other detecting devices includes first and second image processors, the image processing level of the second image processor being not lower than that of the first image processor. The system further includes an elevator controller for controlling movement of the cages up and down, the elevator controller including a device for applying the result of image processing performed by the first image processor to the control of the cages, and a device for applying the result of image processing performed by the second image processor to the control of the cages when the image processing is carried out based on the result of image processing performed by the first image processor and other information pertaining to passengers and waiting persons detected by the other detecting devices.
Abstract:
During up-peak, a dispatcher selecting method chooses among three dispatching algorithms: (i) an up-peak sectoring scheme triggered when two cars leave the lobby fully loaded, (ii) static sectoring, and (iii) dynamic sectoring, in response to any of three criteria: car load, floor population, and average waiting time, allowing a group of elevators to be operated under any three of the dispatching algorithms, not locked into any two.
Abstract:
A group control for double car elevators permits the upper as well as the lower cars to be used at a main stopping floor for travel to both even-numbered and odd-numbered floors. The control has a call memory for each car in which the target calls entered at the main stopping floor and identifying the target floors are stored. A switching circuit has an input connected to the call memories in such a manner that the double car is scheduled in dependence on the allocated call as stopping at floor pairs numbered even-odd or odd-even. An output of the switching circuit is connected to a switching device which excludes either the double cars stopping at floor pairs numbered even-odd or at floor pairs numbered odd-even from the allocation process in the case of a subsequent call to be allocated in order to maximize the possiblilities for coincident stops without losing flexibility.
Abstract:
A method and apparatus for the control of the dispatch of elevator cars from the main floor during up peak traffic conditions are implemented in an algorithm performed by a process computer. The algorithm for an elevator group, consisting of at least one elevator, calculates a transport capacity and a nominal time interval. The transport capacity and the nominal time interval are dependent on the nominal departure load and the compound values are stored in a transport capacity field and in an interval field, respectively. From data generated by a sensor, an elevator control and an input/output unit, the algorithm determines the traffic requirement at the main floor and the traffic requirement at an associated car, and the transport capacity is computed dependant on the higher of the two traffic requirements. Subsequently, the algorithm searches in the transport capacity field for the nominal departure load corresponding to this transport capacity. In a similar manner, the field component of the interval field, indexed with the nominal departure load, is addressed and the value of the field component assigned to the nominal time interval. As soon as the condition actual departure load equals nominal departure load or the condition actual time interval equals nominal time interval is satisfied, the associated car is dispatched.
Abstract:
A method for increasing the transportation capacity of elevators in a building involving dividing the elevators (2-7) into two or more groups, each comprising one or more elevators, in such manner that in certain loading situations the groups will temporarily serve different zones (11, 12) of the building (1). Upward peak traffic conditions are detected and the boundaries between zones (11, 12) are determined and maintained by the steps which include:(a) detecting by a peak traffic condition, mainly on the basis of elevator loading time and/or the number of people arriving in an elevator lobby (9) of the building (1).(b) calculating an initial optimal zone boundary value mainly on the basis of traffic statistics and existing transportation capacity.(c) effecting transition of elevator operation to sub-zoning during upward peak traffic.(d) re-calculating the optimal zone boundary value mainly on the basis of short-term traffic statistics, the number of people in the elevator lobby and the available transportation capacity.(e) sensing the need for change in the zone boundary and effecting the desired change as calculated in section (d).(f) cancelling the sub-zoning upon completion of the upward peak passenger period or when the volume of upward traffic has fallen below a predetermined limit.
Abstract:
A group control assigns elevator cars to floor calls optimized in such a manner, that minimal waiting times result and the elevating capacity is increased. A computing device provided for each elevator calculates at every floor a sum proportional to the time losses of the waiting passengers from the distance between the floor and the car position as indicated by a selector, the intermediate stops to be expected within the distance and the instantaneous car load. By means of call registering devices in the form of ten key keyboards at the floors, it is possible to enter calls for destination floors, so that at the time of calculation, the floor calls and the car calls are available simultaneously. The calculated lost time sum, also called servicing costs, is stored in a cost memory provided for each elevator. During a cost comparison cycle, the servicing costs of all elevators are compared with each other by way of a cost comparison device where in each case an assignment instruction can be stored in an assignment memory of the elevator with the lowest servicing costs which instruction designates that floor to which the respective car is optimally assigned in time.
Abstract:
In an elevator having a group of double-deck cars, a hall call is assigned to one of the decks according to a priority scheme that takes into account the service capability of each car and its decks in a way that favors assignment of the call to the lagging deck of the car most capable of answering the call.
Abstract:
In an elevator control system comprising a plurality of cars serving a plurality of floors, hall call register means provided on the landing of each floor, cage call register means provided in each car, and means for detecting the number of passenger in each car;The improvement comprising means for forecasting the number of in-cage passengers for every destination floor by allotting the detected number of in-cage passengers to the cage calls, means for detecting the number of waiting passengers provided on the landing of specified floors, means for setting the number of waiting passengers on other than the landing of the specified floors, means for sequentially adding the detected number of prospective passengers waiting on each of the specified floors that have generated the hall calls to the detected number of in-cage passengers, means for sequentially adding the setting of the number of waiting passengers on each of the floors other than the specified floors that have generated the hall calls to the number of detected passengers, means for subtracting the number of forecast in-cage passengers for every destination floor from the detected number of in-cage passengers, means for setting the limit of in-cage passenger number, and means for detecting serviceable floors by comparing the forecast number of in-cage passengers for each floor obtained by the addition and subtraction with the limit of in-cage passenger number.
Abstract:
An elevator car dispatching system (100) comprises an elevator control module (102) that controls operation of at least one elevator car. A position monitoring mechanism (104) is coupled to a first elevator car among the at least one elevator car. The position monitoring mechanism (104) is configured to output a position signal in response to movement of the first elevator car. The elevator car dispatching system (100) further comprises an electronic dispatch module (106) that is in electrical communication with the elevator control module (102) and the position monitoring mechanism (104). The dispatch module (106) is configured to determine a vertical position of the first elevator car based on the position signal. The dispatch module (106) is further configured to output a dispatch command signal commanding the elevator control module (102) to adjust operation of the first elevator car based on the vertical position.