JPS5848462B2 - elevator - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates generally to a power method for controlling an elevator system, and more particularly, the present invention relates generally to a power method for controlling an elevator system, and more specifically, the present invention relates to a power method for controlling an elevator system, and more specifically, a plurality of L/Beta elevator cars are connected to a centrally controlled ML1 system. 3, a plurality of elevator boxes serving each floor of a building are installed at b.
In an average multi-tenant building with an elevator system, floor 1, registered with -L of the main floor
Approximately 80% of 1F leases are down calls, and even in the case of middle-class rental buildings, there are more down calls.

, Therefore, an elevator installation with a central processing unit or system setter for controlling the processing of a plurality of elevator cars in response to floor calls may have a special strategy for down calls. ing.

For example, in some prior art systems, a floor (4) is divided into zones containing one or more single floors, and a certain descending floor call is made by all Assigned to the elevator lift box.

- The number of zones registering a ten-down call is counted by 61, and the number of elevator cars set to move downwards that are in the process of answering a down-floor call is also counted.

The number of zones that had a down call in response to those zones (
, ), a request is made such that an available or unoccupied cabin is allocated.

When there are more cabs moving in the direction than zones with down calls, the call is removed from the lowest of those cabs and that cab is available for use. It will be done like this.

All floor calls in that cabin's assignment register are given to other cabins.

The present invention is a method and apparatus for allocating floor calls from a plurality of floors of a structure to a plurality of elevator cars attached to the structure to answer the floors, the method and apparatus comprising: providing means for registering floor calls from a plurality of outlets; providing means for assigning to each of said elevator cars; and adding calls to at least one assigning means of the elevator cars; processing a new floor call by generating a request signal; reprocessing each floor call to locate the closest elevator cab to answer the call; an allocation comprising removing a floor call applied to the cab assignment means during said processing step when the cab is found; and adding the floor call to said closer cab assignment means; In the method and apparatus.

The invention further includes dividing the structure into different zones for up calls and different zones for down calls, and determining the zone of each elevator car according to its location and service direction; In such an allocation method and apparatus, the step of sequentially reviewing the suitability of each car to answer each call includes the step of comparing the zone of the floor call with the zone of each car.

Briefly, the present invention provides a novel strategy for allocating floor calls and assigning a cab to a floor call for a new and improved elevator system that includes an improved arrangement and method for handling downcalls. A new and improved way to handle answering calls.

A new floor call is assigned to the assignment register of at least one suitably-stated elevator cab that is already in the process of answering the call.

A suitably conditioned elevator cab is one that has a travel and service orientation such that it would be able to answer the call in question if it were located with respect to the call and moved through the building in its current direction. .

When no such cabin is found, a request signal is generated for the call and an unoccupied cabin, ie, a cabin that is in service but not in the process of answering calls for elevator use, is assigned to the request call. .

If there are no lifts available, the requirement is
It is held until a cab becomes available or a moving cab is finally in position to answer the call.

The processed floor call is one of those floor calls.
When something occurs that indicates that more than one floor call may need to be reallocated, it is reprocessed.

When a floor call is processed, it is determined whether there is a suitable cab closer to the call floor than the cab that currently has the call in its associated allocation register.

The cabs are successively compared for a particular call, and each time a suitable cab is found that is closer than a previous suitable cab, that call is removed from the less suitable cab's allocation register. Ru.

When all the cabs have been compared, the call is added to the assignment registry of the closest suitable cab found.

Thus, after reprocessing, only one elevator car has one floor call in its allocation register.

When a downcall floor call is assigned to a downwardly moving car, that car is not considered for further downcalls.

Therefore, by placing each call in the allocation register of only one car and allowing it to be allocated to a downward moving car with one down call, each call that exceeds the number of downward moving cars A request signal for cars available for use is automatically generated when there are more calls than there are down-travel cars.

To implement this descending utilization strategy, it is not necessary to count calls or count elevators.

Furthermore, according to the invention, the elevator cab call register accurately indicates the current elevator usage status.

Cab assignment registers are not confused by calls they do not have to answer.

This is because another closer cab with the same call will reach that call floor first.

Thus, according to the invention, an elevator car is returned to its usable condition much more quickly and a car that does not answer its call is prevented from being moved unnecessarily through the building.

The waiting time required to allocate a request call/available elevator cab is reduced because it is returned to the available state more quickly.

In accordance with the present invention, the conventional problem of determining which cabs to take out of transit and make available when the number of cabs moving downward exceeds the number of down calls is eliminated. Ru.

Conventionally, the practice has been to arbitrarily remove calls from the lowest lying cab's allocation register and reallocate them to the remaining moving cabs (1, which may not necessarily be the best strategy). .

In the present invention, the car closest to a given call always has its share, so that the best strategy is always implemented. The removal of that 7-lower call from the assignment register of the less suitable cab is subject to the condition that the less suitable cab has no registered cab calls.

If the less suitable cab has more than 1 L cab call, removing that flow call from its assigned register will not hasten its return to serviceable status. Will.

This is because the cabin is an occupied cabin until it answers the cabin call.

Thus, floor calls are not removed from the assignment register of a car that already has a car call.

This is because the cab is the one in the proper condition for the doorway, and the closer cab is delayed for some reason in its more suitable condition.
This is because there is a possibility that the elevator car that was called will be made to answer the call.

Thus, the less suitable cab will remain in its assigned registration desk until the closer cab answers the call, or the cab call is answered, or the less suitable cab answers its floor call. That f[Noah]
}! withholding.

Reference is made to the accompanying drawings m1, in particular to FIG. 1, which shows an elevator installation 10 in which the concept of the invention may be incorporated.

Engineering I/Beta equipment 10 includes a plurality of elevator cars, such as elevator car 12.

Kone^ Elevating box movement 1-J, system child process-1)
1 makes whitening 1 and I1.

, each of the elevator cars in the bank of elevator cars and the controls for them are similar in construction and operation, so that elevator car 1
Only the control for 2 will be explained below.

More specifically, the lift box 12 is mounted on a lift passageway 13 for movement relative to a structure 14 having a plurality of lift locations, such as 30.

To simplify the drawing, only the first, second and 30th lifting locations are shown.

The lifting box 12 has a rope 16 which is attached to the shaft of a drive moke 20, such as a DC moke used in the Ward Leonard drive system or the solid day drive system, and which is attached to a drawstring shear 18. Supported by A counterweight 22 is connected to the other end of the rope 16.

A regulating rope 24 connected to the top and bottom of the elevator car is connected to a regulating rope 26 disposed above the highest point of movement of the elevator car in the passage 13 and to the bottom of the elevator passage. It is hung on an arranged pulley 28.

The kick-up 30 is provided 1 to detect movement of the elevator car 12 through the action of openings 26A provided at intervals around the speed regulating net 26.

The apertures in the speed control sheave are spaced to provide one pulse for every nominal amount of movement of the car, e.g., one pulse for every 0.5 inches the car moves. .

Pick-up 30 may be of any suitable type, either pneumatic or magnetic, and is capable of capturing pulses in response to movement of aperture 26A in the regulating sheave.

The heater amplifier 30 is connected to a floor selector 34 (a pulse detector 32 which provides distance pulses).

The distance pulses may be emitted in any other convenient manner, for example by a kick-up arranged in the lift cooperating with regularly spaced markings in the lift aisle. sell.

Attached to the lift box 12, the t1 push button array 36
The status of the elevator car, as registered by sent to.

, an up push button 40 disposed at the first up/down location, and a -tri push button 42 disposed at the 30th up/down location.
A floor call controller 46 registers floor calls by push buttons attached to each floor, such as push buttons 44 located at the second and other intermediate lifting locations. are recorded and serially processed.

The resulting serially processed floor call information is sent to system processor 11.

The system processor 11 is generally designated by reference numeral 1
These floor calls are sent to each elevator cab via an interface circuit indicated at 5 to ensure efficient service to each floor of the building and effective use of the elevator cabs.

The floor selector 34 processes the distance pulses from the pulse detector 32 to generate information regarding the position of the elevator car 12 in the elevator path 13, and also sends these processed distance pulses to a velocity pattern generator. Send to 48.

The speed pattern generator generates a speed reference signal for a mork controller 50, and the mork controller 50 provides a drive voltage for the motor 20.

The floor selector 34 maintains the trajectory of the elevator car 12 and service calls for the elevator car, provides an acceleration request signal to the speed pattern generator 48, and registers the service call as the elevator car is decelerated according to a predetermined deceleration pattern. A deceleration signal is provided to the speed pattern generator 48 at the precise time needed to stop at a predetermined floor.

Floor selector 34 also provides signals for controlling auxiliary devices such as door operator 52 and hall lights 54.

The floor selector 34 controls the reset of the elevator car call and floor call control device when a certain elevator car call or floor call has been completed.

Stopping and height alignment of the car at the lift locations is accomplished by a lift transducer system utilizing an inductor plate 56 located at each lift location and a transformer 58 located at the car 12.

Mork controller 50 includes a speed regulator responsive to a reference pattern provided by speed pattern generator 4B.

The speed control may be accomplished by comparing the motor speed required by the reference pattern to the actual motor speed using a pull magnet regulator, as is well known to those skilled in the art of operating elevator systems.

Precision elevator systems using inductor plates and transformers 58 are also well known in the operation of elevator systems.

An overspeed condition near the upper or lower stop position is detected by a combination of deceleration blades, such as pickup 60 and deceleration blade 62.

The pickup 60 is preferably attached to the lift box 12, and a deceleration blade is attached near each stop position.

The speed reduction blade has spaced apart apertures such as toothed edges.

The toothed apertures are spaced apart to cause the pickup 60 to generate a pulse when there is relative movement therebetween.

These pulses are processed in pulse detector 64 and sent to speed pattern generator 48 where they are used to detect overspeed.

A new and improved floor selector 32 for operating an elevator car without involving the operation of a car in a bank with a car was introduced in May 1973.
British patent application 2 filed in April and assigned to the applicant
0 9 1 077 3 specification.

In order to avoid duplication and limit the complexity of this application, more details have been omitted here.

The programmable system processor 11 is adapted to control an elevator car controller (
an interface function 70 for receiving signals from and transmitting signals to the interface 15), a core memory 72 in which software packages are stored, and instructions stored in the memory 72 regarding dispatching of the elevator car. a processor 14 for executing or controlling a group of elevator cars according to a software strategy stored in core memory; a tape reader 76; and an input interface for transferring software data from paper tape or the like to core memory 72. interface 78 , an interrupt function 80 also connected to processor 74 via input interface 78 , and system processor 1 .
1 and a timing function 82 for controlling the transmission of data between the elevator car and the car controller of the elevator car.

U.S. patent application Ser. IJj″I′1
A new and improved system for operating the LI\; collar 5 and the number θ) ESI Beta device 1 is opened and reduced.

This US Yen Special Application No. 340.61.8 describes the software No. 13'. stored in the second memory 72. 7
In order to operate multiple electronics 1, 1, 1, and 1, at the same time as the ``La J, 1, 1'', Inter-7 Ace functions 15 and 17 shown as briZI in FIG. 1 are used. With details of main timing 82, country special Ii/F application 20910/7
3-C); Required for each elevator car control described in 8'
The history is clear 3, the book 1 review is the most 1y. ), here we drew 11J "I11 o'clock A! If-I". o)-'
r country m'f application, JZ -): d, entry law shi, ta structure'3N thing θ) {Φ/, = f,: ¥1 drop-off place Z (1f [
] Eshi Beta Tsuzuki Jc registered from Ryo: J. ) Therefore, σ) 1 call (This, it responds well to the up-lever rate.) In order to perform several upper elevator lifts, θ gives up.
We will also provide a comprehensive explanation of the improved strategies and cores, and the improved processes for implementing the inputs stored in the memory 72 → l-74. 0), 1o, and its new and improved method is
-71-1 Recall HiL, Distance and ++ Various elevator itching descends from the elevator controller and created 6 data.
+ conversion, 511 memorized bu [1 gram of -? J1 top. Is the strategy improved? J first fall:? i
I'll give you a bow for the wholesale domain.') Na Thor 7
1 Implemented by Ikpaku Senryo.

2nd ``Z j is d1 az-b+,172, input inter 7 ace 70, -r---j'``1,''L defeat 0 iso 76
g! ．． Biwari j, hemi function 80 and the first [j nu 1 to 7.
Detailed eight-noro 717 line diagram of 1 woman and 2 women → }-74 6,-, 6,-
Demp [1 seturi] 1 (1, broadly speaking, ``opportunity'') j・5
It is almost the same as the digital iH calculator.゛1
4-j, Tachinona U), f'%.
6 functions θ) 1゛ [1 line [) 21 ・IX. Just by reading the digital computer Nobino's >K, -k person (4 minutes)'), -, . ．． ．． )” tJ7゛/tithe 74 is -7' [1 galley b
In order to perform an overnight continuous YC gaming of 1511 cans 11 of the system dem suspension system 11, →
um, fixed ince 1 ratation and (f.'+-1 constant →
'r7 Ikuno 1・? Wl cup stamp sea ``7・゛7en\, t1 [to1'-1'!J4 Song 111 city I1 釧1word｝冫]This is it.

, fQjlE11', SoCノ) Hans 1 → ction miss Te/'irl'i length is memory I:/) 4
0 9 6 Crystal no J' I-1y Tsushi 7 i' (l
j'f is:) 812 Hi゛-'l-+ij, but there is a special iso) Ll-like j. = needed :), 8
K ZJ A or a round potato I)) may be made 1 saku 1].

1 / 1 register 74 (1, 5 registers 0 register 2 [1, 1 block 1] register 84, 1 memo 1j address 1, register 86, 1 note 11 x 7 allegisc 88, 1 ins 1 ration and register 90, 1 accumule/7l7
・The program ``Nonta 84'', which is equipped with a register 92, resets a pointer to the memory 72 for execution of the Inst1~→ function. Contents (1, Execute 1
Should ince 1~→kusho〉'A I' L. -I
) get, -, memory gamma card 1, 7 thresholder 86 (1,
In order to read the memo 11 and form the address for the 2 and 10 functions, there is a temporary edict [,・registration].

Memory battu. /． 1'l, the register 88 is transferred to the memory 72 and the data Q) is transferred to the memory 72.

)'s I/'kufaisu.

, the first action is 90, and the moment t=
．． It is 4F%.

Arya 7 umulator L register 90 is a temporary storage location for arithmetic and logical operations.

, Brosseso+}74 is also 'hus'l'1'-]
Now go to Ins 1 where you should start: ``1'' and its Broset - {p's 'Rf Sadada - Direct the human power data to the appropriate register according to the cycle status. 3.

Insu]・Rakushon Deco・−゛96u hi→｝cycle state day」Ichichi」and {h1] Omushi 98 (4,'I゛゛-i-ink゛manbisu→2) Aling function 1 0 0 i
c69-f to control the 'r'--r-inge path, its L7τ, its tr'-guiing and sguiarin'/'+geometry 100 are the data-liring no f 1, Data 08l1 o'clock (1, I>・Sl-f
Ukujeong L, Jista 90 and 廿Iku 1re state Te Ding)
(In response to J' and NIM unit 98, the main oscillator or
Pulse 'j that raises enable signal tj for one clock 104
Controlled by h II 90 function 102'! 1 Ru...
θ) The main oscillator 104 (4, the specific
3-, pulse illgll to increase P by L-1
-X:y 1 0 2 . '&Bit}-I'm currently in current condition.
6, and 5, the memory 1-1) function 106 is commanded by the 1) "Noyo"/A1 specific-{}Iro' Depending on the state of the memory, the correct value is set for adjustment, output or write function (0).

Ryo Kyum 1, Ichitaregi Star 92 and Hanima 1! The various arithmetic and logical operations functions generally designated by reference numeral 1
08 and the increment function of the program count register is designated by reference numeral 110.

The skip test circuit 111 has a program count 84.
A signal SKIP is provided to a circuit 110 that increments program counter 84 when is to be incremented by two instead of one.

