EP1418148A1 - Elevator control using zones - Google Patents

Abstract

The system uses several lift cages in separate shafts parallel to each other and various floors in the building are grouped together. The first stage in the process (R=f) determines whether or not a lift call is a priority call. A YES answer activates a stage determining whether a lift cage in use is available (gfK). A NO answer activates a stage determining whether a non-priority lift cage is available (gnfK). YES and NO answers from these stages activate the nearest lift cage (tbfK,tbnfK) or activate queries as to whether other lift cages are available in the call zone (afKsZ,anfKsZ). Further control stages are performed according to a predetermined algorithm.

Description

The invention relates to a method and a device for controlling a Elevator installation with several elevator cars in a building or the like, whose floors are divided into several zones, the Elevator cabs are assigned driving orders.

From EP 0 624 540 B1 an elevator system for zone operation is known become. In this elevator system with instant allocation of zone calls is passenger traffic between at least one main stop and zones in the high building of a lift system consisting of three elevators overcome. Every building-filling lift user passes one Zone associated gate in which a sensor registers the elevator user. By choosing the appropriate gate, the elevator user shares his desired zone without manual operation of a Rufregistriereinrichtung the elevator control with. The elevator cabs travel in certain, permanently assigned Zones. The zoning is used to make a tall building special to fill quickly. There are express lifts to pass by serviced floors not serviced by these elevators.

For the same reason is also known from US-A 5,511,634 Elevator installation carried out a zoning. It is from each free elevator cars that one new call in a new Allocated the zone that can serve this call the fastest.

The object of the invention is a method and a device for controlling an elevator installation referred to in the preamble of claim 1 Art in such a way that thus a zone control with separation from the Zones assigned to user groups is feasible such that waiting times minimized for individual user groups as possible.

This object is achieved by a method having the steps of attached hereto Claim 1 solved.

Advantageous embodiments of the invention are the subject of the dependent claims.

In the control method according to the invention, the zones should preferably assigned to individual user groups with limited access authorization become. In contrast to the elevator systems described above and their controls are used in the inventive method Zone operation for security purposes, strictly separate user groups to separate. If an elevator has a travel order assigned to a zone is busy, so you may further driving orders only from the same Allocated to the zone. The elevator car can only change to another zone be assigned once she has completed all the assigned driving assignments and thus is free. Before a call is given for a new drive order, However, according to the invention, the number of free elevator cars will first be included the number of unallocated, that is currently not served zones compared. This determines whether there are still enough free zones for all zones Elevator cabins are available. This will then help in deciding where to go the new call is to be allocated.

In a preferred embodiment, a call, the one already by the elevator system operated zone is assigned, only a free elevator car allocated if a free elevator remains for each unused zone. Thereby The elevators are thus assigned to user groups on the individual zones Distributed that each group always has at least one elevator too Available.

A particularly preferred embodiment solves problems in a Spatial separation of user groups based on their access authorization arise in a different elevator layout. So it can be elevator systems give, at the some floors only from a subgroup are serviceable by elevators. If only these restricted Floors assigned or assigned to specific user groups are, then it can with these or with the other user groups ever arrive after destination to sometimes considerably increased waiting times or the persons of other user groups can no longer be assigned.

This is achieved according to the preferred embodiment in that at a new reputation is detected, if it is assigned to a zone that at least includes a limited usable floor. Such zones are referred to herein as "preferred zones". Associated with such a preferred zone Calls are referred to here as "preferred calls". For decision, How a call is assigned is preferably initially determined whether it is a priority call or not a priority call, that is is a non-preferred call. The allocation is then dependent on this statement.

In a further preferred embodiment, such preferential calls are preferably elevator cars assigned to serve all floors of a preferred zone can. Such an elevator car is referred to herein as a "preferred cabin". When allocating a call, it is preferably first determined whether it is a priority call or not, taking in the allotment of preferred calls the number of free preferred cabins with the number still unallocated preferential zones is compared to always as possible Preference cabin per unreferenced preferential zone to keep clear. at a non-preferred call is the number of non-preferred cabins with the Number of non-allocated non-preferential zones compared as possible always one free non-preferred cabin per non-allocated non-preferential zone to be able to keep clear.

In this way, despite a heterogeneous elevator structure, the individual Equally treated user groups, and the waiting times per specific User group are minimized. Nevertheless one can at accordingly larger number of elevator cars to be allocated to an increased Passenger traffic in a user group respond.

It is therefore also possible for a zone to be associated with a plurality of elevator cars become. So all elevator cars can be busy. falls but then an elevator car for some reason, so could it just one of the user group to be disadvantaged, if now no elevator more is available for their assigned zone.

For such cases, it is provided in a preferred embodiment that if there are fewer free elevator cabins than non-serviced zones, but one Zone served by several elevators, one of the elevator cars this multi-zone elevators will be blocked for further orders. This cabin will then be free after processing their orders and may not served zone.

Fig. 1

eine Graphik zur Veranschaulichung einer Zonenkontrolle bei Aufzugsanlagen;

Fig. 2

eine schematische Darstellung einer Aufzugsanlage mit mehreren Aufzügen und heterogenem Aufzugslayout;

Fig. 3

eine schematische Darstellung einer ersten Zone der Aufzugsanlage von Fig. 2;

Fig. 4

eine schematische Darstellung einer zweiten Zone der Aufzugsanlage von Fig. 2;

