DE2111934C3 - Control arrangement for a distribution conveyor system - Google Patents

Description

'U
e ·
he

14. Control arrangement according to one of claims 3 to 13, characterized in that to connect and disconnect the return memory (11) to the output of the sliding memory (6) Unstable switching element is provided as a step switch (14), the set input of which is connected to the clock generator is connected such that it tilted into position at the beginning of the station interrogation interval is, generally the feedback memory (11) is connected, and that its reset input with the comparator (9) is connected in such a way that when the comparator responds if they agree the location identifier at the output of the shift and search memory he in the original Switch position tilts back in which the feedback memory (11) is switched off.

15. Control arrangement according to one of claims 8 to 14, characterized in that a bistable switching element as an input switch (15) for entering the station identifier with the Control electronics connected station and the target identifier contained in the target memory (12) in the sliding memory (6) is provided, the set input with the arrival sensor (Gl) of the Station and an input signal generator (G 4) connected and can be set by them and its Reset input the last of the clock pulses (s 7) of a station query interval for resetting receives.

16. Control arrangement according to one of claims 2 to 15, characterized in that the destination memory (12) either with the output of the sliding memory (6) or with the destination input the station connected to the control electronics (110) can be connected.

17. Control arrangement according to claim 16, characterized characterized in that a bistable switching element is provided as a Zicl memory switch (16), its set input with the arrival sensor (Gl) of the station connected to the control electronics can be connected and its reset input with the yes output of the checking the location identifier Comparator (9) is connected.

18. Control arrangement according to one of claims 2 to 17, characterized in that a bistable switching element as a cancel switch (17) for the information in the first line of the Sliding memory (6) is provided, the set input of which with the arrival sensor (Gl) with the station connected to the control electronics as well as with the yes output of the comparator (9) Matching the location and destination ID is connected and its reset output is connected to the clock in such a way that the last clock pulse (i7) is used as an erase pulse for the first line (7) of the shift memory (6) and its trailing edge as a reset pulse can be used for the extinguisher holder (17).

19. Control arrangement according to one of claims 1 to 18, characterized in that a switching group with at least two bistable switching elements (31, 32) is provided which are connected to a line with the station query clock pulses (ni) and input or arrival signals (e or a ) the transmitters (61 or 64) are connected, with the condition m · (e + α) for setting for the first bistable switching element (31) and m ■ (? l · a) for resetting and for the second bistable switching element (32 ) to set with the trailing edge of the station interrogation clock pulse the first switching element (31) must be set * and to reset the first switching element (31) must be reset, and a gate (38) is provided in the output of the switching group, which is then opened when the first Switching element (31) is set and the second is reset.

20. Control arrangement according to one of claims 1 to 19, characterized in that an identifier (40) is provided, at the output of which all in the system can be requested occurring identifiers appear, and that a further comparator (41) to compare these Identifiers with an entered target identifier is provided, the one in the event of a mismatch the entered destination identifier with any of those supplied by the identifier Identifiers having an output emitting an error signal.

21. Control arrangement according to claim 20, characterized in that the error signal output is connected to a target generator for generating a collective target identifier.

22. Control arrangement according to claim 20, characterized in that the error signal output is connected to a lock transmitter to lock the input station from which the faulty Destination identifier originates.

23. Control arrangement according to one of claims 1 to 22, characterized in that a station having an input port (50) with a lock and for outputting an incoming Object has a switchable switch (52) with a downstream encoder (G 3).

24. Control arrangement according to claim 23, characterized in that the input opening (50) a station is connected to a waiting lane (54), which is in a takeover opening (55) with access opens to the mechanical conveyor circuit (56), which is provided with a lock (57)

25. Control arrangement according to one of claims 1 to 24, characterized in that the stations in parallel on wires (112) of a line connected to the control electronics (110) (111) are connected.

The invention relates to a control arrangement for a Vcrteilförderanlage that a plurality of individual and dispensing stations for objects, which at any station with indication of the destination entered and automatically issued when the destination is reached, the conveyor system in successive Sections is divided, between each of which there is a station, with one with each station electrically connected control electronics, which includes a memory, in the when entering

Objects in a partial route assigned destination information are entered in the order can be taken from the input when the objects leave the section, whereby the Control electronics based on the target information when the respective target is reached, the output of the Triggers objects.

Such a control arrangement is known (DT-AS 12 46 564). In this known control arrangement a memory is assigned to each station of the distribution conveyor system; at every transition of an object From a station in the following section, the destination identifier is stored in a free memory location of the memory assigned to the next station. The memory is entered and queried in such a way that the destination identifier is removed from the memory in the order in which it was entered when the objects arrive at the next station at the end of the leg. Every The station thus has its own storage unit or storage section with a group of storage locations. The disadvantage here is that the storage capacity is equal to the mechanical capacity of the conveyor system have to be. As a result, the effort for the store becomes very great as soon as the distribution conveyor system is installed has a plurality of partial routes. A memory is used in the known control arrangement Magnetic core memory used. Relays can also be used as a memory, as is the case with a similar one working device shows (DT-PS 9 01 158). It is also known to use sliding memory in control use of conveyor systems (AEG-Mitteilungen, 1965, p. 294; conveying and lifting, 1960, p. 363). It In these known systems, the sliding memory is only used as an instruction memory, which is a group of Issue commands in a specific, predetermined sequence after applying a trigger pulse. However, these memories are not used to determine the occupancy of the conveyor system and the distribution of the the conveying objects within the conveyor system and the information accordingly to process.

The object of the present invention is to create a control arrangement that can also be used for control larger distribution conveyor systems can be implemented with little effort.

This object is achieved according to the invention on the basis of a control arrangement of the type mentioned above in that a common memory is provided for all sections or stations, that the memory is designed as a sliding memory in which the information is pushed on, that the memory at each memory location also has space for further information in addition to the destination identifier and that a location identifier is used as further information, which indicates in which Part of the route is where the object assigned to the destination identifier is located, with the Order of information with the same location identifier in the information flow direction of the sliding memory is the same as the sequence of the assigned objects within a section.

The identifier of the input station or the identifier of the sections of the route connected to the input station is entered as the location identifier. The identifier of a station and the identifier or designation of the section connecting to the station in the conveying direction are preferably the same. In the following, it is always assumed that the identifier of a station and the section following the station are the same, because this allows the facts to be represented in a simplified manner. If the identifiers of the station and the following section differ, the identifier of the section is always used as the location identifier instead of the identifier of the previous station.
An advantage of the control arrangement according to the invention

tion is that the maximum storage capacity by the maximum load that occurs entire conveyor system is given. Even if individual sections are stretched to the limit of their capacity are busy, which can happen occasionally,

However, the entire conveyor system is by no means up to the edge of its geometrically possible Capacity full. > It is therefore possible with the arrangement according to the invention because of the use of a shared memory and not

Defined assignment of the storage spaces to certain sections of the storage space is much smaller than it corresponds to the sum of the conveying capacities of all sections. This allows in particular a considerable amount for larger systems

Save control effort. Compared to afterimage controls, in which the load pattern of the system is mapped in a memory, the advantage is that the shift clock is independent of the Conveyor speed of the conveyor system is. at

Afterimage controls must store the information analogous to the conveyor speed Moving the system, as the assignment of the information to the objects assigned to them only through Maintaining the "mapping relationships"

can be ensured. In contrast, in a conveyor system with a control arrangement according to the invention, the working speeds of the conveyor system are: without any influence on the function of the control arrangement.

There can therefore be conveyor sections with different speeds within the same system be provided without affecting the function of the control. Is beneficial finally, that no comparative and no reading

device must be provided at each station, whereby the effort for an inventive Device at each individual station is greatly reduced. By eliminating the reading device on each Station is also switched off a source of interference that repeatedly gives rise to complaints in operation. Another particular advantage of the system according to the invention is that it is very flexible is usable. It is possible to set preferences for certain routes or certain objects.

evacuate, for example, when the items entered at a station at a certain rush hour should be promoted preferentially. Another advantage of the system according to the invention is that that the sliding memory always has a picture of the current

6c tanen load on the plant there, although the order the information in the sliding memory by no means fully with the order of the objects is identical in the conveyor system. The number of blank lines or

Empty levels indicate how many objects or containers can still be entered in the system, without an item having previously been issued anywhere in the system. Is also beneficial.

