http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2006005702-A1
Outgoing Links
| Predicate | Object |
|---|---|
| assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_5687633ac8eaede0a0741974aa803638 http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_f7f664b53c1ca3a548900bd0c4710c8b |
| classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/B65B21-06 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/B07C5-122 |
| filingDate | 2005-07-05-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_cbf3be148a1e59d3304f1d96991bfe1c |
| publicationDate | 2006-01-19-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| publicationNumber | WO-2006005702-A1 |
| titleOfInvention | Method of sorting containers |
| abstract | The present invention concerns a method of sorting containers (9), fed arranged in bundles (8) according to a matrix which are examined for affiliation with a sort, removed from the bundles (8) and, separated by sort, and put into bundles (8) again. The object of the invention, to create a method of the aforementioned type which allows the automatic sorting of a fairly large number of containers and/or bundles per unit of time without excessive financial outlay, is achieved by the method according to the invention comprising a first step consisting in the examination of all the containers contained in a bundle in view of the determination of their respective sort (A, B, C or D), a second step wherein the result of said first test of the containers (9) for affiliation with a sort (A, B, C or D) is used to control a first robot (13) in such a way that this robot removes all the containers (9) of all the sorts from the bundle (8) together and puts them according to their specific sort on separate conveyors (4), each said separate conveyor being assigned to a specific sort, which second step is followed by a transfer of the containers (9) by means of the respective conveyors on which they have been put to a collection table (15) on which they are stored until enough containers (9) of a sort (A, B, C or D) have constituted a full matrix, after which a second robot (16) removes all the containers (9) of said full matrix from the collection table (15) and puts them in a predetermined bundle (8). |
| isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2021117073-A1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/IT-201900013290-A1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-2009133784-A1 |
| priorityDate | 2004-07-15-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
| type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
| Predicate | Subject |
|---|---|
| isDiscussedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID410793948 http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID28935 |
Total number of triples: 17.