Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11889/7858
Title: Layout of robot cells based on kinematic constraints
Authors: Tubaileh, Allan S. 
Keywords: Machine layout;Robots, Industrial;Robotics - Mathematics;Robotic cells;Sequential processing (Computer science);Manufacturing processes - Automation
Issue Date: 2015
Publisher: International Journal of Computer Integrated Manufacturing
Abstract: This article presents a new approach in determining machine layout in robotic cells and the corresponding feasible robot configuration at each machine worksite, such that the total cycle time is optimised. Simultaneously, the proposed method considers many design features required to develop a practical workcell including machine dimensions, worksites, orientations, and operational characteristics of the deployed robot. A realistic approach is presented to model the problem using the robot joint space. Such method will enable the robot control parameters to be considered in the problem formulation. A non-linear optimisation model is presented and solved using the Sequential Quadratic Programming algorithm available in the MatlabĀ® optimisation tool box. By implementing to a real industrial robot, the feasibility of the proposed approach is examined through several examples. The simulation test results showed that the proposed approach based on cycle time optimisation produced better results than previous methods developed using constant joint velocity. A 3D simulation software is used to provide a practical analysis of the developed layout and robot dynamics.
URI: http://hdl.handle.net/20.500.11889/7858
DOI: 10.1080/0951192X.2014.961552
Appears in Collections:Fulltext Publications

Files in This Item:
File Description SizeFormat
Layout of robot cells based on kinematic constraints.pdf1.61 MBAdobe PDFView/Open
Show full item record

Page view(s)

43
checked on Jun 27, 2024

Download(s)

29
checked on Jun 27, 2024

Google ScholarTM

Check

Altmetric


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