Action Sequence and Position Planning for Crane Lifting based on CS and AStar

EasyChair Preprint 2085

Abstract

Based on Cuckoo Search (CS) and A*, a combine algorithm is presented for planning feasible crane’s action sequence and position. Firstly, A* algorithm is improved according to the characteristic of crane’s action as A*-circle algorithm for planning object’s path. And the path can be transformed easily into crane’s action sequence. Secondly, for finding the best crane’s position, the feasible area consisting of crane’s position points is defined. And the quality of the action sequence searched by the A*-circle is used as the objective function of CS. Finally, after iterations, the best crane position within the feasible position area can be found by CS. The smaller the number of crane action change and the shorter the moving distance of the object, the higher the quality of action sequence. When the crane is at the best position found by CS, a high quality actions sequence can be found by A*-circle algorithm. In order to verify the effectiveness of the combined algorithm, a simulation is performed in PreLifting software.

Keyphrases: A*-circle, CS, Crane, Crane's Position, action sequence

@booklet{EasyChair:2085,
  author    = {Wan Da Guo and Xin Wang and Bo Jiao and Ru Ming Teng},
  title     = {Action Sequence and Position Planning for Crane Lifting based on CS and AStar},
  howpublished = {EasyChair Preprint 2085},
  year      = {EasyChair, 2019}}