基于改进Bi-RRT和贪心算法的邮轮推舱序列规划
DOI:
作者:
作者单位:

上海船舶工艺研究所

作者简介:

通讯作者:

中图分类号:

基金项目:


Cabin Installation Sequence Planning Based on Improved Bi-RRT and Greedy Algorithm
Author:
Affiliation:

Shanghai Shipbuilding Technology Research Institute

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    以规划可行邮轮预制舱推舱顺序为目的,提出基于改进Bi-RRT和贪心算法的邮轮推舱序列规划方法,通过投影法建立推舱问题模型,使用嵌入改进Bi-RRT推舱路径规划的贪心推舱顺序规划算法,最后在Unity3D中进行方案仿真获得最优推舱工艺。以邮轮甲板区域为例,与人工规划方案对比,提出方法在推舱过程中减少顶部舾装件碰撞次数2次,避免拆卸承重立柱2次,总路径缩短46.34m,为邮轮推舱序列规划提供理论基础和仿真验证工具。

    Abstract:

    Aiming at planning feasible prefabricated modular cabin unit (PMCU) installation sequence for cruise ship deck, this study proposed a PMCU installation sequence planning and simulation method using a Bi-RRT path planning embedded greedy algorithm. First, the planning problem model is build by projecting the 3D deck on a planar map, then a Bi-RRT path planning embedded greedy planning algorithm is introduced to solve the installation sequence. Finally, the planned sequence is simulated and evaluated in the Unity 3D engine. Compared with manual planned cabin installation sequence, the proposed method avoids two top collisions and two pillar dismantle, and the length of the cabin moving path is shortened by 46.34m, demonstrating that the proposed method provides a prompt tool for cabin installation sequence planning.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2024-09-13
  • 最后修改日期:2024-10-14
  • 录用日期:2024-10-16
  • 在线发布日期:
  • 出版日期: