Por favor, use este identificador para citar o enlazar este ítem: https://hdl.handle.net/11000/32295
Registro completo de metadatos
Campo DC Valor Lengua/Idioma
dc.contributor.authorBorrell Méndez, Jorge-
dc.contributor.authorPerez-Vidal, Carlos-
dc.contributor.authorSegura-Heras, José Vicente-
dc.contributor.otherDepartamentos de la UMH::Estadística, Matemáticas e Informáticaes_ES
dc.date.accessioned2024-06-13T08:10:17Z-
dc.date.available2024-06-13T08:10:17Z-
dc.date.created2024-01-13-
dc.identifier.citationThe International Journal of Advanced Manufacturing Technology (2024) 130:4221–4234es_ES
dc.identifier.issn1433-3015-
dc.identifier.issn0268-3768-
dc.identifier.urihttps://hdl.handle.net/11000/32295-
dc.description.abstractThis paper focuses on optimising pick-and-place tasks performed by a dual-arm collaborative robot in a specific shoe manufacturing industry environment. The robot must identify the pieces of a shoe placed on a tray, pick them up, and place them in a shoe mold for further processing. The shoe pieces arrive on the tray in random positions and angles and can be picked up in a different order. Optimising these tasks could increase the assembly speed of each unit and improve shoe production. To achieve this goal, a mathematical model based on binary integer linear programming (BILP) has been developed. This model determines the optimal sequence for picking and placing the shoe pieces in the mold, thus minimising the time required for picking and decision-making. The effectiveness of this approach has been tested using two 3-piece unit shoe models: one for training and another for validation. These models encompass a total of 500 trays. An analysis of the results reveals that BILP offers advantages for task motion planning in complex environments with multiple trajectories and the potential for collisions between arms. The model’s generalizability to shoes with n assembly pieces further confirms its robustness for various piece counts.es_ES
dc.formatapplication/pdfes_ES
dc.format.extent14es_ES
dc.language.isoenges_ES
dc.publisherSpringeres_ES
dc.rightsinfo:eu-repo/semantics/openAccesses_ES
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectGlobal optimizationes_ES
dc.subjectBinary Integer Linear Programming (BILP)es_ES
dc.subjectPick-and-placees_ES
dc.subjectRoboticses_ES
dc.subject.otherCDU::5 - Ciencias puras y naturales::51 - Matemáticases_ES
dc.titleOptimization of the pick-and-place sequence of a bimanual collaborative robot in an industrial production linees_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.relation.publisherversionhttps://doi.org/10.1007/s00170-023-12922-9es_ES
Aparece en las colecciones:
Artículos Estadística, Matemáticas e Informática


Vista previa

Ver/Abrir:
 s00170-023-12922-9.pdf

2,25 MB
Adobe PDF
Compartir:


Creative Commons La licencia se describe como: Atribución-NonComercial-NoDerivada 4.0 Internacional.