Abstract:
With this group control the allocation of elevator cabins or cars to existing storey or floor calls should be timewise optimized and newly arriving storey calls should be immediately allocated. A computer device provided for each elevator computates at each landing or storey, irrespective of whether or not there is present a storey or landing call, from the distance between the storey and the cabin position indicated by a selector, the intermediate cabin stops to be expected within this distance and the momentary cabin load a sum proportional to the time losses of waiting passengers. In this way the cabin load prevailing at the computation time point is corrected such that the expected number of passengers entering and exiting the cabin, derived from the previously ascertained number of entering and exiting passengers, is taken into account for the future intermediate cabin stops. Such loss time sum, also referred to as the servicing cost, is stored in a cost storage or memory provided for each elevator and infed to a comparator. During a cost comparison cycle the servicing costs of all elevators are compared with one another, and in an allocation storage of the elevator with the lowest servicing cost there can be stored an allocation instruction which designates that storey or floor to which there can be optimumly allocated the relevant elevator cabin.
Abstract:
A group control device according to the present disclosure includes a registration unit, a calculation unit, and a selection unit. The registration unit makes call registration for a boarding floor, a destination floor, and an allocated car when a user makes a hall destination call by a hall destination calling device. The calculation unit calculates an in-car stay time of the user for the hall destination call. The selection unit selects a past hall destination call as an alternative candidate for call registration for a new hall destination call, in a case where the past hall destination call which has already been registered by the registration unit, whose allocated car is different from a car allocated to the new hall destination call, and whose in-car stay time is shorter than the in-car stay time calculated by the calculation unit.
Abstract:
Disclosed is a robot interlocking elevator control system for efficient control of elevators operated in association with robots autonomously moving in a building. The present disclosure provides a method of setting the most efficient elevator line to be exclusive for robots in consideration of traffic volume in the building, a method of assigning elevator lines and efficiently switching operation modes of elevators while suppressing an encounter between the robots and humans, and a method of setting robot boarding-related parameters for elevator lines set to allow use of the robots.
Abstract:
An elevator installation for serving at least one floor in at least one building can be modernized, the elevator installation comprising at least one elevator with at least one elevator car and at least one elevator control. At least one destination call terminal for input of at least one destination call and/or for recognition of at least one identification code is installed on at least one input floor. At least one destination call control is installed. The destination call terminal is, for communication of the destination call signal, connected with the destination call control. The destination call control can be connected to the elevator control through a serial interface of the elevator control.
Abstract:
An elevator installation has at least one elevator with at least one elevator car and at least one elevator control. A destination call terminal for input of destination calls and/or for recognition of an identification code is installed on at least one input floor. At least one destination call control is also installed. The destination call terminal is, for communication of the destination call signal, connected with the destination call control. The destination call control is connected to the elevator control through an existing serial maintenance interface of the elevator control.
Abstract:
A method of controlling a elevator installation with several elevator cages per elevator shaft, wherein a destination call to a desired destination story is actuated on a call input story by at least one passenger and at least one most favorable call allocation for transport of the passenger by the elevator cage from a start story to a destination story is determined for the destination call by at least one destination call control. If at least one disadvantage parameter is set, at least one disadvantage-free call allocation for transport of the passenger by the elevator cage from a start story to a destination story is determined by the destination call control, in which it is possible the start story and call input story or the destination story and desired destination correspond.
Abstract:
An elevator dispatching system includes a plurality of elevator groups, each of the plurality of elevator groups comprising a group controller and a plurality of elevator cars, each of the plurality of elevator groups serving a respective set of floors; and a redirector configured to receive a service request comprising a destination floor, and, in the event more than one elevator group serves the destination floor, communicate the service request to the group controllers of the more than one elevator groups, wherein the respective group controllers of the more than one elevator groups are configured to each determine a respective group score, and communicate the respective group score to the redirector, and the redirector is further configured to determine the best group based on the respective group scores.
Abstract:
The movement of a plurality of elevator cars (12, 14) in an elevator hoistway (16) is coordinated for situations in which the regions of the hoistway that are serviceable by the cars (12, 14) at any given time are configured to overlap. A car stop plan for each elevator car (12, 14) is generated that includes a sequence of stops for servicing demand assigned to the elevator car (12, 14). Operation of the elevator cars (12, 14) is then coordinated based on the car stop plans such that each elevator car (12, 14) services its assigned demand without interfering with the car stop plans of any other of the plurality of elevator cars (12, 14).
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 staffing 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 staffing 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:
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.