dal; Sch des der a fine dal an Lc get gei Kl (erv ku wi

du de ric ve sp

ga ur la! Ie

g £ w in L la

bb ο η ie

Kenenden
receive
To suffer

Division (lnung
before-

inordkapag the
η uniqueness
can,
unified
invent-annihilation
u beleiner
ity
ti inslicher
hbildr On-Vor
n the
at
ions
it the
ions
by
«Gc-
- Förnord-
inlay
ier-

; hiedn aniction
ft is
Reading,
would measure
uzicrt
everyone

iusgeerfin-

exible

:in to-

lying-

white

gt da-;

; your-

one-

■ r number;

ι or

iehal-

that in each line containing information Sliding memory after the delivery of an object at any station, at another or an object can be entered again in the same arbitrary station. Finally, the invention opens Device also the possibility of ensuring that always at the stations at which There is a special need for empty containers, these empty containers are also available. Due to the Thus, the control arrangement according to the invention is also suitable for large as well as for Small investments. It can also be expanded without problems because the control arrangement in its mode of operation is not changed during an expansion.

In a preferred embodiment of the control arrangement according to the invention, the output of the shift memory, the one with the last line or level of the shift memory in the direction of information flow is connected, the input of a single return memory can be connected, the output of which is connected to the input of the sliding store can be connected. By switching the single-line feedback memory on and off you can prevent the information of the last line from being sent to the input during the next shift cycle is returned. This makes it possible if this switchover always takes place when there is no information in the last line to remove this blank line from the shift memory. It this allows gaps between the information stored in the sliding memory and the information passing through it conclude.

This makes it easier to use the capacity of the Schicbespcichcrs optimally.

In the control arrangement according to the invention, the order of the information in the shift memory is required does not correspond to the order of the objects or containers in the conveyor circle. It is sufficient rather, if the condition is met that the order of the information is equal to the holder of a partial route, however, any other information in the Memory can be included. In the control arrangement according to the invention, one becomes a container or object-related information only in processing associated with a change subjected when the object passes a "seam", that is, when it is either in the funding circle is entered or a station is reached or left. This cannot be the case with this station only be an input or an output station, but also a switch or an intersection or a transition point to another sponsorship group. It is therefore without additional measures possible, conveyor systems with different conveyor systems, such as flat section conveyors and tower conveyors, which can have any conveying speeds, with the inventive Operate control arrangement. Although the information in memory is stored in of the system do not adhere to a fixed assignment to a specific container and neither to the container Have assigned identification information, it is still surprisingly possible when running in of a container in a station to determine which destination and which location identifier this container are assigned, that is to say which of the many pieces of information contained in the memory are related to this Container belongs. It is sufficient for this to look for the information that is in the direction of the information flow is the first in the memory of all information with the location ID of the previous station. The foremost of this information must belong to the foremost container, which is also the first in the next Station must arrive. The information is therefore available at the point in time when it is needed alone, namely when the object enters a station.

For normal operation, it is sufficient for a simple system if the sliding store is in each Line is able to record the locations and the destination identifier. In a preferred embodiment of the However, the invention has the shift memory in every line or stage except for the location and destination identifier also storage spaces for additional information shifted along with the shift cycle. These additional information can be used for additional information or additional controls. For example, an unlocking signal or a signal for a switch control or the like can also be processed.

The shift memory can have several inputs; for example, each line can have a connector be provided. However, the sliding store preferably has an input in a manner known per se on, the one in the direction of information flow with the first line is connected. Sliding memory with only one input and one or two output connections are considerably cheaper on the market than sliding accumulators with a larger number of connections.

In the preferred embodiment of the invention, there is an occupied lock for the sliding memory available, which triggers a blocking function if there is no free line in the sliding memory. A thing can only be entered in the system if the busy lock determines that the first line of the shift memory is free, in which the information belonging to the entered object is then available is saved. In the preferred embodiment of the invention, this is the busy lock connected with barriers at all input stations.

After an object has been output from the conveyor line, the information assigned to this object is available remove from memory. This can be done, for example, by the fact that this information did not get back to the input of the sliding memory, so for example the supply line to the Input of the memory is interrupted. Or a reset pulse generator is provided that switches off with the gang- or the input of the sliding memory is ver bindable and at the time when the zi canceling information at the output or at the input], delivers a canceling impulse, which the Informa tion clears.

The stations can be constructed relatively simply in the system according to the invention, since they do not Having to compare or read addresses. It is sufficient if, as in one embodiment of the invention provided, a station a sensor for the counter arriving from the previous section stands and a sensor for the following section has incoming objects that are labeled with de Control electronics are connectable.

One feeler indicates the arrival of an object and the other sensor gives a signal indicating the removal of an object the Electronic. If the control electronics are connected to all stations at the same time, the sensors must of all stations still be provided with a special identifier so that the control electronics recognize in which station a process is taking place. However, as in preferred embodiments of the invention provided that the control electronics can be cyclically connected to all stations, the assignment results the sensor automatically, as only the signals from the sensors of the station being controlled are received can. However, a certain minimum speed of the query cycles must be adhered to so that is ensured. that the signal duration of the sensors is longer than the period within which all stations the entire system can be queried.

For connecting and disconnecting the feedback memory to the output of the sliding memory is preferred Embodiments of the invention a bistable switching element is provided as a step switch, its Set input is connected to the clock in such a way that it is in the Is tilted position in which the feedback memory is connected and that its reset input with the Comparator is connected such that when the comparator responds when the match Location identifier at the output of the sliding and search memory it in the original switch position tilts back, in which the feedback memory is switched off. By this arrangement it is achieved that at the beginning of a station interrogation interval the return memory is always connected, whereby the information the last line of the shift memory is transferred to the feedback memory at the next cycle and returned at the next cycle from the feedback memory to the input of the shift memory will. If the search memory does not receive a signal because no object is currently entering the queried station,; o the comparator responds as soon as no information appears in the last line of the shift memory, because then this location identifier 0 is the one in the search memory location identifier 0 is the same. This will be after the next bar at which this O information passes into the feedback memory, the feedback memory is switched off, and this is Empty line removed from shift memory. On the other hand, by switching on the feedback memory at the beginning of each station interrogation interval ensures that after the first shift clock the first line of the shift memory is empty, which is ensured on the other hand. that at the last bar this blank line is in the first line of the shift memory, which means that this line is always free to receive new information. It then only needs to be ensured that the new Information is always entered into the memory with the last shift cycle. Not all of them until then Lines of the memory are occupied, the new information is then always recorded in the memory possible.

In preferred embodiments of the invention, the target memory is so logical with the rest Circuit linked that its input either with the output of the shift memory or with the destination input the station connected to the control electronics can be connected. In the first case, the target memory is used as a buffer for the target information of an object when it only passes through the station, but is not output and its target information is therefore when the object is entered in the next section together with the new location identifier back into the sliding memory is entered. In the latter case it serves as a buffer for the information about a new one entered object that he lasted to

ίο Shifting cycle of the associated station query interval cache !.

The target memory switch is a preferred one Embodiment of the invention a bistable switching element is provided, the set input with the

Arrival sensor of the station connected to the control electronics can be connected and its reset input is connected to the yes output of the comparator checking only the location identifier. Of the The target memory switch then allows the target information

ao tion of the last line of the shift memory in the Target memory arrive when the location IDs of the search memory and the last line of the sliding memory agree if at the same time the associated goals do not match (because

> 5 otherwise the item would have to be issued) and there is also a yes signal from the arrival sensor. In addition, there must be all the control electronics works clocked, one of the clock signals may be present.

When operating a distribution conveyor crane it can happen that the wrong destination identifier is inadvertently used is chosen. If only one undesired, but the existing station is selected, this only has the consequence that the object is

see station being promoted. However, it is accidentally If a destination identifier is entered for which there is no destination station, the result is that the object is not issued anywhere, so it continues to circulate through the system. This will not just do

4 "Space in the system is unnecessarily occupied, but it is In addition, the relevant Geeenstand cannot be found, since mostly nobody knows that "it is in the conveyor system because the person entering the non-existent destination identifier generally does not

realizes that he has entered an incorrect destination ID Has. In order to avoid disturbances caused in this way, in a preferred embodiment of the invention an identifier is provided, at the output of which all occurring in the system on request

Identifiers appear; there is also another comparator to compare these identifiers with an entered destination identifier is provided, the one if the entered destination identifier does not match with any of the

supplied identifiers has an output emitting an error signal. As in a further embodiment is provided, the error signal output with a target generator for generating a collective target identifier be connected. Entering the wrong destination

thus entering a destination identifier that is in the system does not exist, then leads to the fact that the object in question is at a collecting station, which the Collective destination ID is assigned, is ejected, bs is thereby avoided that objects through

the system is "wrong". In another embodiment instead of a target generator, a lock generator is provided which, when the error signal occurs, the associated Input station blocks from which the error

hafte has (give nölij a counter. ncte

tent; and Erfii

strive to follow

F hänj

F Stat

l Res

tion F

river Γ

To kneel

To «kneel

kneel

a do

ation
through-

Zielistann with
iiebc-

nt he
i new
: tzten
rvalls

evoribilcs

to the
rbuncsetzdort-. Of the
»Rnia-

the
ingcn
iiebec to- (because
) and

vorclekrhan-

i before-

1, has

r fal-

^ pus

; t at

itcrer

a
lken-

: r genden
The end-

target-

gift,
At-

itref-

ingsvor-

haftc target identifier originates. This embodiment has the advantage that the person entering the wrong destination identifier realizes that he was wrong. He is then compelled to unlock the input station, enter an existing destination identifier, whereupon the Object is conveyed to the station assigned to this destination identifier.

Further refinements result from the patent claims. In the description below and the drawing shows exemplary embodiments of the invention.

It shows

1 shows a schematic representation of a conveyor line with 4 stations and 4 sections, in which there are 5 objects, to two consecutive ones Points in time

Fi g. 2 a functional picture of the logical relationships with specification of the logical links,

3 shows an example of the time sequence of the flow of information in the stores,

F i g. 4 a cycle time grid,

F i g. 5 a vector group for shaping the signal when entering an object,

F i g. 6 shows a time diagram for the arrangement according to FIG. 5,

Fi g. 7 is a timing diagram for the processes in FIG Station 2 according to Fig. 2,

F i g. 8 a circuit of the search memory for a reserve connection,

F i g. ^l ) a circuit for the detection and treatment of non-existent target identifiers,

10 to 12 show the sequence of the flow of information during an input process,

13 to 15 show the time sequence of the flow of information during an output process,

16 and 17 are a functional diagram of the logic Relationships with specification of the logical links in the input and output process,

18 shows the basic diagram of a station with Output and input with waiting lane,

19 and 19a a functional diagram of the logic Relationships with specification of the logical links during the input process with waiting lane,

F i g. 20 the schematic diagram of a system with several branches and junctions,

Fig. 2! the schematic diagram of a junction with contrast,

F i g. 22 shows an excerpt from the logical link which is based on the arrangement according to FIG. 20 assigned is.

F i g. 23 the schematic diagram of a station with a turning point,

F i g. 24 the schematic diagram of the link between two conveyor systems,

F i g. 25 shows the basic diagram of the link between a horizontal and a tower conveyor system and

F i g. 26 shows the basic diagram of the station connection to the control electronics.

In the simple system shown in FIG. 1, the conveyor comprises 4 sections with the numbers / 1, / 2, / 3 and / 4. At the transition points between the sections there is a station 3, which can be designed as an input and / or output station . The stations also have numbers, whereby the station with the number / 1 is followed by the section with the number / 1 in the conveying direction, then station II and then the conveyor station with the number / 2 , and so on. In such a system in its simplified form, a distinction is made between the following signals: An input signal, which reports the entry of a container into the train, an arrival signal which the

S reports the arrival of a container in a station, and an output signal that the sleuerelectronics emits, when a container has reached its destination and is to be removed from the track. The common one Shift memory of the Stcucrelektronik contains the target information of all containers that are currently in the system and as a location identifier in the the same line is the number of the section or the number of the section in front of it in the conveying direction Section lying station. The arrangement of the information in the memory indicates how many objects are in the system and in which order the objects in the individual sections to run.

In principle, it is possible to enter objects of any shape into the system. However a special effort is then required in order to reliably capture the most varied of objects. It is therefore common in such distribution conveyor systems to put the objects in the container 4 and these To promote containers in the plant. This not only has the advantage that the objects are resistant to transport stresses are protected, but it also has the advantage that because of the uniform shape of the Container the actual conveyor belt as well as the various sensors and grippers on this constant Shape of the container can be aligned. It will therefore always be used in the further description We speak of containers, which, however, is to be understood as the same as the one previously used Designation "object".

In FIG. 1, at a certain point in time there are no containers in section IX , three in section II , one in section / 3 and one in section / 4. The container in section / 4 has the destination information / 1 , should therefore be output in station / 1. The container in section / 3 is to be conveyed to station II and the containers in section II are to be conveyed to stations / 4, / 3 and / 1. At a somewhat later point in time, the containers 4 are in the position shown in dashed lines. In the meantime, the foremost container with the destination information / 4 in section II has passed station / 3. As a result, this container is in the last position in the section / 3, and the following container in the section II with the destination information / 3 has moved to the first position within this section. The sliding store assigned to the system, which is not shown in FIG. 1 shows an empty 1st line, in the 2nd line the location identifier / 4 and the destination identifier / 1, in the 3rd line the location identifier II and the destination identifier / 1, in the 4th line the location identifier II and the destination identifier / 3, de in the fifth row dii location label Il and target identification / 4 and in the sixth line, the last line of the example, the state ortkennung / 3 and the destination identifier / 2. The radius thus indicates that / 3 a Beb al ter is in the leg 4 with the aim Il and in the leg / 4 Be a holder to the target / first In addition, de memory indicates that there are 3 containers with the target identifiers / 4, / 3 and / 1 in succession in the section II. When passing the container 4 ni

21

/ 3 becomes this in- 934

and new information is entered in the input of the shift memory, which in turn is the destination identifier / 4 in which, however, the location identifier / 2 is converted into the location identifier / 3 to indicate that the container is now in the section / 3. At the time the in F i g. 1 is indicated by the dashed container, the sliding memory has the following information on, with the line content starting from the 1st line in the direction of the 6th line, i.e. in Iniormationsflußrichtung is indicated and always first the location identifier and then the destination identifier is indicated: »5

3.4; 4 1; 2 1; 2.3 and 3.2.

In Fi g. 1 is the conveying direction through a Arrow 1 indicated. The route numbers are each set in a circle, and the stations are 3 represented by a pentagon with an inserted number. The containers 4 run in the direction of arrow 1 along the sections.

F i g. 2 shows the logical links between the functional groups working together with a shift memory 6. In the example shown, the shift memory 6 has six lines or stages 7, which are connected one behind the other in the manner of a shift register, which therefore shift their information into the next following line with a shift clock. The first line is connected to an input and the last line to an output. Otherwise, lines 7 have no connection to the outside. The 6th line 7 is connected to the output, the 1st line 7 to the input of the shift memory 6. The sliding memory 6 has two columns 8 in the example shown. In one column are the specified location IDs, which are marked with a T. The other column contains the target IDs, which are marked with Z. Both the location IDs (T) and the destination IDs (Z) are each additionally provided with the associated line number of line 7.

A comparator 9, which also comprises two columns, is connected to the output of the shift memory 6. The column of the comparator 9 labeled Kl is connected to the 6th line 7 of the shift memory 6 , which has the location identifier, and the column of the comparator 9 labeled K 2 is connected to the 6th line 7 of the shift memory 6 containing the target information. A search memory 10 is provided, the two columns of which also contain a location and a destination identifier. The comparator 9 emits two different output signals, depending on whether only the Slandortkcnnung or the location and destination identifier of the 6th line 7 of the shift memory 6 and the search memory 10 match.

The station numbers, the section numbers or the location and destination IDs are in the text each indicated by a slash in front of the relevant number. In the drawing this slash is omitted.

Another one-line memory, a return memory 11, which has as many columns as that Sliding memory 6 can be connected with its input to the 6th line 7 of the sliding memory 6. It can increase the number of lines by one by connecting the feedback memory to the shift memory 6 will. From the feedback memory 11, the information is returned to the input, that is to say the first Line 7 of the shift memory 6 is supplied.

A target memory 12 is single-row and single-column. A destination identifier is stored in the destination memory 12 either entered when an object is entered into the conveyor system, or the destination memory receives it 12 a target information from the corresponding column of the sixth row 7, if the comparator 9 a match between the location IDs in the 6th line 7 of the sliding memory 6 and the corresponding column of the search memory 10, but no match · of the associated target identifiers notices. In this case, it is a container that enters a station but is not dispensed should be, but should continue. Its destination identifier is so long in the destination memory 12 cached until it enters the next section.

For the sake of clarity, it should be pointed out that a column in a memory is not a capacity of one bit means, but has a capacity that is sufficient for a word of several bits. If, for example, words with eight bits each are provided for the identifiers, one column has space for eight bits on the same line. Each of the named columns can be divided into any number of Be divided into columns. The columns are shown in the selected type for the sake of simplicity. It is also understood that the information in the columns is contained in binary code and that When comparing two columns with each other, there is only agreement if all bits of the to comparative words agree with each other.

An occupied memory 13 is connected to the 1st line 7 of the shift memory 6. It is enough to connect the busy memory 13 with one of the two columns 8 of the sliding memory 6, because in both columns 8 either contain information at the same time or no information at the same time. The occupied memory 13 checks whether the 1st line 7 of the shift memory 6 is free. Entering a A signal in the shift memory can only take place if the occupied memory 13 has determined that the 1st line 7 of the shift memory 6 is free.

To control the memory arrangement described and to achieve the desired logic operations, four bistable switching elements are provided, which are denoted by Fl ... F4. These are preferably flip-flop circuits, a step changeover switch 14, an input switch 15, a target memory switch 16 and a clear switch 17. The step changeover switch 14 is set with the station interrogation clock signal; In this position of the step switch 14, the return memory 11 is connected to the 6th line 7 of the sliding memory 6. The number of lines in the shift memory is thus practically increased by one, since the information is fed back from the feedback memory 11 into the input of the shift memory. The step switch is then reset to its other position when the part of the comparator 9 comparing the location identifiers in the last line of the shift memory 6 and in the search memory 10

spe.c «ms

/ to

15 16

to the

aar. It reports a match. That is, for example, the last of the shift clock pulses then closes again; The case when the search memory does not send any information to a station interrogation pulse, by means of which the station interrogation pulse has just been increased because no interrogated station is separated from the control electronics in the station that has just been scanned, the container is entered or arrives, and if and the next station to be interrogated arrives the control unit contains an empty piece of information in the last line of the sliding electronics. The shift clock memory 6 is included. It is characterized impulse of the effects of phase, which are denoted by si ... si, be excluded tig switch is reset and it is switched off by the clock over a line 18 to a gate circuit 19 and ennung recycling storage. 11 This has resulted in a gate circuit 20. The gate circuit 19 is designed so that the empty information disappears. It then becomes permeable when the location IDs store achieves this in such a way that the information in the comparing part of the comparator 9 (Kl) is "compressed" in a sliding memory 6, so that the signal delivers because the location IDs correspond to 9 sliding memories 6 is fully exploitable and do not agree. If the gate circuit 19 is permeable, then empty lines contained in the information are then sent to the reset input of the nd block the memory space. In the logic equations can target memory switch 16, the changeover switch 14 of the tap but S ^{s' st of the} switching state in which the Stufenumschal- 15 and to the clear input of the return memory 11. ennun- ^ter ^ is set. with / 1, the other state with Jl. This denotes the information in the return 1 one. A resetting of the stages the changeover switch 14, memory 11 deleted and the switches 14 and 16 zuit Removing ^{a 'em so} separating the return memory 11 by the reset. If, in addition to the location IDs, the output of the shift memory 6, the destination IDs that the comparator 9 _{compares also occur} if the location ID in the last line 7 is the same as 20, and is also the target memory area shift memory 6 and in Search memory 10 is set to match switch 16, then the shift clock vote occurs, namely when an object arrives. The pulse from the clock line 18 also ^{reaches the digit earths w} ' ^rc * by the fact that this object is passed to the extinguishing switch 17 and also triggers the apazi-assigned information from the memory taken from the container, which at this point in time> acity ^men ' ^{s0 w} ' ^{e becomes} the blank line beforehand. If it is 25 arrives at the queried station. The last sliding calibration around a container that is to be dispensed, clock pulse si , is supplied on a line 21. He _em jj then also matches the target identifier in the last one, except for the advancement of the shift point for Ί-eWe 7 of the shift memory 6 and in the search memory chers 6 by one step with its trailing edge that each 1 * matches, and the container is output and Resetting the delete switch 17 and the step \ _from the associated information completely deleted. Handles 30 changeover switch 14 and input switch 15. Unless it is the case with the incoming container, however, he deletes the information in the target memory 12 _{s [e} j] _t for one with a different target address, which therefore knows and is in the search memory 10 Finally, the 1 deletes the run, so before the complete deletion of the shift clock pulse si , the information in the jgß of the information, the target identifier, is transferred to the target memory first line 7 of the shift memory 6, if a gate 22 is in, and together with the last shift clock - 35 is open, which is then and only open when, _{r to} men with the location identifier from the search memory, the delete switch 17 is set. Since the erase _{switch ί η} in the first line of the shift memory 8 again only 17 only given with the trailing edge of the shift clock pulse t a. si is reset, at the time of arrival _a b _e j. The input switch 15 is either set when the sliding clock pulse si the gate 22 is opened. Col- when an arrival signal from the sensor of the station 40 is _{emitted in front of the input of the target memory 12, a jj J n is} given, which indicates that a container is connected to the OR gate 23, which has two inputs: rma station is arriving; the input switch 15 is also set between the one input and the destination input- _Λ j _st when a container is signaled into the station, a gate 24 is switched, which is permeable, jj _e η and if at the same time the occupied storage when the busy memory 13 not busy indication ines ^c ^ ^er * "* ^{'EER" st} "is reset the Eingabeschal- supplies 45, so indicating that the first line of the pushing _(" _ _he ter 15 always by the last shift clock pulse of a memory 6 is released is prior to the other input of the Lj station polling interval OR gate 23, a gate 25 connected to the ';.. the target memory switch 16 is set _orc by the destination identifiers of the 6th row 7 of the shift j_ arrival signal . the station provided on the managerial memory 6 are supplied and which then pass' ^ers ° d ^he timer is reset the paste destination 50 is sig when the following conditions are met: supply _"before cherschalter 16 through one of the Schiebetaktimp. ulse same Kl yes, comparator K 2 no, target memory _lan _ when the switch 16 comparing the location identifiers is set, any shift clock pulse si ... do part of the comparator 9 reports agreement. s 1 present,

. _well y. The delete switch 17 is set when the input of the feedback memory 11 is over

_sc h_ the output of the station is activated, namely in 55 two lines with the 6th line 7 of the sliding memory

_m j _t the case in which the comparator 9 connected chers 6 match. In these lines is a double

; _part of the location and destination identification and switched gate 26, which then transmits the information

jj _ir _ at the same time, the target memory switch 16 is triggered if the comparator 9 K 1 does not match

_rs g future signal is set. The delete mood is reset if the level switchover is activated at the same time.

^ _CTS switch 17 is always set by the last of the shift clocks 14 and also one of the shift clocks

j _em impulses. impulseil ... si pending.

_den The clock pulses, the raster of which is described later, the busy memory and those from the gate 22

j _en will repeat themselves periodically. You start each extinguishing pulse line are immediately on

_age wcils with a station interrogation pulse that controls the corresponding inputs of the sliding memory 6

Y y _n ; electronics with the respective station to be queried 65. The ones to be entered in the sliding memory 6

, Cj ₁ . binds. Following the station interrogation pulse, information must each pass through an OR gate 27,

_s 9 follow 1 + 1 shift clock pulses, where / equal to the inputs of the two columns 8 of the shift

1 is the number of lines 7 of the shift memory 6. Are connected upstream of the memory 6. Either of the two

17 ¹⁸

OR gates 27 has three inputs. At the target identifier / 3. This target identifier is in the target j

At one input, the information memories / 12 are stored via a double gate 28, and with the last _{it is}

mations from the return memory 11 can be supplied. Shift clock pulse in the first line of Schiebespei- fj _ar

The double gate 28 is permeable when the digger 6 together with the identifier of this station _sch

window switch 14 is set and if 5 or the following also have the same identifier - _{{£ t%}

one of the shift clock pulses sl ... s6 is pending or the section is entered as a location identifier. Since _Sta

if instead of one of the shift clock pulses s 1 ... s6 the empty return memory with the station interrogation _sic ,

Shift clock pulse ^ _ar is pending and at the same clock pulse CONNECTED of the Scluebespeicherausgang

Input switch 15 is reset. sen is achieved that after the first sliding _egg

At another input of the OR gates 27 is io clock pulse the 1st line contains a blank information. _the

a double gate connected 29 via which the infor- _as Da during a sliding Stationsabirageintervalls

mations from the 6th line 7 of the shift memory 6 clock pulse is received more than the shift memory 6 _Sta

be fed; the double gate 29 is below the lines, this blank information is _{un (}

same requirements as the double gate 28 after the 7th shift clock pulse again in the 1st line; _{qu (}

öfinet, with the exception that the step switch 15 it can thus with the 7th shift clock pulse s 7 a _Za

14 must not be set, but must be reset. Since new information is entered_ _larger

the step changeover switch 14 occupies only two layers, The subsequent to the shift clock pulse 57 _mu

is thus achieved that either the station request clock pulse switches the station / 1 from _the

from the 6th line 7 or the information from the control electronics and switches the station / 2 to _Be ;

Return memory 11 reach the OR gates 27. 20 the control electronics. During this process

The third input of the OR gates 27 is via a changes the memory content and the position of the _Sta

Double gate 30 with the output of the target memory 12 memory contents not. In Fig. 3 is now for the pö

or a station number transmitter (not shown) Station / 2 is shown, which occurs when a J ₁₃ ]

tied together. The double gate 30 is open when not. for the station / 2 specific container. _There

the input switch 15 is set if, in addition, 25 an arrival sensor of the station / 2 delivers an α-signal, 40

the shift clock pulse 7 is pending and when finally the arrival of an object in the station _we

In addition, the delete switch 17 is reset. indicates. Thereupon the search memory in later _ar)

In Fi g. 3 is an example of the time sequence of the manner to be discussed entered information, \ y,

Flow of information in the stores. which, as the location identifier, is the identifier of the previous

The station interrogation pulse is used to identify the station to be departed and the identifier _se j as the destination identifier

interrogating station connected to the control electronics. of the queried station. After the second §cl

The position of the information in the shift memory shift clock pulse is in the 6th line of the 40th

is in the columns between the 1st station shift memory, the information 1, 4, so the state χ _ν

further switching pulse and the 1st shift pulse pulse dar- ortknung / 1 and the target identifier / 4. The location _v0

posed. For example, the 3rd line is an identifier in the 6th line of the shift memory Correct Gr

Empty line. The 1st line is also an empty line, because it corresponds to the location identifier in the search memory ^ ₆

no new information in the previously queried station; however, the two target IDs are incorrect _s \ _c

formation has been entered. The level changeover matches. Since the location IDs match, st;

ter 14 was activated with the station interrogation pulse, the step switch 14 is connected to the fc _e

puts. As a result, the feedback memory 11 is reset to 40 the 3rd shift clock pulse s 3. Also d _e

6th row of the sliding store connected. According to this, the target information from the st;

the first shift clock pulse, all information 6th line of the shift memory in the target store incoming _e h

moved forward by one line. The information given out. Then the processes run like

the return memory is already described in the 1st line of the shift. With the 7th shift clock pulse j _m

spieichers migrated, the information from the 6th line 45 is _en the destination identifier in the search memory as new stand-

of the shift memory 6 is in the return memory location identifier and the destination identifier in the destination memory as b _e

hiked. After the third shift clock pulse, the target identifier is in the 1st line of the shift memory 6 d _e

there is blank information in the 6th line. Entered there. _m ,

the search memory also contains empty information. the station subsequently queried / 3 _d j,

holds because there is no arrival signal from the corresponding 50, an output of an object is now written to f ₀

the encoder or sensor of station / 1 is present, ben. The arrival sensor of the station reports _ra

the comparator 9 matches the location / 3 the arrival of a container with a «signal. _a j-

identifier fixed. It is thereby the gate circuit 19 The a signal causes the search memory as _nE

conductive, and the next shift clock pulse, the location identifier the identifier of the previous $ t

4. Shift clock pulse, flips the step switch 14 55 station and as the target identifier the identifier of the departed-] _a

um, so he puts it back. As a result, the station in question is entered. After the second yes

the comparator 9 puts the empty information from the 6th line of the shift memory shift clock pulse j2 over-] j ₍

chers not back to the input of the sliding memory match between the location and destination ID of § _£

chers is returned. The step switch 14 last line of the sliding memory 6 and the search J ₁

thus practically causes the shift memory to be fixed to 60 memory 16. This will produce an output _c \

together with the feedback memory 7-stage, if an impulse is triggered, the mechanical output of the _er

the step switch 14 is set, and that initiates the at- container in the station. On the other hand, _{V (}

the memory together have 6 levels if the Stu-, as already described several times, the Stu- _ni

switch 14 is reset. Reset during the stage changeover switch 14, whereby at the same time

tionsabfrageinlervalls, so in the period between 65 associated with the container information disappears _ze

the 1st station interrogation pulse and the 2nd station det. The destination memory does not contain a signal and it becomes ^ i

_{query clock pulse, no new information s} j is generated in the example shown with the 7th shift clock pulse

an object entered into the station / 1 with the delivered to the input of the sliding store 6. p,

Aim
espeitation
iron There
question-
: hlosiiehalts.
dear 6
iation

from
'2 on
; angs
ι des
• the
sines
Diels. :
gnal,
ition
) ater
ben,
■ production
: iten

of
andlortnmt
■ pei-

ot
nen,
Jen- :
the ■:

the
a '.

how
duIs
ind-:

as
rs 6;

n / 3 i
rie- j
tion '
nal.
as

the :
ige-:
iten;
Herder
chbe-
of
/ ird
ituitous
r'm- • ird
ion

The following considerations apply to the dimensioning of the cycle time grid. During the time in which the conveyor belt moves the distance that corresponds to the prescribed, smallest distance between two containers, a container gap, all; Are stations of the plant once queried to ensure order I that eic pre- • transition is happening at any station that is not detected. Taking the i for simplicity, that the time intervals between the individual shift clock pulses are as great as between the last shift clock pulse and the station interrogation pulse and the station polling pulse and the first shift clock pulse, then the frequency of the clock is equal to the product of the - multiplied number of stations with the number of rows in the sliding store increased by two and multiplied with the belt speed and divided by the minimum clear distance between two containers.

For example, if a distribution conveyor has twenty stations that need to be queried cyclically, this is Conveying speed 1 msec, and if the minimum clear container distance is limited to 4 cm, the Duration of the gap signal 40 msec. All twenty stations must be queried within this 40 msec will. A time period of 2 msec comes into consideration as the time duration for the station scanning interval. The sliding memory now has 48 lines, which means that 48 containers are in the system at the same time can be, the time interval between two shift clock pulses is 40 | isec. This time interval from 40 nsec results in a clock pulse frequency of 25 kHz. If one takes into account that clock pulse frequencies of 1 MHz are completely common today and around one Order of magnitude higher clock pulse frequencies do not cause any technical difficulties, it can be seen that that it can also be used in large systems with many stations and a multi-cell sliding store there is no difficulty in interrogating all stations during the container gap once and for each Station query to let the entire sliding memory content circulate once.

Although there is always only one blank line from the shift memory within a station interrogation interval can be removed and it is therefore possible that a blocked status is reported when the station is queried is, even though one or more lines are still free in the shift memory, this has no meaning because the station interrogation intervals follow one another so quickly. Since all stations during a period of 40 msec, for example, but even under the most unfavorable circumstances at the latest After two or three queries from all stations, a free line is available as long as it is If there is still a free line in the dispatch memory, this does not result in a noticeable one Impairment in the operation of the system. Even if all stations were queried multiple times, until a free line was available at the input of the sliding memory, this would be the one for this The time required is still only a fraction of a second, so it would generally be at all not be noticed.

The e and α signals occur at the individual stations at unforeseeable, completely arbitrary times. In addition, these signals can differ in their length and shape, especially with regard to their rise and fall times. In order to be able to guarantee reliable processing of these signals in the control electronics, these signals are transformed so that they are available in the correct form and at the correct time. For this purpose, a switching group is provided, which is referred to as a signal scanner and is shown in FIG. 5 is shown. The signal scanner comprises two bistable circuits 31 and 32. The two bistable circuits 31 and 32 are

ίο preferably designed as a flip-flop. Each of the set inputs and each of the reset inputs is connected via a gate 33, 34, 35, 36 to a pulse line 37 which carries the station interrogation pulse m. The gate 33 in the supply line to the set input of the bistable circuit 31 is permeable when an e or an α signal is present. In the same way, the gate 34, which is connected to the reset input of the bistable circuit 31, is conductive when neither an e nor an α signal is present. The gate 35 in the supply line to the set input of the bistable circuit 32 is permeable when the bistable circuit 31 is set. Conversely, the gate 36 in the feed line to the reset input of the bistable circuit 32 is permeable when the bistable circuit 31 is reset. In addition to the four gates 33 to 36, the pulse line 37 is also led to a further gate 38 which is permeable when the bistable circuit 31 is set and the bistable circuit 32 is reset. Behind the gate 38 there is then a clocked e-signal on an e-signal line. The e or α signal coming from the sensor of the interrogated station is generally much longer than several complete interrogation cycles. Since the stations are interrogated periodically, the e or a signal is broken down into a sequence of signals which each have the length of a station interrogation interval. At the end of the first station interrogation interval, in which the e-signal appeared, the bistable circuit 31 is set with the station switching pulse m. The bistable circuit 32 is set at the subsequent interrogation cycle m, which is thus one full interrogation cycle, during which time all other stations are interrogated, from the first interrogation cycle m. Since this interrogation pulse m does not set the bistable circuit 32 until its trailing edge, it is able to pass the gate circuit 38 and appears at the output of the signal scanner on the e-signal division as a clocked e-signal. Since the state that the bistable circuit 31 is set and the bistable circuit 32 is not set. can occur only at the beginning of an e or an α signal, it is ensured that only a single clocked c or α signal is generated, regardless of how long the e or α generated by the sensor or transmitter of the station -Signal is.

Only when there is no e or α signal at the input during the cyclic station interrogation can a next gc keyed e or α signal be generated and appear on the line 39 with the next station interrogation interval.

The timing diagram associated with the signal sampler is shown in FIG. 6 shown. In the first line are the clock pulses continuously shown. In this representation, the stalion interrogation clock pulses differ in Polarity and shape do not depend on the shift clock pulses. The only difference is the impulses by their time interval. In Fig. 6, the signals of a searcher are shown, which the code

ruing the queried station and supplies the identifier of the previous station. The search engine includes two ring counter, which is switched with the frequency of the station query clock pulses and whose number of stages is equal to the number of stations. The two ring counters deliver the station address and an address delayed by one. An interrogation cycle is carried out when the ring counter rotates.

All further clocks are derived from the clock pulse shown in the first line. With the station interrogation pulse is the ring counter, which for example consists of a flip-flop chain, switched. The second ring counter can then be controlled in such a way that the count of the first ring counter is shifted over to the second ring counter with each interrogation cycle. In order to it is automatically achieved that the station address in the second ring counter is always one behind the im chasing the first ring counter.

The timing diagram of all the processes described in the various memories, switches and comparators is shown in FIG. 7 for the passage of a container in station II according to FIG. In the first line, in which the clock pulses are shown, the station interrogation clock pulse, which connects the station II to the control electronics, is denoted by ml. The information content of the relevant line of the specified memory is shown in the lower five lines. The first number means the location ID and the number in brackets next to it means the destination ID. In the last line, in which the target memory is shown, only the target ID is given. The information is contained in each case from the point in time on in the corresponding line of the memory, which is represented by the left boundary of the field in which the information in FIG. 7 is registered. As can be seen from FIG. 7, the switching processes always take place with the trailing edge of a clock pulse.

With a conveyor device according to the invention, it is possible to continue this later without difficulty expand and adapt to growing needs. Reserve connections for additional stations provided, but at which there are not yet any stations. The reserve portsc however, they are already provided with an identifier. You will be in control electronics like a already in operation station treated. The advantage is that with a later Installation of the corresponding station, no significant changes to the control electronics are required. The input of the identifiers in the search memory 10 takes place via an additional double gate, its Gate conditions are written in Fig. 8. This one Gate, the station IDs supplied by the two ring meters are entered.

Operating errors cannot be ruled out in any system. In the case of the conveyor system according to the invention, it is therefore ensured that incorrect identifications given when entering the container do not lead to a disruption in operation. In this context, incorrect identifications are understood to mean identifications that are not present in the system, that is to say are not assigned to any station. If a container with such a misidentification were entered as the destination ID, the result would be that the container would never be output from the system, since it can never reach the destination assigned to it, because this destination station \ si «,

does not exist at all. j dci

It is therefore provided either when entering; sigi

a misidentification the entry of the container to i _sc h

block or the container a Sammelziel- j assign an identifier which causes the container \ Zic is output to a collection station. The relatively slight expansion of the circuit required for realizing this task is shown in FIG. 9 i total

ίο shown. The core of this arrangement is a switching din group 40 on the basis of a start pulse sequence all tioi gradually, in the existing _system: NEN destination identifiers can appear at its output. The ; as a destination input takes place, as before, with the 'we e-signal via the gate 24 to the OR gate 23 and; \ On to the destination memory 12. The destination memory in the I fon 12 stored destination identifier is connected to a DES \ SEN output to comparator 41 with the; tats target IDs at output 40 compared. j wui

It is also still a destination identifier switch 42 \ the provided which is processing to a bistable formwork \ g fi _C, preferably is a flip-flop. The i, target identification switch 42 is controlled by the <- sets Signal overall \ mn when it has passed through the gate 24?. The same J itself

Signal starts after passing the gate 24 also i Stei the switch group 40, which then starts the other one after \ sarr the valid target IDs at its output '■ ^Sta: to produce. The target identification] wci switch 42 is reset by the last shift clock- \ halts

impulse ί 7. j 5]

