DSpace Repository

Optimization strategy for object picking and placing on table by industrial robot

Show simple item record

dc.contributor.author Rout, Bijay Kumar
dc.date.accessioned 2025-02-25T11:01:42Z
dc.date.available 2025-02-25T11:01:42Z
dc.date.issued 2024
dc.identifier.uri https://ieeexplore.ieee.org/abstract/document/10841625
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/18043
dc.description.abstract Object 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 robot en_US
dc.language.iso en en_US
dc.publisher IEEE en_US
dc.subject Mechanical Engineering en_US
dc.subject Object sorting en_US
dc.subject Travelling salesman problem (TSP) en_US
dc.subject Particle swarm optimization (PSO) en_US
dc.subject Integer linear programming (ILP) en_US
dc.title Optimization strategy for object picking and placing on table by industrial robot en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account