Elevator system

• US 4,511,017 A
• Filed: 09/20/1983
• Issued: 04/16/1985
• Est. Priority Date: 09/20/1983
• Status: Expired due to Term

• Current Assignee: Inventio AG (Schindler Holding AG)
• Original Assignee: Westinghouse Electric Corporation (Paramount Global (f/k/a ViacomCBS Inc.))
• Inventors: MacDonald, Robert C.
• Primary Examiner(s): Truhe, J. V.
• Assistant Examiner(s): Duncanson, Jr., W. E.
• Application Number:
  US06/534,005
• Time in Patent Office: 574 Days
• Field of Search: 187/29
• US Class Current: 187/383
• CPC Class Codes: B66B 5/02 responsive to abnormal operating conditions

Abstract

An elevator system, and method of operating same, in which emergency back-up service is provided all floors of a building when normal service is degraded, such as due to a dispatcher malfunction, a communication failure between the elevator cars of a bank of cars and a group supervisory controller or dispatcher, failure of the hall call circuits, and the like. When the emergency service is provided, a different initial block of floors is assigned to each elevator car, and as each elevator car completes a round trip its block of assignments are revised in a rotational manner. Thus, all floors are guaranteed service as long as at least one elevator car is operational.

Claims

1. A method of providing emergency elevator service for each floor of a building having a bank of elevator cars and a plurality of floors, including a main floor, comprising the steps of:

pre-assigning a predetermined different pattern of floors to each elevator car of the bank,

and revising the assignment for each car after a predetermined occurrence.

2. The method of claim 1 wherein the revising step revises the assignments in a rotational manner, changing each floor of its pattern by one.

3. The method of claim 1 wherein the step of pre-assigning predetermined different patterns of floors includes the step of assigning the main floor in each pattern, and wherein the step of revising the assignments for each car includes the step of retaining the main floor assignment in the revised assignment.

4. The method of claim 1 wherein the predetermined occurrence which results in the revising step changing a car'"'"'s assignments, is the completion of a round trip by the car, starting from a predetermined floor and returning to the predetermined floor.

5. The method of claim 1 wherein the predetermined occurrence which results in the revising step changing a car'"'"'s assignments, is the completion of a round trip by a car, starting from the main floor and returning to the main floor.

6. The method of claim 1 wherein the predetermined occurrence which results in the revising step changing a car'"'"'s assignments, is the completion of a round trip by a car, starting from the lowest floor the car can serve and returning to this floor.

7. The method of claim 1 wherein the step of pre-assigning predetermined different patterns of floors to each car includes the step of including the main floor in each pattern, and the revising step revises the assignments in a rotational manner, changing each floor of each predetermined pattern by one, and including the step of retaining the main floor assignment in each revision.

8. The method of claim 1 wherein the preassigning step includes the step of spacing the floors in each pattern according to the number of cars in the bank.

9. The method of claim 8 wherein the revising step revises the assignments in a rotational manner, changing each previously assigned floor of a predetermined pattern by one, and including the step of wrapping around from one end of a pattern grouping to the other, when an end is reached.

10. The method of claim 1 wherein the preassigning step includes the step of grouping the floors into a predetermined number of groups of contiguous floors, and the step of assigning each car to at least one floor from each group.

11. The method of claim 10 wherein the revising step includes the step of revising the assignments in a rotational manner, changing each pre-assigned floor of each group by one, and including the step of wrapping around to the other end of the same group when an end of the group is reached.

12. An elevator system comprising:

a building having a plurality of floors including a main floor,

a bank of elevator cars mounted in said building to serve the floors therein,

means responsive to a predetermined condition for initiating an emergency operating mode of the elevator system,

and means for implementing said emergency operating mode, including means for assigning a predetermined different pattern of floors to each elevator car, means for detecting a predetermined occurrence relative to each elevator car, and means responsive to each such detection for revising the associated car'"'"'s pattern of floor assignments.

13. The elevator system of claim 12 wherein the means for revising each car'"'"'s floor assignments does so in a rotational manner, changing each floor of this pattern by one.

14. The elevator system of claim 12 wherein the means which assigns a predetermined different pattern of floors to each car, spaces the floors of each pattern according to the number of elevator cars in the bank.

15. The elevator system of claim 14 wherein the means which revises each pattern of floor assignments changes each previously assigned floor of the pattern by one.

16. The elevator system of claim 12 wherein the means which assigns a predetermined different pattern of floors to each car includes means for grouping the floors into a predetermined number of groups of contiguous floors, with each car being assigned to at least one floor from each group.

17. The elevator system of claim 16 wherein the means for revising each car'"'"'s assignments includes means for changing each pre-assigned floor of each group by one, and for wrapping around to the other end of the same group when an end of the group is reached.

18. The elevator system of claim 12 wherein the means for assigning a predetermined different pattern of floors to each elevator car includes non-volatile memory means associated with each car in which its initial pattern is stored.

19. The elevator system of claim 12 wherein the means which detects a predetermined occurrence for each elevator car, detects the arrival of the car at a predetermined floor.

20. The elevator system of claim 19 wherein the predetermined floor is the lowest floor of the building which the car can serve.

21. The elevator system of claim 12 wherein the means which revises a car'"'"'s pattern of floor assignments includes random access memory means having a predetermined number of memory words associated with car assignments, the bits of which represent floors of the building, and with set bits representing assignments, with the assignments being revised by shifting set bits associated with the prior assignment to an adjacent bit, wrapping around in the same memory word when an end of a memory word is reached.