If the comparator 41 establishes a match! between the destination identifier in the destination memory 12 and | If a target identifier is set at the output of display group 40 \ Stat, input switch 15 is set. The set j K01

For this purpose, the input of the input switch 15 is connected via an OR link 43 to a gate 44 \ scli \ to which a counting cycle is fed via a line 45 j zwii. The J Stat counting cycle supplied via line 45 also controls the respective advancement of the j stell

Switching group 40 from target identifier to target identifier. \ Find the frequency of the counter clock on line 45 is j tive, high that certainly before the last shift clock \ ersl · the station polling interval of Priifvorgang finished \ Trai is thus already wen with the last shift clock the \

There is a decision as to whether the entered! to target identifier is allowed. If the input switch 15 j is a set because the comparator 41 match j far has determined, a transfer of the target identifier from the target memory 12 to the shift memory 6 j Einj

take place. Remains constant during the test, the compliance I c mood, the input switch 15 remains in I to its reset position, and it may be the gela in the j input of the container entered incorrect Zielken- \ whether c not drying from the destination memory 12 in the Shift memory j to d

more likely to get 6. Instead, a collective target; his identifier is entered in the sliding memory 6 together with ' eige of the relevant location identifier. To ; Dab this end stands on an unillustrated \ Ven line, the collective address constantly, and this [practicing line is connected via a gate circuit with a detection weite- I REN input of the OR gate 27 \ for the target container. This j in the course of the LEI \ In processing the collection target identifier switched port Zun is then transparent when the input switch 15! would exist