Fig. 5

eine schematische Darstellung einer dritten Zone der Aufzugsanlage von Fig. 2;

Fig. 6

ein Beispiel einer Rufzuteilung zu der Aufzugsanlage von Fig. 1;

Fig. 7

ein Beispiel einer Rufzuteilung, wie sie durch herkömmliche Steuerungen ausgehend von der Situation von Fig. 6 erzielt werden würde;

Fig. 8A bis 8E

Darstellungen verschiedener Rufzuteilungen und neuer Rufe, ausgehend von der in Fig. 6 verdeutlichten Situation;

Fig. 9

ein Flussdiagramm für einen Algorithmus bei der Steuerung einer Aufzugsanlage, wie sie beispielsweise in den Fig. 2 bis 5 dargestellt ist;

Fig. 10

einen Teil des Flussdiagramms von Fig. 9 mit Anmerkungen;

Fig. 11A bis 11C

verschiedene Darstellungen von Rufzuteilungen und neuen Rufen bei der Aufzugsanlage von Fig. 2, wobei Fig. 11A eine beispielhafte Ausgangssituation, Fig.11 B einen neuen Ruf bei der in Fig. 11A gezeigten Situation und Fig. 11 C eine Rufzuteilung aufzeigt, welche durch eine herkömmliche Steuerung erhalten werden würde;

Fig. 12

einen Teil des Flussdiagramms von Fig. 9 mit Anmerkungen zur Verdeutlichung, wie der in Fig. 9 gezeigte Steuerungs-Algorithmus die Rufzuteilung durchführen würde;

Fig. 13

eine Darstellung der Endsituation der Rufzuteilung, wie sie durch den in Fig. 9 gezeigten Algorithmus ausgehend von der Situation gemäß Fig. 11A erhalten wird;

Fig. 14 bis 17

weitere Darstellungen von Rufzuteilungssituationen bei der Aufzugsanlage gemäß Fig. 2 zur Verdeutlichung der Funktion des Steuerungs-Algorithmus gemäß Fig. 9;

Fig. 18 und 19

beispielhafte Darstellungen einer Rufzuteilung ohne freie Aufzugskabine zwecks Erläuterung einer problematischen Situation;

Fig. 20 und 21

Rufzuteilungen entsprechend den Fig. 18 und 19 zwecks Illustration einer Lösung zu diesem Problem;

Fig. 22 bis 24

Flussdiagramme für einen Algorithmus zur Lösung des in den Fig. 18 und 19 dargestellten Problems; und

Fig. 25 bis 27

Darstellungen von verschiedenen beispielhaften Rufsituationen zur Erläuterung der Funktion des Algorithmus gemäß den Fig. 22 bis 24.

Embodiments of the invention are explained below with reference to the accompanying drawings. It shows:

Fig. 1

a graph illustrating a zone control in elevator systems;

Fig. 2

a schematic representation of an elevator system with multiple elevators and heterogeneous elevator layout;

Fig. 3

a schematic representation of a first zone of the elevator installation of Fig. 2;

Fig. 4

a schematic representation of a second zone of the elevator installation of Fig. 2;

Fig. 5

a schematic representation of a third zone of the elevator system of Fig. 2;

Fig. 6

an example of a call allocation to the elevator system of Fig. 1;

Fig. 7

an example of a call allocation, as would be achieved by conventional controls based on the situation of Fig. 6;

FIGS. 8A to 8E

Representations of different call allocations and new calls, starting from the situation illustrated in FIG. 6;

Fig. 9

a flowchart for an algorithm in the control of an elevator system, as shown for example in Figures 2 to 5.

Fig. 10

a portion of the flowchart of Figure 9 with annotations;

Figs. 11A to 11C

11A shows an exemplary starting situation, FIG. 11B shows a new call in the situation shown in FIG. 11A, and FIG. 11C shows a call allocation, which is represented by a call conventional control would be obtained;

Fig. 12

Figure 9 illustrates a portion of the flowchart illustrating how the control algorithm shown in Figure 9 would perform the call allocation;

Fig. 13

a representation of the final situation of the Rufzuteilung, as obtained by the algorithm shown in Figure 9, starting from the situation of Figure 11A.

FIGS. 14 to 17

Further representations of Rufzuteilungssituationen in the elevator system of Figure 2 to illustrate the function of the control algorithm of FIG. 9.

FIGS. 18 and 19

exemplary representations of a call allocation without a free elevator car for the purpose of explaining a problematic situation;

FIGS. 20 and 21

Call allocations corresponding to Figs. 18 and 19 for illustration of a solution to this problem;

FIGS. 22 to 24

Flowcharts for an algorithm for solving the problem illustrated in Figs. 18 and 19; and

Fig. 25 to 27

Representations of various exemplary call situations for explaining the function of the algorithm according to FIGS. 22 to 24.

1. General considerations 1.1 Introduction to the problem of zone control

A zone control in buildings or the like (conceivable would be synonymous Ships) is used to carry various groups of elevator passengers separate from each other. The zone control is a security feature that used in buildings or the like, where passenger groups from each other have to be disconnected.

For example, if there are two groups of passengers, namely one group 1 and a group 2, then allowed in a zone-controlled building a passenger belonging to the group 1 not together with one to the Group 2 belonging passenger drive.

In a zone-controlled building or the like, each destination call is one Zone assigned. To separate passenger groups, a busy one Elevator does not accept a call that is assigned to a zone other than the zone that the elevator is currently operating. It is for example Assume that an elevator A serves a call for a zone 1. It was further assumed that at this moment one belonging to the group 2 Passenger enters a call. Due to the zone separation the passenger may from Group 2 travel only in its zone 2 while the passenger is out zone 1 is allowed to travel only in its zone 1. That's why this new call can be of belonging to the group 2 passenger is not associated with the elevator A. become.

In the present elevator system as well as the underlying here Control method for such a lift system should make it possible be a favorable control method using such To perform zone control. The individual each assigned to a zone Operator groups should be effectively separated from each other so that no person from a first operator group with a second zone driving elevator can drive.

The individual operator groups can be identified by known person identification measures be assigned to the individual zones. For this the elevator installation can have various personal identification devices exhibit. Examples are key-operated switch, code keypad, electronic Keys, smart cards, finger sensors, etc. Virtually any on the sector the locking technology such as doors, gates or motor vehicles known technique is usable. For example, one may be to a particular one Person belonging to a call for a travel order with a destination floor in their zone using only a personal one mechanical or electronic key or by entering her enter personal code. In the corresponding control method So, preferably, when calling is a person identification performed to assign the call to a specific zone.

1.2 Change of zones

In a zone-controlled building, each elevator can either be up-to-date Serve calls, or he has no orders. If the elevator has no driving orders has, he becomes "free". In a free state, an elevator can make a call from any one Accept zone.

When an elevator operates calls within a zone, the elevator can handle the Do not change the zone until it becomes free.

An example with two zones is given in FIG.

R → Z1

ein zu der Zone 1 zugeordneten Ruf;

Z1

Zone 1;

Knj

der Aufzug hat keine Aufträge;

fr

der Aufzug ist frei;

R → Z2

ein Ruf ist der Zone 2 zugeordnet;

Z2

Zone 2.

Where:

R → Z1

a call associated with zone 1;

Z1

Zone 1;

knj

the elevator has no orders;

Fri.

the elevator is free;

R → Z2

a call is assigned to zone 2;

Z2

Zone 2.

Fig. 1 illustrates the above facts.

2. Preference cabin algorithms

To assignment problems in buildings with heterogeneous elevator layouts or to solve heterogeneous elevator structures, here are so-called preferred cab algorithms (English: favorite car algorithms) used.

To clarify the problems and the solution presented here in the following an exemplary elevator structure and some of these associated Zones as they actually occur in certain buildings can. All the examples presented are based on the featured zones and structures. After an introduction, the according to The algorithm proposed in the embodiment together with some Examples explained.

2.1 elevator structure

FIG. 2 shows an example of a heterogeneous elevator structure (elevator layout). played. The elevator system shown there schematically has six elevators with elevator cars A, B, C, D, E, F on. With a dashed Line is the main entrance ME indicated. The elevators with the cabins A, B, C, D lead from the main entrance ME only upwards. In this one presented example operate the elevators with the cabins E, F also below the main entrance ME lying basement floors. Only the elevator cabins E and F thus serve all floors of the building. The following Examples relate to this exemplary elevator structure, as they are in Fig. 2 is presented.

2.2 zones

The building shown here is supposed to be a building in which a zone control is desired as a security feature. It was assuming that the building is a bank building public areas - for example a floor, is operated in the gastronomy - and has living areas. In the Figs. 3 to 5 are the resulting zones, each of which is a single user group the lift system are assigned, each with a gray Bars indicated.

2.2.1 Zone 1: Visitors

The first user group should be in this example to trade visitors. The visitors should in the example shown here Have access to the main entrance and a visitor floor. The visitor floor For example, a floor with publicly accessible Gastronomy or include the visitor's rooms of the bank. The Zone 1 is shown by the reference Z1 in FIG. There is one gray bar at the main entrance ME and a gray bar in the visitor floor.

The other two user groups for the example building are residents and bank employees.

The visitors share the following floors with the residents: Main entrance ME and visitor floor. With the bank employees Visitors have only the floor "main entrance" in common.

As can be seen from Fig. 3, in the example shown here, all elevators A to F serve the floors of visitors and thus zone Z1.

2.2.2 Zone 2: Residents

Naturally, residents of a building should have access to those Floors on which apartments are located. Usually There are also areas in the basement of a building, which is a resident be accessible, such as basements or a residents underground car park.

In Fig. 4 is an exemplary zone 2 - designated by reference numeral Z2 - for Residents indicated. The floors for residents are shown in the Example of the main entrance, all floors from the visitor floor and above and a few floors below the main entrance.

The residents have with the visitors the floors "main entrance" ME and the visitor floor together. With the bank employees have the residents just shared the floor "main entrance" ME.

2.2.3 Zone 3: Bank employees

In the example shown here in Fig. 5, the floors for the Bank employees all floors from the main entrance ME to the Visitor floor (where the visitor floor is not included) and a few floors below the main entrance ME. The result resulting zone 3 is marked in Fig. 5 with Z3. The bank employees accordingly have with the visitors and the residents only the floor "Main entrance" ME in common.

2.3. definitions

To better understand the preference cabin algorithms, there are some Expressions explained:

2.3.1 Preference Zone

A zone is a "preferred zone" if it contains floors that are not for every elevator car can be reached. In the above examples, the zones are "Residents" Z2 and "Bank employees" Z3 preferred zones.

2.3.2 Preferred cabin (preferred lift)

An elevator car is a "preferred cabin" if all floors at least can serve a preferential zone. In the above examples are the elevator cars E and F preferred cabins.

2.3.3 Vorzugsruf

A call assigned to a motion task is a priority call if it is one Preferred zone is assigned. This can be done for example by known Identify personal identification measures, as explained above. If a passenger by an appropriate key or code as Resident identifies so he can place a driving order in a destination floor within enter zone Z2. The corresponding call then becomes the zone Assigned to Z2. The example shown here requires visitors not necessarily a person identification. The bank employees need for the input of an assigned to the zone Z3 call again a key or the like.

2.3.4 Number of unallocated preferential zones

The number of preferential zones that currently or not currently to any Elevator or an elevator car are assigned, as a number unassigned preferred cabins referred to. An example of this is in Fig. 6 reproduced.

In this case, the elevator cars A, B, C and F are free (this state is in the Drawings indicated by the reference numeral fr). The elevators D and E are busy with driving assignments. The elevator D operates a driving order a visitor, is therefore assigned to zone Z1. The elevator E operates a Driving order of a resident and is thus assigned to the zone Z2.

In this example, the number of unassigned preferred zones is one. The Zone Z3 is a preferred zone, but it is not to any elevator car assigned.

2.3.5 Number of unallocated non-preferential zones

Non-preferred zones are all zones which are not preferred zones are. The number of non-preferred zones currently or to Time are not assigned to a lift is unallocated as a number Non-preferred zones. In the example of FIG. 4, the number is unallocated non-preferential zones zero. The only non-preferential zone in our example the zone is Z1. Zone Z1 is an elevator car assigned, namely the elevator car D.

2.3.6 Plenty of preferred cabins available

The condition "sufficient preference cabins available" should then be met, if the number of free preferred cabins is greater than or equal to the number of not assigned preferential zones.

This condition or expression is appropriate when making a decision It must be taken if a call is assigned to a free elevator car should or should not be.

In the example of Fig. 7, the elevator cars A to C are free. The elevator car D is assigned to the zone Z1 and the elevator cars E and F are assigned to zone Z2. In this example, there are not enough preferred cabins available! Both preferred cabins E and F are busy. For the Preference zone Z3 is no preference cabin left.

2.3.7 Sufficient non-preferred cabins available

The condition "sufficient non-preferred cabins available" is then met, if the number of free non-preferred cabins is greater than or equal to the number of unallocated non-preferential zones.

This expression is useful when making a decision It must determine whether a new call should be placed in a free elevator car or not.

2.4 Why an algorithm?

When a call is entered by a user, the call immediately becomes one Zone assigned. According to known allocation algorithms - see For example, EP 0 301 178 B1 - selects the elevator control then the best elevator car that can serve that reputation. This can for example, depending on a cost minimization or algorithms for the fastest possible filling and / or shortening of waiting times be performed. For the selection of the best elevator car there is Moment only a few restrictions: The elevator car must both the Start floor as well as the destination floor, the zone state the elevator car must be "free" or at the time of the elevator car assigned zone must match the zone assigned to the call.

What can happen is shown in FIGS. 8A to 8C.

In Fig. 8A, an exemplary initial state is shown. This condition corresponds to the state of Fig. 6, that is, the elevator car D is the zone Z1 and the elevator car E is assigned to the zone Z2, while the remaining elevator cars are free fr. There is one in this condition new call nRZ2 in zone Z2, as shown in Fig. 8B. In this new call nRZ2 should be here the request of a driving order between a habitable floor and one accessible to the residents Basement act.

For example, the elevator controller selects the elevator car F as best Elevator car.

The resulting allocation situation is shown in Fig. 8C. The state corresponds to that of Fig. 7, wherein the newly allocated call is highlighted in gray.

Without special algorithm, the following situation can arise:

It is assumed that now a new call nRZ3 by a bank employee is specified between the main entrance and the only for Bank employees want to operate accessible basement floor. This new call belongs to zone Z3 and includes one of the basement floors.

As shown in Fig. 8E, there is no available elevator car for this purpose. The free Elevator cabs A to C can not operate the basement and the two preferred cabins E, F, which could serve the basement, are assigned to another zone Z2 and therefore may not be assigned to zone Z3 become.

The bank employee has to wait until one of the two elevator cars E and F become free again. Since here again and again new destination calls Zone Z2 could be entered, this may u. U. take a long time.

To solve such a problem becomes an "allocation to a free cabin" algorithm proposed. This analyzes the situation and moves the elevator allocation of belonging to the zone Z2 call on the Elevator car E and not to the elevator car F.

After the algorithm has been performed, the call can be definitive be assigned and the user is given information that show him the assigned cabin for his call.

2.5 The "assignment to a free cab" algorithm

R = f

Ruf ist ein Vorzugsruf. Hier wird untersucht, ob es sich bei dem Ruf um einen Vorzugsruf handelt oder nicht.

gfK

Genügend Vorzugskabinen verfügbar? Diese Bedingung wird anhand der obigen Definition untersucht. Dabei erfolgt die Abfrage (auch) derart, dass untersucht wird, ob nach einer Zuteilung des neuen Rufes zu einer freien Vorzugskabine dann noch genügend Vorzugskabinen verfügbar sind.

tbfK

Nimm die beste Vorzugskabine. Die Auswahl aus der Anzahl von freien Vorzugskabinen erfolgt nach den auch bei üblichen Steuerungsalgorithmen eingesetzten Kriterien.

afKsZ

Andere Vorzugskabinen verkehren in derselben Zone. Hier wird untersucht, ob es bereits eine Vorzugskabine gibt, die derselben Zone zugeordnet ist, zu der der neue Ruf gehört.

gnFK

Genügend Nicht-Vorzugskabinen verfügbar? Bei der Abfrage wird vorzugsweise auch untersucht, ob nach der Zuteilung des neuen Rufes zu einer freien Nicht-Vorzugskabine dann noch genügend Nicht-Vorzugskabinen verfügbar sind.

R → nfK

Ruf kann zu einer Nicht-Vorzugskabine verschoben werden.

anfKsZ

Andere Nicht-Vorzugskabinen verkehren in derselben Zone.

tbfKsZ

Nimm die beste Vorzugskabine, die in dieser Zone verkehrt.

tbnfK

Nimm die beste Nicht-Vorzugskabine.

R → nfKsZ

Ruf kann zu einer Nicht-Vorzugskabine verschoben werden, die in dieser Zone verkehrt.

tbnfKsZ

Nimm die beste Nicht-Vorzugskabine, die in dieser Zone verkehrt.

nc

keine Veränderung.

The "assignment to a free car" algorithm is shown in FIG. 9 in the form of a flowchart. The flowchart is self-explanatory considering the following legend:

R = f

Reputation is a priority call. Here it is examined whether the call is a preferred call or not.

gfK

Plenty of preferred cabins available? This condition is examined by the above definition. The query (also) takes place in such a way that it is examined whether, after an allocation of the new call to a free preferred cabin, there are still enough preferred cabins available.

tbfK

Take the best preferred cabin. The selection from the number of free preferred cabins takes place according to the criteria also used in conventional control algorithms.

afKsZ

Other preferred cabins operate in the same zone. Here it is examined whether there is already a preferred cabin assigned to the same zone to which the new call belongs.

gnFK

Enough non-preferred cabins available? In the query, it is also preferably examined whether there are still enough non-preferred cabins available after the allocation of the new call to a free non-preferred cabin.

R → nfK

Call can be moved to a non-preferred cabin.

anfKsZ

Other non-preferred cabins operate in the same zone.

tbfKsZ

Take the best preferred cabin that operates in this zone.

tbnfK

Take the best non-preferred cabin.

R → nfKsZ

Call can be moved to a non-preferred cabin that operates in this zone.

tbnfKsZ

Take the best non-preferred cabin operating in this zone.

nc

no change.

2.5.1 What would the algorithm in the example of 8A to 8E do?

For this purpose, the decision branch illustrated in FIG Algorithm of Fig. 9, reference is made. At 100, the condition is "the call a preferred call has been found to be true: the call shown in FIG. 8B belongs to the preferential zone Z2 and is therefore a priority call.

If the call - as in our example by the upstream usual Control algorithms happen - be placed on the elevator car F would not be enough elevator cars for a call in the preferred zone Z3 available. The condition "enough preferential cabins available" gfK is therefore not satisfied, as shown at reference numeral 102 is.

On the other hand, the preferred cabin E already operates in zone Z2. The condition "other preferential cabins operate in the same zone" afKsZ is Thus, as can be seen at reference numeral 104.

There are still three free non-preferred cabins. The condition "sufficient Non-preferred cabins available "So gnfk is fulfilled, but the new one can Call nRZ2 of Fig. 8B to be assigned to no non-preferred cabin because none of the non-preferred cabins A to D contained in the new call nRZ2 Basement can serve, this leads to the 106 reproduced Decision.

So the algorithm leads to the statement tbfKsZ, that is the best one Non-preferential cabin operating in this zone must be taken as indicated at reference numeral 108. This is the right decision because now the new call nRZ2 is assigned to the elevator car E, for the preferential zone Z3 thus a preferred cabin F is kept free. Of the new call nRZ3 of Fig. 8D can be allocated without undue waiting times become.

2.5.2 Another example

Fig. 11A illustrates another situation that may happen. In the Fig. 11A the elevators with the elevator cars A, B, D and E are inoperative, what is represented by the reference numeral oos (out of service). The Elevator car C is assigned to the zone Z2 and the elevator car F is free Fri. Now, as shown in Fig. 11B, suppose that a new call NRZ2 is entered in zone Z2, which is a travel order between the Main entrance ME and a top resident floor. Such a Exemplary order can also from a non-preferred cabin A to D. be done. Conventional elevator controls would be such assign new call NRZ2, for example, the elevator car F, since they are this recognize as the best elevator car.

Without an algorithm, therefore, one would have the situation illustrated in FIG. 11C, according to which the elevator cars C and F are both assigned to the zone Z2 and the other elevator cars are out of service oos.

Then there is the problem that a possible new associated with the zone Z3 Call (see, for example, the call nRZ3 of Fig. 8D) in particular then can not be assigned, if this call only by a preferential cabin can be served.

FIG. 12 shows what the algorithm shown in FIG. 9 is in FIG would do this case.

As indicated at 110, the algorithm has decided that the reputation of the Zone Z2 is assigned and thus is a preferred call. The decision 112 It is based on the fact that only one preferred cabin is left, but there are two preferential zones gives. Would you assign the call of the elevator car F, so would be not enough preferred cabins available. This leads to the decision 112th

At 114, it should be noted that in the situation illustrated in FIG Cabin is left for the non-preferential zone Z1, since only a single non-preferential cabin C operates in zone Z2 and all other non-preferred cabins are not available. This leads to the decision that Not enough non-preferred cabins are available.

The non-preferred cabin C operates in zone Z2. So there are others Non-preferred cabins operating in the same zone as at 116 is indicated.

Since the new NRZ2 call only the floors main entrance ME and above Concerning floors, the reputation of a non-preferential cabin, which is in the same zone. The one in the same zone Non-preferred cabin C can all floors from the entrance in Serve upwards direction. The corresponding decision is at 118 played.

Thus, at 120, the algorithm performs best on the ZbnfKsZ instruction Non-preferential cabin that operates in the same zone. This is in the example of Fig. 11A, the cabin C!

The corresponding allocation made by the algorithm is in Fig. 13 reproduced. The algorithm shifts the call allocation of the Call NRZ2 from the one selected by upstream elevator algorithms Elevator car F to the elevator car C. The algorithm has the elevator car F reserved for further calls belonging to Zone Z3. In each In this case, a call belonging to the zone Z3 can be served.

Note: However, if a new call is not to zone Z2 or elevator car C can be moved, the algorithm would be the decision "no change" nc lead. The call would not be postponed at all. Thus, according to the other known algorithms, the elevator car F assigned to the call.

2.5.3 Example 1

Zone Z1

Nicht-Vorzugszone

Zone Z2

Vorzugszone für die Kabinen E, F

Zone Z3

Vorzugszone für die Kabinen E, F.

Reference is made to FIG. 14. As can be seen, there is again the elevator layout according to the previous examples (Figures 2 to 5) with six lifts A to F. There are two elevator cab preference cabins, designated E and F. There are the following defined zones:

Zone Z1

Non-preferential zone

Zone Z2

Preferential zone for the cabins E, F

Zone Z3

Preferred zone for the cabins E, F.

The cabin E is assigned to the zone Z2. The cabin F is free. For one new call assigned to zone Z1 would become a costing algorithm For example, select cabin F for this call. If the Cab F would be assigned to zone Z1 but would not have a cab remain for zone Z3.

The algorithm of Fig. 9 prevents this problem. How easy from the Flowchart of Fig. 9 derivable, the algorithm decides in this Example, that the best non-preferential cabin already in this zone Z1 wrong to take for this new call for zone Z1.

2.5.4 Example 2

Zone Z1

Nicht-Vorzugszone

Zone Z2

Vorzugszone für die Kabinen E, F

Zone Z3

Vorzugszone für die Kabinen E, F.

Reference is made here to FIG. As can be seen, there is again the elevator layout according to the previous examples (Figures 2 to 5) with six lifts A to F. There are two elevator cab preference cabins, designated E and F. There are the following defined zones:

Zone Z1

Non-preferential zone

Zone Z2

Preferential zone for the cabins E, F

Zone Z3

Preferred zone for the cabins E, F.

In this example, assume that the car A is allocated to the zone Z1 and cabin E of zone Z2. The rest of the cabins were free.

If now the cabin F would be allocated to the zone Z1, none would Special cabin left for zone Z3. To avoid this problem, the algorithm decides - as easily from the flowchart of Fig. 9 derivable - that the best non-preferred cabin for this new call must be taken.

2.5.5 Example 3

Zone Z1

Nicht-Vorzugszone

Zone Z2

Nicht-Vorzugszone

Zone Z3

Vorzugszone für die Kabinen D bis F

Zone Z4

Vorzugszone für die Kabinen D bis F.

Example 3 is illustrated in FIG. 16. Again, there are six elevators, but three non-preferential cabins A to C and three preferential cabins D to F. As defined zones:

Zone Z1

Non-preferential zone

Zone Z2

Non-preferential zone

Zone Z3

Preferred zone for the cabins D to F

Zone Z4

Preferred zone for cabins D to F.

In the example according to FIG. 16, the cars A and B are the zones Z1 and the cabins D and E assigned to zone Z3. The cab C and F are free. Now enter a new call assigned to Zone Z3. A pure cost calculation algorithm For example, the elevator car would make this new call Assign C

But if the elevator car would be assigned to the zone Z3, would be no elevator car left for Zone Z2.

The decision of the algorithm can be made - as in the above examples 1 and 2 - easily obtained from the flowchart of FIG. As From this, the algorithm avoids the problem just mentioned. The algorithm decides that the best preference cabin already in Zone Z3 reverses, for this new call assigned to zone Z3 must become. The algorithm must not take the car F because then no cabin left for zone Z4.

2.5.6 Example 4

Zone Z1

Nicht-Vorzugszone

Zone Z2

Vorzugszone für die Kabinen D bis F

Zone Z3

Vorzugszone für die Kabinen D bis F

For Example 4, reference is made to FIG. 17. Here is an elevator layout as assumed in FIG. 16. Accordingly, there are three preference cabins in an elevator group, denoted D, E and F. Two of them are assigned to zone Z2. Overall, the following zones are defined here:

Zone Z1

Non-preferential zone

Zone Z2

Preferred zone for the cabins D to F

Zone Z3

Preferred zone for the cabins D to F

