Please use this identifier to cite or link to this item:
Title: Sensor-enabled crane lifting
Authors: Zhang, Tianci
Keywords: DRNTU::Engineering
Issue Date: 2016
Abstract: Crane lifting is an important but common task in industrial plants. In order to find a safe and cost effective path of lifting, a Master–Slave Parallel Genetic Algorithm and implement the algorithm on Graphics Processing Units using CUDA programming is developed to calculate a lifting path plan. Before this algorithm is introduced to crane industry, a tower crane model should be established to test the integrity between software algorithm calculation and physical crane lifting. Furthermore, because of the complexity and volatility of construction sites, a sensor-based collision avoidance system tailored for tower crane is crucial for tower crane lifting. In this report, a 1:64 tower crane fully functional tower crane model based on Terex SK 415-20 is designed and erected. Master–Slave Parallel Genetic Algorithm is used to calculate the optimized lifting path which can be read by the tower crane model. After that, the crane moves accordingly in the 3 degree-of-freedom space and performs the lifting task. Meanwhile, the sensor-based collision avoidance system is activated and monitors potential collision hazard. Once obstacles are detected, the collision avoidance system is able to stop the tower crane and manual remote control is activated. At last, the tower crane model is tested and reviewed. Suggestions are given for future study on crane lifting and related study.
Schools: School of Mechanical and Aerospace Engineering 
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:MAE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
Sensor-Enabled Crane Lifting.pdf
  Restricted Access
Main Article2.91 MBAdobe PDFView/Open

Page view(s)

Updated on Jun 11, 2024

Download(s) 50

Updated on Jun 11, 2024

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.