The instruction set for the system processor 11 includes eight memory-based instructions, Uchi,
Instructions that require a memory operation in the execution of an instruction other than the initial memory operation required to invoke that memory operation, and 16 accumulation reference instructions, i.e., at the beginning of execution of that instruction. and instructions that cause operations on the current contents of the accumulation rake.

Its instruction set is as follows.

Addressing of memory-based instructions may be direct.

In this case, the instruction is stored in the same page of core memory 72 as the address of the instruction copied by program counter 84.

Add L/Tshing of memory-based instructions is as follows:
It may be indirect.

In this case, the instruction is stored in a different page of memory than the page in which the address of the instruction provided by program counter 84 is stored.

The fourth MSB of the instruction code determines whether the addressing is direct or indirect, with a logic one indicating a direct instruction and a logic O indicating an indirect instruction.

In the case of a direct instruction, the address of memory to be operated on is determined by the fourth MSB of the program counter and the eighth LSH of the instruction.

The 4th MSB of the program count qualifies one of l6 possible 256-word pages within a 4096-word block of core memory, and the 8th LSB of the instruction qualifies the words within that page. are doing.

In the case of indirect addressing, program count 8
The 4th MSB of 4 and the 8th LSB of that instruction are used to determine an address in the same page as the program counter pointer, and the contents of this address are op1/1 is the address of the desired memory.

Since this address is a full 12 bit word, this address can be anywhere within the 4096 word block of memory 72.

A fixed cycle control sequence is utilized to perform instruction execution.

This control sequence includes six possible cycle states.

However, not all cycle states are used for all instructions.

FIG. 3 illustrates five different cycle state sequences that may be used.

Roman numerals indicate each cycle state as follows:

■・Instruction fetch■・・Indirect addressing■・・Memory read ■・・Memory write■・・Accumulator reference■・・Incremental program count cycle states ■ and ■ are used for all instructions, but Other cycle states may or may not be used depending on the particular instruction to be executed.

For example, a memory reference instruction involving a memory read operation uses cycle states I, ■, and ■ for direct addressing, and cycle states 1, II, ■, and ■ for indirect addressing.

Memory reference instructions involving memory write operations use cycle states 1, IV, and ■ for direct addressing, and cycle states I, II, III, and ■ for indirect addressing.

The Accumulate Reference Instruction uses cycle states I, ■, and ■.

Cycle state I calls an instruction to be executed from memory.

At the beginning of cycle state I, the address of the instruction is at program counter 84t.

The contents of the program count 84 indicated by the serial output signal pco+ are transferred to the serial input ADIN of the memory address register 86 via the data steering gating circuit 94.

The cycle state decoder and controller 98 includes a gating and steering decoder 100 that sets the gating path for the data steering gating circuit 94F.
and the memory read/write controller 106 which configures the memory 72 for the memory read operation required to call the address of the instruction placed in the memory address register 86.
Outputs cycle status signals for

The memory address from the memory address register 86 is
The contents of this address are transferred in parallel to core memory 112 via gate 114 and the contents of this address are transferred in parallel to memory buffer register 88 via gate 116.

The contents of memory buffer register 88 are then dictated by output signal MBO and gating pulse GC
Pt is serially transferred to input IRIN of instruction register 90 via data steering gating circuit 94.

Instruction register 90 (in which various parts of the instruction
- Transferred in parallel to circuit 108.

The instruction decoder 96 sets the gating and steering decoder 100 (in this case to game 1) and the cycle state decoder and controller 98.
can provide a cycle status output signal associated with that particular instruction.

If the instruction placed in the instruction register 90 is an indirect memory reference instruction, the sequence is automatically advanced to cycle state 3.

Cycle state (2) obtains the address of the memory from which data is to be read during cycle state (2) or to which data is to be written during cycle state (2) according to its specific instructions.

In cycle state (3), the fourth MSB of the program count 84 included in the serial output signal pco+ and the eighth LSB of the instruction register included in the serial output signal IRQ are used for the task steering gating. It is transferred via circuit 94 to memory address register 86 .

These disk steering gating circuits 94 were preset to perform this function.

If the instruction to be executed is a direct memory reference instruction (instructions LDA, ADD) that requires a memory read operation,
, AND , XOFt, BRA and OPR Direct)
If the instruction to be executed is an indirect memory-based instruction of this kind, then it is advanced directly from cycle state I to cycle state ■. .

Cycle state ■ obtains data from memory 112 to be operated on by executing its instructions.

The memory address for this data is contained in the memory buffer register 88 as a result of the memory read operation in cycle state H for indirect instructions, and the fourth address of program count 84 for direct instructions. and the 8th LSB of instruction register 90.

During cycle state 1, this mark is transferred from that location to address register 86 via data steering gate circuit 94 and from cycle state decoder and controller 98 to memory read/write controller. In response to signal ■ applied to 106, a memory read operation is initiated.

Data read from memory 112 is transferred in parallel to memory bus resistor 88 and then to accumulator resistor 9 via data steering gating circuit 94 according to its specific instructions.
2 or operated by the contents of accumulator 92 and the results stored in accumulator 92 or to program count 84 .

If the instruction to be executed is a direct memory reference instruction (instructions STP and ST
If A), cycle state ■ changes from cycle state ■
You can proceed directly to

If the instruction to be executed is an indirect memory-based instruction of this type, it is advanced from cycle state ■ to cycle state ■.

In the cycle state ■, data is written to the memory 112.

The memory address for that write operation is
For indirect instructions, it is contained in the memory buffer register 88; for direct instructions, it is contained in the fourth MSB of the program counter 84.
and the 8th LSB of instruction register 90
included in.

During cycle state 1, this data is transferred from that location to memory address register 86 via disk steering gating circuit 94.

The data written to memory 112 is contained in either an accumulator 92 or a program count 84, and during cycle state 1, this data is passed through a data steering gating circuit 94 to a memory buffer resistor 88. It is transferred serially from that location.

The signal ■ from the cycle state decoder and controller 98 is
Enables memory read/write control 106 to prepare its memory 112 for a write operation, and data transferred to memory buffer register 88 according to memory addresses contained in memory address register 86. It is transferred in parallel to memory 112 via gate 118.

If the instruction read during cycle state I was an accumulative reference instruction 1 instruction, it is advanced directly from cycle state ■ to cycle state ■.

Cycle state ■ is used to operate on the contents of the accumulation rake 92.

Upon completion of cycle states II1, IV, and (2), cycle state (2) is advanced to increment the program counter 84.

The cycle state decoder and controller 98 outputs a signal ■ to increment the program count function 110 to determine the next instrument to be executed? Advances the program counter to establish the memory address of the action.

Since memory operations are not required during cycle state 1, control of memory 112 is relinquished to direct memory access (DMA) and data words are transferred to memory 112.
2 and the elevator car controller of the elevator car.

Execution of the LDA instruction results in accumulator 92 being loaded with the contents of a memory location.

In the case of an LDA Direct Instance] action, the contents of the memory location defined by the 8th LSB of the instruction contained in instruction register 90 and the 4th MSH of program counter 84 are loaded into accumulator 92.

For example, if program count 84 includes hex count CO116 and memory address CO16 is FD
716, the address of the data is hexadecimal number CD7,6.

If the data at this address is assumed to be 5136, the result of executing this index 1 action is
The hexadecimal number 5 1 3.6 is in accumulator 92.

If the LDA instruction is indirect rather than direct, the 4th MSB of program count 84 and the 8th LS of that instruction
The contents of the memory location defined by B will be used as an address instead of data.

The contents of this address will then be loaded into accumulator 92.

For example, if the contents of program count 84 are CO1
6, and the contents of memory address CO116 are ET.
) 7.6, then memory location CD 716 is read to obtain address 5 1 316, and memory location 5 1 3.6 is read, e.g. 7 1 . 4
．． , 6 will be obtained.

The result of executing this instruction is 714 hexadecimal numbers.
16 is in the accumulator 92.

As a result of executing an LDA direct instruction or an LDA indirect instruction, the previous contents of the accumulator are erased.

As a result of the execution of the ADD instruction, the contents of the accumulator rake 92 are added to the contents of a memory location, and the sum is stored in the accumulator rake 92.

The previous contents of the accumulator are destroyed.

Execution of the AND instruction results in bitwise ANDing of the contents of the accumulator and the contents of a memory location.

This result is stored in the accumulator, erasing or destroying the previous contents of that accumulator.

Execution of the XOR instruction results in a bitwise exclusive OR of the contents of the accumulator and the contents of a memory location.

The result is stored in the accumulator, destroying its previous contents.

As a result of the execution of the STA instruction, the contents of the accumulation rake are stored in a memory location.

Execution of this instruction does not change the contents of that accumulator.

As a result of the execution of the STP instruction, the current contents of program count 84 are stored in a memory location.

The contents of the program counter are unchanged by execution of the instruction, except that the program counter is incremented by one at the end of execution of the instruction.

Instruction BRA is used to cause branching.

That is, execution of the program is switched to a memory location that is not in the normal sequence of adjacent memory locations.

The BRA instruction is the program counter 84
Load.

Its program counter 84 is incremented by two upon completion of the BRA instruction.

OPR direct instructions are stored in memory 112.
The data stored in the direct memory access (DMA) portion of is indirectly loaded into the accumulation rake 92.

The DMA portion of memory 112 is the portion to which data is written or read by the car controllers of various elevator cars without program intervention.

Accumulate reference instructions are a subset of OPR direct instructions.

The highest number 016 is the OPR of Insu 1 Raction.
Indicates an indirect accumulation reference class.

The hexadecimal digit in the center indicates that particular accumulator reference instruction.

The lowest hexadecimal digit indicates the literal of the instruction.

SKU instructions are used to skip execution of multiple sequential instructions.

The number of skipped instructions is written in the literal.

The contents of the accumulate rake are not changed and the program count is not incremented more than necessary to skip the desired number of instructions.

As a result of execution of the CHS instruction, a two's complement of the data in the accumulator is formed and stored in the accumulator.

As a result of the execution of the L D Z instruction, the contents of its accumulator are replaced by 00016.

Execution of instruction PRI is used for priority interrupts.

As a result of the execution of instruction LSA, the contents of the accumulator are shifted to the right.

The amount of right shift is determined by that literal.

The shift is done by recirculation.

The execution of instruction SSA is similar to the LSA instruction, except that no recirculation occurs.

The accumulator contains, when the shift is made,
0 is filled from the left side.

If execution of instruction SKB results in its tested bit being equal to a logic one, the next instruction is skipped.

In other words, the program counter is incremented by two if the bit tested is a logic one, and incremented by one if the bit tested is a logic O.

The bit to be tested is determined by decoding the literal.

The contents of that accumulation rake are not changed by execution of this instruction.

As a result of execution of the instruction SET, certain selected bits of the accumulator are set for logic I.

The bit to be set is determined by decoding the literal.

Bits other than the specified bits of the accumulation rake are not changed by execution of this instruction.

Execution of instruction INP causes the contents of one input register 126 or 128 shown in FIG. 2 to be transferred to its accumulator.

The second LSB of the literal selects its input register.

01 means the selection of the college registration disk 126, and 1
0 means selection of input register 128.

The contents of the addressed input register remain unchanged by execution of this instruction.

Execution of the instruction OUT causes the contents of the accumulation rake to be transferred to some output register.

Since one output resistor is not currently being used,
This instruction will not be used until such a resist is needed.

As a result of the execution of instruction SKZ, the next instruction in the sequence is skived if the contents of its accumulator rake are O.

In other words, program count 84 is incremented by two if all of the bits in its accumulator are logic O's.

The program counter is incremented by 1 if any bit in the accumulator is a logic one.

As a result of the execution of instruction SKP, the next instruction in the sequence is skipped if the contents of its accumulate rake are positive.

This condition is true if the most significant bit of the accumulator is logic O and the contents of the accumulator are OOO, 6
If not, you will be satisfied.

Execution of this instruction does not change the contents of the accumulate rake.

As a result of the execution of instruction SKN, the next instruction in the sequence is skipped if the contents of the accumulator are negative.

This condition is satisfied if the most significant bit of the accumulation rake is logic I.

The contents of that accumulator are not changed by execution of this instruction.

The result of execution of the instruction NOT is to form the one's complement of the contents of its accumulator.

The result is stored in the accumulator and the previous contents of the accumulator are destroyed.

As a result of the execution of instruction LTA, the literal is arithmetically added to the contents of the accumulator.

The result is stored in the accumulator and the previous contents of the accumulator are destroyed.

As a result of execution of instruction STZ, one bit of the accumulator is set to logic zero.

The bit to be set is determined by decoding the literal.

For example, if the literal is 0000, it indicates the LSB, and if the literal is 101
If it is 1, it points to the MSB of the accumulator.

Only the bits specified by decoding that literal are affected by execution of this instruction.

Master oscillator 104 may include a Crystar/141J controlled oscillator that provides gated clock pulses GCP at a desired rate, such as 6 MHZ, to shift and control data transferred into processor 74.

The gating signal for starting pulse GCP is signal ENABL provided by pulse control circuit 102.
It is E.

Pulse control circuit 102 may include a 4-bit binary synchronous counter that is loaded in parallel to provide a predetermined number of up to and including twelve active clock pulses in response to the fourth LSH of instruction register 90. .

In addition to controlling the number of active clock pulses, the pulse controller 102 controls the count 0 and count 1 of the synchronous counter.
5 to establish the necessary gating path to enable the generation of gated clock pulses.

A set pulse and a reset pulse are applied at count 0 and count 14 of the synchronous counter.

At counts 3-14 of this count, 12 gated clock pulses are generated.

For example, assume the synchronization counter is at count 15 and has stopped counting from the previous cycle state.

When a signal is applied to transfer or shift the data, the count advances to a count of 0, which establishes the gating necessary to enable clock pulses to be generated.

And it also establishes parallel loading of that counter.

A gated clock pulse is generated from the beginning of the next clock pulse.

On the next clock pulse, the counter is loaded in parallel to the initial value required for the correct number of gated clock pulses to be generated.

The gate clock pulse circuit is disabled at count 14 and its cycle state advances.

A count of 15 stops the counting operation and completes the data shift or transfer for a given cycle state, or for a portion of the cycle state if the cycle state requires one or more data shifts.

The cycle state decoder and controller 98 includes a binary number that is loaded in parallel or advanced by one count depending on the particular instruction that causes the parallel load circuit to follow the required instruction cycle state sequence, as shown in FIG. May include a synchronization count.

The output of that count is decoded to provide signals 1--2 corresponding to the particular cycle state of the processor at that time.

Read/write memory controller 106 includes pulse controller 1
02 to 14 and various cycle status signals that require certain memory operations.

When memory 112 is not full, as indicated by the absence of a memory full signal on line 124,
A read or write signal is provided by controller 106 on line 120 or 122.

Instruction decoder 96 is, for example, a 3-8 line decoder responsive to parallel output bits 9-11 of parallel output signal IRP of instruction register 90 to decode eight memory reference instructions and sixteen accumulator reference instructions. may include a 4-16 line decoder responsive to bits 4-7 of the parallel output IRP of instruction register 90.

The cycle state output signals from the instruction decoding circuit 96 and the cycle state decoder provide inputs to gating and steering decoder logic 100.

The output of logic 100 establishes the gating path for gated clock pulse GCP.

Dexteering gating 94 receives inputs from various registers and directs these signals to the inputs of the appropriate registers as established by the particular instruction and cycle state of the instruction execution sequence.

Program counter register 84, memory address register 86, memory buffer register 88, instruction register 90, and accumulation register 92 may each include three 4-bit synchronous shift registers.

The clock pulse input to these registers is a GCP signal that is gated under the control of gating and steering decoder logic 100.

For example, the incremental program count circuit 110 includes a full adder, a first register that holds its carry for each serial arithmetic operation.
a flip-flop, and a second flip-flop used to add an additional one to the contents of the program count.

The program counter 84 is incremented by ■ or 2 during cycle state ■ for all instances except SKU.

The program count is incremented by one during state 2, except when the second flip-flop is set and summed by signal SKIP which causes the program count to be incremented by two.