The elevator cars C and F are free. For a new, assigned to zone Z2 Call would be a cost calculation algorithm, for example, cabin Select F for this call.

But if the car F was assigned to zone 2, none would remain Preferred cabin left for zone Z3.

From the flow chart of Fig. 9 it can easily be seen what the algorithm presented here does in this case. He tries to put that call on Cabin C, if possible, to clear a Zone Z3 Preferred Cabin. If this is not possible, the second best cabin, which operates already in the zone Z2, take the call.

2.6 The "Missing Cabin by Zone" Algorithm

Let us now consider a situation as illustrated in FIG. 18. Here is again an exemplary elevator structure as shown in FIG. 2 can be seen. The subdivision of the individual floors of the provided Building is as described above to Figs. 3 to 5 explained. In the illustrated Situation cabins A, B, D, F serve the zone Z3. The cabin C is the Zone Z1 is assigned, and the car E is assigned to the zone Z2. Just one single cabin operates in zone Z1. All other cabins run in other zones. No cabin is free.

It is further assumed that, as shown in FIG Z1 running elevator car becomes unavailable. This is indicated by the reference numeral oos for "out of order" indicated. In other words, that goes Zone Z1 "lost". From now on, all persons who are in zone Z1 assigned call, no longer be operated.

At this moment an algorithm begins to work that is called "Missing Cabin by zone "is called:

The operation is shown in FIGS. 20 and 21. As shown in Fig. 20 can be seen is, this algorithm determines among all running (that is not free) Cabins a specific cabin, which receive no more calls becomes. This car - in the example car D - is locked against new calls. A cabin in such a condition is referred to here as a "jumper cabin" SK.

As shown in Fig. 21, a jumper cabin will be installed as soon as it is completed Has processed calls, free and can then calls for the zone that has been lost is, edit. In the end situation shown on the right in FIG. 21 Cab D can now be used for zone Z1. The "missing one Cabin for zone "algorithm stops working again in this situation.

If more than one zone is "lost" in the manner described above, this algorithm selects a jumper cabin for each lost zone, then after processing their orders from the assigned zone in the free State jumps.

The Missing Cabin by Zone algorithm maintains two lists: On the one hand, this is a list for all new orders Preferred cabins (preferred showers) and a list for all non-preferential cabins (non-preferential) for new orders.

An example of a "missing cabin by zone" algorithm is shown in FIGS. 23 and 24, wherein FIG. 22 shows the main part of the algorithm, FIG. Fig. 23 shows the process of waiting for the list of non-preferred showers and Fig. 24 shows the process of waiting for the list of preferred showers represents.

The flowcharts shown in Figs. 22 to 24 are taken into consideration the legend below, of course.

The "Missing Cabin by Zone" algorithm shown therein becomes each Times before a call is finally assigned to a car.

LSnfK

Warten der Liste von Nicht-Vorzugsspringerkabinen;

LSfK

Warten der Liste von Vorzugsspringerkabinen;

K e LSnfK

Kabine ist in der Liste der Nicht-Vorzugsspringerkabinen;

K e LSfK

Kabine ist in der Liste von Vorzugsspringerkabinen;

nc

keine Veränderung;

tbuKsZ

nimm die beste Nicht-Springerkabine, die in dieser Zone verkehrt (mit anderen Worten sperrt der Algorithmus die Springerkabinen gegen eine neue Rufzuteilung);

mnfZ

fehlende Nicht-Vorzugszonen;

rLSnfK

Reset der Liste von Nicht-Vorzugssprungkabinen (die Liste derjenigen Nicht-Vorzugskabinen, die für neue Rufzuteilungen gesperrt ist, wird auf Null gesetzt);

K = fr

Kabine ist frei;

K = nf

Kabine ist Nicht-Vorzugskabine;

#mnfz > #SnfK

die Anzahl fehlender Nicht-Vorzugszonen ist größer als die Anzahl von Nicht-Vorzugsspringerkabinen;

KsZ > 1

mehr als eine Kabine verkehrt in dieser Zone;

K → LSnfK

füge Kabine zu der Liste von Nicht-Vorzugsspringerkabinen hinzu;

na

keine Aktion;

mfZ

fehlende Vorzugszonen;

rLSfK

Reset der Liste von Vorzugsspringerkabinen (die Liste derjenigen Vorzugskabinen, die für eine neue Rufzuteilung gesperrt sind, wird auf Null gesetzt);

K = f

Kabine ist Vorzugskabine;

#mfZ > #SfK

die Anzahl der fehlenden Vorzugszonen ist größer als die Anzahl von Vorzugsspringerkabinen; und

K → LSfK

füge Kabine zu der Liste von Vorzugsspringerkabinen hinzu;

Legend for the flow charts of Figs. 22 to 23:

LSnfK

Waiting for the list of non-preferred jumping-booths;

LSfK

Waiting for the list of preferred jumping-cabins;

K e LSnfK

Cabin is in the list of non-preferential jumpers;

K e LSfK

Cabin is in the list of Preferred Springer cabins;

nc

no change;

tbuKsZ

take the best non-jumpers cabin that operates in this zone (in other words, the algorithm locks the jumpers against a new call allocation);

mnfZ

missing non-preferential zones;

rLSnfK

Reset the list of non-preferential jump cabins (the list of those non-preferred cabs that is locked for new call allocations is set to zero);

K = fr

Cabin is free;

K = nf

Cabin is non-preferred cabin;