is reset, at the same time the target identifier switch L tels 42 is set and also the delete switch 17 j mitti is not set and finally also the last one; Dan Shift clock pulse of the Stalionsabfraeeintervailc nn. ; <*; »» '

!station

input
ters to
target holder
) ic to
relative
Fig. 9
Switching step
nd
eats. the
lit the
and
storage
to desnit the

liter 42
Sounds. Of the
nal same

even
l entrance
voltage actuation

nmung
and
ppe 40
τ setting purpose
Gate 44
un 45
j leads c
ten of
naming.

it's so
: clocked
ends
its the
icbene
older 15

stands. It is also possible in a simple manner instead the input of a collective target code a blocking signal to be provided by the corresponding gate circuit with the conditions just described causes a blocking of the station in which the wrong destination ID was entered, so that at this Station no container is accepted by the conveyor system as long as the destination identifier is not corrected is. In practice, however, the procedure is that the input digit of a station is basically locked and if a blocking signal does not appear, i.e. if the target identifier is recognized as correct, the lock is released.

In the described, simplified embodiment of a conveyor, it was assumed that when a destination identifier is entered in the memory, a container actually gets into the system. It was also assumed that when it reached its destination, the container would definitely be challenged off the track. If these requirements are not met, malfunctions can occur. In order to eliminate such disturbances, i.e. to make the system safe to operate, a certain extension of the control electronics is required, which is described below together with the stations. A station as shown in FIG. 18 is shown schematically, has an input opening 50 for the input of the container, which is provided with a removable lock 51. In the simplest embodiment, the lock 51 is immediately followed by the transition to the transport path. In addition, the station has a switchable switch 52 in the form of a contrast switch. The switch 52 consists of a pivotable bracket which is pivoted into the transport path and forces an incoming container to move into a stopping lane 53. Several transmitters are assigned to each station, which determine whether a container is located at the transmitter's location. Such transmitters can act photoelectrically, inductively, capacitively or mechanically. A first encoder G 1 is attached to the transport track upstream of the station. This transmitter announces when a container arrives on the transport path in order to prevent a collision between an entered container and an arriving container. Another transmitter G 2 is provided below on the lock 51. The transmitter G 2 controls the entry of a container. In the vicinity of the switch 52, the parking lane 53 is provided with a transmitter G 3, which controls whether a container has entered the parking lane. In addition, the transmitter G 3 can indicate whether the parking lane is free or occupied. Subsequent to the encoder G 2, a waiting lane 54 can be provided which opens into a transfer point 55 which forms the actual transition to the transport path 56. A removable lock 57 is provided at the transfer point 55. In addition, another transmitter G4 is provided at the transfer point 55. The G 4 transmitter controls the transfer of a container from the waiting lane to the transport lane. When an input is made, the following processes take place: First, the container is placed in the locked input opening 50. Its destination identifier is entered by means of a numeric switch (not shown) or by means of a key on a keypad. Then the actual input process is triggered by pressing an enter key. The lock 51 is thereby released, and the container arrives in the waiting lane 54, where it remains until the lock 57 is released. The transmitter Gl detects the arrival of containers on the transport path 56. The acceptance of an entered container by opening the lock 57 is released when the transmitter Gl indicates that the transport path 56 is free. The takeover of the container by the transport path is ensured by the

