EP1204491A1 - Method for sorting a group of objects - Google Patents
Method for sorting a group of objectsInfo
- Publication number
- EP1204491A1 EP1204491A1 EP00958314A EP00958314A EP1204491A1 EP 1204491 A1 EP1204491 A1 EP 1204491A1 EP 00958314 A EP00958314 A EP 00958314A EP 00958314 A EP00958314 A EP 00958314A EP 1204491 A1 EP1204491 A1 EP 1204491A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- sorting
- objects
- storage area
- order
- relevant
- 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.)
- Granted
Links
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 carrying out the sorting method.
- the object of the invention is to provide a sorting method which enables a high sorting speed when sorting a group of objects and which can be carried out automatically using simple apparatus.
- a method for sorting a group of objects according to an ascending sequence or a descending sequence of order numbers which are assigned to the objects is proposed, the objects being subjected to a sorting treatment in successive sorting steps, depending on the Sorting criterion, whether the order number of the respective object in its binary representation has or would have a zero or a one depending on the relevant sorting step, assigns a respective first storage area or a respective second storage area for sorting treatment in the next sorting step, the first Sorting step the least significant digit and in the subsequent further sorting steps the respective next most significant digit of the order number in the binary representation is relevant for the sorting criterion, starting from d em second sorting step either first subjecting all items from the respective first storage 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 storage area - maintaining the relevant storage area order for all further sorting steps - to the sorting treatment, specifically at the latest from the third sorting step in the order
- the sorting method according to the invention can be automated easily and by means of a correspondingly adapted conveyor, e.g. Suspend conveyor system.
- the objects are on conveyed goods carriers, which serve as transport means and which are movably guided along the relevant guide rails.
- the conveyed goods carriers are usually driven for movement by means of drive belts or the like along the guide rails, and they can optionally be stowed in stowage areas which can be used as storage areas.
- a sorting device for sorting objects according to the method according to the invention is also proposed, the sorting device being part of a conveying device, in particular a hanging conveying device, in which conveyed goods carriers can be guided on guide elements, in particular guide rails, as transport means for the objects along the conveying lines concerned
- the sorting device comprises the following features: a first conveyor section to be used as the first target storage area and a second conveyor section to be used as the second destination storage area for the intermediate storage of objects located on conveyed goods carriers during a respective sorting process.
- the sorting device can be implemented using simple apparatus, with components which are normally known from the field of conveyor technology being able to be used to construct a sorting device according to the invention.
- the source storage areas and the target storage areas are preferably conveyor section areas of conveyor circuits which are connected to one another via the switch device W.
- a single conveyor circuit is used, which has a bridging branch in the sense of a bypass section between two nodes, the switch device being provided in one node.
- the original group can be divided by assigning, in a preparation step, all objects with an order number greater than a predetermined number to a first sub-group and assigning the remaining objects of the original group to a second sub-group.
- the subgroups are then sorted one after the other according to the method of claim 1.
- the individually sorted subgroups can be merged in an orderly fashion, so that all the original objects are merged according to an ascending sequence of the order numbers.
- Fig. 1 shows a block diagram for explaining a variant of the
- FIG. 2 shows a highly schematic illustration of a sorting device according to the invention during various stages in the processing of a sorting task.
- FIG. 1 One way of carrying out the sorting method according to the invention is explained using the block diagram in FIG. 1.
- six items are to be sorted according to the ascending order of their order numbers, these six items being in a random or arbitrary order according to order numbers 5, 4, 7, 2, 1, 3 of the schematically outlined sorting device via a feeder Conveyor section Z are fed.
- the objects are shown as circles and marked with their order number. It is assumed that each object can be moved through the sorting device on its own conveyed goods carrier along respective conveying lines.
- 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 immediately in front of an entry 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, said control device preferably a microcomputer for controlling the individual items which will be explained below Sorting steps includes.
- 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 ° 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 storage 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 storage area 21 and the items with the order numbers 5, 7, 1 and 3 are in the second storage area 22. The first sorting step thus has a separation of the original group of items in causes 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 storage 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 objects 5 and 1 reach the first memory area 31, since their ordinal numbers have a zero at the second last position in the binary representation, whereas the objects have the ordinal numbers 7 and 3 are instructed in the second memory area 32 because 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 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 sorting step 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 atomic number 2 then comes into the first memory area 41.
- the object with the ordinal number 7 is instructed in the second memory area 42. Finally, the object with the ordinal number 3 arrives in the first storage area 41. After this third sorting step, the items with the order numbers 1, 2 and 3 are therefore in the first storage area 41, whereas the items with the order numbers 4, 5 and 7 can be found in the second storage area. In the case of the example, the objects are already present in the individual memory areas 41 and 42 in the correct ascending order of their order numbers. Only the step remains to bring the objects from the two storage areas 41 and 42 together in an orderly manner.
- 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 digit 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 being sorted in the order in which they were sorted in the previous third step have been introduced into the first memory area 41.
- the objects from the second storage area 42 are then treated in a corresponding manner. Since none of the objects has an ordinal number that has a one in the fourth last position, the objects arrive in the storage area 51, in the order of increasing ordinal numbers.
- the group of objects originally supplied to the sorting device with the order number 5, 4, 7, 2, 1, 3 has thus been sorted in the desired manner.
- Each of the last mentioned turnouts can be assigned a respective reader L, which informs the control device of the respective order number of the object next to the relevant turnout, so that the control device S switches the turnout in accordance with the order number or can apply according to the sorting criterion of the respective sorting step to be applied to the order number.
- the control device S can in principle calculate the respective target occupancy of the memory areas in advance in association with each sorting step, provided the order of the ordinal numbers of the originally introduced group of objects for the Control device was detected, for example with the reader L, which is connected upstream of the input switch W1.
- the reader L which is connected upstream of the input switch W1.
- the control device S can be used to calculate for each sorting step which object, taking into account the sequence described above during processing of the respective memory areas is next supplied to the switch to be currently controlled. With such a procedure it is assumed that the means the control device always corresponds to the calculated actual state when occupying the memory areas.
- the last-mentioned procedure would lead to an incorrect sorting result without actually checking the order numbers of the objects supplied to the points in question by means of the respective reading devices L. It is therefore more advantageous to read in the ordinal number of each object fed to a relevant switch in order to control the switch according to the sorting criterion in the respective sorting step.
- the read order number can possibly be compared with a respective order number calculated in the manner described above by the control device in order to monitor the correct functioning of the sorting device. If there is a discrepancy between the calculated target order number and the read actual order number, this is an indication that a sorting error has occurred.
- Such a sorting error can occur, for example, if an object inadvertently falls out of the conveyor system forming the sorting device or derails and is then reintroduced into the conveyor system, but at an arbitrary point.
- the control device detects a discrepancy in a relevant comparison between the actual state and the target state when the objects are fed to a respective switch, it can, for example, trigger an alarm signal and / or carry out a correction operation, e.g. in the form of repeating sorting steps that have already been carried out in order to remedy the sorting error.
- R is a return path which, in the event of a sorting error, enables the entire group to be returned for re-sorting.
- Embodiment of a sorting device according to the invention is repeatedly accessed or prepared in a recurring manner to physically the same memory area pairs in order to carry out the sorting process up to the desired degree of order of the objects. Such a procedure is explained below with reference to FIG. 2.
- FIG. 2 shows an example of a sorting conveyor circuit according to the invention for a conveyor device, in particular a hanging conveyor device, in a highly schematic representation during various stages in the processing of 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 so that all objects with an order number ⁇ 8 to a first Preparation memory SP01 lets through, whereas all items with an order number> 8 are fed to a second preparation memory SP02.
- Such a separation in particular approximately halving the original group, is expedient in the case of a large number of objects to be sorted in the original group, in order to make do with relatively small and reasonably clear storage area capacities for the further sorting process.
- the control device S receives from the reading device LO the information about the order number of the object supplied next to the switch WO. It is assumed that everyone
- Object is carried by a conveyor, which has the order number of the object in machine-readable form for automatic reading by means of the reader L.
- Preparation memory SP01 contains the items with the order numbers 5, 4, 7, 2, 1, 3, whereas in the preparation store SP02 the items with the order numbers 9, 1 1, 1 1, 8, 9 are stored in the corresponding order of the order numbers.
- the objects from the first preparation store SP01 are first included in the sorting process, these objects being fed to the conveyor circuit 50, so that situation a) according to FIG. 2 results.
- the conveyor circuit 50 has an internal 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 direction of rotation of the conveyor circuit to the switch W indicated by arrows, conveyed goods carriers with their objects move according to the switch - Position of the switch W either in the inner bridging branch 50i or in the outer conveyor branch 50a.
- a reader L is upstream of the switch W in the sense that it is the order number of the object subsequently fed to the switch can read from its conveyed goods carrier in order to provide the order number information for the control device S, which then controls the position of the switch W depending on the respective order number in accordance with the sorting criterion assigned to the respective sorting step.
- a device for separating the objects can also be provided in front of the switch W.
- Stop elements B1 i, B2i and B1 a, B2a are provided both in the inner bridging branch 50i and in the outer conveying branch 50a.
- the stop elements can be moved in a controlled manner between a blocking position and a release position.
- the individual stop elements are controlled by means of the control device S.
- In the blocking position a stop element in question extends into the conveying path of the conveyed goods carriers in order to prevent conveyed goods carriers from continuing to travel.
- a stop element in question is removed from the respective conveyor line. If a relevant conveyor line is blocked, be it in the bridging branch 50i or in the outer conveyor branch 50a, a jam of conveyed goods carriers can form behind the blocking stop element. As soon as the respective stop element has been transferred to the release position, the traffic jam can dissolve.
- a first source memory area QS1 is provided in the bridge branch 50i between the stop elements B1 i and B2i.
- a first target memory area ZS1 is located between the stop element B2i and the switch W.
- a second source memory area QS2 is defined between the stop element B1a and the stop element B2a, while a second target memory area ZS2 is located between the stop element B2a and the switch W. given is.
- the switch W allows all objects with an odd ordinal number, namely in the example the objects with the ordinal numbers 5, 7, 1, 3, to pass through to the first target storage area ZS1.
- the objects with the even ordinal numbers namely the objects with the ordinal numbers 4, 2 in the example, are routed from the switch W to the second target storage area ZS2.
- the stop elements B2i and B2a are still in the blocking position until all objects with their goods carriers have passed the switch W.
- the control device S then causes the stop elements B2i and B2a to pass into the release position so that the respective objects can get from the target memory area ZS1 or ZS2 to the adjacent source memory area QS1 or QS2.
- situation b) according to FIG. 2 is present at the end of the first sorting step, all stop elements B1 a and B2a and B1 i and B2i being in the blocking position.
- Relevant for the sorting criterion of the first sorting step was the least significant digit of the respective order number in the binary representation, ie the 2 ° bit.
- all objects with an order number which has a zero in the least significant position in the binary representation, are located in the second source memory area QS2.
- the items with order numbers that have a one in their binary representation at the least significant position, i.e. the items with odd number numbers, are in the first source memory area QS1 after the end of the first sorting step.
- the second last digit of the respective order number in the binary representation is relevant for the sorting criterion.
- the second sorting step is initiated in that the stop element B1 a is transferred to the release position, so that the items with the order numbers 4 and 2 are fed to the switch W one after the other.
- the control device S controls the switch so that the item with the order number 4, which has a zero in the second to last position in the binary representation, reaches the second target storage area ZS2, whereas the item with the Order number 2, which has a one in the second last position in the binary representation, is routed into the first target memory area ZS1.
- the stop elements B2i and B2a which are normally in the blocking position, are switched into the release position by the control device S, so that the objects get from the target storage area ZS2 to the source storage area QS2 and the objects reach the source memory area QS1 from the target memory area ZS1.
- the second sorting step is then completed and situation d) according to FIG. 2 is present in the example.
- the third sorting step then follows in an analogous manner to the previous sorting steps, with the now being used for the sorting criterion third last digit of the order numbers in the binary representation, i.e. the 2 2 bit, is relevant.
- the objects from the source storage area QS2 are first subjected to the sorting treatment in the predetermined order, 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 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 to say the second 3 bit, the situation f) according to FIG. 2 is relevant.
- the objects are sorted in ascending order of their order numbers and can then be removed in turn from the conveyor circuit 50 and, for example, fed to an output store.
- the items with the order numbers 9, 1 1, 1 1, 8, 9 are fed from the preparation memory SP02 to the conveyor circuit 50 and subjected to the sorting process until all items with the order numbers 8, 9 and 1 1 are available in the desired order.
- the items ordered in this way can then be transferred to the output memory, in which all items of the original group are then present in the correct order of the order numbers 1, 2, 3, 4, 5, 7, 8, 9, 9, 1 1, 1 1 ,
- the descending order would have been achieved if QS1 and then QS2 were accessed in each sort step.
- the exemplary embodiments explained show that the sorting method according to the invention can be carried out with a continuous forward flow of the objects, ie it is not necessary for the objects to perform forward-backward runs. This not only brings advantages in terms of drive technology, but also in particular parts when sorting, so that a comparatively high sorting speed can be achieved.
- the exemplary embodiments described also show that the sorting method according to the invention can be carried out with a wide variety of sorting devices, a conveyor circuit of the type shown in FIG. 2 in particular being able to be implemented with a few elements.
- the control device S always compares the actual sorting state with the desired sorting state and, if an error occurs, controls the sorting process in such a way that sorting steps are repeated, possibly starting with the first sorting step to fix the sorting error.
- sorting criterion of the bit-wise query can optionally be formulated by means of various alternative mathematical representations which, under the same conditions, lead to the same physical sorting sequence and sorting effect and are therefore encompassed by the invention.
- the least significant digit of an ordinal number in the binary representation has a zero or a one
- this can alternatively be done, for example, by dividing the ordinal number (as a natural number) in the range of natural numbers by 2 and the resulting one Using the rest as a sorting criterion. For example, consider the decimal number 7. The binary representation is: 01 1 1. The least significant bit is therefore a one. If the number 7 is divided by 2, this results in 3, the remainder 1. This residual value 1 is then the sorting characteristic to be distinguished. For comparison:
- the number 6 in binary representation is 01 1 0.
- the least significant bit is therefore 0. If the number 6 is divided by 2, the result is 3, the 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 thus two equivalent representations of one and the same physical situation and thus two mutually corresponding representations of the sorting criteria used in the invention.
- 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.
Landscapes
- Control Of Conveyors (AREA)
- Warehouses Or Storage Devices (AREA)
- Sorting Of Articles (AREA)
- Discharge Of Articles From Conveyors (AREA)
- Branching, Merging, And Special Transfer Between Conveyors (AREA)
- Mechanical Treatment Of Semiconductor (AREA)
Abstract
Description
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE19938470 | 1999-08-13 | ||
DE19938470A DE19938470A1 (en) | 1999-08-13 | 1999-08-13 | Method of sorting a group of items |
PCT/EP2000/007313 WO2001012347A1 (en) | 1999-08-13 | 2000-07-28 | Method for sorting a group of objects |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1204491A1 true EP1204491A1 (en) | 2002-05-15 |
EP1204491B1 EP1204491B1 (en) | 2003-10-01 |
Family
ID=7918332
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP00958314A Expired - Lifetime EP1204491B1 (en) | 1999-08-13 | 2000-07-28 | Method for sorting a group of objects |
Country Status (7)
Country | Link |
---|---|
US (1) | US7126074B1 (en) |
EP (1) | EP1204491B1 (en) |
JP (1) | JP2003507170A (en) |
AT (1) | ATE250986T1 (en) |
DE (2) | DE19938470A1 (en) |
ES (1) | ES2207547T3 (en) |
WO (1) | WO2001012347A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2019061845A1 (en) * | 2017-09-30 | 2019-04-04 | 北京极智嘉科技有限公司 | Parcel falling method, sorting robot, and sorting system |
Families Citing this family (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
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 |
US6924451B2 (en) * | 2002-10-08 | 2005-08-02 | Lockheed Martin Corporation | Method for sequentially ordering objects using a single pass delivery point process |
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 |
US20070075000A1 (en) * | 2005-09-30 | 2007-04-05 | Lockheed Martin Corporation | Sort mechanism and method of use |
DE102008018937A1 (en) * | 2008-04-15 | 2009-10-29 | Siemens Aktiengesellschaft | Device and method for transporting objects over intersecting transport paths |
US20100241272A1 (en) * | 2009-03-20 | 2010-09-23 | Goss International Americas, Inc. | Automated product transporting and sorting apparatus and method |
DE102009043008A1 (en) | 2009-09-28 | 2011-03-31 | Herbert Kannegieser Gmbh | Method for sorting textile articles |
DE102011085458A1 (en) | 2011-10-28 | 2013-05-02 | Siemens Aktiengesellschaft | Sorting plant and sorting process with two storage areas |
US10722920B2 (en) * | 2017-02-21 | 2020-07-28 | Siemens Aktiengesellschaft | Device and method for delivery point sorting |
CH715719A1 (en) * | 2019-01-09 | 2020-07-15 | Ferag Ag | Buffer storage system for overhead conveyor systems. |
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 (en) * | 1982-04-15 | 1983-10-21 | Fustier Guy | DEVICE FOR CLASSIFYING HANDLING OBJECTS |
US5377814A (en) * | 1990-06-20 | 1995-01-03 | Fabri-Check, Inc. | Transport carrier for use in an article sorting system |
US5072822A (en) * | 1990-06-20 | 1991-12-17 | Fabri-Check, Inc. | Article sorting system |
DE4118164A1 (en) * | 1991-06-03 | 1992-12-10 | Rsl Logistik Gmbh & Co | METHOD AND DEVICE FOR PICKING |
DE4226066A1 (en) | 1992-08-06 | 1994-02-10 | Rsl Logistik Gmbh & Co | Sorting procedure |
JPH07185472A (en) * | 1993-12-28 | 1995-07-25 | Hitachi Ltd | Paper sheet dividing apparatus |
JP3590998B2 (en) * | 1994-08-19 | 2004-11-17 | 株式会社日立製作所 | Sorting machine system |
DE19513734C2 (en) | 1995-04-11 | 2003-10-23 | Wf Logistik Gmbh | Method for sorting a plurality of individually conveyed objects |
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/en not_active Withdrawn
-
2000
- 2000-07-28 AT AT00958314T patent/ATE250986T1/en not_active IP Right Cessation
- 2000-07-28 ES ES00958314T patent/ES2207547T3/en not_active Expired - Lifetime
- 2000-07-28 DE DE50003928T patent/DE50003928D1/en not_active Expired - Lifetime
- 2000-07-28 JP JP2001516681A patent/JP2003507170A/en active Pending
- 2000-07-28 US US10/049,431 patent/US7126074B1/en not_active Expired - Fee Related
- 2000-07-28 EP EP00958314A patent/EP1204491B1/en not_active Expired - Lifetime
- 2000-07-28 WO PCT/EP2000/007313 patent/WO2001012347A1/en active IP Right Grant
Non-Patent Citations (1)
Title |
---|
See references of WO0112347A1 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2019061845A1 (en) * | 2017-09-30 | 2019-04-04 | 北京极智嘉科技有限公司 | Parcel falling method, sorting robot, and sorting system |
US11285516B2 (en) | 2017-09-30 | 2022-03-29 | Beijing Geekplus Technology Co., Ltd. | Parcel dropping method, sorting robot and sorting system |
Also Published As
Publication number | Publication date |
---|---|
ATE250986T1 (en) | 2003-10-15 |
US7126074B1 (en) | 2006-10-24 |
DE50003928D1 (en) | 2003-11-06 |
JP2003507170A (en) | 2003-02-25 |
WO2001012347A1 (en) | 2001-02-22 |
ES2207547T3 (en) | 2004-06-01 |
DE19938470A1 (en) | 2001-02-15 |
EP1204491B1 (en) | 2003-10-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE69501159T2 (en) | DEVICE FOR SORTING INDIVIDUALLY PROMOTED ITEMS | |
DE69815649T2 (en) | Method and device for sorting packets | |
EP1846309B1 (en) | Apparatus and method for sorting unordered containers in an order picking system | |
DE69117411T2 (en) | Device for analyzing samples | |
EP0834354B1 (en) | Device and method for transferring parcels to be sorted according to an ordered row | |
EP3853156B1 (en) | Method and device for feeding products from a first process to a second process in a packaging plant | |
EP4112504A1 (en) | Suspended picking system with rail integrated weighing system and method therefore | |
EP1204491B1 (en) | Method for sorting a group of objects | |
EP0582224A1 (en) | Sorting method | |
EP3162742A1 (en) | Sorting mechanism with distributed control | |
EP1073601B1 (en) | Processing system for processing piece goods | |
DE2831843C2 (en) | ||
AT525183A2 (en) | Distribution system and method for conveying goods in a storage and picking system | |
DE10332359A1 (en) | Method and device for early baggage storage | |
EP1012087B1 (en) | Device for outward guidance of articles transported on a conveyer | |
EP0737634B1 (en) | Sorting method for several articles which are separately fed | |
EP3178986B1 (en) | Method and device for sorting laundry items | |
DE10145606A1 (en) | Method for storing parts to be conveyed in a store and for outputting selected parts for conveyed parts | |
EP4081354B1 (en) | Sorting device and method | |
EP4326652A1 (en) | Method for operating a conveyor for successive goods, and corresponding conveyor system | |
DE3423538A1 (en) | MACHINE WITH AUTOMATIC OBJECT TRANSPORT | |
DE2813902C2 (en) | Device for increasing the occupancy of a processing device for the timely row processing of goods in the course of a continuous conveyor, in particular a power and free conveyor | |
DE202006005115U1 (en) | Unordered articles e.g. containers, sorting device for use in commissioning system, has transferring unit connecting two exchange points and exchanging articles between two points based on barcode information in articles | |
DE19603363C2 (en) | Method for operating a sorter system | |
DE102022001774A1 (en) | Sorting conveyor device for shipments in a distribution center |
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 |