METHOD FOR OPERATING A TRANSPORT SYSTEM AND TRANSPORT SYSTEM
20240085893 · 2024-03-14
Assignee
Inventors
Cpc classification
B65G43/00
PERFORMING OPERATIONS; TRANSPORTING
G05B2219/31274
PHYSICS
G05B2219/31432
PHYSICS
B65G54/02
PERFORMING OPERATIONS; TRANSPORTING
G05B2219/31276
PHYSICS
International classification
G05B19/418
PHYSICS
B65G54/02
PERFORMING OPERATIONS; TRANSPORTING
Abstract
A method serves to operate a transport system, in particular a multi-carrier system, that comprises a plurality of linear motors that are arranged in a row and have a guide track, a plurality of transport elements that can be moved along the guide track by means of the linear motors, and a plurality of stations along the guide track, wherein each of the transport elements is associated with one of the stations. The method has the following steps: generating an instance for each of the transport elements, generating a list for each of the stations, wherein the instance for each of the transport elements associated with the respective station is associated with the list, and wherein, within the respective list, the instance of each transport element is linked to the instance of the transport element directly ahead of the observed transport element and to the instance of the transport element directly behind the observed transport element, transferring a transport element from a first station to a directly following second station and inserting the instance of this transport element into the list of the second station if a transport job that goes beyond the first station is present for the transport element, wherein the transfer of the instance takes place in an event-controlled manner and independently of a transfer point if a predetermined transfer condition is fulfilled, and controlling the linear motors to execute travel jobs of the transport elements.
Claims
1. A method for operating a transport system, comprising: a plurality of linear motors that are arranged in a row and have a guide track, a plurality of transport elements that can be moved along the guide track by means of the linear motors, and a plurality of stations along the guide track, wherein each of the transport elements is associated with one of the stations, and wherein the method comprises: generating an instance for each of the transport elements, generating a list for each of the stations wherein the instance for each of the transport elements associated with the respective station is associated with the list, and wherein, within the respective list, the instance of each transport element is linked to the instance of the transport element directly ahead of the observed transport element and to the instance of the transport element directly behind the observed transport element, transferring a transport element from a first station to a directly following second station and inserting the instance of this transport element into the list of the second station if a transport job that goes beyond the first station is present for the transport element, wherein the transfer takes place in an event-controlled manner and independently of a transfer point if a predetermined transfer condition is fulfilled, and controlling the linear motors to execute travel jobs of the transport elements.
2. The method in accordance with claim 1, wherein the transfer condition is fulfilled when the transport element has set off and/or has reached a predetermined transfer speed.
3. The method in accordance with claim 1, wherein each instance has the link to the instance of the transport element directly in front of the observed transport element, the link to the instance of the transport element directly behind the observed transport element, and an identification feature for the respective transport element.
4. The method in accordance with claim 3, wherein the links are each configured as pointers referring to memory addresses of the respective instance.
5. The method in accordance with claim 4, wherein the transfer of an instance from the first station to the directly following second station takes place by overwriting the memory addresses to which the respective pointers refer.
6. The method in accordance with claim 1, wherein the transport system has a control unit and a memory area for creating instances for each of the transport elements is provided in the control unit.
7. The method in accordance with claim 1, wherein the stations are at least partly arranged at identical positions along the guide track.
8. A transport system that comprises a plurality of linear motors that are arranged in a row and have a guide track, a plurality of transport elements that can be moved along the guide track by means of the linear motors, and a plurality of stations along the guide track, and further comprising a control unit that is configured to carry out the method in accordance with claim 1.
9. The transport system in accordance with claim 8, wherein the stations are at least partly arranged at identical positions along the guide track.
10. The method in accordance with claim 1, wherein the transport system is a multi-carrier system
11. The transport system in accordance with claim 8 that is a multi-carrier system.
Description
[0033] The invention will be described schematically and by way of example with reference to the drawings. It is shown therein:
[0034]
[0035]
[0036]
[0037]
[0038]
[0039] The transport elements 15, 17, 19 are magnetically driven by the linear motors 11. For this purpose, the transport elements 15, 17, 19 have one or more permanent magnets, not shown, that are acted on by a driving force by means of a changing and/or wandering magnetic field that is generated by the linear motors 11. The driving force leads to a movement of the transport elements 15, 17, 19 along the guide track 13. The transport elements 15, 17, 19 can in particular be moved independently and separately from one another. The linear motors 11 are controlled by a control unit, not shown, to drive the respective transport elements 15, 17, 19.
[0040] As can be seen from
[0041] Each of the transport elements 15, 17, 19 on the path is associated with exactly one of the stations S.sub.1, S.sub.2, S.sub.3 at any point in time. This means that the respective station S.sub.1, S.sub.2, S.sub.3 is responsible for the transport elements 15, 17, 19 associated with it and can execute commands for the transport elements 15, 17, 19, in particular for stopping or driving, by means of the control unit.
[0042]
[0043] In accordance with the invention, an instance is created for each transport element (also referred to as a carrier, a mover, or a runner) that is located on the path. If, for example, twenty transport elements are moved on the path, twenty instances are created so that there is a corresponding pool with one instance for each transport element. This in particular takes place in a central memory area of the control unit that is provided centrally for the maximum number of transport elements.
[0044] Each of the instances I.sub.1, I.sub.2, I.sub.3 is provided with an identification feature 21 that uniquely identifies the transport element corresponding to the respective instance I.sub.1, I.sub.2, I.sub.3 (Carrier 1, Carrier 10, Carrier 9). Furthermore, each instance I.sub.1, I.sub.2, I.sub.3 has a link 23 to the instance of the transport element directly ahead of the observed transport element and a link 25 to the instance of the transport element directly behind the observed transport element. The links 23, 25 are in particular configured as pointers that refer to the memory areas of the respective target elements. If it is the foremost transport element in the direction of movement x or the last transport element in the direction of movement x that is associated with the corresponding station, the respective links 23, 25 are marked as links to nothing, namely here as a null reference, see the link 23 of the instance I.sub.1 and the link 25 of the instance I.sub.3.
[0045] With this data structure, an overview results for the station at any point in time, on the basis of its list, of all the transport elements associated with the station, their logical sequence along the direction of movement x and, based on the null references, also an overview of which transport element is the first or the last transport element along the direction of movement x that is associated with the station. Significant memory savings can be achieved in this respect since sufficient memory for the maximum number of transport elements does not have to be provided for each station. Rather, a global pool of instances, which are each associated with a list or chain, is created. Furthermore, an additional management of the sequence of the transport elements associated with the station along the path is obsolete. The station that will always grant the next travel job to the first element of the list or chain that is linked to this foremost transport element can always address the corresponding transport element via the first entry of its list.
[0046]
[0047] In accordance with
[0048] In an implementation with pointers as links 23, 25, the transfer of the respective instances can therefore already be effected by overwriting the memory addresses to which the respective pointers refer in each case so that the transferred instance is correctly removed from the list or chain link of the preceding station and is added to the list or chain link of the following station.
[0049] The transfer takes place in an event-controlled manner without separate transfer points being required that are also designated as trigger points. Only a defined transfer condition is required. This can be, for example, that the transport element has been set into motion or has reached a certain transfer speed. Thus, it is, for example, possible for the transport element to be transferred to the following station directly after starting to move, even if it has not yet arrived there. A stopping at a waiting position or transfer position is then not necessary if the receiving station is free. If the currently executed transport job goes beyond the receiving station and the receiving station is free, the latter can even directly transfer the transport element further to the next following station. The travel time can thus already be used to prepare commands for the transport element. Ideally, unnecessary stopping processes for the respective transport element can be avoided.
[0050] The method described here thus leads, on the one hand, to memory savings and, on the other hand, also to an improved and simplified handling of transport elements on the path.
REFERENCE NUMERAL LIST
[0051] 10 transport system [0052] 11 linear motor [0053] 13 guide track [0054] 15 first transport element [0055] 17 second transport element [0056] 19 third transport element [0057] 21 identification feature [0058] 23 link [0059] 25 link [0060] I.sub.1 instance [0061] I.sub.2 instance [0062] I.sub.3 instance [0063] L.sub.S1 list (station 1) [0064] L.sub.S2 list (station 2) [0065] S.sub.1 station [0066] S.sub.2 station [0067] S.sub.3 station [0068] x direction of movement