ίο G4 encoder checked. Isn't the station with a Provided waiting lane 54, then the lock 57, the transfer point 55 and the transmitter G4 are omitted. The input opening 50 then opens directly into the transport path. With the first on the actuation a station query following an enter key is the set destination identifier in the destination memory 12 entered, provided the sliding memory is not fully occupied, so the Beselztspeiche 13 a free signal gives away. In addition, the identifier of the following

ao partial route, which is equal to the identifier of the queried Station is entered in the search memory as a location identifier. The sliding memory 6, the comparator 9, the search memory 10 and the return memory 11 are provided with a further additional column, which is used to record special information. This special information is initially in the corresponding additional column of the memory with stored and indicates that the container is not yet is entered into the actual transport path 56.

The target identifier is now checked. Is this positive and the transport path 56 in the Area of the encoder Gl free, which is determined by the fact that Gl no arrival signal for several seconds releases, the lock 51 or, in the case of a station with a waiting lane, the lock 57 canceled, and the container arrives in the transport path 56. The transmitter G 2 or at a station with waiting lane 54 the encoder G4 now gives confirmation the input of the container within the unlocking time the actual e-signal, the input signal with which the aforementioned special information is deleted again. This shows that the container is actually in the transport path.

If the input key is pressed at a station without a container in the input opening is located, there is no signal from G2 during the unlocking time except for the special information the entire associated container information in the memory is deleted again.

Just like the input, the output is also controlled by an encoder. The output may only then take place when the space in the parking lane 53 in front of the encoder G 3 is still free. Reached a container its target, but cannot be ejected because the Abstellspul 53 is occupied, the counter-switch may 52 must not be actuated, otherwise a collision would occur. In this case the container stays in the transport path 56 and makes one more revolution until it arrives again at its destination station. aside from that the output of a container that has arrived at its destination station is prevented even if If there is too little space in front of or after this container there is another container and through the If the distance between the containers is too small, a disruption to the dispensing process is to be feared. This container clearance control can by timing elements in conjunction with the signals from the encoder G1.

The corresponding processes in the memory when an object is entered are shown schematically in FIGS. 10 to 12, the memory including an additional column for notes. The query of station m == 3 is shown. At this point in time, a destination is entered with a clocked e-signal, which is triggered by pressing a button on the station. The target information remains in the target memory 12 until the 7th shift cycle. During this time, the previously described check of the target identifier for validity takes place. The input switch 15 (F2) is set immediately before the 5th shift clock and indicates that the target identifier is OK, so that the target identifier can be transferred from the target memory 12 to the first line 7 of the shift memory 6 with the following 7th shift clock . Together with the destination identifier, the station number is entered as a location identifier and an e-note. If it is now determined that the path between the transmitter Gl and the opening through which the container enters the transport path 56 is free of passing containers, the input lock is released and the container enters the transport path. At the beginning of this unlocking signal, further storage processes in connection with the entry of the container are initiated. 11 shows how the location identifier / 3 and the c-note are entered into the search memory 10 with the clocked unlocking signal at the time of the station queryc of the station / 3.

From the contents of the memory it can be seen that in the meantime the container with the destination identifier / 4 has moved from the section / 2 to the section / 3 and that the container with the destination identifier / 3 has also reached its destination in the section / 2 , because this identifier is no longer available in the sliding memory. By re-storing the identifier of the container with the target identifier / 4, the information with the e- note is advanced further in the sliding memory. The search process shown in FIG. 11 now follows, in which attention is only paid to the correspondence between the two location identifiers and the two e-notes. After the second shift cycle, these two matches exist and the destination identifier / 1 is transferred to the destination memory 12. With the 7th shift cycle, the destination identifier is stored in the first line of the shift memory 6 together with the location identifier / 3 and the e-note. The information assigned to the container has not changed during these processes, it has only been returned to the input of the sliding store. The reason for this is that a long time can elapse between the processes shown in FIGS. 10 and 11, namely if the transmitter Gl repeatedly reports a container passing by and the input of the container is delayed for a long time as a result. Considering in F i g. 11 shows the memory contents after the second shift cycle, it is found that the information for the container to be entered comes from the information of the container that has passed by with the target identifier / 4 . If the container were actually entered, the sequence of the container information of the section / 3 would not match the actual container status, since the container with the destination identifier / 4 had long since passed the input opening. It is therefore necessary to correct the sequence of the information, which is only achieved by the processes shown in FIG. The deletion of the> Stai e note may only take place if the input] a; holder has been confirmed by the transmitter G 2, as j clic subsequently explained with reference to FIG. 12; becomes ι. At the end of the unlocking signal, the location identifier / 3 and the \ aus e-note are entered into the search memory 10. However, this input can; the ίο only take place if the encoder G2 at the end of the; the entry has been confirmed by the unlocking time. It is ; . forth] viewed represents therefore a bistable control switches 70 (. Figure 17), which is designed as a flip-flop comprising: infi is set to the end of the unlocking and j, makes sure that illustrates steps changeover switch 14 in these; the processes is always set. is therefore the recycling storage '■ the reasonable 11 to the output of the shift memory 6 J fun closed. Only with the 7th shift cycle does the j only reset both the step switch 14 and (Gel ίο of the control switch 70. The deletion ί Zw of the c- note must not be done by the known intermediate \ Geb and back storage, otherwise the There is a risk that the sequence of the container information \ I in the shift memory will be falsified if namely; log while the container is being transferred to the lane, the transmitter G1 reports that it has passed again - F i ensures that with the 4th shift, only the location To and the destination ID are transferred to the return memory 11 im, but not the e-note of the e-note, the content of the slide memory 6 unchanged compared to your state immediately before the 1st shift cycle

The processes in the memory when a 72 container is dispensed are described below with reference to FIGS. As shown in FIG. 13: e the transmitter Gl reports the arrival of a container, whereby Do the search memory 10 receives the location identifier / 2 and the destination identifier i before / 3 at the time of the station query. During the subsequent search process; with after the second shifting cycle by comparing rather 9 a correspondence of both the location ^; gna identification and found the target label, and let it reach the destination identifier from the sixth row 7 of the rail of the storage bespeichers 6 ■ wet after the third shift clock in the target '12. Since not yet sure whether the container ^; spe can actually be output, the target identifier ■ ist is saved back with the i dur 7th shift clock, together with the location identifier / 3 and with a j Sch α comment. The entry of the a-note in the j I shift memory is only done if fixed; read; is found that the distance of the dispensed loading \ sov hälters enough to a preceding drive container; is large so as not to impair the function of the switch. J Toi

A time signal ta is also started at the same time. \ gen During this time signal of a certain duration, it is checked whether the distance to a subsequent one of the container is also sufficiently large. Only when these loading \ Vei conditions are satisfied, the point setting signal \ OE is added, which causes the ejection of the container by [such as the turnout. \ des

If at the end of the time signal ta it is established that \ lies the container distance to a subsequent container ■; / is too low, as shown in Fig. 14, a * 25 'search process for the information with the a -ver ■; Attention is directed to the α information i

/ 6

η required
: η Voring des
of the loading

is like
rumors
Is will
jnd the

However
nd the

It is
7) read out with
rd and I

this |
memory |
• an- \
ilgl the I.
Is also j
being j
ischcn- I
Danger \
mation]
stupid \
: Railway \
envy. '
izt there- ■
indort-;
: herll;
note. i
as Lö-;
: blows
nd un-

: one '
ig. 13;
-crosses =
> by:
uions-;
nnung;
e becomes 1
crglei- ■;
ndortjnd c «·
Send ι
Target i
holder j
t the;
nnung j
one
ι the
ι firmly flexing
u begged,
will
; nd
: Loading

that
older
;, a
Verr to

Clear. The container then remains in the lane with the target identifier / 3 until it again receives the Station / 3 is reached and a new output process is initiated. The storage processes shown in FIG take place when the distance to a subsequent container is too small.

If the distance to the subsequent container is sufficiently large, the reset signal is given at the end of the time signal ta , and the storage processes shown in FIG. 15 follow at the end of the reset signal. The end of the turnout signal triggers a search for the information with the «note; the destination identifier is then temporarily stored with the fourth switching cycle if the output of the container has not worked for any reason, although the switching signal has been correctly given. If, however, the transmitter G "3 confirms the output of the container, this intermediate storage is omitted and all of the information assigned to this output container is deleted.

In Figs. 16 and 17 the functional diagram is the logical links are specified which result in this behavior of the control system.