Signal SKIP is provided by skip test circuit 111.

A 16-1 line multiplexer may be used to test the bits selected by the SKB instruction.

The parallel output ACPA of the accumulation rake 92 is connected to the data input of its multiplexer, and the 4 LSBs of the instruction register 90 are connected to the data select input.

The multiplexer is enabled by the SKB instruction.

Therefore, when the SKB instruction is executed, the accumulator bits, defined by the 4 LSB code of the program counter, determine the state of the SKIP signal.

Addition and bit test circuit 108 includes the full adders and flip-flops required to hold the carry output resulting from bit serial addition.

One adder circuit is used for the execution of the SKU instruction during cycle state 1.

In this case, 4LS of instruction register 90
The contents of B are added to the contents of program count 84.

Another adder circuit operates during cycle state V to add the contents of the four LSBs of instruction register 90 to the contents of accumulator 92 for execution of instruction LTA.

Yet another adder circuit is ADD, AND and XO.
In order to execute R instruction, cycle state■
Works medium.

Addition and bit test circuitry 108 also includes set/clear bit circuitry used in the SET and STZ input functions to force selected bits of accumulation rake 92 to logic 1s and logic 0s, respectively. do it like this.

Bit operations are performed during cycle state V by accumulating rake 92
is done in series when the is shifted.

For example, the output of a 4-16 line coder is
It can be cross-connected to the data input of a 16-1 line multiplexer.

The input of that decoder is instruction register 9
Connected to 4LSH of 0.

The output of the multiplexer provides the signal used to control the setting or clearing of the appropriate bits.

The output of the pulse control counter of pulse controller 102 is connected to the data selection input of the multiplexer.

The output of the multiplexer is a logic 1 during the interval in which the selected bit is being shifted, which causes the serial input to its accumulator rake 92 to be a logic 1 or a logic 0 during this interval in response to a SET or STZ instruction. can be used for

Addition and bit test circuit 108 also includes circuitry that performs this complement function.

Input interface 78 includes two l2-bit registers 126 and 128, referred to as input register 1 and input register A:2.

Input register A1 provides an interrupt input to processor 74, and input register A2 provides data input to processor 74 via an external device such as tape reader 76.

Interrupt circuit 8 that provides an interrupt to input register A1
0 includes a timed interrupt generator 130, an interrupt receiver and storage circuit 132, and an interrupt detection circuit 134.

Interrupt receiver and storage circuit 132 has an input connected to time interrupt generator 130 with additional interrupts, such as an interrupt in response to a low voltage detector.

Pulses are generated by the interrupt in circuit 132 which are sent to interrupt detection circuit 134 and stored in a memory such as a flip-flop.

Those memories are connected to parallel inputs of input register A1.

Input register storm 1 is loaded with stored interrupts from circuit 132 in response to signals from interrupt detection circuit 134 .

That signal causes the input registers At to be loaded in parallel.

This signal remains active until the contents of input register 1 are transferred serially to accumulator 92 via data steering gating 94.

Processor 74 inputs the contents of input register 1 to its accumulator 92 to read the number of active interrupts.

The interrupt storage flip-flop is reset when input register A1 is loaded.

When receiving certain interrupt signals from circuit 132, interrupt detection circuit 134 mirrors certain signals to processor 74 of active interrupts, including signals to program count 84 and memory address register 86.

From the interrupt detection circuit 134 to the memory address register 86
The signal to 0 sets its memory address register to zero and
Instruction STP placed at 00,6 causes the contents of the program count to be stored.

A signal from interrupt detection circuit 134 to program counter 84 causes the contents of that program counter to be zeroed during cycle state 1, forcing instruction STA placed at 00116.

The STA instruction stores the contents of the accumulator.

At that time, a program associated with an interrupt may be started.

FIG. 4 is a block diagram illustrating a new and improved arrangement of subprograms that affect the dispatch and control of multiple elevator cars.

In general, the concept is to divide the program into sections, with a means for indicating which sections of the program need to be executed as determined by the signals and data provided by the elevator force formula; hardware,
Contains software or both.

Additional means then serially execute the sections of the program that need to be executed in that order based on their relative urgency.

The programmable system processor software for directing related hardware to elevator car dispatch tasks includes: (a) reading and storing car status data from the car controllers of the various elevator cars; and (b) (a) and (b) to read and store the call data and determine the service allocation for the car in the favorable pattern;
(d) sends a command to start the elevator car with the determined service assignment; and (e) sends the floor number to be traveled by the car to indicate the appropriate stopping point. and (f) must send output signals indicating the status of the system necessary for the proper functioning of the system components.

The software mechanism used shall allow tactical changes without modifying the overall program concept.

Furthermore, the software performs all functions (a) through (e) above while using the sequential processing mode required for digital computer-based processors. When received by the vehicle controller of the associated vehicle, it shall be accomplished in such a manner that it is almost always valid.

The total number of floors served by the elevator car, the number of flat or elevator cars in the elevator system, the presence or absence of express zones where cars do not stop, and certain physical characteristics of the elevator facility, such as the basement and top extension floors served. Affects software.

Certain tactical concepts that influence the software include the main floor or point where passengers first enter the elevator system, the zoning of the building for service allocation purposes, and the location of vehicles in that zone, regardless of the specific tactics being implemented. If a vehicle is not assigned, the vehicle assignment pattern is modified by the request for service to the zone and traffic conditions initiated by a corridor call from the zone.

The work of a programmable system processor can be divided into two broad categories: (1) entries and (2) operations triggered by significant events in the system.

Entries must be performed on a periodic basis and frequently enough to keep the computer records current.

This includes reading vehicle status data, corridor call registration and updated system signal output.

In any case, when an event occurs in the system, some special action by the computer is required, which temporarily interrupts the cycle entry process.

Such significant events include (a) a computer or system processing unit assigning a suitable running vehicle or indicating that an available non-running vehicle should be assigned to the call; (b) attempts should be made to register a demand signal for the new corridor call in the system; (b) if the car and call service forces are similar and may possibly require the car to make a new stop request; (c) a car becomes available and in any case a demand signal requests that a car be assigned to the call opened; (di leaves the main floor; This may require a replacement car to be sent to the main floor; (e) the car enters the new zone (this may require calls in the new zone to be assigned to that car, perhaps canceling the demand); (b)
Any call, if possible, will be assigned to the vehicle being reassigned or, for those not so assigned, requiring the establishment of a demand signal to remove the vehicle from use; ) the car is bypassing the corridor call (this means that certain calls assigned to the car have to be reassigned or a demand signal is established for that purpose).

For the purposes of this specification, active or running vehicles, i.e. vehicles that are active or on the task of servicing car calls, are added to the assignment register for a corridor call on a zone basis, as opposed to a specific assignment basis. A call is said to be an allocated call, and a corridor call that cannot be allocated in this way and for which a demand signal is established and an available inactive vehicle is allocated is an It's called a summons.

In other words, the car is assigned and the car is assigned.

In some cases, calls are said to be unallocated for convenience in the software language.

The meaning is that the call is considered unallocated.

The occurrence of events within the system that require action by the system processing unit may be detected by hardware.

In this case, the nodeware generates an interrupt pulse that causes an interruption of the computer's normal cyclical operation.

The event may be detected by software.

Detection of events by software is accomplished by comparing consecutive data records.

In this case, the program itself interrupts its cycle entry function by branching itself to the appropriate action on the detected event.

Many events often occur over a very short period of time (on the order of hours).

Since they must be processed sequentially, the software arrangement assigns priority ratings to events according to the urgency of the action, and then the program processes them in order of priority.

In the embodiment of the invention chosen for illustration, two hardware interrupts are provided, one for power failure and one for timing.

A power failure interrupt causes the computer to initiate emergency procedures when the line voltage drops below a predetermined level.

Timing interrupts occur at regular intervals and are used by the computer to maintain a clock so that the timing of operations can be efficiently performed as tactically required.

All other events can be detected by comparison of continuous data records, but some can be devised by hardware if desired.

The software package used includes a set of functional programs, namely an entry and control program that executes at the command of a supervisory program.

The supervisory program includes (a) an inrupt supervisory program, shown generally at 150 in FIG. 4, which handles hardware interrupt processing, such as a power failure, represented by block 152, and (b) its priority order. Contains a priority monitoring program that controls the running of functional programs.

A single priority is assigned to each functional program as a fixed characteristic of the software package.

There are four possible program states: (1) running, (2) suspended by inrupt, (3) command to execute, and (4) inactivity.

The only program that is not subject to inruption is the inrupt monitor program 150.

Therefore, the implant monitoring program is (1)
Can only be in a state of running or (4) inactivity.

It executes as soon as it receives an interrupt pulse, so it does not command execution.

If the inrupt is for timing, the inrupt supervisor program may optionally reduce the clock, place the timer program in the command state, and place some other functional program in the command state before returning control to the suspending program. can.

This optional feature is only required if the elevator system is such that certain entry programs may be prevented from running sufficiently to keep the system up to date in high-density traffic situations. In such an event, the inrupt supervisor will place them into orders when they do not execute for a preselected period of time.

When a functional program is started, it runs until terminated or inrupted.

In the former case, the program is transferred to the priority supervisory program, and in the latter case, control is transferred to the interrupt supervisory program and the functional program goes to interruption.

If the incrupt supervisor program ends, it restarts the aborted program from the point it was incremented.

When a functional program is started, regardless of its preferred rating,
Will not be interrupted while other functional programs are running.

The function of the priority supervisor is to start the highest priority function program that is ordered to run.

It is instructed in the same manner as a functional program.

Functional programs are placed in command by other functional programs and the interrupt supervisor program.

The inrupt monitoring program is activated at predetermined intervals, e.g., 3.
A timer program 154 is placed in the command every 2 seconds.

Timer program 154 has the highest priority to ensure that when the priority program is checking the instruction register to see which program to execute next, it executes before any other functional program. rank,
In other words, O is given.

Before discussing the instruction structure in detail, we will discuss the software,
It is essential to mention how the package is divided into a number of subprograms and the instruction priorities associated with each.

These subprograms are CSU, TNC, ACL,
They are called ACR and CHECK.

Subprogram CSU, indicated by block 158 in FIG. 4, has the second highest ranking, ie, one.

Subprogram CS. The U reads and stores car status data provided by the car controller of the elevator car in the puncture and compares new data with respect to previous data records to detect events requiring action.

Subprogram CSU places subprogram TNC, as shown by dashed line 160, and subprogram ACR, as shown by dashed line 162, into instructions as required by the event by detection, and by the event by detection. In response, it sets a flag for use by function program ACL.

Subprogram TN indicated by block 164
C has the third highest rank, ie 2.

The subprogram TNC reads the state of the corridor call register and performs a comparison with the previous record to detect the arrival of a new call. It is added to the call table CL, which records the elapsed time since the call was made.

Subprogram TNC also detects cancellation of a corridor call and removes the call from the call record.

The subprogram TNC places the subprogram ACL in the instruction, as shown by dashed line 166.

The subprogram ACL indicated by block 168 is the fourth highest ranking.

That is, it has 3.

The subprogram ACL is suitably adjusted, i.e. placed with the service orientation in such a way that the car is able to process the call as it moves forward on its journey through the building. Assign the call to a running or active vehicle.

Subprogram ACL establishes a demand signal meaning that any car that cannot be allocated in this way should be allocated an available car to service the call.

The subprogram ACL registers the demand signals, including the signal identifying the type of demand, while the assignment of available cars to the call is performed in the subprogram ACH.

Subprogram ACL indicates whether other calls in the call table have been processed, i.e. allocated to the active car;
or as flagged as a demand call,
It normally allocates only new calls detected since it last executed.

However, when a flag or indicator is set by subprogram CSU in response to the detection of an event that may require reallocation of one or more calls, subprogram A. CL shall handle all calls within the system.

The subprogram ACL places the subprogram CHECK in command, as indicated by dashed line 170, or this function is automatically performed by the priority supervisor program each time control is returned to the priority supervisor program. Ru.

Subprogram ACR, indicated by block 172 in FIG. 4, has the fifth highest priority, ie, four.

The subprogram ACR is placed on command by the subprogram CSU only when there is a demand in the system and there are available vehicles that can be assigned to the demand, and it assigns the available vehicles to the priority order defined by the tactic. The demand may be a car call or a group of calls from a single zone.

Program ACR assigns a car to each demand and outputs a command to each car it assigns until all demands are met or there are no cars available.

The subprogram ACR places the program CHECK in the instruction, as shown by dashed line 174, or, as described above with respect to the subprogram ACL, the priority program executes the subprogram CHECK each time it obtains control. Place on command.

Subprogram CHEC indicated by block 176
K simply places the subprogram CSU in the instructions, as shown by dashed line 178, which can be used additionally for computer failures and then for certain predetermined actions of the computer. automatically disconnects the computer or system processing unit if the computer or system processing unit does not meet predetermined requirements.

The subprogram TIME, indicated by block 154 in FIG. 4, has the highest priority of O and decrements all of the clock counters by which the computer controls the timing of its certain operations.

For example, it controls the timing of how long cars can stand on the main level and the elapsed time each corridor call is registered.

In some installations where tactical programs ACL and ACR may result in excessive running time, the intrusion monitoring program may require subprograms CSU and T.
NC can be placed on commands in a time-based manner.

For example, if the subprogram CSU does not run for a predetermined period of time, say 0.4 seconds, it is indicated by the dashed line 1
If the subprogram TNC does not run for a predetermined period of time, e.g. 0.7 seconds, which can be placed into the instruction by the inrupt supervisor program as shown at 80, it is indicated by the dashed line 180. can be placed on the instruction by the inrupt supervisor program as shown.

However, in small facilities, the subprograms CSU and TNC' will normally be executed often enough that no time command by the interrupt supervisor is required.

The critical structure between subprograms in FIG. 4 is shown by dashed lines, and the flow or sequence of subprogram running is shown by solid lines connecting blocks.

Note that this functional program executes in two main loops.

The first main loop is the function program CSU-TNC-
ACL contains one CHECK-CSU, and the second main loop contains the function program CSU-TNC-ACL-ACR
-CHECX-CSU included.

In the second main loop, the demand is subprogram ACL.
Occurs only when the call is opened by not assigning it to the appropriate active vehicle, and the subfuge CS
U determines that there are cars available for assignment to the demand and places subprogram ACR in the command.

Subprogram CSU places subprogram ACR in its instructions, but it also places subprogram TNC in its instructions.

When the CSU finishes its run, the priority monitoring program has higher priority than the ACR, so the TN
Run C.

Subprogram TNC then subprogram A.
Place CL as a command.

Therefore, when the TNC returns control to the priority monitoring program, since it has a higher priority than the ACR,
Execute ACL.

When the subprogram ACL ends, the subprogram ACR is then executed because it has a higher priority than CHEOK.

Subprogram ACR executes until all demands are satisfied or there are no cars available to assign to the demand, and then returns control to the priority monitoring program which causes subprogram CHECK to execute.

The subprogram CHECK is the subprogram C S
In the next run of the program, the loop followed depends on whether the CSU commands the ACH.

The block diagram in Figure 4 shows the selected functional subprograms to execute and the instructions for other subprograms, but it is determined whether a particular subprogram has a need to execute. The step is subprogram A. As with CR, it is outside the subprogram.

The needs for subprograms CSU, TNC and ACL can be determined outside of these programs and can then be placed in instructions if they have a need to execute.

For example, instead of inserting a subprogram TNC to discover whether there are any new calls, this step can be performed outside the TNC,
A TNC can only be placed in an instruction when the program is somehow involved.

In a particular embodiment of this invention, subprogram CSU
, TNC and ACL are determined in the program, and when there is a need to execute them, it is actually done by branching to the necessary steps that take the requested action. Put it in a command.

If there is no need to execute, the program receives the last instruction when this is determined.

Before discussing the subprograms of the software package in detail, some tables that are written into a storage device by the software or that are referenced by the software should be mentioned.

FIG. 5 FIG. 5 illustrates the instruction register XBDR addressed by the priority supervisor program at the end of the functional program to determine the highest priority program execution instruction.

