摘要:
Assignment of a hall call to an elevator car occurs only if servicing the hall call will not have an adverse effect on the response times of other registered calls for the car. Assignment of a hall call is made to the car having the lowest number of registered calls which cross a predetermined response time threshold in response to servicing the call.
摘要:
Instantaneous car assignment is combined with sectoring for providing an elevator dispatching scheme in which, in response to a hall call registered at the lobby, a car not assigned to a sector and having the lowest remaining response time of all such cars is assigned to the next available sector and the sector assignment is displayed to passengers immediately on a screen in the lobby.
摘要:
A method for controlling the dispatching of elevator cars, and apparatus for accomplishing the method. The method includes the steps of (a) receiving a hall call from a floor landing; (b) determining a current passenger load of an elevator car; (c) determining if a crowd signal is generated for the floor landing; and, if it is determined that a crowd signal is generated for the floor landing, (d) determining, from the current passenger load, if the elevator car is EMPTY. If it is determined that the elevator car is EMPTY, the method further includes the steps of (e) assigning an Empty Car Bonus to the elevator car; and (f) employing the Empty Car Bonus value in determining a Relative System Response for the elevator car. The Relative System Response is a function of a plurality of bonuses and penalties. The use of the invention increases the efficiency of the elevator system and serves to decrease the waiting time for persons waiting behind the hall call by increasing the probability of an empty car being assigned to a hall call having a crowd waiting behind the hall call.
摘要:
Method and apparatus is disclosed for operating an elevator system that includes a group of elevator cars servicing a plurality of floor landings divided into Sectors. The method includes the steps of, with a controller associated with each elevator car of the group, (a) determining when the elevator car has reached a Turn Around Point for returning the elevator car to a lobby; (b) initiating travel to the lobby; and (c) determining when the elevator car has reached a predetermined Sector Assignment Fixation Point. After reaching the predetermined Sector Assignment Fixation Point, the method further includes the steps of (d) communicating Sector-related information with other controller of other elevator cars of the group; and (e) based upon the communication, assigning to the elevator car a next Sector to be serviced after arrival at the lobby. A round-robin arbitration technique is disclosed for assigning Sectors among the elevator cars.
摘要:
An elevator system (FIG. 1) employing a microprocessor-based group controller (FIG. 2) communicating with elevator cars (3, 4, . . . ) to affect the assignment of cars to hall calls at a plurality of floors in the building, using different, speedier car motion profiles and system motion parameters when the presence of a passenger crowd is predicted (FIGS. 3-5). When a large passenger crowd presence is predicted, each of the assigned car(s) going to the relevant floor(s) is given a higher jerk and acceleration and deceleration rates for improved service time and decreased waiting time. (See FIG. 5.) When such a passenger crowd presence is no longer predicted (crowd signal reset), the car reverts back to a profile with a lower jerk and acceleration and deceleration rates for enhanced passenger comfort. The prediction methodology used for the predicted presence of a crowd utilizes "artificial intelligence" logic.
摘要:
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.