Abstract: To solve the problem that ship pipe layout relies on expertise and had low efficiency,an automatic ship pipe routing method based on Shortest Path Faster Algorithm(SPFA)was proposed.The layout space was decomposed into small grids,and the grid status was initialized according to the layout constrains.SPFA was extended to 3D space and the grid power was brought into the distance relaxation function.The layout constrains described by grid power was involved into the algorithm.On this basis,the routing methods for both single pipe and branched pipe were given,and the constrains processing method of reducing elbows,parallel routing,bending distance,rack setting and pipe interface direction was provided.The effectiveness of this method was demonstrated by two test cases.

Key words: ship pipe, pipe routing, shortest path faster algorithm, grid decomposition method

摘要： 为解决船舶管路布置依靠专家经验且效率较低的问题,提出一种基于最短路径快速算法的船舶管路自动敷设方法。在该求解方法中,首先对布置空间进行网格化处理,根据管路布置的约束对网格状态进行设置,再将传统的最短路径快速算法扩展到三维网格空间,并将网格能量值引入距离松弛函数,将可以通过网格能量描述的布置约束考虑其中。在此基础上给出单管路和带分支管路的敷设方法,并针对船舶管路对弯头数目、成束敷设、折弯长度、支架设置和接口方向等约束的要求,给出基于最短路径快速算法的处理方法。通过两个布置实例验证了方法的有效性。

关键词: 船舶管路, 管路敷设, 最短路径快速算法, 网格分解法