When a program is placed into an instruction, its associated bit in the instruction register is set to logic one.

The instruction register is a 12-bit word using only 6 bits starting from 0.

Subprogram TIME has the highest priority and is associated with bit O.

Subprogram CI{ECK has the lowest priority and is assigned to bit 5.

FIG. 6 FIG. 6 illustrates the 12 bits of input register number 1 referred to by reference numeral 126 in FIG.

Input register no. l is set to a logic 1 in response to a signal from time interrupt generator 130, as previously discussed.
It has bit O set to 0 and is used as an inrupt register.

Any additional hardware interrupts are assigned to other bits of input register #1.

Figure 7 Figure 7 shows the call record CLR, call change record CC'L
R and allocation table CFi. A is illustrated.

These records are stored in storage device 112 shown in FIG.
Although different storage locations are used in FIG. 7, they are illustrated in a unified manner in FIG. 7 for convenience.

When the corridor call register is followed, information is stored in a storage location containing six 12-bit words for buildings with up to 36 floors.

This is the call record CLR with records stored therein, one bit per floor on a directional basis.

Words CLR;0, CLFi,1 and CLR,2 give 36 bits, so we have a container for storing descending calls from up to the 36th floor.

The floors are assigned to bits of the same value, number the bits, and the floors start from the right hand side of the descending call record.

Words CIJt3, CLR4 and CLR5 provide 36 bits and thus have the capacity to store ascending calls from up to 36 floors.

The bits of these words are numbered starting from the right side of the call record and the floors are assigned from the highest numbered bit used in the descending call record to the bit that activates floor number one.

The call modification record CCLR follows the same format as the call record CLR and its six words from CCLRO to CCLR5 are in the same core canonical area.

When the most recent call record is compared to the previous one, a bit is set in the call change record for each change.

Therefore, a new up or down corridor call sets bit I of the call change record.

This is because the bit that is set appears on this floor of the most recent succession of the Corridor Call Regisk, and not on the previous succession.

In the same manner, canceled corridor calls, ie, answered calls, set a bit in the call modification record.

This is because the bit that is set will appear for the relevant floor of the previous record and will not appear for the latest succession.

The vehicle allocation table CRA is the same as the one used in the call record CLR for storage of up and down corridors respectively, up service (UPSV) and down service (UPSV).
DNSV) has three words per car for buildings up to 36 floors with the conventions used for cars.

The specific convention used is determined by the vehicle's service direction.

Therefore, when the service direction of the car is down, the number 3 from CRANO to CRAN 2 in the assignment table is
The three words have the conventions in the top table of FIG. 7, and when the service direction is up, the three words from CRANO to CRAN 2 have the conventions in the bottom table of FIG.

When the program assigns a call to a car or assigns a car to a particular floor, it uses an indicator or a car assignment table cR
Set the bit for the floor in question at A.

If the car is a moving car and a call is assigned to it by means of a program ACL, the program, in addition to setting the bit associated with the call floor in the car's assignment table, indicates that this call should be checked to see if it is closer than the previous stop.

If so, it must replace the next stop address with the address of this call.

If the car is an available car that is assigned to a command call by the program ACR, in addition to placing the call in the car allocation table for the car, it also assigns a service direction to the car and gives it a departure signal. and floor address must be sent to the car.

If a demand has several calls associated with it, such as many high zone up calls, all calls related to the demand are placed in the car allocation table CRA of the car concerned and the floor address of the first stop. is sent to the vehicle.

FIG. 8 FIG. 8 illustrates a call table CL in which two 12-bit words are filled in for each corridor call.

The first word PCL O maintains a 3-bit binary word (bits O-2) corresponding to the calling zone and bits 4 of this word.
establishes the service direction of the call, with a logic 1 indicating rising and a logic 0 indicating falling;
This is the floor address in decimal numbers.

The second word associated with each call is called PCLOA and uses bit 1 to flag whether the call is a demand call and to indicate whether a car was assigned to the floor of the call. Use bit 0.

Bits 5 to 11 are used by the call timer;
This is set to the timeout value when the call is first stored in the call record.

This time is decremented with each running of subprogram TIME and goes negative when the call times out.

Figure 9 Figure 9 illustrates the timeout call record TCA, which consists of three 12-bit words, TCA(1-TCA2) for up to 36 floors.

The same conventions mentioned for the call record CLR apply.

FIG. 10 FIG. 10 shows data words DEMIND . TODEM and DEMA. S is illustrated.

The word DEMIND is a demand indicator word with bits of the word assigned to different types of service demands.

For example, the main floor demand (■'E) that serves the top extension floor is assigned to bit 9, and the top extension floor demand (■'E) is assigned to bit 9.
TE) is assigned to bit 7 and the main zone descent demand (M
ZD) is assigned to bit 6, high zone rising demand (clothes) is assigned to bit 5, low zone rising demand (LZ)
is assigned to bit 4, and the main floor demand (MF) is assigned to bit 1.
2 and the basement demand Q3) is assigned to bit 1.

Therefore, the command sets a bit in DEMIND that corresponds to the type of demand registered.

The word TODEM is used for demands and uses the same conventions as DEMIND.

A demand recorded for a predetermined period sets a bit in TODEM corresponding to the type of demand.

When a car is assigned to a demand, the corresponding bit in DEMIND is reset to 0, but the corresponding bit in TODBM is not reset to 0 until the call is actually answered by the car. .

The word DEMAS is an Indian language.

When a car is assigned to respond to a main floor demand (MFD) or a notemand (Mlli'E) from the main floor for an extended floor, a bit is set in DEMAS that corresponds to the demand bit in DEMIND.

The bit is cleared from DEMAS when the car is answered and the call is cancelled.

FIG. 11 FIG. 11 illustrates the system status word sysw setting bits in response to different system conditions.

For example, bit 7 is for severe upward traffic (SIUP).
Bit 6 is for falling peak (SDPK), bit 5 is for rising peak (UPPK), bit 4 is for basement demand (BA
SD), bit 3 for the top extension demand (TEXD), bit 2 for the main zone descent demand (MZDD), bit 1 for the high zone up demand (UDHZ),
and bit 0 can be associated with a low zone rise demand.

FIG. 12 FIG. 12 illustrates three 12-bit input words IWO, IWI, and IW2 sent to the system processor from each vehicle controller.

These input words provide status data about each vehicle that the system processor uses in its tactical and corridor call assignment decisions.

The information conveyed by these input word symbols is posted in the symbol and signal identification table set out below.

FIG. 13 shows three 12-bit output words owo, owi sent by the system processor to each vehicle controller.
and OW2 are illustrated.

These words contain various commands sent by the system processor to each elevator car to dispatch cars and answer corridor calls based on programmatic tactics.The information sent by these words is set out below. It can also be obtained by looking up the appropriate symbol in the table provided.

FIG. 14 FIG. 14 illustrates additional or redundant memory words maintained for each vehicle to fill in the various tracks and further assist the system processor.

The information contained in this extra word can also be identified by inventorying the signals and program identifiers.

Figure 15 Figure 15 illustrates how buildings are zoned and coded to provide zone codes used by the system processor to fill corridor calls, demands and elevator car tracks. .

Cars called for up or down service or set up for up or down service must be located in the basement (
Zone code 1 is used for B), zone code 2 is used for the main floor (MF'), and zone code 7 is used for the top extension floor.

Vehicles set for ascending service use zone codes 4 and 5 for floors between the main floor and the top extension floor, which are divided into low and high zones L and H, respectively.

Cars called for descent service or set for descent service use zone code 6 for floors between the main floor and the top extension (MZD).

Cars without assignments are given zone code 0.

If the building has an intermediate express zone where cars do not stop,
This group of floors may be given a zone code of 3.

In describing the software program illustrated in FIG. 4 in detail, it may be helpful to establish the various signals and symbols used in the discussion of the flowcharts, as well as the program identifiers used in the flowcharts.

The following list of symbols and their functions are listed in Sections 12, 13 and 1.
It also includes signals used for input words, output words, and extra words shown in Figure 4.

FIG. 16 is a flow diagram of an inrupt monitoring program that may be used for the function shown as block 150 in FIG.

The incrap 1 monitoring program is activated at terminal 200 in response to a timing inrupt initiated by time inrupt generator 130 shown in FIG.

Alternatively, the computer first takes control of the system and starts when the program starts at hex address 00016.

The inrupt supervisory program stores the information currently in program counter 84 and accumulator 92 in step 202 and continues with input registration number 1 in step 204.

Input register number 1 is illustrated in block form as register 126 in FIG. 2, and the 12 bits of the register are shown in FIG.

Step 206 checks bit O to see if it is set (ie, logic 1).

If this bit is set, indicating a timing interrupt, the timer is decremented in step 208.

If this bit is not set, ie, it is a logic zero, it indicates that the computer has just taken control and the program is at address 00016.

In this event, the program returns to terminal 210 to follow certain initialization procedures, as described below.
Leave the Incrapto Monitoring Program at .

Insertion into the inrupt monitoring program is
If it was for an inrupt, the time is checked in step 212 to see if the time is less than zero.

If the time is greater than or equal to O, the contents of the accumulator and program counter are retrieved in steps 214 and 216, respectively, and the program run at the time of inruption is replayed at the same point it was at at the time of inruption. insert.

If the time is less than zero, indicating that it has been 3.2 seconds since the timer program last ran, the timer is set to 32 and the timer program is placed on command at step 218.

Steps 214 and 216 are then performed to restore the running program.

When the run is finished and control is returned to the priority monitoring program, the subprogram TIME is executed in step 21
8 and executes.

Because it has the highest priority.

FIG. 17 FIG. 17 is a flow diagram illustrating the initialization procedure and priority monitoring program.

The program is started at the monthly hexadecimal address, so that the inrupt supervisory program 150 is activated at the terminal 210.
If you follow the bus to , the initialization procedure that starts at terminal 220 in FIG. 17 is tracked.

As shown in step 222, this includes the command register XBDR, the demand word DEMIND, the indicator word DBMAS, the timeout demand indicator TODEM, and the rising and falling peak indicators UP.
K and DPK1 rising peak timer UPTIN, indicator NCL indicating the number of calls in the call table CL, indicator NTOD for timeout descending calls, indicator MFU for main floor ascending calls, next military indicator N
EXI, Indicator ZCO for ton call in the next car
I as well as setting the indicator ZINIT to 0 to indicate the first execution through the subprogram CSU.

The program then follows the bus from terminal 224 to step 226.

Step 226 includes car allocation table CRA, call record CL
R, clear the call change record CCLR and the call table CL (these are shown in Figures 5 and 8).

This completes the initial setting and inserts the priority monitoring program at the terminal 128.

The function of the priority monitoring program is to start at the highest priority bit, ie, bit O, of the instruction register XBDR shown in FIG. 5, and to execute the priority program that is commanded to be executed.

Therefore, the first step 230 is to set the pointer in bit O of the instruction register.

Program CHEOK is then placed in the instruction register at step 232 by setting bit 5 of the instruction register.

Each bit of the instruction register is stored in steps 234 and 236.
is checked successively starting with bit O, and if a set bit is found, this bit 1 is erased in step 238 and the program jumps to the start of the program at terminal 240.

If none of the functional programs command execution,
The subprogram CHCK is executed as it was placed in command by the priority supervisor program during step 232.

Subprogram CHECK may be an active program.

It checks computer logic for fault searching.

Alternatively, as illustrated in FIG. 17, subprogram CHECK has a single step 244 to place subprogram CSU in the instruction by setting bit 1 of instruction register XBDR to logic 1, and then It may simply be a dummy program inserted at terminal 242 back to terminal 228 of the monitoring program.

Therefore, when the computer first has control, the priority monitoring program uses the subprogram CHEC
By instructing K, the state program is activated with program CSU.

Subprograms ACL and ACR therefore place subprogram CHECK in command when they return control to the priority supervisor.

This is because the priority monitoring program commands the subprogram CHECK for them.

FIG. 18 shows a subprogram T that can be used for the function shown as block 154 in FIG.
It is a flowchart of IME.

A subprogram TIME is inserted at the terminal 246, and step 248 inserts the timers NXTIM, MFTI
Decrease M and MFSTIM.

Timer NXTIM controls the time to dispatch the next car from the main floor, timer MFTIM runs when there are no cars on the main floor and MFSTIM is the main floor activation timer.

The falling peak timer DPK is checked in step 250 to determine whether it is greater than 0, and if so, indicating a falling peak condition, the falling peak timer is decremented in step 252. , system drop peak SDPK are set in the system signal word SYSW shown in FIG.

The rising peak timer UPTIM is then checked in step 256 to see if it is greater than zero.

If so, indicating a rising peak situation, the falling peak timer DPK is checked to see if it is greater than zero.

If a falling peak condition is occurring, UPK and UPPK are set to logic 1 in step 262, since if both occur at the same time, the falling peak will dominate the rising peak.

If a rising peak situation occurs without a falling peak, U
PK and UPPK are set to logic 1 in step 264.

If no rising peak has occurred, step 256 immediately proceeds to step 262, which sets UPK and UPPK to logic one.

Timeout demand word TO shown in Figure 10
The DEM is cleared in step 266 and the indicator NEXI is checked in step 268.

If NEXI is greater than 0, it indicates there is a next car; if it is 0, it indicates there is no next car.

If there is a next car, step 270 sets INDAYGAK-SYSMFX and TOM to zero.

Both of these are associated with the function of manning the main deck car when there is no next car.

The main floor timer MFTIM is set to 4 in step 270.
It is set to 1 and continues to be reset to 4 as long as there is a car on the main floor.

The program then proceeds to terminal 272.

If step 268 determines that there are no cars, the rising peak indicator UPK is checked at step 274.

If a rising peak has occurred and UPK is set, indicator TOM is set in step 276 and the program proceeds to terminal 272.

When an indicator or bit is shown as set, it indicates that it is set to a logic one.

If the rising peak UPK is not set, the main floor timer MFTIM, which runs when there are no cars on the main floor, will run in step 2 to see if it has timed out.
It will be inspected at 78.

If it has not timed out, the program will return to terminal 272.
Proceed to.

If it has timed out, step 280 checks to see if there is an up call registered on the main floor.

If so, the indicator TOM is set in step 276.

If not, ie, the MFU is not set, the program proceeds to terminal 272.

The subprogram now checks all calls in the call table CL for timing out.

Step 282 is the number of timeout descending calls NTOD.
is set to the quota OTOD that triggers the upcall bypass.

Step 282 also sets the variable WN to the number of calls in the call table CL minus one to provide a negative number when all calls in the call table have been processed.

The WN is tested in step 284 to determine whether all calls have been processed.

Otherwise, the call timer for the call determines whether it has timed out in step 286.
That is, it is checked to see if it is negative.

If it has not timed out, the timer for this call is decremented in step 288 and the next call, if any, is considered by setting WN equal to WN-1 in step 290.

If the call is found to have timed out its timer, the timeout demand word TODEM, illustrated in FIG. 10, is set in step 290.

The call is checked for service direction at step 294.

In the case of a rising call, step 296 sets the relevant bit in the system word SYSW.

In the case of a descending call, step 298 sets the relevant bit in the timeout record TCA (shown in FIG. 9).

Step 298 also timesout descending call count NTO
Set D to NTOD minus 1.

For both ascending and descending calls, the program then proceeds to step 290 to process the next call.

When all calls have been processed, step 284 provides the final command to subprogram TIME via terminal 300 and returns to terminal 228 of the priority supervisor program shown in FIG.

Figure 19 Figure 19 is a flowchart of the subprogram CSU.
It can be used for the function 158 shown in block form in FIG. 4 with the flowcharts shown at A, 20B, 20C and 20D.

The subprogram CSU starts at the terminal 302 and
In step 303, it determines the number of cars not in service (NOSC), the number of cars available for use (NAC), the number of cars on the main floor excluding those with basement assignments (ZNM).
C) and the number of cars rated as responding to the main floor demand (ZMDC) are set to zero.

Step 304 sets the variable ZI equal to the front height value assigned to the elevator car, ie, starting from 0, to the value 3 for a four car system (ζ).

Step 305 includes the output words owo, owi and OW2.
, images of the input words IWO, IWI, and IW2, and an image of the extra word XW are formed for the first car to be processed for use during the analysis.

The vehicle condition analysis begins at terminal 306 and ends at terminal 30.
Ends at 7.

Vehicle condition analysis between these terminals is performed by the 2nd OA, 20B,
20C and 20D and are described below.

After completing the vehicle condition analysis for the vehicle in question, step 308 decrements the ZI, which is then checked in step 309 to see if there are other vehicles to consider.

If there is more than one car to consider, the program
Returning to step 305 for the next car, that analysis is performed.

When all cars have been considered, the indicator ZINIT is checked in step 310 to see if this is the first execution of the subprogram CSU following the start of the system.

If it is the first run, ZINIT is set to non-O in step 311 and the program returns to terminal 302.

The first vehicle condition analysis following system departure is the 20A
As will be discovered when Figure 20D is explained from the figure,
This is not an in-depth analysis.

If this was not the first run through the subprogram CSU following departure, the program
Proceed to step 312 to check the timer DPK.

The falling peak timer DPK is positive during falling peak conditions.

If it is positive, in the DEMIND and DEMAS words shown in Figure 10 in relation to the main order demand,
Proceed to step 313 where bit MFD is set.

If the falling peak timer DPK is negative, step 31
4 checks to see if there are any cars grading to respond to the main floor demand or if the system is at a rising peak.

If any cars are rated, the counter ZADC is positive, or if the system is in an up-peak, the up-peak indicator UPK is positive and the program proceeds to step 313 described above.

If there are no cars to rate or the system is not in a rising peak, the main floor demand pit MFD is set to DEMIND in step 315 to register the demand for cars on the main floor.

Step 316 checks to see if there are any demands in the system by checking the demand word DEMIND.

If there is no demand in the system, subprogram TN
C is commanded in step 317.

If the system has demand, subprogram AC
It is important to note that R is not automatically placed in the command.

First, the system checks to see if there are any cars available that can be assigned to the demand.

If not, the counter NAC becomes 0 when it is checked in step 318 and the subprogram CSU places the subprogram TNC in command in step 317.

If there is a demand and a car available, subprogram ACR is commanded in step 319 and then subprogram TNC is commanded in step 317.

If both the TNC and ACR are placed in an instruction, the TNC will override the ACR because it has higher priority as noted with respect to the program instruction and the flowchart in Figure 4.
Run earlier.

Step 317 proceeds to step 325 which checks to see if all active vehicles are available (AVAD) based on the system processor.

If all vehicles in service are not AVAD, program OSU provides a final command at terminal 326 and the program returns to terminal 328 of the priority monitoring program.

The program also terminates from terminal 326 if either the falling peak timer DPK or the rising timer UPK is positive, as checked in step 327, or there is a demand on the system, as determined by checking DEMIND in step 328. Go.

If all active vehicles are AVAD, the system is not in a down-peak or up-peak situation, there is no demand on the system, and step 329 is in DEMAS.
, SYSMFX and NOL by setting them to O and the program completes step 2.
To clear all of the table at 26, exit at terminal 330 which inserts terminal 224 of FIG.

This ensures that corridor calls are not lost for any reason and clears the call table CL and car allocation register CRA when all active cars are available.

If there is a corridor call that does not answer, it is re-registered in the call record CLR and picked up as a new call in the call change record OCLR.

This results in one of the available cars being assigned to the call.

FIGS. 20A-20D are assembled to provide a single flowchart for the vehicle condition analysis function performed for each vehicle between terminals 306 and 307 of subprogram CSU in FIG. be able to.

The vehicle condition analysis starts at terminal 331 and in step 332 a ZACP is formed which is an image of the forward vehicle position of the vehicle whose condition is being checked.

Step 333 checks ZINIT to see if this is the first run through the CSU after departure and it is the program that goes to terminal 334 (FIG. 20B) and tracks the initialization procedure of step 335.

This step sets BSMT, NEXT and PARK to logic 1, which clears the extra word image ZXW, which sets the vehicle's zone based on the zone code shown in FIG. M
Both ODO and MODI are set to logic 0, inhibiting all corridor calls to vehicles, and it is the trip assignment signal T.
It sets the ASS corresponding to the direction of travel of the vehicle and it sets the service assignment signal SASS corresponding to the direction of service of the vehicle.

The program then runs the system down peak timer D
Terminal 336 (where the PK is checked in step 337)
Proceed to Figure 20D).