#mnfz>#SnfK

the number of missing non-preferential zones is greater than the number of non-preferential priced cabins;

KsZ> 1

more than one cabin operates in this zone;

K → LSnfK

add cabin to the list of non-preferred jumpers;

n / A

no action;

Mfz

missing preferential zones;

rLSfK

Reset the list of preferred show booths (the list of preferred booths that are locked for a new call assignment is set to zero);

K = f

Cabin is preferred cabin;

#mfZ>#sfk

the number of missing preference zones is greater than the number of preferred boarding booths; and

K → SPFK

add cabin to the list of preferred showers;

2.6.1 example

Zone Z1

Nichtvorzugszone

Zone Z2

Vorzugszone für die Kabinen E, F

Zone Z3

Vorzugszone für die Kabinen E, F.

Referring to Fig. 25, an exemplary initial situation is shown. Again, the elevator structure and the zoning are assumed as explained in FIGS. 2 to 5. There are accordingly the following defined zones:

Zone Z1

Non preferential zone

Zone Z2

Preferential zone for the cabins E, F

Zone Z3

Preferred zone for the cabins E, F.

The allocation of the individual elevator cars A to F to these zones is off Fig. 25 can be seen.

Now, the car C is suddenly unavailable, which in Fig. 26 and 27 by "UA" (unavailable) is indicated. In the resulting in Fig. 26 thereof Situation can be assigned to future and waiting passengers, the zone Z1 are no longer promoted.

Now a new call is entered. The call is assigned to zone Z3. For example, a costing algorithm would decide that the elevator car D is the best for this reputation.

From the flow charts 22 to 24 it is easy to see what the "Missing Cabin for zone "algorithm in this case does.This algorithm ranks not the call to the car D, but chooses the cabin D as a jumping cabin out. The call is now assigned to the best of those other cabins, which already operate in Zone Z3.

Later, as shown in FIG. 27, the car D becomes free. The cabin D is now free for assignment to zone 1.

It should be noted that the car D is now by the previously explained "assignment to free cabin "algorithm is actually kept free.

Claims (10)

Method for controlling an elevator installation with several elevator cars (AF) in a building whose floors are subdivided into several zones (Z1, Z2, Z3), wherein the elevator cars are assigned driving jobs of a zone,
characterized in that as long as an elevator car executes a travel order for a zone, this elevator car is not assigned a travel order for another zone,
that as a result of a call (nRZ2, NRZ2) for a travel order, the number of free elevator cars (fr) is compared with the number of unallocated or not yet served zones, and
that the driving order executing the call is assigned to an elevator car depending on the result of the comparison. A method according to claim 1, characterized in that a new call (nRZ2, NRZ2) associated with a zone (Z2) already served by at least one of the elevator cars (AF) is only allocated to a free elevator car (fr) if the number of free elevator cars (fr) is greater than or equal to the number of zones (Z3) not served by the elevator system. A method according to claim 2, characterized in that in the event that the number of free elevator cars (fr) is less than the number of zones not served by the elevator system (Z3), the new call is assigned to an elevator car which is already in the same zone , Method according to one of the preceding claims, characterized in that in the case that a) at least one of the floors is not operable by all elevator cars of the elevator installation, and b) the zones comprise at least one preferential zone (Z1, Z2) which is defined by the fact that at least one floor not operable by all lift cars (AF) belongs to it; the allocation of a new call depends on whether it is assigned to a preferred zone or not. A method according to claim 4, characterized in that in the case that the conditions a) and b) and additionally c) the elevator installation has at least one preferred cabin (E, F), which is defined as being able to serve all floors of at least one preferred zone (Z2, Z3), in the case of a call assigned to a preferential zone, the number of free preferential cabins (E, F) is compared with the number of preferential zones not yet allocated or not yet served by the elevator installation, and the call is allocated as a function of the comparison result and / or
that in the case of a call which is not assigned to a preferred zone, the number of free non-preferred cabins (AD) is compared with the number of non-allocated zones (Z1) not yet allocated or not yet serviced by the elevator installation and the allocation of the call depends on the comparison result takes place. Method according to claim 5, characterized in that a new call assigned to a preferential zone (nRZ2, NRZ2) is allocated to a free preferential cabin (E, F) only if the number of free preferential cabins is greater than or equal to the number of then not by the elevator installation operated preferred zones (Z2, Z3) is and / or
a new call not assigned to a preferred zone is only allocated to a free non-preferred cabin (AD) if the number of free non-preferred cabins is greater than or equal to the number of non-preferred zones (Z1) not currently serviced by the elevator installation. Method according to one of the preceding claims, characterized in that in the event that the number of free elevator cars (fr) is less than the zones currently not served by the elevator system and one zone (Z3) is served by two or more elevator cars, one (D) of these same zone (Z3) serving elevator cars is locked against further allocations until it is free and thus an allocation to one of the unused zones is accessible. A method according to claim 7, characterized in that in an elevator installation in which the total number of zones (Z1, Z2, Z3) is less than or equal to the number of elevator cars (AF), one of the elevator cars, each one the same zone, per unused zone operate like another elevator car, locked against rescheduling. Method according to one of the preceding claims, characterized in that the subdivision of the floors into a plurality of zones (Z1, Z2, Z3) depends on the access authorization of passengers to the floors or is carried out. Control device for an elevator installation with a control method according to one of claims 1 to 9.

Images