EP1204491B1 - Verfahren zum sortieren einer gruppe von gegenständen - Google Patents
Verfahren zum sortieren einer gruppe von gegenständen Download PDFInfo
- Publication number
- EP1204491B1 EP1204491B1 EP00958314A EP00958314A EP1204491B1 EP 1204491 B1 EP1204491 B1 EP 1204491B1 EP 00958314 A EP00958314 A EP 00958314A EP 00958314 A EP00958314 A EP 00958314A EP 1204491 B1 EP1204491 B1 EP 1204491B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- sorting
- objects
- storage area
- relevant
- sorting step
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B07—SEPARATING SOLIDS FROM SOLIDS; SORTING
- B07C—POSTAL SORTING; SORTING INDIVIDUAL ARTICLES, OR BULK MATERIAL FIT TO BE SORTED PIECE-MEAL, e.g. BY PICKING
- B07C3/00—Sorting according to destination
Definitions
- the invention relates to a sorting method and a sorting device for Implementation of the sorting process.
- the invention has for its object to provide a sorting method which is a great sorting speed when sorting one Group of objects possible and which with simple apparatus Funds is automatically feasible.
- a method of sorting a Group of items according to an ascending order or a descending sequence of order numbers that correspond to the objects are assigned, proposed in successive Sorting the items undergoes a sorting treatment, depending on the sorting criterion, whether the order number of the respective object in its binary representation a zero depending on the relevant position depending on the sorting step concerned or has or would have a one, a respective first one Storage area or a respective second storage area Assigns sorting treatment in the next sorting step, being in the first Sort step the least significant digit and in the successive further sorting steps, the next higher digit of the Order number in the binary representation for the sort criterion is relevant, starting with the second sorting step either first all items from the respective first memory area and then the items from the respective second storage area or first all items from the second storage area and then the items from the first memory area - the relevant memory area order maintaining for all further sorting steps - the Undergoes sorting treatment, at the latest from the third Sorting step in the order in which
- the sorting method according to the invention is simple automate and by means of a correspondingly adapted conveyor, e.g. Suspended conveyor system.
- a correspondingly adapted conveyor e.g. Suspended conveyor system.
- the objects on conveyors which serve as a means of transport and which along the relevant guide rails are movably guided.
- the goods are conveyed by means of drive belts or the like along the guide rails
- Movement driven being in storage areas, which are called storage areas can be used, can optionally be stowed.
- the sorting device can be implemented using simple apparatus are, usually known from the field of conveyor technology Components for building a sorting device according to the Invention are applicable.
- Embodiment of a sorting device according to the invention comes with a single support group that is between two nodes has a bridging branch in the sense of a bypass section, wherein in the switching device is provided at a node.
- the original Group can be divided several times if necessary. If a one-time division of the group should suffice, an approximate halving is aimed for.
- the original group can be divided by: in a preparatory step, all items with an order number greater than a predetermined number of a first subset assigns the remaining items to the original group instructs a second subgroup. Then the subgroups sorted sequentially according to the method of claim 1. Finally the individually sorted sub-groups can be merged so that all original items are sorted accordingly an ascending sequence of the order numbers are summarized.
- the respective order number is provided in machine-readable form, for example in the form of a barcode, on the respective conveyed goods carrier, so that the optoelectronic reading device L, which is arranged directly in front of an input switch W1, the order numbers of the objects which are guided past the reading device L in turn can capture.
- the reading device L forwards the read information to a control device S, this control device preferably comprising a microcomputer for controlling the individual sorting steps which will be explained below.
- the control device controls the input switch W1 in accordance with the order number of the respective next object which is read in by the reading device L and which is fed to the switch.
- the criterion for the respective setting of the switch W1 is the 2 ° bit in the binary representation of the respective order number.
- the switch W1 controlled by the control device S lets the object in question pass to the first memory area 21. If, on the other hand, the 2 0 bit of the order number of the object next to the switch W1 is 1, then the switch W1 lets the object through to the second memory area 22. After all objects have passed through the entry switch W1, the first sorting step is ended. In the example, the items with the order numbers 4 and 2 are then in the first memory area 21 and the items with the order numbers 5, 7, 1 and 3 are in the second memory area 22. The first sorting step thus has a separation of the original group of items in creates a group with an even number and a group with an odd number.
- the second sorting step begins with the objects being fed from the first storage area 21 to the switch W21.
- the switch W21 leaves the objects in the following first memory area 31 or to the following second memory area 32.
- the original second storage area 22 is treated in that the objects stored therein are fed via the switch W22 to the following first storage area 31 or the following second storage area 32.
- This sorting treatment of the original second memory area 22 still belongs to the second sorting step, in which the second last digit, ie the 2 1 bit, in the binary representation of the respective ordinal number is still relevant for the sorting decision.
- the items 5 and 1 reach the first storage area 31, since their ordinal numbers have a zero at the second last position in the binary representation, whereas the items with the ordinal numbers 7 and 3 are instructed in the second memory area 32 since their ordinal numbers have a one in the second last place in the binary representation.
- the second sorting step is ended.
- the starting situation for the third sorting step that follows is as follows: The objects with the ordinal numbers 4, 5 and 1 are located in the current first storage area 31. The objects with the ordinal numbers 2, 7, 3 are located in the current second storage area 32 The storage areas 31 and 32 used as target storage areas for the second sorting step are now the source storage areas for the third sorting step.
- the third sorting step takes place in an analogous manner to the second sorting step, in that first all objects from the first storage area 31 are subjected to a sorting treatment by means of the switch W31, before all objects from the second storage area 32 are then subjected to the sorting treatment by means of the switch W32.
- the third to last position ie the 2 2 bit, is now used for the sorting criterion in the binary representation of the ordinal number. All objects in which the ordinal number has a zero at the third to last position in the binary representation reach the following first memory area 41, whereas the remaining objects in which the ordinal number has a one in the third last position are introduced into the following second memory area 42.
- the articles from the first storage area 31 and then the articles from the second storage area 32 are each subjected to the sorting treatment in the order in which they were introduced into the relevant storage area.
- the third sorting step thus proceeds as follows: the objects with the ordinal numbers 4 and 5 arrive in succession in the second storage area 42 before the object with the ordinal number 1 is then instructed in the first storage area 41.
- the object with the ordinal number 2 then arrives in the first memory area 41.
- the object with the ordinal number 7 is instructed in the second memory area 42.
- the object with the ordinal number 3 arrives in the first storage area 41.
- the objects with the ordinal numbers 1, 2 and 3 are therefore in the first storage area 41, whereas the objects with the ordinal numbers 4, 5 are in the second storage area or 7 are to be found.
- the objects are already present in the individual memory areas 41 and 42 in the correct ascending order of their order numbers.
- a fourth sorting step which is carried out completely analogously to the third sorting step by means of the switches W41 and W42, the fourth last position of the ordinal number in the binary representation being considered as the sorting criterion in the fourth step.
- the first storage area in this case, storage area 41
- the objects from the second storage area 42 are then treated in a corresponding manner.
- the control of the turnouts W21, W22, W31, W32, W41, W42 u. possibly. further switches are made by means of the control device S.
- Each of the a respective reader L can be assigned to the last-mentioned switches be which of the control device the respective order number of the notifies the object guided next to the switch in question, so that the control device S the switch according to the order number or in accordance with the applicable to the order number Sort criterion of the respective sort step can apply.
- the control device S basically the respective target assignment of the memory areas in Calculate the assignment to each sorting step in advance if the Order of the ordinal numbers of the group originally introduced was detected by objects for the control device, for example with the reader L, which precedes the input switch W1 is.
- the control device S for each sorting step can be calculated which object taking into account the above described sequence when processing the respective memory areas the next switch to be controlled is supplied.
- the means the control device each calculated target state when occupying the memory areas always correspond to the actual state.
- the atomic number of each of a switch read object to the switch according to the Control the sorting criterion in the respective sorting step can possibly be with one in the manner described above respective order number calculated by the control device compared to the correct functioning of the sorting device monitor. If there is a discrepancy between the calculated target order number and read actual order number occurs, this is a Indicates that a sorting error has occurred.
- Such a sorting error can occur, for example, if an item is accidentally falls out of the conveyor system forming the sorting device or derailed and then back into the conveyor system, but at random Place that is introduced.
- FIG. 2 shows an example of a sorting conveyor circuit according to the invention for a conveyor, in particular overhead conveyor, in one highly schematic representation during various stages at the Processing a sorting task.
- a sorting preparation step the objects are successively fed via the feed path Z to a switch WO controlled by a control device S.
- the turnout WO is controlled in such a way that it passes all objects with a sequence number ⁇ 8 to a first preparation memory SP01, whereas all objects with a sequence number ⁇ 8 are fed to a second preparation memory SP02.
- Such separation in particular approximately halving the original group is useful in a large number of objects to be sorted in the original group to t questioneden get along for further sorting process with relatively small and reasonably clear Speicher Schemeskapazi.
- the control device S receives from the reading device L0 the information about the order number of the object next supplied to the switch W0. For this purpose, it is assumed that each object is carried by a conveyed goods carrier that has the order number of the object in machine-readable form for automatic reading by means of the reading device L.
- the conveyor circuit 50 has an inner bridging branch 50i which starts from a switch W controllable by the control device S. and leads to the node K, so that according to the arrows indicated direction of rotation of the conveyor circuit to the switch W moved Goods carriers with their objects in accordance with the course setting the soft W either in the inner bridging branch 50i or be guided into the outer conveyor branch 50a.
- a reader L is the switch W upstream in the sense that it is the order number of the following object of the switch Funding agencies can read the order number information for the Provide control device S, which then according to the the sorting criterion assigned to the respective sorting step the position of the Turnout W controls depending on the respective order number.
- In front of the switch W can also be a device for separating the Objects may be provided.
- stop elements B1i, B2i or B1a, B2a are provided.
- the stop elements are between a blocking position and one Release position can be moved in a controlled manner.
- the control of each Stop elements are carried out by means of the control device S.
- a stop element in question extends into the conveyor section of the Conveyed goods carriers in order to continue conveying goods carriers on a further journey prevent.
- a stop element in question is off the respective conveyor line removed.
- a relevant one is blocked Conveyor route, be it in the bridging branch 50i or in the outer one Conveying branch 50a, there may be a jam of conveyed goods carriers behind the form a blocking stop element. As soon as the respective stop element then has been transferred to the release position, the jam can dissolve.
- a first source memory area is located between the stop elements B1 i and B2i QS1 provided in the bridge branch 50i.
- a first target storage area ZS1 is located between the stop element B2i and the switch W.
- Between the stop element B1a and the stop element B2a defines a second source memory area QS2 while a second target memory area ZS2 between the stop element B2a and the soft W is given.
- the first sorting step is now carried out carried out.
- the switch W allows all objects odd atomic number, namely in the example the objects with the ordinal numbers 5, 7, 1, 3, to the first target memory area ZS1 by.
- the Stop elements B2i and B2a are still in the blocking position, until all objects with their goods carriers move the switch W have happened.
- the control device S then initiates the stop elements B2i and B2a to go into the release position so that the respective objects from the target storage area ZS1 or ZS2 get into the adjacent source memory area QS1 or QS2 can.
- situation b) according to FIG. 2 is at the end the first sorting step, all stop elements B1a and B2a and B1i and B2i are in the blocking position.
- the was relevant for the sorting criterion of the first sorting step least significant digit of the respective order number in the binary representation, so the 2 ° bit.
- all items with an order number which is a zero in the least significant position in the binary representation in the second source memory area QS2.
- These are the Objects with the even numbers 4 and 2.
- the Items with order numbers that appear in their binary representation least significant digit have a one, i.e. the objects with odd-numbered ordinal numbers are located after the first sorting step in the first source memory area QS1.
- the second sorting step is the second to last digit of the respective order number relevant in the binary representation for the sort criterion.
- the second sorting step is initiated in that the stop element B1a is transferred to the release position so that the objects with the Order numbers 4 and 2 are supplied to the switch W one after the other become.
- the control device S controls the switch so that the object with the order number 4, which is second to last in the binary representation Has a zero in the second target memory area ZS2 arrives, whereas the item with the order number 2, which in the binary representation has a one in the second to last position, in the first target memory area ZS1 is passed.
- the sorting treatment in the source memory area now follows QS1 items with the serial numbers 5, 7, 1, 3.
- the stop element B1i is in the release position offset so that the objects are transported to the turnout W.
- the sorting criterion of the second sorting step still applies, see above that the item with order number 5 is in the storage area ZS2 arrives, after which the item with the order number 7 in the Storage area ZS1 is performed.
- the item with the serial number 1 comes back into the memory area ZS2, whereas the Item with order number 3 in the storage area ZS1 is directed.
- the third sorting step then follows in an analogous manner to the previous sorting steps, the third to last position of the order numbers in the binary representation, that is to say the 2 2 bit, now being relevant for the sorting criterion.
- the objects from the source storage area QS2 are first subjected to the sorting treatment in the given sequence, after which the objects from the source storage area QS1 are then subjected to the sorting treatment.
- Situation e) according to FIG. 2 shows the sorting state after the third sorting step has been completed.
- the fourth sorting step which in turn is carried out analogously to the preceding sorting steps and in which the fourth last digit of the order number in the binary representation, that is the 2 3 - Bit, which is relevant, is the situation f) according to FIG. 2.
- the objects are sorted in ascending order of their order numbers and can then be removed from the conveyor circuit 50 one after the other and fed, for example, to an output store.
- the objects become from the preparation memory SP02 with the order numbers 9, 11, 11, 8, 9 fed to the conveyor circuit 50 and subjected to the sorting process until all objects with the Ordinal numbers 8, 9 and 11 are available in the desired order.
- the items ordered in this way can then be stored in the output memory are transferred, in which then all objects of the original Group in the correct order of order numbers 1, 2, 3, 4, 5, 7, 8, 9, 9, 11, 11 are present.
- the descending order would be achieved if in each sorting step first on QS1 and then on QS2 would have been accessed.
- the illustrated exemplary embodiments show that the sorting method according to the invention with continuous forward flow of the objects can be carried out, i.e. it is not necessary for the items Carry out forward-backward runs. This not only brings advantages in terms of drive technology, but in particular also time advantages when sorting, so that a comparatively high sorting speed is achievable.
- the exemplary embodiments described also show that the inventive Sorting process with different sorting devices Type can be carried out, in particular a support group of the type shown in Fig. 2 can be realized with few elements can.
- the control device S it is also possible for the control device S always the actual sorting state with the target sorting state compares and controls the sorting process if an error occurs, that sorting steps are repeated, possibly starting with the first sorting step to fix the sorting error.
- sorting criterion is the bit-wise Query if necessary through various alternative mathematical representations can be formulated on the same conditions same physical sorting process and sorting effect and thus are encompassed by the invention.
- the least significant digit of an ordinal number has a zero or a one in the binary representation, this can e.g. alternatively, this can also be done by using the ordinal number (as natural number) divided by 2 in the range of natural numbers and uses the resulting rest as a sorting criterion. For this, e.g. considered the decimal number 7.
- the binary representation is: 0111. The least significant bit is therefore a one.
- the number 6 is 0110 in binary form.
- the least significant bit is therefore 0.
- Dividing the number 6 by 2 gives the value 3, remainder 0.
- the residual value 0 is again the distinguishing feature for the first Sorting step.
- the bit query and the residual value query are therefore two equivalent representations of one and the same physical state of affairs and thus two mutually corresponding representations of those in the invention sort criteria used.
- Such an assessment of the residual value is also possible as an alternative representation of the sorting criterion in relation to the higher order bit positions of binary numbers. It can easily be shown that an ordinal number, which results in a remainder of 0 or 1 when divided by 4, has a zero in the binary representation at the second least significant bit, i.e. the 2 1 bit. If there is a remainder of 2 or 3 when dividing by 4, the 2 1 bit has a one. Instead of directly querying the 2 1 bit in the binary representation, the corresponding sorting criterion can alternatively be represented by dividing the ordinal number by 4 and differentiating according to the residual values.
- an ordinal number in its binary representation has a zero or a one in its third least significant position, i.e. the 2 2 bit
Description
- Fig. 1
- zeigt ein Blockschaubild zur Erläuterung einer Variante des Verfahrens nach der Erfindung.
- Fig. 2
- zeigt in einer stark schematisierten Darstellung eine Sortiereinrichtung nach der Erfindung während verschiedener Stadien bei der Abarbeitung einer Sortieraufgabe.
Claims (5)
- Verfahren zum Sortieren einer Gruppe von Gegenständen entsprechend einer aufsteigenden Folge oder einer abfallenden Folge von Ordnungsnummern, die den Gegenständen zugeordnet sind, wobei man in aufeinander folgenden Sortierschritten die Gegenstände einer Sortierbehandlung unterzieht, indem man sie abhängig von dem Sortierkriterium, ob die Ordnungsnummer des jeweiligen Gegenstandes in ihrer binären Darstellung an einer abhängig vom betreffenden Sortierschritt relevanten Stelle eine Null oder eine Eins aufweist bzw. aufweisen würde, einem jeweiligen ersten Speicherbereich oder einem jeweiligen zweiten Speicherbereich zur Sortierbehandlung im nächsten Sortierschritt zuweist, wobei im ersten Sortierschritt die niederwertigste Stelle und in den aufeinander folgenden weiteren Sortierschritten die jeweilige nächsthöherwertige Stelle der Ordnungsnummer in der binären Darstellung für das Sortierkriterium relevant ist, wobei man ab dem zweiten Sortierschritt entweder zuerst alle Gegenstände aus dem jeweiligen ersten Speicherbereich und dann die Gegenstände aus dem jeweiligen zweiten Speicherbereich oder zuerst alle Gegenstände aus dem zweiten Speicherbereich und dann die Gegenstände aus dem ersten Speicherbereich - die betreffende Speicherbereichs-Reihenfolge für alle weiteren Sortierschritte beibehaltend - der Sortierbehandlung unterzieht, und zwar spätestens ab dem dritten Sortierschritt in der Reihenfolge, in der die Gegenstände dem jeweiligen Speicherbereich im vorausgegangenen Sortierschritt zugeführt worden sind.
- Verfahren nach Anspruch 1, wobei man die Gruppe in wenigstens einen Vorbereitungsschritt unterteilt in eine Untergruppe von Gegenständen, deren Ordnungsnummer kleiner ist als eine betreffende vorbestimmte Zahl, und in eine Gruppe von Gegenständen, deren Ordnungszahl gleich oder größer ist als die vorbestimmte Zahl, und wobei man jede Untergruppe gemäß Anspruch 1 sortiert.
- Verfahren nach Anspruch 2, dadurch gekennzeichnet, daß man die Untergruppen nach deren Sortierung geordnet zusammenführt.
- Sortiereinrichtung zum Sortieren von Gegenständen gemäß dem Verfahren nach Anspruch 1, wobei die Sortiereinrichtung Teil einer Fördereinrichtung, insbesondere Hängefördereinrichtung, ist, in der Fördergutträger als Transportmittel für die Gegenstände längs betreffender Förderstrecken an Führungselementen, insbesondere Führungsschienen, geführt bewegbar sind, wobei die Sortiereinrichtung folgende Merkmale umfasst:einen als ersten Ziel-Speicherbereich (ZS1) zu nutzenden ersten Förderstreckenabschnitt und einen als zweiten Ziel-Speicherbereich (ZS2) zu nutzenden zweiten Förderstreckenabschnitt zur Zwischenlagerung von an Fördergutträgern befindlichen Gegenständen während eines jeweiligen Sortierschrittes nach Maßgabe des in dem Sortierschritt relevanten Sortierkriteriums,einen als ersten Quell-Speicherbereich (QS1) zu nutzenden Förderstreckenabschnitt und einen als zweiten Quell-Speicherbereich (QS2) zu nutzenden Förderstreckenabschnitt zur Bereitstellung der an Fördergutträgern befindlichen Gegenstände zur Sortierbehandlung bei einem jeweiligen Sortierschritt,wenigstens eine Weicheneinrichtung (W) zwischen den Quell-Speicherbereichen (QS1, QS2) und den Ziel-Speicherbereichen (ZS1, ZS2),wenigstens eine nahe der Weicheneinrichtung (W) vorgesehene Datenleseeinrichtung (L) zur Erfassung von vorzugsweise an den Fördergutträgern in maschinenlesbarer Form vorgesehenen Ordnungsnummern von Gegenständen, die der Weicheneinrichtung (W) zugeführt werden,eine Ordnungsnummer-Informationen von der Datenleseeinrichtung (L) empfangende Steuereinrichtung (S), die dazu eingerichtet ist, die Zufuhr der Fördergutträger mit daran befindlichen Gegenständen zu der Weicheneinrichtung (W) und die Weichenstellung der Weicheneinrichtung (W) zu steuern, so dass nach Maßgabe des Sortierkriteriums, ob die Ordnungsnummer des der Weicheneinrichtung (W) jeweils zugeführten Gegenstandes in ihrer binären Darstellung an einer abhängig vom betreffenden Sortierschritt relevanten Stelle eine Null oder eine Eins aufweist bzw. aufweisen würde, die betreffenden Gegenstände bei den Sortierschritten dem ersten Ziel-Speicherbereich (ZS1 ) und daraus dem ersten Quell-Speicherbereich (QS1) oder dem zweiten Ziel-Speicherbereich (ZS2) und daraus dem zweiten Quell-Speicherbereich (QS2) zur Sortierbehandlung im nächsten Sortierschritt zugeführt werden, wobei im ersten Sortierschritt die niederwertigste Stelle und in den aufeinander folgenden weiteren Sortierschritten die jeweilige nächst höherwertige Stelle der Ordnungsnummer in der binären Darstellung für das Sortierkriterium relevant ist, wobei ab dem zweiten Sortierschritt entweder zuerst alle Gegenstände aus dem ersten Quell-Speicherbereich (QS1) und dann die Gegenstände aus dem zweiten Quell-Speicherbereich (QS2) oder zuerst alle Gegenstände aus dem zweiten Quell-Speicherbereich (QS2) und dann die Gegenstände aus dem ersten Quell-Speicherbereich (QS1 ) - die betreffende Quell-Speicherbereichs-Reihenfolge für alle weiteren Sortierschritte beibehaltend - der Weicheneinrichtung (W) zugeführt werden, und zwar spätestens ab dem dritten Sortierschritt in der Reihenfolge, in der die Gegenstände dem jeweiligen Quell-Speicherbereich (QS1, QS2) im vorausgegangenen Sortierschritt zugeführt worden sind.
- Sortiereinrichtung nach Anspruch 4, dadurch gekennzeichnet, daß die Ziel-Speicherbereiche (ZS1, ZS2) und die Quell-Speicherbereiche (QS1, QS2) in Förderkreisen (50i, 50a) vorgesehen sind, welche über die Weicheneinrichtung (W) miteinander in Verbindung stehen.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE19938470 | 1999-08-13 | ||
DE19938470A DE19938470A1 (de) | 1999-08-13 | 1999-08-13 | Verfahren zum Sortieren einer Gruppe von Gegenständen |
PCT/EP2000/007313 WO2001012347A1 (de) | 1999-08-13 | 2000-07-28 | Verfahren zum sortieren einer gruppe von gegenständen |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1204491A1 EP1204491A1 (de) | 2002-05-15 |
EP1204491B1 true EP1204491B1 (de) | 2003-10-01 |
Family
ID=7918332
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP00958314A Expired - Lifetime EP1204491B1 (de) | 1999-08-13 | 2000-07-28 | Verfahren zum sortieren einer gruppe von gegenständen |
Country Status (7)
Country | Link |
---|---|
US (1) | US7126074B1 (de) |
EP (1) | EP1204491B1 (de) |
JP (1) | JP2003507170A (de) |
AT (1) | ATE250986T1 (de) |
DE (2) | DE19938470A1 (de) |
ES (1) | ES2207547T3 (de) |
WO (1) | WO2001012347A1 (de) |
Families Citing this family (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7250582B2 (en) | 2002-10-08 | 2007-07-31 | Lockheed Martin Corporation | Method and system for sequentially ordering objects using a single pass delivery point process |
US6924451B2 (en) * | 2002-10-08 | 2005-08-02 | Lockheed Martin Corporation | Method for sequentially ordering objects using a single pass delivery point process |
US20040251179A1 (en) * | 2002-10-08 | 2004-12-16 | Hanson Bruce H. | Method and system for sequentially ordering objects using a single pass delivery point process |
US20070075000A1 (en) * | 2005-09-30 | 2007-04-05 | Lockheed Martin Corporation | Sort mechanism and method of use |
DE102008018937A1 (de) * | 2008-04-15 | 2009-10-29 | Siemens Aktiengesellschaft | Vorrichtung und Verfahren zum Transport von Gegenständen über sich kreuzende Transportpfade |
US20100241272A1 (en) * | 2009-03-20 | 2010-09-23 | Goss International Americas, Inc. | Automated product transporting and sorting apparatus and method |
DE102009043008A1 (de) | 2009-09-28 | 2011-03-31 | Herbert Kannegieser Gmbh | Verfahren zum Sortieren textiler Gegenstände |
DE102011085458A1 (de) | 2011-10-28 | 2013-05-02 | Siemens Aktiengesellschaft | Sortieranlage und Sortierverfahren mit zwei Speicher-Bereichen |
US10722920B2 (en) * | 2017-02-21 | 2020-07-28 | Siemens Aktiengesellschaft | Device and method for delivery point sorting |
CN107838041A (zh) | 2017-09-30 | 2018-03-27 | 北京极智嘉科技有限公司 | 包裹落件方法、分拣机器人和分拣系统 |
CH715719A1 (de) * | 2019-01-09 | 2020-07-15 | Ferag Ag | Pufferspeicheranlage für Hängefördersysteme. |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS5670886A (en) * | 1979-11-14 | 1981-06-13 | Nippon Electric Co | Sorter |
FR2525127A1 (fr) * | 1982-04-15 | 1983-10-21 | Fustier Guy | Dispositif de classement d'objets manutentionnes |
US5072822A (en) * | 1990-06-20 | 1991-12-17 | Fabri-Check, Inc. | Article sorting system |
US5377814A (en) * | 1990-06-20 | 1995-01-03 | Fabri-Check, Inc. | Transport carrier for use in an article sorting system |
DE4118164A1 (de) * | 1991-06-03 | 1992-12-10 | Rsl Logistik Gmbh & Co | Verfahren und vorrichtung zum kommissionieren |
DE4226066A1 (de) * | 1992-08-06 | 1994-02-10 | Rsl Logistik Gmbh & Co | Verfahren zum Sortieren |
JPH07185472A (ja) | 1993-12-28 | 1995-07-25 | Hitachi Ltd | 紙葉類区分装置 |
JP3590998B2 (ja) * | 1994-08-19 | 2004-11-17 | 株式会社日立製作所 | 区分機システム |
DE19513734C2 (de) * | 1995-04-11 | 2003-10-23 | Wf Logistik Gmbh | Verfahren zum Sortieren einer Mehrzahl einzeln geförderter Gegenstände |
US6373012B1 (en) * | 2000-09-15 | 2002-04-16 | Lockheed Martin Corporation | Method and apparatus for facilitating custom sorting of mail items and improved search techniques usable therewith |
-
1999
- 1999-08-13 DE DE19938470A patent/DE19938470A1/de not_active Withdrawn
-
2000
- 2000-07-28 JP JP2001516681A patent/JP2003507170A/ja active Pending
- 2000-07-28 US US10/049,431 patent/US7126074B1/en not_active Expired - Fee Related
- 2000-07-28 WO PCT/EP2000/007313 patent/WO2001012347A1/de active IP Right Grant
- 2000-07-28 DE DE50003928T patent/DE50003928D1/de not_active Expired - Lifetime
- 2000-07-28 EP EP00958314A patent/EP1204491B1/de not_active Expired - Lifetime
- 2000-07-28 ES ES00958314T patent/ES2207547T3/es not_active Expired - Lifetime
- 2000-07-28 AT AT00958314T patent/ATE250986T1/de not_active IP Right Cessation
Also Published As
Publication number | Publication date |
---|---|
DE19938470A1 (de) | 2001-02-15 |
DE50003928D1 (de) | 2003-11-06 |
US7126074B1 (en) | 2006-10-24 |
ATE250986T1 (de) | 2003-10-15 |
EP1204491A1 (de) | 2002-05-15 |
WO2001012347A1 (de) | 2001-02-22 |
JP2003507170A (ja) | 2003-02-25 |
ES2207547T3 (es) | 2004-06-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1204491B1 (de) | Verfahren zum sortieren einer gruppe von gegenständen | |
EP0853984B1 (de) | Vorrichtung und Verfahren zum Überführen von Sortiergutstücken in eine geordnete Reihe | |
EP0834354B1 (de) | Vorrichtung und Verfahren zum Überführen von Sortiergutstücken in eine geordnete Reihe | |
EP0582224B1 (de) | Verfahren zum Sortieren | |
DE102006003270A1 (de) | Vorrichtung und Verfahren zum Sortieren von ungeordneten Behältern in einem Kommissioniersystem | |
DE1781183C2 (de) | Verteilanlage mit einem Stückgut-Sortierförderer | |
EP1073601B1 (de) | Bearbeitungssystem zur bearbeitung von stückgut | |
DE10332359A1 (de) | Verfahren und Vorrichtung zur Frühgepäckspeicherung | |
AT525183A2 (de) | Verteilersystem und Verfahren zum Fördern von Waren in einem Lager- und Kommissioniersystem | |
EP1012087B1 (de) | Vorrichtung und verfahren zum ausleiten von gegenständen, die auf einem transporteur befördert werden | |
EP0737634B1 (de) | Verfahren zum Sortieren einer Mehrzahl einzeln geförderter Gegenstände | |
DE2831843A1 (de) | Foerdereinrichtung | |
EP3178986A1 (de) | Verfahren und vorrichtung zum sortieren von wäschestücken | |
DE4032048C2 (de) | Probenverarbeitungs- und Verteilungsgerät | |
DE10145606A1 (de) | Verfahren zum Einlagern von Fördergut-Teilen in einen Speicher und zur Ausgabe von ausgewählten Fördergut-Teilen | |
EP4081354B1 (de) | Sortiervorrichtung und -verfahren | |
WO1994002398A1 (de) | Einrichtung für die verarbeitung von druckprodukten | |
DE2813902C2 (de) | Vorrichtung zur Steigerung der Besetzung eines Bearbeitungsgerätes für die zeitgerechte Reihenbearbeitung von Gütern im Zuge eines Stetigförderers, insbesondere eines Power- und Free-Förderers | |
DE202006005115U1 (de) | Vorrichtung zum Sortieren von ungeordneten Behältern in einem Kommissioniersystem | |
DE19603363C2 (de) | Verfahren zum Betreiben einer Sorteranlage | |
DE3638436A1 (de) | Transportvorrichtung fuer gegenstaende, insbesondere an einer etikettiermaschine | |
DE967949C (de) | Einrichtung zur Steuerung des Programms eines Ablaufes von Bearbeitungs-, Regel- oder Steuervorgaengen mit wenigstens zwei Impulsgebern | |
DE102021110132A1 (de) | Verfahren zum Betreiben eines Förderers für hintereinander folgende Güter und entsprechendes Fördersystem | |
EP0947449B1 (de) | Verfahren zum Betrieb einer Anlage zum Zusammenstellen auftragsspezifischer Warengruppen sowie Anlage zur Durchführung des Verfahrens | |
DE60107616T2 (de) | Verfahren zum Sortieren von Massengütern mittels eines Fördersystems |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20020206 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE |
|
GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20031001 Ref country code: IE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20031001 Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20031001 |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D Free format text: NOT ENGLISH |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
GBT | Gb: translation of ep patent filed (gb section 77(6)(a)/1977) | ||
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D Free format text: GERMAN |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: NV Representative=s name: A. BRAUN, BRAUN, HERITIER, ESCHMANN AG PATENTANWAE |
|
REF | Corresponds to: |
Ref document number: 50003928 Country of ref document: DE Date of ref document: 20031106 Kind code of ref document: P |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040101 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040101 |
|
REG | Reference to a national code |
Ref country code: SE Ref legal event code: TRGR |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: FG2A Ref document number: 2207547 Country of ref document: ES Kind code of ref document: T3 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FD4D |
|
ET | Fr: translation filed | ||
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040728 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040731 Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040731 Ref country code: MC Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040731 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040731 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed |
Effective date: 20040702 |
|
BERE | Be: lapsed |
Owner name: *WF LOGISTIK G.M.B.H. Effective date: 20040731 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: NL Payment date: 20050714 Year of fee payment: 6 Ref country code: SE Payment date: 20050714 Year of fee payment: 6 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20050725 Year of fee payment: 6 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: ES Payment date: 20050816 Year of fee payment: 6 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: AT Payment date: 20060714 Year of fee payment: 7 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20060728 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20060729 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20070201 |
|
EUG | Se: european patent has lapsed | ||
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20060728 |
|
NLV4 | Nl: lapsed or anulled due to non-payment of the annual fee |
Effective date: 20070201 |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: FD2A Effective date: 20060729 |
|
BERE | Be: lapsed |
Owner name: *WF LOGISTIK G.M.B.H. Effective date: 20040731 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040301 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20060729 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20070728 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20110729 Year of fee payment: 12 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20110630 Year of fee payment: 12 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: IT Payment date: 20110722 Year of fee payment: 12 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST Effective date: 20130329 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130201 Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20120731 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 50003928 Country of ref document: DE Effective date: 20130201 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20120728 |