A graph-based path planning algorithm for the control of tower cranes

2021 AMERICAN CONTROL CONFERENCE (ACC)(2021)

引用 1|浏览1
暂无评分
摘要
This paper presents a new path planning procedure for transportation tasks of three degrees of freedom tower cranes assuming a known, regularly updated and quadratic obstacle map derived by imaging sensors. Key objectives are the identification of either short, energy-efficient or low exciting load sway paths and the capability to be combined with an anti-sway controller and its trajectory generation module. An exact cell decomposition is carried out for the workspace of the tower crane introducing cells in the shape of circle parts. The height of each cell is determined considering the payload dimensions to ensure collision free paths. Moreover, a graph is derived by assigning a node to each cell and connecting the neighbors with circle arcs in tangential direction and lines in radial direction. The path finding is carried out utilizing an extended version of the novel graph searching algorithm L*. The extension follows from the fact that the height costs depend on the investigated path and thus need to be considered during the search. A simulation example of a realistic scenario is provided in order to discuss the generated paths.
更多
查看译文
关键词
investigated path,generated paths,graph-based path,tower crane,path planning procedure,transportation tasks,freedom tower cranes,known obstacle map,regularly updated obstacle map,quadratic obstacle map,imaging sensors,key objectives,short energy-efficient,trajectory generation module,exact cell decomposition,circle parts,collision free paths,circle arcs,tangential direction,path finding
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要