If the system falling peak timer is “on”,
The vehicle indicator DNPK is set in step 338.

If it is not "on", DNPK steps 3
Set at 39.

Next, the three command words OWO, O shown in FIG.
W1 and OW2 are output to the car in step 340, and the first
The redundant words shown in FIG. 4 are updated in step 341, the input data is updated in step 342, and the vehicle condition analysis leaves terminal 343 and is transferred to terminal 3 in FIG.
Return to 07.

After all cars have been inspected through this initial procedure, Z
INIT is set to 1 in CSU step 311 (Figure 19) and the analysis of the car begins again.

In this case, step 333 of FIG. 20A proceeds to step 344 to check whether the vehicle is running.

If not, a counter NOSC for counting the number of idle cars is incremented in step 345.

The vehicle is then inspected in step 346 to determine whether the vehicle was operated on a run prior to the CSU.

If it was running during the previous run, the program proceeds to step 342 and the vehicle condition analysis is completed for this vehicle via terminal 343 to terminal 3 of FIG.
Leaving in 07.

If the car was running before and after the CSU but is not running now, this is an event that requires the next run of the ACL to process all calls in the call table, so flag ZACLDB is set in step 347.

The car is checked in step 348 to determine if the car is indicated by the system processor to be the next car to leave the main floor.

If it is identified as the next car to leave the main floor, indicators NEX1 and ZCCI are set in step 418l to indicate that there is no next car and the program continues to terminal 334 in FIG. 20B. , following the same route described for the first run through vehicle condition analysis immediately following departure.

If the car is not next, the program immediately proceeds from step 348 to terminal 334.

This is as described above.

If the car is running, step 349 checks to see if the car was running during the run before the CSU.

If it was not active during the previous run, the allocation table CRA is cleared in step 350 and the program proceeds to terminal 334.

This is as described above. If the car is running, the car is checked for changes in its bypass state in step 351, and if there is a change in its bypass state, indicator ZACLBD is set to subprogram ACL.
is set in step 352l to cause the call table to handle all calls in the call table.

The variable ZACPMF is then set at step 353 to the forward vehicle position minus the main floor.

The position of the car is checked at step 354 to see if the position of the forward car is below the main level.

If so, the output signal BSMT is output in step 355.
and step 356 sets the mode signal MOD to give the car a main floor and below assignment.
O and MODI, which is the basement assignment signal S
Not only TT but also travel and service allocations are set appropriately.

The program then proceeds to terminal 336.

This is as described above.

If the forward vehicle position is not below the main floor, step 3
54 proceeds to step 357 and checks to see if signal BSMT is set.

If not set, the program will run directly to the terminal 35
Proceed to step 8.

If set, the car is available in steps 359 and 360 based on the floor selector (AVAS
) and cars are available, AV on the run before CSU
It is checked to determine if it was an AS.

The car is an AVAS or an AVAS and a CSU
(7) If AVAS in M's running, the program executes basement assignment step 35 as previously mentioned.
Proceed to step 6.

My car is AVAS, but it was AV on the run before CSU.
If not, flag ZACLBD is set and BSMT is set in step 361.

A change in availability based on the selector causes the AC to handle all calls in the call table during its next run.
This is an event that requires L and setting it to BSMT removes the basement signal to the car.

The program then proceeds to terminal 358.

Step 362 sets the STT to turn off the basement signal and checks for basement car calls in step 363.

If there is a basement car call, step 364 sets the BCC; if there is no basement car call, step 365 sets the BCC.
Set C.

Step 366 determines whether the car is assigned to the demand, and if so, step 367
checks to see if the car is selected as the next car to leave the main floor.

If it is the next car, in step 368 the signals NEXT and AVAD are set, the door and light modes are set to standard and the indicators NEXI and ZCCI are set to zero.

Step 369 (FIG. 20B) sets the master car call recent signal MCCR to register the car call with this next car and the program proceeds to terminal 370.

If the car is not the next car, step 380 sets AVAD and MNFL and the program continues to terminal 370.

If the car is not assigned to the demand, step 36
6 proceeds to step 371 where it is determined whether the forward vehicle position is on the main floor.

If the car is not on the main floor, step 372 returns MNFL and M
FS, an output signal indicating whether the forward vehicle is on the main floor, and a main floor activation signal are set respectively.

Step 373 determines whether the car is the next car to leave the main level.

If it is the next car, the program proceeds to step 368 as described above.

If not, the car is checked in step 374 (FIG. 20B) to determine whether it has completed its run.

If not, signal AVAD is set in step 375 and the program proceeds to terminal 370.

If the car has finished its run, it
Step 377 sets the AVAD if it is appropriate to be put into the AVAD, which is checked to see if it has a call or demand for a vehicle. If not, step 378 sets AVAD and the program proceeds to terminal 370 via step 369, as described above.

Step 371 determines that the forward vehicle's position is on the main floor and that position is determined by binary input signal AVPO-AVP6l.
If this determines that the main floor binary address t is equal, step 379 sets MNFL and step 381 checks to see if the car has a main floor activation signal.

If so, step 382 includes a main floor activation timer M
Check FSTIM to see if it has timed out.

If it has timed out, step 383 sets the door and light modes to standard and the program returns to
Proceed to terminal 384 in the 0D diagram.

If the timer MFSTIM has not timed out, step 385 checks the weight of the vehicle and
If it is greater than 5%, the program proceeds to step 383, as just described.

If the weight of the vehicle is less than 75% of its capacity, step 369
(FIG. 20B) registers the car call and the program proceeds to terminal 370.

If the car is on the main floor and does not have a main floor activation signal,
Step 386 determines whether the car has been selected as the next car to leave the main level.

If it has not been selected as the next car, step 387
Determines whether the car is marked as the next car to leave the main floor.

If not, step 388 sets NEXT and proceeds to step 369, as described above.

If not rated as the next car, signal NEXT
is set in step 389 and the program proceeds to the 20C terminal 390.

If step 386 determines that the car is the next car, the program also advances to terminal 390.

From terminal 390 in FIG. 20C, the next car is
At 1, the door is inspected to see if it remains open.

If so, step 392 checks the door timer and if it has not timed out, the program goes to terminal 370 (Figure 20B).

If the door timer has timed out, as determined by step 392, step 393 checks to see if the vehicle is moving.

If so, the program goes to terminal 370.

If not, step 394 checks for calls for cars above the forward car's position.

If there is no call for a car above the forward car position, step 395 checks to see if the door is open.

If the car door is not open, the program goes to terminal 370 via step 369 as described above.

If the door is open, step 369 determines whether the indicator STRP is set, indicating that the safety ray beam associated with the door has been faulty for four consecutive seconds.

If indicator STRP is set, step 397 sets signal AVAD and the program goes via step 369 to terminal 370.

If STRP is not set, the program:
From step 369 to terminal 37 via step 369
Go to 0.

If step 394 determines that there is a car call above the forward car position, the master car call reset signal MCCR is checked in step 39B to see if it is set.

Car calls indicate that the car is not acceptable;
If it is set, the program will
go to.

If it is not set, step 399 indicates that the car call can be registered.
Set AD and indicator ZCCI in step 40
At 0, the car call checks to see if the car is registered.

If the car call is registered, the safety lay indicator STRP is checked in step 401.

If the non-faulty beam is shown for 4 seconds and it is set, the door is set normally in step 402 and the signal MCCR is set in step 403 (20D
) and the program goes to terminal 384.

If step 400 finds that ZCCI is not set, step 404 sets ZCCI and also sets timer NXTIM, which controls the time interval before the car receives a main floor start command.

The program then proceeds to terminal 405.

From terminal 405, the program checks timer NXTIM for timing out in step 406.

If it has timed out, the program goes to step 402, as described above.

If not, step 407 checks to see if the car is on a down peak.

If so, the program goes to step 402.

If not, step 408 determines whether the weight of the vehicle is greater than 50% of its capacity.

If it is above 50% of its capacity, step 409 sets a rise timer UPTIM and the program goes to step 402.

If the weight of the car is less than 50% of its capacity, the program goes to step 403.

The program branch that inserts terminal 370 of FIG.
D), for example, the car is AVAD and is checked to see if it is on the main floor or can immediately go to the main floor for its travel and service direction.

If the car is rated, it is counted in step 411 by an incrementing counter ZMDC and the program proceeds to step 412.

If the MFD requirements are not met, the program proceeds directly to step 412.

Step 412 checks to see if the forward vehicle's location is on the main floor.

If it is on the main floor, it is counted by incrementing ZNMC in step 413, and if not on the upper floor, the program proceeds to terminal 414.

If the forward vehicle is located on the main floor and is not moving when inspected in step 415l or is moving but not decelerating when inspected in step 416, then
The program goes to terminal 414.

If the forward vehicle's position is on the main floor and the car is moving and slowing down indicating that it is about to reach the main floor, signals MFX, SYSMF and ASG are set and the car allocation register CRA is set. , cleared in step 417.

The program then goes to terminal 414. From terminal 414, the car is checked in step 419 to see if it has a park assignment.

If so, step 420 sets that the vehicle is unavailable based on the dispatcher (AVAD is set) and the program proceeds to terminal 421.

If the car does not have a park assignment, step 41
9 proceeds to step 422 where it checks to see if the car is assigned to the demand.

If it is assigned to the demand, step 423
determines whether it should suspend the assignment status by determining whether the car answered the first call since its assignment.

If the car did not answer its first call, it should remain in the state with the assignment and the program
Go to terminal 424 in the 0D diagram.

If the car had answered the first call for that assignment,
It does not hold state due to allocation, step 42
5 sets both ASG and ZACLBD to flag the program ACL that handles all calls in the call table.

Because this car may now be given a zone assignment.

That is, since the call is an active vehicle, it may be assigned to a vehicle.

The program then goes to terminal 421 and the car is checked for zone changes at step 426.

If it did not change the zone, the program
Go to terminal 424.

If the zone has changed, step 427 sets the zone coat and also sets the indicator ZACLBD.

This is an event that requires all calls in the call table CL to be processed the next time subprogram ACL executes.

The program then goes to terminal 424.

If step 422 finds that the car has not been assigned, step 428 checks to see if the car is AVAD.

If not, step 429 determines whether the car has been selected to be the next car to leave the main level.

If the car is the next car, the program goes to terminal 336 as described above.

If the car is not AVAD and not the next car, step 430 checks to see if it was AVAD the last time the CSU ran.

If it is not AVAD, the program goes to terminal 421 as described above.

If it was AVAD on the last run, the program goes to step 335 and sets the signal posted there as described above.

If step 428 determines that the vehicle is AVAD, step 431 checks to see if the forward vehicle's location is on the main floor.

Otherwise, step 432 determines whether the car is rushing to the main level.

Otherwise, the program goes to terminal 433.

If the main floor is being rushed, the signal AVAD is activated in step 434.
Step 435 of FIG. 20D is set to
Check to see if the car is in the main zone descent (zone 6).

If it is not in this zone, the program goes to terminal 436.

If in zone 6, step 437 sets the car for main level park assignment with travel and service signals TASS and SASS set to down and assignment mode OO rejecting corridor calls.

The program continues from step 437 to terminal 3 as described above.
Go to 36.

If step 431 of FIG. 20B finds that the forward vehicle's position is on the main floor, then the rising peak indicator U
The PK is checked in step 438.

If the rising peak indicator is not set, the program goes to terminal 433.

If the rising peak indicator is set, step 439 determines whether the number of cars on the main floor, excluding those with basement assignments, is greater than two.

If the indicator ZNMC is greater than 2, the program is sent to terminal 433.

