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.author | Borrell Méndez, Jorge | - |
dc.contributor.author | Perez-Vidal, Carlos | - |
dc.contributor.author | Segura-Heras, José Vicente | - |
dc.contributor.other | Departamentos de la UMH::Estadística, Matemáticas e Informática | es_ES |
dc.date.accessioned | 2024-06-13T08:10:17Z | - |
dc.date.available | 2024-06-13T08:10:17Z | - |
dc.date.created | 2024-01-13 | - |
dc.identifier.citation | The International Journal of Advanced Manufacturing Technology (2024) 130:4221–4234 | es_ES |
dc.identifier.issn | 1433-3015 | - |
dc.identifier.issn | 0268-3768 | - |
dc.identifier.uri | https://hdl.handle.net/11000/32295 | - |
dc.description.abstract | This 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.format | application/pdf | es_ES |
dc.format.extent | 14 | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Springer | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Global optimization | es_ES |
dc.subject | Binary Integer Linear Programming (BILP) | es_ES |
dc.subject | Pick-and-place | es_ES |
dc.subject | Robotics | es_ES |
dc.subject.other | CDU::5 - Ciencias puras y naturales::51 - Matemáticas | es_ES |
dc.title | Optimization of the pick-and-place sequence of a bimanual collaborative robot in an industrial production line | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.relation.publisherversion | https://doi.org/10.1007/s00170-023-12922-9 | es_ES |
Ver/Abrir:
s00170-023-12922-9.pdf
2,25 MB
Adobe PDF
Compartir:
La licencia se describe como: Atribución-NonComercial-NoDerivada 4.0 Internacional.