DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/18043
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRout, Bijay Kumar-
dc.date.accessioned2025-02-25T11:01:42Z-
dc.date.available2025-02-25T11:01:42Z-
dc.date.issued2024-
dc.identifier.urihttps://ieeexplore.ieee.org/abstract/document/10841625-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/18043-
dc.description.abstractObject sorting is a problem of separating objects of different kinds based on shape, size, or any other feature into separate stacks to process those separately. In the food processing industry, object sorting is used to separate fruits of different grades. Separating fruits into different grades is essential for quality control. Manual sorting is slower and costs more than automated sorting. This paper presents a novel solution for the object sorting problem using YOLOv8x and various optimization algorithms (ILP, GA and PSO). Here, the object sorting problem is solved by modelling it as a TSP. Through experiments, it was observed that a PSO-based approach could solve the object-sorting problem efficiently. The PSO method obtained a near-optimal solution with 42% less processing time than those obtained from the ILP method, which would enhance the productivity and performance of the industrial roboten_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectMechanical Engineeringen_US
dc.subjectObject sortingen_US
dc.subjectTravelling salesman problem (TSP)en_US
dc.subjectParticle swarm optimization (PSO)en_US
dc.subjectInteger linear programming (ILP)en_US
dc.titleOptimization strategy for object picking and placing on table by industrial roboten_US
dc.typeArticleen_US
Appears in Collections:Department of Mechanical engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.