If indicator ZNMC is not greater than 2, step 440 sets AVAD and step 441
clears the car allocation register CRA and extra words shown in FIG. 14 and sets the zone equal to O, the zone for unassigned cars.

The program then proceeds to step 403 and terminal 384 in Figure 20D, as described above.

From the terminal 433, the program goes to step 442 where it increments the number of available cars indicator NAC by one.

Step 443 then determines whether this AVAD vehicle was the CSU's previous running AVAD.

If not, the program goes to step 441 as described above.

If the previous run was AVAD, the program returns to the 20th D via step 403, as described above.
Go to terminal 384 in the figure.

The analysis arriving at terminal 384 of FIG. 20D sets allocation mode OO, sets ASGN to logic zero in step 444, and proceeds to terminal 445.

The program tells us from terminal 445 that the number of cars available plus the number of cars on the main floor is equal to two times the number of cars in the system.
Proceed to step 446 where the question is ``Is times equal?''.

If the answer is "no", the program goes to terminal 336 as described above.

If the answer is yes, step 447 determines whether there is any demand within the system.

If there is no demand, step 448 starts the intermediate building park on the car, sets AvAD and ASGN,
The program returns to terminal 336.

If step 447 finds a demand, the program does not go to step 448 but goes to terminal 336.

A program launch arriving at terminal 424 in FIG. 20D is checked by the car allocation register CRA in step 449 to see if it has been assigned a floor.

If the CRA has assigned you a floor, step 450
gives an address to the floor as signal FADOFAD6 and places a signal at output word OWO.

Step 451 then checks to see if the service assignment SASS is up.

If the answer is "no", step 452
Before proceeding to step 45, set the assignment mode, door mode and light mode normally.

If step 451 determines that the SAS is up, step 453 determines whether the forward vehicle position is equal to the main floor or
Decide which one is bigger.

Otherwise, the program continues to step 452.

If so, step 454 checks to see if the car is at a downhill peak; if not, the program goes to step 452.

If the car is on a down peak, step 455 checks the number of timeout calls.

If the indicator NTOD is negative, the quota for going up call bias has been reached and the program goes to step 444 which rejects the terminal 384 and corridor calls and sets allocation mode OO.

If NTOD is positive, the program changes the allocation mode to
Proceed to step 452 to successfully set that the corridor call can be seen ahead in that service direction.

Step 449 is the car allocation table CR of the car being considered.
If it is determined that A is not assigned a floor, step 456 checks to see if the car has a basement assignment or a basement car call.

If it is a basement car, step 457 determines whether the forward car position of the car is on or above the main floor.

If the forward vehicle position is below the main floor, the program goes to terminal 336, as described above.

If the forward vehicle's position is at or above the main level, step 458 sets STT and PA[, which gives the main level and below assignments, for down travel and down service. Set the assignment and it will set the door and hall lights normally.

The car is checked in step 459 to see if it is moving.

If it is not running, the program goes to terminal 336.

If it is, step 460 sets the ASGN on the vehicle and then goes to terminal 336.

If step 456 determines that the vehicle is not a basement vehicle, step 461 checks to see if the location of the forward vehicle is on the main floor. If not, the program returns to the terminal as described above. Go to 436.

If the forward vehicle position is on the main floor, step 462
Check the car call above.

If there is no car call on, the program calls terminal 436
go to.

If there is a car call above, the program goes to terminal 445 as described above.

This concludes the vehicle condition analysis that can be used for this function in the program CSU.

FIG. 21 is a flow diagram of a Saf program TNC that may be used for function 164 shown in block form in FIG.

Subprogram TNC represents a new call,
Starting from terminal 470, step 471 initializes the ascending call scanning subprogram.

The corridor call registers load their call information directly into the core, with core addresses that are sequential in the order of the building floors, by direct memory access during periodic state VI.

A rising call is placed on a predetermined bit of each call word in the core, and step 472 loads the accumulator with the first call word to test this bit.

If an ascending call is registered and determined by step 473, then the bisto is set to the 12-bit word YCALL in step 474.

Otherwise, step 474 is skipped.

The word YCALL is a variable used to provide a call record word for comparison with the previous call record word CLR to obtain a call change record CCLR.

The word YCALL then becomes the new CLR.

Steps 475, 476 and 477 pass through the 12th floor of the building, and in step 478 the exclusive OR O
R, the word YCALL, the same level previous call record word CLR and its result are stored in the call change record CCLR.

YCALL is now a new CLR word, so YCALL
can be set to O to process the 12th floor of the next group.

Step 479 then returns to step 472 via step 477 to inspect the next 12th floor.

When all floors of the structure have been inspected, step 479 asks step 480 whether the down calls have been inspected.
Proceed to.

Since only ascending calls have been examined thus far, the program proceeds to step 480 to examine the descending call bit of the call word and setting the address pointer to scan the core address for the descending call.

The process described for up calls is repeated for down calls until step 479 finds that all floors have been inspected for the down calls.

Step 480 then executes the program in step 482.
Proceed to.

Step 482 sets the counter YNCLO to the number of calls in the call table CL, and then step 483 prepares to scan the call change record CCLR for descending calls.

Any bit set in CCLR indicates a change, ie, a canceled call or a new call.

If a set bit is found, step 485 checks to see if it is an ascending call from the main floor.

Since we are processing the descending call first, it is not the main ascending call, the program goes to step 48.
Proceed to step 6.

Step 486 determines whether the call is in the call table.

If so, the set bit in CCLR indicates that the call was answered and counters NCL and YN
CLO is decremented and calls are made to steps 487, 48
8 and 489 respectively, and the program returns to step 484 to search for the other sent bits of CCLR.

If step 486 determines that the call does not exist in call table CL, the set bit indicates a new corridor call, and step 490 continues with the two call words for each call in FIG. Set the zone and timer as specified and call table C.
Add a call to the bottom of L.

Step 491 reflects the added call.
Increase the counter NCL.

However, the counter YNCLO is not incremented because this call has not been processed by program ACL.

The program then returns to step 484 to look for the set bit in the call change record COLR.

If the set bit is no longer found or there is nothing to start with, the program proceeds to step 492 where it checks to see if the call modification record CCLR has been processed for the ascending call.

Since the ascending call has not yet been processed, step 493 initializes the ascending call and the program returns to step 484.

Step 485 checks to see if the set bit indicates a primary ascending call.

If so, step 494 includes indicator M
Change the FU to the opposite situation of what it currently is.

If it was a logic 0, it is set to a logic 1 to indicate a call.

If it was a logic one, it is set to a logic zero to indicate that the call was being answered.

The remainder of the ascending call modification record CCLR is processed in the same manner as described for the descending call modification record.

If the set bit is no longer found or there is nothing to start with, step 492 places the subprogram ACL on the instruction and returns the program at terminal 496 to priority supervisor terminal 228.
Proceed to step 495 to issue.

Subprogram A. Since CL is currently the program with the highest priority that is ordered to be executed, program ACL will be executed even if the CSU orders ACR.

22A-22C FIGS. 22A, 22B and 22C illustrate the tactical program A shown as block 168 in FIG.
It can be assembled to give a flowchart for CL.

The function of subprogram ACL is to allocate corridor calls to suitably arranged cars already active with service call duty for elevator service or to establish demand signals for calls that cannot be so allocated. It is.

This program does not assign available cars to demand calls.

This is because this function is executed by the subprogram ACR.
When a demand exists, there are available cars that can be enforced as determined by the ACL and assigned to this demand as determined by the CSU, and then the CSU
Since we put it in the command.

Subprogram ACL leaves terminal 500l and then immediately sets flag ZACLBD to step 5.
01, the total call table CL is subprogram TN
Check to see if the CSU has found an event indicating that it should be processed as opposed to only processing new calls added to the bottom of the processed calls in the call table CL by C. .

If flag ZAGLBD is not set, step 502 sets the address pointer to the first new call.

Since we have two words in each call table, the address of the first new call is the address B of the first call.
Double the number of cars on the call list to CALLO (2YNCLO)
is added.

If ZACBZ is set, all demands are reset in step 503 and
04 sets the pointer to the first call of the call table CL.

Steps 502 and 504 both proceed to step 505, which sets the address to the second word of the first call being considered.

Step 506, again check the indicator ZACIBD, if it is not set, step 507
But since only new calls are processed, the indicator FD
Set CL to O.

Exclude the part of the program that pertains to this best descending call strategy.

The program then proceeds to terminal 508. Step 5
06 indicates that all calls will be processed and Z
If you discover that ACLDB is set,
The highest descending call tactic is used and step 509 is FD
Set CL to logic 1, it is indicator MZDS
Set WP to 0, this indicator is also used in the highest descending calling tactic and it is set to indicator SP
MCR is set to O and is used to indicate the time an unassigned car in zone 76 was given a descending corridor call.

Step 509 then proceeds to step 510.

Step 510 uses well-known classification techniques to populate the call table CL with the highest call in the building at the top of the list and to place the remaining calls downward from the highest call in which they were registered. As you advance, order them to be placed in the order they appear on the building.

The program then proceeds to terminal 508.

From terminal 508, the program goes to step 511.

Step 511 examines the contents of the address of the first word PCLO of the call.

This call may be the first call or the first new call in the call table, depending on whether ZACLBD is set.

If the content of address PCLO is not O, then there is a call at this address and step 512 adds CALZON to the call zone taken from the zone mask ACRMSK and bits o, 1 and 2 of the first call word for vehicle selection.
Set.

Step 513 checks CALZON to see if the call is for the basement zone (Zone 1 as determined from FIG. 15).

If it is about basement sawn, step 51
4 causes the basement program to run and then proceeds to terminal 515.

Once the call is processed, the program proceeds to step 516
Terminal 51 always starts selecting the next call with the two-word address of the next call established at
Return to 5.

The program then returns to terminal 508 to examine the contents of the address of the first word of this next call.

For example, the basement program sets predetermined requirements for basement cars and discovers that such a car sets the signal BSMT for this car to logic one.

If no such car is found, it sets the demand for the basement to DEMIND related to the basement demand B.
It is opened by setting the bit number 1 in .

In either event, the program returns to terminal 515 as stated.

If step 513 determines that the CALZON is not a basement zone, then step 51
7 sets the variable ACLFLR equal to the calling floor and proceeds to terminal 518.

The program then executes step 519 from terminal 518.
Proceed to.

Step 519 checks bits 0 and 1 of the second call to see if the call is a demand and if a car has been assigned to this demand.

If the call is an assigned demand call, the program proceeds to terminal 520.

If the call is some other combination other than an assigned demand call, step 521 optionally sets the call as a demand call, but no matter what the combination actually is. I can't do it.

The program then proceeds to terminal 520.

Step 522 sets the variable AC LO R to minus one.

This variable is later set to the car number of the suitable car found closest to the calling floor, and when other cars are considered and a closer car is found, the value of the closer suitable car is Changed to car number.

Step 522 optionally sets the variable ASDIF to 128.

As D I F is then set to minus the forward vehicle position of the closest suitable car found from the calling floor, and when a closer suitable car is found, it is set as required. Be changed.

Step 522 also sets variable XI to the car number of the elevator system.

The program then proceeds to terminal 523 (Figure 20B).

Terminal 523 is the terminal to which the program returns whenever it wants to consider other cars for the particular call being considered.

Step 524 then sets X1 to X1 minus one.

This is because when assigning numbers to cars starting with O, the highest number assigned to a car is one less than the minimum number of cars in the elevator system.

Step 525 is used to find the time when all cars were considered for a particular call.

When it is thinking of a car, it goes to terminal 526; when there is no car to think about, it goes to terminal 527.

If a car is being considered, the terminal 526 proceeds to step 528 to provide an address for obtaining information about the car being considered, and step 529 calls the variable ACLMCR to determine the forward position of the car being inspected from the floor. It is set equal to minus the direct.

Step 530 checks to see if the car is running and bypassing the corridor call.

If a car is not in service or is in service but bypasses the corridor call, the program is not suitable for any call, regardless of its location in the building or its service direction, and the program Return to 523.

If the vehicle passes the ``Running'' and ``Not Bypassing'' tests in step 530, it
At 31, the car selection mask ACRMSK is checked to see if it exposes the CARZON.

If the car does not pass this test, ie, it does not have the same zone as the call being considered, the program returns to terminal 523 to consider the next car.

It should be noted that without assignment, only active cars can be considered since available cars are given a code of O (see Figure 15).

The zone of an active vehicle is the zone of its forward vehicle's location, but the zone of the assigned vehicle, a vehicle that has not started slowing down to answer the first call after being assigned to the demand, is the zone of its forward vehicle's location. has a zone of calls that is assigned to reply to.

If the vehicle passes the test of step 531, we already know that the vehicle has the appropriate service direction for the call, since the zone also identifies the service direction.

The program then proceeds to step 532 where it checks the service direction of the call.

If the call is for an elevated service, step 53
3 executes the climb program and then returns to terminal 523 to consider other cars.

The ascending calling program is not shown in detail.

This is because it is very similar to a downcall program or is usually less complex than a downcall strategy.

For example, a rising call program may follow the tactics set out in British Documents Patent 949,761, assigned to the same assignee as this application.

Generally, if ACLMCR is greater than or equal to 0, the forward vehicle position is below the call floor and therefore the vehicle is properly adjusted for upcall.

It is a matter of memorizing the car number and the position of the suitably adjusted car closest to the call and updating it when a more suitable car is found.

After the up call program processes the car associated with the call in step 533, it returns to terminal 523 to process the next car.

If the possible call in step 532 is for a descending service, the program returns to step 5.
Go forward 34I.

Step 534 tests the call to see if it is a demand call and if a car has been assigned to it.

If it is a demand call and the car has been assigned to the demand, it is said to be an assigned demand call.

If it is an assigned demand call, the car determines in step 535 whether this car is an assigned demand call, i.e., a demand assigned car that has not started slowing down to answer the first demand assignment call. It will be inspected to see what is going on.

If the car is an assigned car, step 536 checks to see if the floor the car is assigned to is the same as the currently considered call floor.

If they are the same, the call is allowed to remain with this car.

Because the car is already in the process of answering the call.

The program then proceeds to step 538 which sets terminal 537 (Figure 22C) and indicators FDCL and MZDSWP.

This is because if this call was a top-down call, no specific top-down call strategy would need to be considered.

Since no more cars need be considered for this call, step 538 returns to terminal 515 for selection of the next call.

If step 534 determines that the call is an allocated demand call but step 535 finds that the car should be assigned or the car is assigned and step 536 determines that the call is on the assigned floor. If it finds that they are not the same, the program returns to terminal 523 to consider the next car.

If step 534 finds that this descending call is not an assigned demand call, the program:
Proceed to step 539 to check to see if the vehicle has been given a Zo76 down call.

If the car is given a zone 6 down call, the indicator SPMCR is set and if the full call table has been processed, the SPMCR car will not be considered for any other down calls.

Step 540 determines whether the full call table has an indicator ZAC
Inspect the LBD to see if it has been treated.

If the car is a SPMCR car, i.e. its indicator SPMCR is set and the entire call table has been processed, then the program is no longer considered for calls to be processed, so the program The user returns to the terminal 523 to inspect the car.

The tactic is to eject active vehicles in Zone 6 and open vehicles assigned to Zone 6 when available vehicles or Zone 6 down calls exceed the number of active vehicles serving Zone 6. , to get as many vehicles as possible working in Zone 6.

If the car is not a SPMCR car or it is SPMCR
If it is a car but only a new call is being considered, the process proceeds to step 541.

Step 541 checks to see if the car is rushing to the main floor.

If the car is rushing to the main floor, a step 542 determines whether the rising peak indicator UPK is set.

If set, this car is not considered for the call, so the program goes to terminal 523 to consider other cars.

If the car is rushing to the main floor and the rising peak indicator is not set, step 543 determines whether the call being processed has timed out.

If it has not timed out, this car can no longer think about the call, so the program returns to terminal 52.
Return to 3.

If the car is not rushing to the main floor, or if it is rushing to the main floor but the rising peak indicator is not set and the call times out, the program proceeds to step 544 to check the status of indicator MZDSWP. .