Some additional gate circuits and switches are new in FIGS. 16 and 17 compared to the functional diagram shown in FIG. The third column in the shift memory 6, in the comparator 9 and in the search memory 10, which is used to record notes, is new. It is also new that the input for the location identifier in the search memory 10 is preceded by an OR gate 71. The input of the shift memory 6 for the column with the notes is preceded by an OR gate 72 which has four inputs. At two of these inputs, the c- and the ((-note) are fed via a double gate 73. Via a further double gate 74, the OR gate signals from the Vcrmeikcolumn of the last row of the shift memory 6 or the feedback memory 11, which are marked with vr and The double gate 73 for the c-Vermcrk (not to be confused with the P signal, the clocked input signal) is permeable when the shift clock pulse si is present and the input switch 15 is set and also either the destination identification switch 42 or the restore switch 94. The double gate 30 is replaced by a double gate 30 ', which is then permeable when the last shift clock pulse s 7 is present when the input switch 15 is set.

The double gate 73 is permeable to the α-note when the shift clock pulse si is present and both the input switch 15 and the cancel switch 17 are set. The gate of the double gate 74 ′ located in the line of the signal vr coming from the feedback memory 11 has the same gate conditions as the double gate 28, which is located between the feedback memory 11 and the OR gates 27. The part of the double gate 74, which lies between the output of the comment column of the sliding memory 6 and the OR gate 72, has the same gate conditions as the double gate 29 which is located between the output of the sliding memory 6 and the OR gates 27.

In place of the gate 25, however, a gate 25 'is now connected, which is then permeable when from Comparator 9 a match is found between the location identifiers and the notes and if the target memory switch 16 is also set and another clear switch 76 is reset is and if at the same time one of the shift clock pulses si ... s6 is pending.

The OR gate 71 is connected upstream of the input of the location identifier of the search memory 10, to one input of which the signal from the searcher is carried and to the other input of which a gate 77 is connected to which the location identifier of the queried station is fed. An OR gate 78 is sounded in front of the input of the comment column of the search memory 10, one input of which the e-comment is fed via a gate 79 and the other input of which the a- comment is fed via a gate 80.

»5 den. The gate 77 is permeable if either the signal given at the beginning or the end of the ice unlocking time of the station lock is pending or if the signal is pending at the end of the point setting time or if either the signal is pending at the end of the time signal ta and the distance signal is not pending, which indicates that the distance between the dispensing container and the subsequent container is sufficiently large. The gate 79 is permeable when either the signal at the beginning or the signal at the end of the unlocking time of the input lock is pending. Finally, the gate 80 is permeable if either the signal is present at the end of the point setting time or both the signal is present at the end of the time signal ta and the signal is missing at the same time that indicates that the distance between the container to be dispensed and the following container is sufficiently large.

The target identification switch 42 ensures that the c- entry is entered after the target identification has been checked; At the same time, the restore switch 94 ensures that when the information is restored in accordance with FIG. 11, the e- note is also restored. On the other hand, as indicated by the gate conditions for double gate 73, the input of the α-note by the delete switch 17 is also controlled. The cancel switch 17 is set during the search process, which is initiated by an arrival signal (α signal, not to be confused with α mark) when the arriving container has reached its destination and the distance to the preceding container is sufficiently large. The signal which indicates the sufficiently large distance to the preceding container is denoted by la. By means of the control switch 70 and the delete switch 76 it is possible to delete certain information assigned to a container or only the accompanying note without intermediate or restoring and thus without changing the sequence of the container information in the sliding memory 6. By setting the extinguishing switch 76, such a deletion process is basically initiated by the extinguishing switch 7f preventing the step switch 14 from being reset. If only the associated comment is to be deleted, the control switch 70 is set. In an input operation of the cancel switch 76 to the end of the Entriege wire lung signal set, and it is, the Gebei Eq if the entry was confirmed, and the control switch 7 (set; thus is a deletion of only the e-Vermer kes initiated.

During the dispensing process, the control switch 70 and the delete switch 76 are initially set if, at the end of the time signal ta, the distance to a subsequent container is not sufficiently large.

The two switches are finally set at the end of the point setting signal, provided that the transmitter G 3 has not confirmed the output of the container in question. This state can occur if, in spite of the turnout signal, the turnout did not work properly, which is checked by the G3 transmitter. If, on the other hand, the transmitter G 3 confirms the output, then only the delete switch 76 is set and thus the deletion of the information assigned to this container is initiated. The corresponding logic operations are implemented with the AND operations 81, 82 and 83 shown in FIG. 17 as well as with the OR operations 84 and 85 connected upstream of the set input of the clear switch 76 and the control switch 70, respectively. In the supplemented arrangement according to FIG. 17, instead of the OR link 43, an OR link 43 'is provided which has an additional input to which the signal beginning of the unlocking time era is fed. An OR operation 1S6 is connected in front of the control input of the target memory switch 16, the two inputs of which are supplied with the α signal and the signal beginning of the unlocking time era . An OR operation 87 is connected in front of the reset input of the step switch 14 and the target memory switch 16, one input of which is the last shift clock pulse si and the other input of which the shift clock pulses sl ... s6 are fed via a gate circuit 88, which is then permeable when the Comparator 9 determines a match between the location IDs and the notes and if the cancel switch 76 is reset at the same time. A common OR gate 89 is connected in front of the two reset inputs of the feedback memory 11 for the station and destination identification, one input of which is supplied with the shift clock pulses si. An OR gate 90 is connected upstream of the reset input of the column of the feedback memory 11 containing the notes, one input of which is also fed with the shift clock pulses si. A gate circuit 91 is connected in front of the other input of the OR gate 89 and is then permeable when the control switch 70 is reset. The input of the gate circuit 91 and the z-th input of the OR gate 90 are connected to one another. Between the clock line 18 on which the shift clocks si . .. j6 arrive and the interconnected inputs of the OR gate 90 and the gate circuit 91, a gate circuit 92 is provided, which is permeable when the comparator 9 determines correspondence between the location IDs and the notes and when the delete switch 76 is set at the same time.

The shift clock pulses sl.. You; Gate circuit 20 'differs from gate circuit 20 in that, in order to open it, the conditions must also be met that agreement of the notes is determined by the comparison · 9 and that the> ißnal la is also present, which indicates that the The distance between the container to be dispensed and a preceding container is sufficiently large.

The double gate 26 connected in front of the inputs of the return memory U is now replaced by a triple gate 26 ', in which the conditions must also be met for opening that the comparator 9 also determines that the notes agree that the extinguishing switch 76 is reset and that the In addition, the control switch 70 is set in the supply lines for the location and destination identification. Finally, a back storage switch 94 is also provided, the set input of which is supplied with the unlocking start signal era and the reset input of which the last shift clock pulse si is supplied. The restore switch 94 ensures that when the information is restored as shown in FIG. 11 the e- note is also saved back. The arrangement shown in FIG. 17 and just described is used to control input stations which have no waiting lane, that is to say in which the container passes directly into the transport path 56 after the lock 51 has been released.

However, it is often expedient to have the stations with a waiting lane 54 as shown in FIG Fig. 18 to be provided. However, this also requires a certain expansion of the circuit, as shown in the 19 and 19a and described below is. There are only the changes compared to the representations in FIGS. 19 and 19a according to the Fi g. 16 and 17 indicated.

The OR gate 72 at the input of the comment column of the shift memory 6 is replaced by an OR gate 72 'with two additional inputs. The double gate 73 was replaced by the double gate 73 ', which differs from the double gate 73 only in that in the line carrying the e-note, the gate condition for opening the gate 73' switched on is simplified by omitting the condition that the restore switch 94 can be set instead of 42. The restore switch 94 can be dispensed with in a station with a waiting lane and is therefore omitted. A double gate 95 is connected in front of the two additional inputs of the OR gate 72 '. In order to open the gate circuit in a line carrying a w mark, the condition must be met that the input switch 15 and a waiting switch 96 are set when the last shift clock pulse si is present. If these conditions are met, the “'comment can be entered in the comment column of the slide switch 6. The other gate of the double gate 95 requires the same conditions to open, whereby a transfer switch 97 must be set instead of the waiting switch 96. If these conditions are met, then a «remark is entered in the remark column of the sliding memory 6.

In the supply line of the location identifier to the OR gate 71 in front of the search memory 10, the gate 77 is replaced through gate 77 '. It differs from gate 77 in that instead of the signal the beginning of the Unlocking 51 the signals end of unlocking 57 or beginning of unlocking 57 or end of Unlocking 51 are required to open. The OR gate 78 is through an OR gate 78 'with two additional inputs replaced. The gate 79 is replaced by a gate 79 ', which is opened when the End of the unlocking signal of the lock 51,

the Sigr entrance and the lock mark peltor ere2-Sig the OD lungssig: reached the gate of the Veri The d of the Lö: OR- 'fung lerüberr. the g4- the Enc 57 angit OR-lichen I OR-the Enc 51 and locks Set OR-43 "sent a * start display: OR-durchkc closes 100} of the gel signal receiver is off switch! of the ent Rü Überga Sliding bound at c with Wi Der B (given switch! Given when d for it, 'lane fn 12 set code set, query together note ii betrayed free. Zi; succeeded factual'; G2 ko container «

running-

: hers 11
^J rch a
- Huh

ir trade is fixed and
ϊ Stand control
Return entrance
ι Returned
for that
let the
; t moved and
utterance
Consecration 51
him 56

itions
■ ing in
h one
η the
ϊπ bed 19a
: ellun-

split
Jr 72 '
) ppelt that
-inter- ■ note
t one-way
age
cher-

extract a
ι the
nd
'han-

Uses
ι the
chal-
: p 95
'obei
r 97
fills,
palte

IER-er
from the

the
lung

the
That
two
puts
the

the signal erel is pending. The w mark and the w mark are connected to the two additional inputs of the OR gate 78 'via a double gate 98. The double door 98 is open for the vv note when the era 2 signal, and the double gate 98 is open for the ii note when the ere2 signal is present. The w-comment is sent to the OR gate 78 'when the unlocking signal of the lock 57 is pending. Likewise, the ü-note arrives at the input of the OR gate 78 'when the end of the unlocking signal of the lock 57 is pending.

The AND and OR links connected upstream of the set inputs of the control switch 70 and the cancel switch 76 are expanded by an AND link 99, at the output of which the error acceptance signal is present. Your two inputs receive the g4 signal from the transmitter G4 and the signal indicating the end of the unlocking signal for the lock 57. The OR link 86 is replaced by an OR link 86 ', which has an additional input. The signal, the end of the unlocking signal of the lock 51 and the signal indicating the beginning of the unlocking signal of the lock 57 are fed to the three inputs of the OR operation 86 '. In front of the set input of the input switch 15, instead of the OR link 43 ', an OR link 43 ″ is connected. Another input of the OR link 43 "receives the counting clocks coming through the gate 44. Finally, the output of an AND link 100 is connected to the fourth input, the two inputs of which receive the signal from the encoder G 2 and the signal erel indicating the end of the unlocking signal from the lock 51. The output of the AND link 100 is also connected to the set input of the waiting switch 96. The set input of the transfer switch 97 receives the signal eral, which indicates the beginning of the unlocking signal of the lock 57. The reset inputs of the waiting switch 96 and the transfer switch 97 are connected to the line 21 carrying the respective last shifting act impulse si.

When a container is entered into a station with a waiting lane, the following processes take place: The container is entered into the input opening 50, and the destination is entered into the destination memory 12 by means of a numeric switch and a keystroke. This input is only made when the encoder Gl emits a g2 signal as a sign that at least one space is still free in the waiting lane. When the destination is entered in the destination memory 12, the known test process begins. If the destination identifier is valid, the destination identifier switch 42 is set. With the last shift cycle of the station interrogation interval, the destination identifier is entered into the shift memory 6 together with the location identifier and the e-note. At the same time, the lock 51 enables access to the waiting lane 54. At the end of the unlocking signal of the lock 51 (erel) , it is checked whether the container has actually been entered, which is controlled by the transmitter Gl. If Gl confirms the input of the container, a search process for the associated container information is initiated in a known manner. The e-remark is then deleted by temporarily storing the destination identifier. With the last pushing cycle, the drawing identifier is stored again together with the new location identifier and another note, the waiting note w .

If, however, does not confirm the input with an input operation by Gl, it is even ίο a search operation is performed, and also an interim storage of the destination identifier; however, there is no restoring of the container information because the input switch 15 has not been set, so that the associated container information is deleted again.

In the waiting lane 54, the containers move up in the direction of the transfer point 55. As soon as the transmitter G4 reports a waiting container and there is no container moving past in the transport path 56 between the transmitter G1 and the transfer point 55, a takeover process is initiated in which the lock 57 is briefly released. With the beginning of the associated unlocking signal eral , a search process for the associated container information begins, which is identified by the first IV note arriving in the sliding memory 6. There are now again an intermediate and a restoring process in which the waiting note w is deleted and the container information is provided with a transfer note ü. This restoring process also brings the information assigned to the container back to the correct place in the sliding memory in which the correct sequence of the various information is given.

If the transmitter G 4 now confirms the takeover of the container, a search process for the associated container information with the «note is initiated with the end erel of the unlocking signal for releasing the lock 57 in order to delete the! / Note without this The sequence of the information assigned to the containers is changed by means of intermediate and restoring. The erel signal is therefore used to set the cancel switch 76, and if G4 confirms the acceptance, the control switch 70 is also set. As a result, the ü-note is deleted during the search process.

If the giver G 4 has not confirmed the takeover, the takeover device is not faultless worked, which is reported as an error to a monitoring circuit. Also in this If the control switch 70 is not set, all of the information assigned to the container in the The course of the search process is deleted. This also has the advantage that the container can be removed from the transfer point 55 has no effect on the content of the Sliding memory 6 has.

The input of the two new notes H 'and ü is controlled by the waiting switch 96 and the transfer switch 97.

To simplify the entire control, the parking lane 53 is connected to the switch 52, whereby it can be avoided that an incoming container is only issued when the Issue is free. The parking lane can be designed so that it can accommodate any number of containers

can without hindering the dispensing process will.

The position of the switch 52 is basically independent of the position of the transfer point 55 is chosen in the construction of the station. However, to the encoder Gl, the arrival of a Container with an a-signal reports, both for the monitoring of the output as well as the input to be able to use, it is advisable to place these two points at an appropriate distance from the Provide encoder Gl.

The control system described is not limited in its application to systems that have a single conveyor circuit. Rather, the system can also be applied to systems with several branches and junctions, one of which is shown in FIG. 20, for example. In this system there are two switches and two junctions. The main conveyor circle forms a ring with the stations / 11, / 12 ... / 17. These Stalionskerinungen are constructed in such a way that the first digit denotes the number of the train and the second digit the number of the station within the train. These two digits are denoted by ρ and m. In the system shown schematically in FIG. 20, a track with the number / 2 begins: at station / 13, which is provided with a switch. Station / 22, i.e. the second station of the 2nd lane, is also provided with a switch that leads to a third lane.

When the stations are queried, switches and junctions are used as usual stations with entry and output handled. In the one shown in FIG For example, the station query begins at station / 11 and ends at station / 32. The route numbers match, as before, with the number of the previous station. It is So the section / 12 is the section following the station / 12 in the conveying direction.

In Fig. 21 a junction is shown schematically, which is provided with a counter switch 52, as it can also be used in the same design for an output station. The station or partial route names, which have since been designated as st , are now denoted by ρ and m , where ρ indicates the path and m the partial route or station identifier within the path. In front of the encoder Gl there is therefore the section pi mi, which belongs to the path pl. The subsection plml ends at the encoder Gl, at which the station pirn2 begins, whereas the following subsection ρ Im 2 begins practically at the contour 52. In the other conveying direction, the counter switch 52 is followed by the section ml of the path ρ2. If a container in the station plml is transferred to the subsection plml, the location identifier must be changed accordingly when the associated destination identifier is restored.

The actuation of the counter switch 52 is independent of the path section in which the target of the container is located. Therefore, it is according to the representation of Figure 22 by means of further comparisons. Found forth 109 whether bri arrival is associated with a destination identifier to the encoder Eq the container in question, which makes an operation of the switch erforierlich. For the sake of simplicity, it is assumed that the sliding store 6 also has six lines. In this case, however, the capacity, although the column 8 of the sliding memory 6 containing the destination identifier as well as the location identifier, is designed in such a way that the two digits that form an identifier can be recorded in each case. The lane number pz6 located in the sixth line of the sliding store 6 is now compared with the lane number ρ 2 when the switch plml or possibly another switch p3m4 is queried. The switching through of the path numbers ρ 2, ρ 3 etc. to the individual stages of the comparator 109 can be programmed with regard to the design of the system. If, for example, in a system according to FIG. 20 a container with the destination identifier / 32 is entered in station / 11, both the switch of station / 13 and the switch of station / 22 must be operated. The switch / 13 is always set if the target identifier contains the lane numbers / 2 or / 3, because these lanes are only available for a container when the switch / 13 is in the appropriate position.

are reachable. On the other hand, the switch must be in the station / 22 should always be set if the target identifier of a container contains the lane number / 3 is. It is assumed that the contrast signal 52, as long as there is no corresponding signal, has the position shown in Fig. 21 with the container remaining in the same path, in the aiso the first digit of the section and station number before and after the switch remains the same. The identification is checked by the cnt-

speaking stages of the comparator 109 carried out and is only carried out when a Station is queried with a switch. The signals ρ 2, p3 etc. are used by the individual stages of the comparator 109 supplied via gates 102, which are then opened when a station with a switch is queried will.

Each switch station is provided with a transmitter G5, which is provided immediately behind the counter switch 52 and determines whether the container has actually passed into the path with the other code number ρ . In the logic circuit, the gate 20 ', which is connected upstream of the set input of the delete switch 17, is replaced by a gate, not shown, which is opened when the comparator 9 reports a match between the location identifier and the note when the target memory switch is also set and the signal is present that the distance to a preceding container is sufficiently large, and if the target identifier in comparator 9 or one of the lane numbers in comparator 109 also match. The delete switch 17 is used to enter the a- comment, as can also be seen from FIG. Similar to the output process, on arrival the information from the identifiers is initially provided with the new section number plm2 and also with an output note if the door conditions described above are met. The switch is actuated if, after the time ta has elapsed, it is determined that a sufficiently large distance is also maintained from a subsequent container.

At the end of the point setting signal wse, it is then checked by means of the transmitter G5 whether the container has actually passed into the subsection plml . In this case, there is an additional control switch, not shown, together with the input switch 15 and the target memory switch 16

setJ Signa release It is a tidy corridor and c creates a signa denotes a C the other at P the same when backfold (for (verbu leads desei dem the I open! set; sound third through inputs at the A ters Verki dem <knüpl Signa In

Bahn handi haltci according to Wenc draw gestri hälti the expiration who is allowed to act, 2.Ba run before serving by] the one in the Di.

} zip ί ·; can

bespei-numbers
mg bil-schie
vergli-soft

Orbits of the

ispiels station
give,
as
'earth,
εηη in
un-
; cherier err start dei
ent- ■> ntrail instructs
bt, in

Steady.
: against

■ g! Eieöff-
asks

ie 52
tatfer ρ
that-
dar-'enn
indßer-Silauenn
)the
input
I.
here
the
mer
Erk

all
uch
; ro-

earth
ter

set and a new search process initiated. The Si ° nal of the encoder G 5 also prevents the Clear switch 76 is set, whereby the required Intermediate storage and restoring of the target identifier is guaranteed.

A re-folder is also provided, which creates a new location identifier. This rearrangement works in such a way that it receives, for example, the location identifier / 13 at its input and then generates the identifier / 20 at its output (see FIG. 20). The re-folder is practically a re-encoder which, when a certain signal is present at the input, generates a certain signal assigned to this signal at the output. In this case, the double gate 30 '(FIG. 16) is replaced by a triple gate. The gate condition for the zz signal remains unchanged. The signal st is fed to the other section of the triple gate, which is open when the sliding clock pulse s7 is present and when the input switch 15 is set at the same time, when the aforementioned additional control switch is reset. The output of this part of the triple gate leads to the OR gate, which is connected to the column for the location identifier of the sliding memory 6. From the line with the signal st , a branch leads to the above-mentioned rearrangement, at the output of which the signal st ' appears and which is fed to the third gate of the triple gate, which is open when the shift clock pulse si is present, if the input switch 15 is also set and the aforementioned additional control switch is also set. The second and the third gate of the triple gate are optionally permeable. Their outputs lead to different inputs of the OR gate 27.

When a counter switch is actuated, the control of the set input of the extinguishing switch 76 is also slightly changed. In this case, the OR link 84 (cf. FIG. 17) at the input to which the signal wse is supplied is preceded by an AND link to which the signal wse and the signal £ 5 are supplied.

In systems in which there are two parallel tracks with opposite transport directions, turning points 103 according to FIG. 23 could be used to shorten the path for containers with a corresponding destination. By actuating the turning gate 103, which assumes the position shown in the normal position and, when actuated, assumes the position shown in dashed lines, a container is transferred from the 1st track to the 2nd track. The electrical functional sequences required for this are identical to the functional sequence for the railway junction using a counter switch. As a supplement, the turning point 103 may only be actuated if not only the first lane, but also the second lane in the area of the switch is free of passing containers. This is determined by the additionally provided G 6 transmitter. The G 5 encoder is again used to control the transfer of the container from lane / 1 to lane / 2. In addition, G5 detects the passage of containers in the path II .

The merging of two lanes is basically the same as entering a container. The leading track can also be provided with a waiting lane. In any case, the opening track is provided with a lock in order to avoid container collisions. The waiting lane is separated from the mechanical drive of the conveyor line in front of it. The section running through is provided with the section identifier j, the merging track with the section identifier ι.

The following storage and control processes take place: With the start of the unlocking signal for the lock at the opening point of the section / in section i , a search process is initiated, in which, however, not the section /, but the section / is entered as the search information. This is ensured in a similar way

• 5 ways, as previously explained for the contrast switch, a re-folder. As soon as the associated container information is found, it is temporarily stored and restored with the last shifting cycle together with the new section number / + 1 and a transfer note. The input of the ü- note is made possible by the fact that the transfer switch 97 is set with the unlocking signal for the locking on the muzzle (cf. FIG. 19). With the G 7 encoder provided on the lock (which corresponds to G 4 in a station with input), the transfer of the container to the section / + 1 is checked. If the container has been accepted, a search process is initiated again in order to delete the acceptance note. The takeover note is deleted without intermediate and restoring when the search process is initiated by setting the control switch 70 and the delete switch 76, which causes the takeover note to be deleted during the subsequent station interrogation interval.

If the track ends with the section j without a waiting lane, a lock is only provided shortly before the end of the line, which is controlled by the transmitter Gl, so that no container collisions can occur. A small distance upstream from the point of discharge, a transmitter is provided in each of the two lanes to indicate which lane a container is coming from.

A major advantage of the control system described is that it is possible to use small systems to link to large systems or systems with different conveyor systems. Such a link between two systems is shown schematically in FIG. Every Both systems have their own control electronics with sliding memory. Still is a Container exchange possible from system to system. It is sufficient to have one transfer memory per connection point to be provided, which, however, means very little effort, since it is like the known Cache can be built. At the point where containers leave one system a counter switch 52 is provided, as shown in FIG. To the counter-soft 52 is followed by a waiting lane 104, which opens into the path of the other conveyor system. the The outlet point is constructed in the way described above. The waiting lane 104 is not assigned a route number. The two systems are linked in the in F i g. 24 only in one direction. It goes without saying, however, that a corresponding

14th

Such linkage in the opposite direction is also possible, as is indicated by the waiting lane 104 ' shown in dashed lines. Each of the two systems has its own query cycle that works independently. All destination information also contain a number that is assigned to the system into which the container in question is to go. If a container passes the actuated counter switch 52 in the manner previously described at the junction, it arrives in the waiting lane 104, and if the transmitter G 3 confirms the arrival of the container in the waiting lane 104, it is in the sliding store belonging to the first system the information assigned to the container in question is deleted. At the same time, however, the target identifier of this container is transferred to a transfer memory. The target identifier remains in this memory until this target identifier is transferred from the transfer memory to the sliding memory of the second system / when the discharge station of the other conveyor circuit is queried. As already described, the identifier is initially provided with a w mark. As soon as the transfer can take place, the w note is replaced by a «note, and as soon as the transfer is confirmed by the donor G 7 (corresponding to G 4), the ti note is deleted without intermediate or restoring.

Although the transfer memory can only store a single target identifier, the waiting lane can still accommodate several containers, since the transferred destination identifier is immediately transferred to the sliding memory of the second system / with a w-note when the outlet station / -f 1 is next interrogated. In any case, the time until the takeover is only a fraction of the time that elapses until the next container can arrive in the waiting lane Ϊ04. Basically, the processes involved in a container transfer from one system to another are similar to those for a container input and output with waiting and parking lanes.

Linking a horizontal conveyor system with a tower system does not mean any functional expansion of the control electronics. Such a link is in Fig. 25 a and 25 b shown schematically. It can be used both in the form of a tower conveyor 107 leading path a waiting lane 105 as well as in the one leading away from the tower 107 Railway a waiting lane 106 may be provided. However, it is also possible to output from tower 107 to make directly in the main line, as shown in Fi g. 25 b is shown. That is then without any disadvantages possible if there is no high container density in the horizontal path.

If the encoder Gl in the horizontal path 108 reports the arrival of a container whose target information requires transfer to the tower conveyor 107, the counter switch 52 is set and the container arrives in the waiting lane 105 When the container is taken over, the information pertaining to the container is deleted from the sliding store of the horizontal system and taken over into the take-over store of the tunnel conveyor 107. The information is transferred from the transfer memory to the sliding memory of the tower conveyor 107 during the subsequent interrogation of the associated tower station.

i ^ver '

The ^v | ^ele target identifier must be checked for validity. : ^ ^{Ine V (with} the acquisition of the destination identifier in the shift memory of the tower conveyor 107 is these equipped with a sale notice, and there is the acquisition i, of the container into the tower conveyor 107 once DIE | * ^{stt ell} j ser.. a free space reports what the donor G12 \ detects jen ^lau Here, the w-note overall ί ^ · ^ö is first -. ^e extinguished and replaced by a "token entry in a known 5 ^la 8 ^s way is cleared as soon as a transmitter ί ^ ⁱⁿ f ^{n (} GlO reports the takeover of the container. i

A loading is output in a similar manner. holder from the tower. A G13 transmitter signals the arrival of a container and triggers a search process. If it is found in this search, i S ^{s w} that the container is to ^lrale be transferred to the horizontal system, it shall, unless the waiting lane 106 is not full, initiated handover process. A transmitter GIl at the transfer point confirms that the transfer has taken place, whereupon the target information in the sliding memory of the tower conveyor 107 is deleted. ;. It is assumed in the acquisition memory of the horizontal i system. The next time the station i + 2 is queried, the destination identifier is transferred from the transfer memory to the sliding memory of the horizontal system together with a waiting note w. The takeover of the container at the merging point 55, 57 of the station i + · 2 takes place in the manner already described when this can be done without the risk of a container collision.

It is possible that a container is carried past a dispensing point because of the distance to a preceding or a following container is too small, as already described became. To avoid this, braking points are provided, which are triggered by one of the in the course of the Path-switched encoder can be operated. By checking the duration of the encoder signal is it is possible without difficulty to control the distance between two containers and with to briefly signal the following container by braking something of the preceding container to remove.

In addition to the column for notes, the shift memory and the memory allocated to it can also have a received additional column for special information, also together with the location and destination IDs circulate. This special information can be used to generate a Detour formwork or to control a preference circuit at peak times.

The advantage of the system described is that the stations can be supplied with empty containers in a very simple manner. For this purpose, several empty containers are always entered into the system, which are provided with the target identifier zero, the information of which in the sliding memory 6 therefore only consists of the location information. If an empty container is requested by a station, a bistable switching element is set by pressing a button, by means of which it is checked for all α signals from the relevant station whether the container has the target identifier zero. As soon as such a container arrives, the information pertaining to it is provided with an α mark in the sliding memory and an output process is initiated.
It can easily be controlled how

lay empties that empties empty places hen 1 game E;

lagei ^: an ι I Leei I wirl; ■ from nicr

: total

: Ni ■; ve

i ge

■■ se

^; isi

i 8 ^f ei

Veise they will. Slide with a crimping) ald dieter G12 not recognized η encoder: t.