This indicator is set only when the highest descending call cannot be allocated based on the first set of conditions, giving an opportunity to attempt to allocate the highest descending call according to the second set of conditions before leaving subprogram ACL.

Since this call did not determine that it could not be allocated at this point, the indicator MZDSWP would not have been set even though this was the highest descending call registered.

Therefore, the program proceeds to step 545.

Step 545 determines whether a car has been assigned to the demand by subprogram ACH.

If so, the program returns to terminal 523 since this car is no longer considered for this call.

Once a car has been given a quota by program ACR, it begins to slow down due to the first call for a demand assignment, at which point it becomes an active vehicle to which program ACL may assign corridor calls. , suspend its assigned state.

If the car is not assigned, step 546 indicates that the ACLMCR formed in step 529 is
Check to see if it is larger than .

If it is thicker than O, the forward vehicle position is on the wrong side of the call, i.e., below this descending call.
The program returns to terminal 523 to consider other cars.

If the calling floor minus the forward vehicle position is not greater than O, i.e. O or negative, then the forward vehicle position is at or above the calling floor and a suitable vehicle has been found for the call. become.

When a suitable call is found for a call, it is determined whether it is the most suitable car ever found or an even more suitable car was found while inspecting a car with a high value for this call. It will be inspected to see if it is correct.

The basis for comparing the suitability of finding the most suitable car is which car has a forward car position closer to the calling floor.

This function uses the absolute value of ACLMCR (regardless of whether it is positive or negative)
This is accomplished by first obtaining the .

This is done in step 547 (Figure 22C) and then in step 548 from the ASDIF.
Check if ACLMCR minus O is greater than O.

ASDIF is the difference between the call floor and the forward vehicle position of the car closest to the call floor found so far.

If this is the first suitable car found, AS
Since DIF was arbitrarily set directly to this f in step 522, ASDIF is still at 128.

In this case, ASDIF minus ACLMCR is greater than zero, and the program returns to step 549.
Proceed to.

It should be noted that if a suitable car was found earlier, but the current suitable car is closer to the calling floor, then the ASDIF minus ACLMCR will be greater than O. Yes, the program proceeds to step 549 in this case as well.

Therefore, the program selects step 5 when the considered car is the most suitable car found so far.
Proceed to step 49.

Step 549 then determines whether this "most suitable car so far" is the first car found or an even more suitable car that was previously found to be suitable.

It does this by checking ACLOCR for O.

If it is negative, as it was set in step 522, it is the first car found to be suitable and the program proceeds to step 550.

Step 550 adds A to the car number of the currently considered car.
Set CLOCR. Set ASOIF to that of ACLMCR.

Therefore, future suitable cars are compared with this car to determine which is more suitable.

The program then goes to terminal 523 to consider other cars for this call.

If a suitable car was previously found and the current car is more suitable, then ACLOCR will not be negative and step 549 goes to step 551.

Step 551 checks to see if the vehicle found to be less suitable has a car call by checking the signal call.

If it does not have a car call and the floor call now considered is assigned to a car in the previous run of the program ACL, then assigning this floor call to a less suitable car will result in its assignment table CRA removed by removing the call from .

The tactic is to not dissipate the cars' call registers by removing call assignments to which the car does not respond, but to promote them back to an availability state that assigns cars to demand.

However, if the car has a car call, it will not return to available status until it services the car call.

Since the car is appropriate for the floor call being processed, the floor call assignment can be held in the event that a more appropriate car is delaying responding to the call for some reason.

If a suitable car has already been found for the call being processed during the current or previous run of the program ACL, and step 548 determines that the previous suitable car is more suitable than the car currently being considered. Let's assume that we decide.

In this case, step 548 would proceed to step 552.

If this call was assigned to the currently considered car during the previous run of subprogram ACL, step 552 removes this call from its assignment table CRA if the car does not have a car call. .

The reason behind this tactic is as described for step 551.

Next, the program calls terminal 523 to consider other cars.
Return to

The up call program of step 533 may use steps 547 through 552 to find the most appropriate car for the up call in the same manner as described for the down call.

Once all cars have been considered for the call, the number of the most suitable car found will appear in ACLOCR,
The difference between the forward vehicle position and the called floor appears in ASDIP.

When all cars are considered for the call, step 52
5 determines when X1 goes negative and the program proceeds to terminal 527 and step 553.

Step 553 checks the service direction of the currently considered corridor call.

If the call is an ascending service, the program goes to step 533, the ascending call program.

This part of the lift call program ensures that the appropriate car
LOCR is still checked to see if it is found by checking to see if it is negative one.

If so, the demand is based on the zone of the call and the DEM
Registered for the corresponding bit set in IND.

If ACLOCR is not negative, a suitable car has been found and its allocation table CRA is set to the calling floor.

If step 553 determines that the call is for a descending service, the program proceeds to step 554 (Figure 22C) where the call is checked to see if it is an assigned demand call. move on.

If the answer is ``yes,'' then when step 536 finds a car to be assigned to the floor of the assigned demand call, the program has already proceeded to step 538 and terminal 515 to consider the next car. For this call, you will be immediately informed that no vehicle has been found.

Therefore, the car was not found assigned to the floor of the assigned demand call when the assigned demand call arrived at step 554.

If the call is an assigned demand call, step 554 returns the program to step 521.

Step 521 optionally sets the call as a demand call, but the call is not assigned.

All cars will be checked again for this call, but
In this case, the car assigned to the floor of the call is examined to find a suitable car.

Therefore, in this case, the program returns to step 534.
branches to step 539 and follows the procedure described above for ASG and new calls.

When all the cars have been considered, the program is in step 5
Return to 54.

If step 554 finds that the call is not an assigned demand call, step 555 checks to see if a suitable vehicle was found for the call by checking the ACLOCR.

If ACLOCR is non-negative, indicating that a suitable car has been found and that it is a call assigned to the car by subprogram ACL, as opposed to a demand call where the car is assigned by subprogram ACH, The call is set to ASG and DEM by step 556.

Since a suitable vehicle has been found, step 557 sets indicators FDCL and MZDSWP to logic O.

This is because the best calling strategy is program A. Since it does not apply to this run of CL, the bit in SPMCH corresponding to the most suitable car found (ACLOCR) will prevent this car from being allocated to another Zone 6 down call when the full call table is processed. To prevent, step 53
9 and 540 as described above.

Step 558 places the floor of the call in the allocation register CRA of the most appropriate car found (ACLOCR);
The program returns to terminal 515 to consider the next car in the calling table OL.

The lift call program 533 may use the same as step 558 when it discovers a suitable car for a lift call.

If step 555 finds that ACLOCR is still negative, no suitable car was found for that call, and the program determines whether this call is the highest descending call by checking the indicator FDCL. Proceed to step 559 to view.

If the entire call table has been processed and this call is the highest descending call registered, then FDCL is set to logic one by step 509.

If indicator FDCL is not set, step 560 appears in DEMIND (bit 6
) establishes a demand for the main zone descent (zone 6) and the program goes to terminal 515 to think of the next car.

If the indicator FDCL is set, special treatment is given to this long descent call by changing the requirements for the appropriate vehicle and the vehicle is checked again for the call.

However, this cannot be done unconditionally.

Step 561 first checks to see if there are any available cars to allocate to the demand.

If there is a car available, the program establishes a demand for the unassigned long down call by branching the program to step 560 and then returns to terminal 515 to take the next call.

The tactic in this case is to prevent the elevator car from being forced to traverse substantially the entire length of the building unnecessarily.

In previous technology developments, assignments that respond to the highest descending call may cause the assigned car to respond to the highest descending call if it is moving to answer the highest descending call, but another higher descending call is recorded. goes to this new higher call,
The primitive call claims to be a demand given to the next available car.

In this case, available cars approaching the last registered highest down call will not be assigned to this down call.

Because the already assigned car assignments will be changed to this higher descending call.

The available cars approaching this last registered highest descending call are assigned to the descending call originally assigned to the first car.

It can therefore be seen that both of these cars end up traversing unnecessarily long distances to reach their assigned floors.

The proposed tactic allocates the highest descending call to the closest car, and when a new call appears, asks the system if there are any available cars.

If there are no cars available, this new higher descending call is given to the assigned car traveling to the call that was originally the highest descending call.

If there are cars available, the allocation remains unchanged.

The program creates another demand and assigns this call to the closest car, keeping the highest descending call.

When there are no cars available, the program sets the indicator MZDS as determined by step 561.
Proceed to step 562 to check to see if WP is set.

Step 509 sets it to O.
Reset MZDSWP.

Therefore, MZDSWP is not set at this point.

The program then proceeds to step 563 where it sets MZDSWP by setting it to a logic one.

In step 563, AHIFLR is then set to the floor of the forward vehicle position of the highest vehicle found,
Set IFLR arbitrarily to the main floor.

AHICA. R is set to the car code of the next highest car found, and AI-iIc. A. R is also arbitrarily set to minus one.

The demand for the main zone descent (Zone 6) is also registered by step 563 and appears in DEMIND.

The program now returns to terminal 518 to process this unassigned highest descending call a second time.

This descending call is based on an unassigned demand call and is processed as described above until reaching step 544.

If the car passes all tests up to step 544, step 544 is already set by step 563 since MZDSWP is set and represents the second processing of the unassigned last descent call;
・Discover what was done here.

The program then branches from step 544 to step 564, which picks up the car assigned to the demand call.

It will be recalled that the initial processing of this call excluded such cars from consideration in step 545, considering only unassigned cars.

In this second process, only cars assigned to the demand are considered.

If step 564 finds that no car is assigned, it advances the program to terminal 523 to check for the next car.

If a car is assigned, the forward car position of this car (
ACRFLR) determines in step 565 that it has the highest assigned vehicle (HIF) considered to date.
LR).

If this is the first assigned car found in this reprocessing of the highest descending floor call and it is above the main floor, HIFLR is arbitrarily set to the main floor so that it is the highest It becomes a car.

If ACRFLR is not greater than HIFLR, the program goes to terminal 523 to consider the next car.

If this is the best car ever launched, AH
ICAR is set to the car number of the car currently being considered and HIFLR is set to the floor of the forward car position of this car in step 566.

When all cars are considered, AHICAR will contain the car number of the highest assigned car in the building, and H
I F L R will contain the floor of the forward vehicle position of this vehicle.

When all cars have been considered for this call, the program continues through steps 562, 553, 554.
, 555, 559 and 561.

Step 562 now includes the set MZDSWP
will be discovered.

This is because it was set by step 563 to perform the second processing of the highest descending call.

The program then goes to step 567 where it checks to see if a car has been found during the second processing of the top-down call.

If no car is found, AHICAR remains minus one, per step 563, and the program proceeds to step 538 to reset FDCL and MZDSWP, then it returns to the terminal to take the next call. Go to 515.

If a car is found, AHICAR will be equal to the car number and the program will proceed to step 568.

Step 568 determines the location of the car with respect to the called floor using ACLF.
Determine by subtracting AHIFLR from LR.

If this difference is greater than O, the floor of the forward vehicle position of the car is below the highest descending call.

If the forward vehicle position is below the calling floor, step 5
69 is travel assignment TA. Check SS.

If the travel quota is down, the program proceeds to step 53.
8 to proceed to the next call.

If the trip quota is rising, step 570 checks to see if the vehicle has begun to slow down.

If it has started, the program will start at step 53.
8 to proceed to the next call.

If not, it is not too late to change the car assignment and proceed to step 571.

Step 571 is where step 568 determines that the forward vehicle position is above the call floor.

Therefore, due to a descending call, an assigned car that is ascending will have its assignment ζ changed to a higher registered descending call.

Since only one car is assigned to each descending floor call in zone 6, the previously assigned call will not be able to be assigned to the active car. This becomes a demand processed by ACL.

Step 571 checks to see if the currently considered call, the highest registered descending call, will time out.

If it has not timed out, step 572
Determine whether the call that the car is currently assigned to answer has timed out.

If so, the program returns to terminal 515 through step 538 to consider the next call.

If the currently considered call has timed out, but the call that has not timed out and a car is assigned is not timed out, proceed to step 573.

Step 573 sets the car number (ACLOCR) of the closest appropriate car to the car number of AHICAR set in step 566.

Since the call is given to the assigned car, it is set to assigned and demand by step 573.

At J), the program executes step 55 for resetting FDCL and MZDSWP and setting SPMCR.
7, step 558 places the floor of this long-height down call in the assignment register CRA of this car (ACLOCR).

The primitive descent call assigned to this car is program A.
During CL's next run, no car would be found and assigned to that floor.

An attempt is then made to allocate the call to an active car, or for a call to which an available car is allocated,
Demand is opened.

When all cars processed have finished, step 511 finds that the contents of PCLO is now equal to O, and the program then returns ZACLB in step 574.
D is set to O and the program is sent back to the priority watch program via terminal 575.

FIGS. 23A and 23B FIGS. 23A and 23B can be assembled to provide a flow diagram of subprogram ACH that can be used for the function 172 shown in FIG.

The function of the subprogram ACH is that the subprogram ACR assigns available cars, i.e. cars that are not actively servicing calls for elevator service, to active cars with floor calls adjusted accordingly. When this is not possible, it is allocated to a demand established by the subprogram ACL.

As mentioned in the second incorporated application, the floor selector of an elevator car is programmable to signal AVAS when the car is in service but not currently servicing a call for elevator service. to the system processing unit.

The signal AVAS is given when the vehicle in operation is not moving or slowing down and its door is closed.

When the system processor 6 makes a decision about its own availability and considers that a vehicle is available from the system processor 6 for demand allocation, the system processor 6 outputs the signal AVA.
Give D.

As mentioned earlier, the program ACR executes only when a demand is established by the subprogram ACL and the CSU determines that there are available cars that can be assigned to the demand.

Subprogram CSU puts ACR in the instruction, but it does not execute until programs TNC and ACL execute.

This is because ACR has a lower priority than these subprograms.

Therefore, subprogram CSU is subprogram A
When commanding a CH, it breaks the program from its first loop or cycle and directs it to the second loop or cycle containing the ACR.

Subprogram ACR sequentially checks different types of system demands with predetermined priorities.

When a demand is discovered, the programs to discover available cars for the demand are generally similar for each demand, so the timeout demand term T
Denoted by ODEM.

Only the timeout demand for zone 6, the main zone descent, and the demand for the main floor, indicated by the demand word DEMIND, are discussed in detail.

More specifically, the subprogram ACR starts from the terminal 600 and a step 601 checks the indicator TOM.

When TOM is set, main floor timer MFT
Indicates that IM has timed out.

If TOM is set, step 602 is S
Check YSMFX.

SYSMFX, when set, indicates that there is an express vehicle on the main floor.

Indicator TOM is set, indicator SYS
If MFX is not set, the program proceeds to step 603 where it attempts to find a car for the main floor.

If the car cannot be found, the program can exit at terminal 604 (Figure 23B) and return to the priority monitoring program.

This is because it is likely that the car will be sought after due to other types of demand that may be registered.

Alternatively, the program can be arranged to check for some other type of demand and, if it finds one of these demands registered, try to find a car. Since the program loop is very fast, there will usually only be one type of demand registered for any particular run of ACH.

Therefore, in practice, when the ACR discovers a demand and it is unable to assign a car to that demand, the program can immediately revert to the priority monitoring program.

If indicator TOM is not set or TO
If M is set and SYSMFX is set, or if step 603 finds a car, the program proceeds to step 605.

Step 605 is step 5 of subprogram ACL.
In the same manner as described for 10, the calling table C
Command L.

Step 606 checks TODEM for the timeout demand of dune 6, ie, the timeout primary zone drop call.

TOD indicating timeout main zone descent demand MZD
If bit 6 of EM is set, step 6
07 sets bit selection masks LKA and LKO to binary 7 and binary 6, respectively.

Binary 7 and binary 6 are 1'. /), and is then ANDed and exclusive with the call word of subroutine LOOK in step 608 to see if the call zone matches the zone of demand, i.e., zone 6 in this case. are logically ored.

FIG. 24 is a flow diagram of a subroutine LOOK that can be used in step 608 and is inserted at terminal 609.

Step 10 sets the variable PCLV equal to the address of the first word in the call table (PCALLO).

Since step 605 commanded the call table, the first word in the call table will be the highest call in the building, which can be an ascending or descending call.

Step 11 checks the contents of the PCLV. If the call table indicates no calls and the content is equal to O, step 12 sets the cumulative value equal to O and returns via terminal 613 to the program ACH.

If the content of PCLV is not O, step 61 4
checks to see if the calls in the PCLV match the look mask.

Since LKA was set to binary 7 in step 607, ANDing binary 7 with the calling word means that bits 0, 1, and 2 of the first calling word are used to identify the zone. be exposed.

LKO is set to binary 6 and exclusive-or's the binary 6 with the calling zone.

If it matches, the call is a major zone descending call, and step 615 puts the call table address PCLV for this call word into an accumulator and returns to the ACH via terminal 613.

The call is not a zone 6 call. For example, if it may be an ascending call, the program calls terminal 6
16 and step 617.

Step 617 sets <PCLv equal to the address of the first word of the next call in the call table, and step 611
Return to

This cycle begins when zone 6 is discovered and it is detected in step 61.
5 into the accumulator or all calls are tested and no zone 6 calls are found, step 6
This continues until it reaches 12 and puts 0 in the accumulator.

Step 618 of FIG. 23A checks to see if a Thorn 6 call is found.

If a zone 6 call is found, we are looking for a timed out zone 6 call, so it must be tested to see if it has timed out.

Step 619 performs this function and if the call does not time out, the program returns to terminal 616 in subroutine LOOK which proceeds to the next call in the call table to continue searching for timeout zone 6 calls.

If the call times out, the program proceeds to step 620 to see if the call was already allocated.

If so, the program returns to terminal 616 in subroutine LOOK to check the next call in the call table since the car is already in the process of replying to an assigned call.

If step 620 finds that the call is not assigned, the floor of the discovered Dun6 call is made the reference floor REFLR in step 621.

Step 622 then searches for the closest vehicle (AVAD) to this floor that is available and unassigned by the dispatcher and is active.

Step 623 determines whether such a vehicle has been found, and if not, the program ACR
returns to the priority monitoring program via terminal 604.

If the vehicle is found, step 624 includes the OCRNO
Set to the number of the car that was found.

OC RNO is the number of the car to which the assignment is made.

Step 625 provides the binary address of the calling floor which is output to the car in question as signal FADC-FAD6.

Step 626 is the floor address allocation mode MODO,
MOD? Outputs the car allocation, including the service allocation SASS and the service allocation SASS.

If step 606 does not find a timeout demand in zone 6 or step 618 does not find a zone 6 call, or if a zone 6 call is found and step 623 finds a car to assign to the call;
The program proceeds to step 627.

Step 627 checks bit 4 of TODEM for low zone rise, ie, timeout demand in zone 4, using the convention of FIG.

If bit 4 of TODEIvf is set, step 628 checks bit 4 of DEMIND to determine if the vehicle was already assigned to zone 4.

If a car is assigned to a demand, the demand is D
It is removed from EMIND, but it asserts TODEM until the demand timeout call is answered.

Therefore, if a zone 4 timeout demand is found in the TODEM check of step 627, a step 628 is required to see if the car has been previously assigned to this demand.

If DEMIND indicates a zone 4 demand, step 629 finds the lowest climb call for zone 4 and then searches the AVAD for the closest active vehicle that is ASG.

If a car is found for this call, an assignment is made to the car and the program proceeds to terminal 63.

If the car is not found, the program returns to terminal 60.
Return to the priority monitoring program via step 4.

If step 627 does not find a timeout demand in zone 4 or the demand is found and step 62
If 8 does not find a demand in zone 4, the program also proceeds to terminal 630.

From terminal 630, step 631 checks bit 5 of TODEM for the high zone (zone 5) timeout demand.

Upon finding a timeout demand for zone 5, step 632 checks to see if the vehicle has already been assigned to zone 5.

If step 632 finds that no cars were assigned to the demand in zone 5, step 633 finds the lowest rise call in zone 5 and the ASG in AVAD.
The system finds the closest operating vehicle with , and outputs the assignment.

If no call is found in the terminal 633, or if a car is found, the program proceeds to terminal 634 (Figure 23B).

If the call is found but the car is not found, the program returns to the priority monitoring program via terminal 604.

If no timeout demand for zone 5 is found, or a car is found and the demand for zone 5 is DE
If not found by MIND, the program will
Proceed to step 34.

From terminal 634, the program checks bit 6 of DEMIND for zone 6 demand, step 635.
Proceed to.

Upon discovering such a demand, a step 636 discovers the call and possibly a vehicle for the call, and connects the terminal 60 to the call.
Go to step 4, if the call is found and no car is found, go to the priority watch program, and if it does not find the zone 6 call, go to step 637.

The program also proceeds to step 637 if step 635 fails to find a zone 6 demand.

Step 637 performs DEMIN for the main floor demand.
Check bit 2 of D.

Upon discovering such a demand, step 638
DEMA. Bit 2 of S is checked to see if the car has already been assigned to the main floor demand.

If bit 2 of DEMAS is not set, step 639 sets the indicator LOBMZD, AVAD
Check to see if a car is assigned to zone 6, main zone descent.

If LOBMZD is not set, the AVAD vehicle has not been assigned to zone 6, and step 640 sets the reference floor REFLR to the main floor.

Step 641 searches for the closest available car, and upon finding such a car, as determined by step 642, step 643 outputs the main floor assignment.

Step 644 sets bit 2 of DEMAS to indicate that the car has been assigned to the main floor demand and the indicator LOBMZD is reset.

If step 641 fails to discover the car as shown in step 642, the program:
The process returns to the priority monitoring program via the terminal 604.

If step 637 cannot find a demand for the main floor, or it does, and DEMAS indicates that the car is assigned to the main floor demand, the program proceeds to step 645.

The indicator LOBMZD is set (step 63
9) Or if a car is found (step 642), the program proceeds to step 646.

Step 645 resets LOBMZD and proceeds to step 646.

Step 646 checks bit 1 of DEMIND for a basement demand, and if such a demand is found, step 647 attempts to find a car in the basement.

If no car is found, the program returns to the priority supervision program via terminal 604.

If a car is found, the program proceeds to step 648.

Step 648 checks bit 4 of DEMIND for low zone rise, zone 4 demand.

Upon discovering such a demand, Stemp 649 will:
Look for the lowest call in zone 4 and try to assign a car to it.

If step 649 does not find the car, the program returns to the priority monitoring program via terminal 604.

If a vehicle is found or a zone 4 call cannot be found, the program proceeds to step 650.
Proceed to.

Step 650 checks bit 5 of DEMIND for the demand in zone 5.

Upon discovering such a demand, step 651
It finds the lowest rise call in zone 5, attempts to assign a car to this call, and returns to the priority monitoring program via terminal 604.

If step 650 does not find a Zone 5 demand, the program returns to the priority monitoring program via terminal 604.

The program tactics of the program contained herein are hereby modified, altered or improved upon or are subject to the United Kingdom Document Patent 94 assigned to the same assignee as this application except for the joint application originally established herein. 9,7 6
Follow what is announced in 1.

In summary, a new and improved method of allocating floor calls and assigning elevator cabs to floor calls in a new and improved elevator installation has been described to provide improved elevator service.

Certain new floor calls are already in the process of answering calls for elevator use and are in service and direction and location for those calls such that moving through the building in the current direction will allow those calls to be answered. Assigned to the elevator car.

This initial allocation may be made to all suitable cabins, or only to the suitable cabin closest to the called floor.

Those floor calls are reprocessed synchronously to determine if there is a suitable cab that is closer than the cab that currently has that call in the allocation register.

If a closer suitable car is found, the floor call is added to the allocation register and the floor call is removed from all allocation registers of the car containing it.

Thus, the cabs will not move unnecessarily due to calls they will not answer.

This is because the closer car with the assignment will ultimately answer the call.

In this way, the cabs are returned to their available status much faster and they can be assigned to request calls for which the elevator installation could not find a moving cab in a suitable condition. Become.

Such an arrangement provides means for counting the number of descending cabs and the number of descending calls by allocating only one descending call to each descending cab and placing that call in the assignment register for only one cab. without the need to provide
Cab requests are automatically granted when the number of down calls exceeds the number of down travel cabs.

Furthermore, such an arrangement prevents the number of descending elevator cars from becoming greater than the number of descending floor calls.

Therefore, it is unnecessary to set up arbitrary rules for restoring one of the blocked elevator cars to a usable state, which is currently not an appropriate strategy.

[Brief explanation of the drawing]

FIG. 1 is a partial schematic block diagram of an elevator installation in which the concepts of the present invention may be utilized. FIG. 2 is a detailed block diagram of a system processor that can be used in the elevator apparatus shown in FIG. FIG. 3 is a schematic diagram of an instruction cycle state sequence that may be used to execute instructions by the system processor shown in FIG. FIG. 4 is a block diagram of a new and improved software system for the elevator system shown in FIG. 1 that enables the system processor hardware to operate the elevator system to provide improved elevator service. FIG. 5 is a schematic diagram of a pit register used by a software system to determine the most efficient linkage of each running subprogram of its program in response to usage conditions experienced by the elevator system. FIG. 6 shows the input register number shown in FIG. 1 is a schematic diagram of 1 illustrating its use for interrupts such as time interrupts; FIG. FIG. 7 is an illustrative diagram of a call record, call change record and cab assignment table established by the software system to maintain a track record of floor calls and the assignment of floor calls to various elevator cabs in the system; be. FIG. 8 is an illustration of a call table established by the software system illustrating the two words placed in the call table for each floor call. FIG. 9 is an illustration of a timed-out call record established by the software system to maintain a track record of floor calls registered for longer than some predetermined period of time. FIG. 10 is an exemplary diagram of the words established by the software system to maintain the trajectory of system requests, the types of requests, and whether some of those requests have been assigned a lift. FIG. 11 is an illustration of system signal words established by a software system to maintain track of certain types of system requests. FIG. 12 is an illustration of input words received by the system processor from each elevator car of the system. FIG. 13 is an illustration of the output words prepared by the system processor for each elevator car in the system and sent to its associated car controller. FIG. 14 is an illustration of additional terms established by the software system for each elevator car. FIG. 15 is an illustration of zone codes used to fix floor call locations and direction of use requirements, as well as the location and movement of various elevator cars in the associated building. FIG. 16 is a flowchart illustrating a subprogram that may be used for the block software function labeled "Interrupt Execution" in FIG. FIG. 17 is a flowchart illustrating a subprogram that may be used to establish linkages between subprograms of the software system shown in FIG. 4 in response to the bit register shown in FIG. FIG. 18 is a flowchart illustrating the subprograms used for the block software function referred to as "Time" in FIG. 4. FIG. 1 is a flowchart illustrating subprograms that may be used for block software functions referred to as . Figures 2OA, 20B, 20C and 20D show the flow chart used by subprogram CSU shown in Figure 19 to determine the status of each elevator car. FIG. 21 is a flowchart illustrating subprograms that may be used for the block software function labeled "TNC" in FIG. Figures 22A, 22B and 22C are ``AC'' in Figure 4.
Figures 23A and 23B illustrate flowcharts that may be used for the block software function labeled ``ACR'' in Figure 4. 1 illustrates a flowchart that may be performed. FIG. 24 is a flowchart for the subroutine "LOOK" used in the software function. 10... Elevator equipment, 11... System processor, 12... Lifting box, 13...
...lifting passage, 14... structure, 16...
...Rope, 18...Tow sheave, 20...
... Drive motor, 22 ... Counterweight,
24...Governing rope, 26...Governing sheave, 28...Pulley, 30...Pickup, 32...Pulse Detector, 34...
...floor selector, 36...push button array, 38...lifting box call controller, 40...
・Up push button, 42...Down push button,
44... Up and down push button 46...
... Floor call controller, 48 ... Speed pattern generator, γ0 ... Interface function, 1
5...Interface 72...Core memory, 74...Processor, 76...
...Tape reader, 78...Input interface, 80...Interrupt function, 82...
Timing function, 84...Program counter register, 86...Memory address register,
88...Memory buffer register, 90...
...Instruction register, 92...
Accumulation register, 94...Data steering Goethe, 96...Instruction decoder, 98...Cycle state decoder and drawing device, 100...Goethe ing and steering function, 102...Pulse control function, 104...Main oscillator, 106...
Memory read and write functions.

Claims (1)

[Claims] 1. Floor calls from multiple floors of a certain structure,
means for registering floor calls from a plurality of floors of the structure, each of the elevator cars being assigned to a plurality of elevator cars attached to the structure to answer the floor; means for processing a new floor call by issuing a call or request signal to the at least one assigning means of elevator cabs; and means for reprocessing a call, wherein when the reprocessing step finds a different cab closer to the call floor, adding to the means for assigning a cab during the processing step; 1. A method for controlling an elevator, comprising: means for removing a floor call that has been received; and means for adding or assigning the floor call to the means for allocating the closer elevator car. 2. An elevator installation operating according to the method as claimed in claim 1 for a structure having a plurality of vertically spaced floors, comprising a plurality of elevator cars and a plurality of elevator cars for answering the floors. means for mounting the elevator car for movement relative to a structure; descending floor call registration means operable to register calls for downward elevator use from each of the plurality of floors; ascending floor call registration means operable to register calls for upward elevator use from a plurality of said floors, and for each of said plurality of floors as may be required by an associated elevator car load; a car call registration means for each of the elevator cars operable to register a call; dispatching means for assigning registered floor calls to selected elevator cars; assignment register means associated with each of said elevator cars operable to receive floor call assignments, said dispatching means collecting floor calls from said ascending and descending floor call registration means. a certain floor collected by said collecting means by adding a selected floor call to the allocation register of the at least P elevator cabs or by registering a request signal in respect of said call; processing means for periodically processing calls and detecting whether there is a need to reallocate at least a particular floor call to a different elevator cab than the initial assignment; In such an elevator control system, which sometimes has a control for receiving certain newsletters, when all of the floor calls are processed, the means for controlling said fH number. It is equipped with a processing stage f that processes only new floor calls until the
(The processing means described in 1J is sent to the front of a certain elevator car.)
When processing an attached core call, the core call is assigned to the second elevator car according to a predetermined condition, and the core call is assigned from the assignment register of the first elevator car according to a predetermined condition. An elevator control device characterized by eliminating call assignment. 3. An elevator installation operating according to the method as claimed in claim 1 for a structure having a plurality of vertically spaced floors, comprising a plurality of floors... \
an overnight elevator car, means for attaching said elevator car so as to be movable relative to the memorial structure to serve said floor, and registering calls for downward elevator use from each of said plurality of floors. }'' descending floor call registration means operable to register upward elevator calls from a plurality of said floors; and an associated elevator car. a cab call registration stage f for each of the elevator cabs operable to register a call for each of a plurality of said floors that may be required by the loading of a selected elevator cab; and allocation registration means associated with each of said elevator cars operable to receive a floor call allocation of said processing means, said processing means being operable to receive a floor call allocation of said elevator car; In such an elevator system having a first means for collecting the floor call registration means for
1) a second method for periodically arranging the floor calls collected by the first means such that their relative positions correspond to the positions of their associated floors of said structure; means, the first means is provided with means for the second means.
adding the collected floor calls to the end of the ordered floor calls after the arrangement of the floor calls by means of and further assigning certain selected floor calls to the assignment disk of at least one elevator cab or a third means for periodically processing a particular floor call collected by said first means by registering a request signal relating to said call; Means are responsive to said second f stage and t
) When the second means clears the floor calls, it processes all of the floor calls in 1σ, or else it only processes the floor calls that are added at the end of the cleared floor calls. Yes, and furthermore, the third means (4,
When processing a 7" floor call that was previously assigned to a certain elevator car, the floor call is assigned to the second elevator car according to predetermined conditions, and An elevator control device having as a sign that a 0a call from a car assignment register removes an assignment.