ines be; nalized search presented, brought forth 06 not itet. A t the ertion in: ht will, rizontalrage the η über-Jorizonw über-joins in it without : look

he exchange to follow-: h rubbed len in front who can, inals is nd two to - through 3container

There were people on earth who could think a: pref-

: m, add that item in: n! i, whose key from the station

39

many empty containers are circulating in the system. Becomes a predetermined number of empty containers circulating is achieved, an input blocking for empty containers can be provided. With each other linked systems, it is also possible to automatically compensate for the circulating in each sub-system Reach empty containers. If one takes ζ B a large system with several horizontal systems that are connected to one another via one or two towers, it can be achieved that in each of the subsystems the number of circulating Lecrbchälters between a minimum and one Maximum limit is. The automatic compensation of the number of empty containers in the individual conveyor systems is controlled by a central unit common to all systems. So it will be the individual systems assigned sliding memory is monitored for the number of empty containers. If it is determined that in one system the maximum number of empty containers is exceeded, as soon as a Empty container reaches a junction or transition point, this empty container with a corresponding one Note provided in the manner described and thus conveyed to the other system, for example in the tower conveyor.

It is also possible in each of the plants when reaching the prescribed Hochsteahl to block the entry of further empty containers into this system on rotating empty containers. Included jcdo ~ h this blocking affects the input of containers with a valid destination identifier

not. ".. _,;,

The stations are connected to the control electronics 110 via a collecting line, as shown in FIG. The control cable 111 connecting the stations to one another and to the control electronics 110 comprises only seven wires 112, which are designated as a-b-g wire. Each d '.r stations arrival to each of the cores in the same We.se ^8C ° The stations are interrogated sequentially in time (Time Division Multiplexing), -um The α-wire 112 leads from the Steuerelektron.k each with a receiving amplifier 113 of a jeden_ Station. There are signals on the b, c ... g wires only as long as a station is switched on. Only the signals from this station are on the line. The control electronics 110 give each other the identifiers of each station on the α-wire HZ. In each station there is a comparator 1141 at the output of the receiving amplifier; 113 connected The other input of the comparator is connected to a fixed number transmitter, which continuously supplies the station number to the comparator 114. As long as the comparator 114 receives the identifier assigned to its station via the α wire from the control electronics 110, it sends a yes signal to an output line 115. The yes signal on the output line 115 opens a gate circuit IJJ, which sends the encoder signals gl, g2... To the ft wire 112. In the same way, the yes signal on the output line 115 opens gate circuits 117, 11.8 and 119, the output connections of which are connected to the c, d and e wire 112. Control signals generated by the station are passed through the gate circuit 117 to the control electronics 110 via the c-wire 112. These signals are the signals erel, era2, ere2, wse , etc. On the d-wire, control signals from the control electronics 110 are input to a buffer 120 via the gate 118 opened by the yes signal on the output line 115. In the same way, special information is fed to a buffer 121 via the e-wire 112 and the opened gate circuit 1119. This special information is used, for example, to trigger an additional signal that, for example, at stations that dispense certain containers for several recipients, the respective recipient is notified, ao Finally, each station also has a numeric switch 122 for entering the destination identifier. The destination identifier is given from the numeric switch 122 via a gate circuit 123 to the / -Ader 112, if the gate 123 is open. The gate 123 is open when the yes signal of the comparator 114 is present on the output line 115, when, in addition, an input key for the container input is pressed and an input key for the empty container input is not pressed.

A key 125 is also provided, the actuation of which generates the target identifier zero. The target identifier zero becomes the g-core 112 and thus the control electronics via a gate circuit 124 If the comparator 114 supplies the yes signal, HO is supplied, the input key for the empty container input is pressed and the enter key is not pressed to enter the container.

It goes without saying that the wires α to g do not need to be individual wires, but that each wire can comprise a number of signal channels. For example, the α-wire can consist of eight individual wires, i ^; Via which an eight-digit binary number can be transmitted at the same time if the station numbers are used in the system, for example as eight-digit binary numbers ♦ 5.

It goes without saying that the invention is not limited to the illustrated embodiment, but rather Deviations from this are possible without departing from the scope of the invention. In particular individual features of the invention for sicti or several can be used in combination. The control system according to the invention is suitable for also for traffic systems. In particular, according to this system, a gondola lift, for example, can be used be controlled, in which the cabins should automatically reach the desired destination. Basically the principle according to the invention is suitable for controlling all systems in which individual objects « automatically entered along predetermined paths «to achieve goals.

41

Table 1

el el

Explanation of symbols

AND operation of two or more binary signals a = el el ... en,

OR operation of two or more binary signals a = el + el +. .. + en,

Binary storage element (flip-flop),

ei = setting pulse,

el = reset pulse.

There is no arrow to show the flip-flop output, as it provides a better overview because of the action of the flip-flop on other circuits through there Specification of the flip-flop states / and / is displayed.

The setting and resetting of the flip-flop is done isochronously with the trailing edge or the end of the set and reset pulses.

el el

Ii

Ti e2 I.
I. I. ♦ if i Room I. f 1 K

Storage space for location identifier T or destination identifier Z ₁ index ι (number or letter) denotes storage space allocation, el = information input pulse,
el - erase pulse.

The information output is optionally available with an arrow or by specifying the Memory content shown at the relevant point.

The contents of the memory are marked with corresponding small letters, e.g. B. ζ 6 = location identification number in line 6 of the sliding memory, zz - destination identification in the destination memory.

The memory content is changed isochronously with the trailing edge or the end of an input or cancellation pulse.

Comparator for comparing two identifiers contained in different memories, state k means agreement,
State Tc means no match.

OR gate for ORing two or more freely definable ones Signals.

ff'fi

Gate for any definable signal,

Gate is permeable if the gate condition contained therein is met, e.g. B. Signal α is switched through when flip-flop Fl is set and flip-flop Fl is reset.

ΐΠ,

. + en, i

»Sees f

t through I.

Return

be of B.

e or

ungen,

rable 3

... / i7 21 11 934 Table 2 Abbreviations zr Shift clock pulses. st z6 Location identifier (station number = Number of the following section). tr, Location and destination identifier of the return
memory.
Location and destination ID on the 6th line ί6, of the sliding memory. Tl Station address. m Station polling interval. Π Time for full polling cycle. η ■ Number of stations. η Number of lines in shift memory. i Input signal. C. Output signal. a Signal from transmitter G 2 that container is on «2 given is. Duration> unlocking time. Signal from sender G 3 that container is off _g 3 ere given is. Duration> point setting time. Signal at the beginning or at the end of the Ent era locking time, Duration> - ^ - (see Fig. 4), beginning with the station interrogation cycle.

wes signal at the end of the point setting time,

Duration> - = - (see Fig. 4), beginning
with the station interrogation cycle.

ha, la distance of a container to be dispensed

to a subsequent (Λα) or to a preceding (la) is greater than a certain minimum value, which is necessary for an undisturbed actuation of the output gate.

ta A time signal that is generated by the

signal of a container to be output is triggered and is required after the time ta to trigger the point control signal.

tae signal at the end of the time signal Ta,

Duration> -. (see. Fig. 4), beginning

with the station interrogation cycle. V Storage space for special notes. ere I End of the unlocking signal of the Ver locking Sl. era 2 Beginning of the unlocking signal of the Ver locking 57. he el End of the unlocking signal of the Ver locking S 7. et 1 Enter key for container input pressed. hurry Enter key for empty container input be makes. In addition 25 sheets of drawings

Claims (13)

Patent claims: 1. Control arrangement for a distribution conveyor system, which has a plurality of input and output stations for objects that can be found at any station, specifying the destination entered and automatically output when the destination is reached, whereby the conveyor system ic is divided into successive sections, between each of which there is a station, with control electronics that are electrically connected to each station and include a memory, in the destination information assigned to the entry of objects in a partial route entered which are removed in the order of entry when the items leave the partial route, the control electronics based on the target information at Reaching the respective goal triggers the issuing of the special items, characterized in that that a memory common to all sections or stations is provided, that the memory is designed as a sliding memory (6) is in which the information is pushed on as that memory is at each Storage location not only for the target identifier but also for space for at least one additional piece of information and that a location identifier is used as further information, which indicates in which part of the route the object assigned to the destination identifier is located, with the Shift memory (6) the sequence of information with the same location identifier in the information flow direction of the sliding memory is the same as the sequence of the assigned objects within the section with this location identifier is. 2. Control arrangement according to claim 1, characterized in that an output of the shift memory (6) can be connected to an input of the shift memory, that a comparator (9) is connected to the output of the shift memory and a search memory (10) is connected to the comparator , which is connected to a search generator that delivers the identifier of this station as the destination and the identifier of the station previously passed through by the object as the location identifier when an object enters a station, that the yes output of the comparator (9) is connected to a pulse generator , which supplies an output pulse and a delete pulse for the associated information in the shift memory (6) and in the search memory (10) to the station in question, and that the control electronics have a target memory (12) which is connected to an input of the shift memory (6) and its destination identifier when an object passes from a station to the subsequent section as a destination identifier with the identifier of this station used as the location identifier. 3. Control arrangement according to claim 1 or 2, characterized in that the output of the Sliding memory (6), the one with the information flow direction last line (7) or level of the shift memory is connected, the input of a single-line feedback memory (11) is connected, the output of which is an alternative to that with the output connected to the last line of the shift memory with the input of the shift memory (6) is connectable 4. Control arrangement according to one of claims 1 to 3, characterized in that the sliding memory (6) in each ZeUe (7) except for the location and destination ID there are also storage spaces for has additional information shifted in the shift cycle of a clock generator. 5. Control arrangement according to one of the preceding claims, characterized in that that an occupied lock (13, 24) for the sliding memory (6) is present, which in the absence of one free line (7) in the sliding memory (6) triggers a blocking function 6. Control arrangement according to claim 5, characterized in that the occupied lock (13, 24) is connected to barriers (51) of all input stations. 7. Control arrangement according to one of claims 1 to 6, characterized in that a clear pulse generator (17, 22) can be connected to the input and / or the output of the sliding store (6) is, de 'deletes the information assigned to this object when an object is output. 8. Control arrangement according to one of claims 1 to 7, characterized in that a station a sensor (61) for objects arriving from the previous section and one Has sensor (62) for incoming objects in the following section, which with the Control electronics (110) can be connected. 9. Control arrangement according to one of claims 1 to 8, characterized in that the control electronics (110) can be cyclically connected to all stations. 10. Control arrangement according to claims 4 and 9, characterized in that the clock generator in its frequency to a value is set, with η = number of stations, i = number of lines of the sliding store, ν = object speed and / = minimum distance between the end of a preceding and the beginning of a subsequent object on the conveyor. 11. Control arrangement according to claim 10, characterized in that the switching frequency of the cyclical connection of all stations with the control electronics (110) / _s = j _T ln . 12. Control arrangement according to one of claims 1 to 11, characterized in that the search generator comprises a ring counter which is switched at a switching frequency / _s , the number of stages is equal to the number of stations in the system and the switch position is the identifier of the time with the Control electronics (110) connected station results. 13. Control arrangement according to claim 12, characterized in that the searcher comprises a further ring counter which is switched at the switching frequency / _s , the number of stages equal to the number η of stations and the switching state is always one switching step behind the first ring counter of the searcher . gf st is' isi gl sp df sp eii fü St de de Se St bi Rush sp de de de St gl * de de ve de sp en fü sc eii de mi Ül kc ga there im (f füi sp; eir Sc Le od sin ZUl Ri Jer
ien
; rs el
> ed-
iir
it-