船舶管路系統之自動路徑規劃法

ATUO-ROUTING METHOD FOR SHIP PIPING SYSTEM

翁維珠(W.-C. Weng) ； 郭學豪(X.-H. Kuo)

《中國造船暨輪機工程學刊》 38卷2期 (2019/05) Pp. 83-89

摘要

由於船舶建造之複雜，因此有研究報告提出造船4.0口號，並點出現階段提升造船產業之關鍵：如何提升生產效率。船舶是一個複雜的巨型產品，由其他數不清的產品組合而成，而船舶管路系統就是其一。商船機艙內就包含大多數船舶管路系統，這些管路系統的規劃方式多是沿著牆壁佈置垂直管以銜接各平台管路佈置而構成完整的立體管路系統。如何規劃船舶管路系統是一種立體路徑問題，本論文針對上述管路佈置特性提出平面化自動路徑法以自動規劃管路系統。此法將一條立體管路分割成多條平面管段，每個平面管段應用戴克拉斯特法搜尋最短且最少轉彎次數的路徑以完成規劃，最後自動新增垂直管銜接平面管段以完成立體管路系統之自動規劃。平面化自動路徑法會先針對各平面排除障礙物區，將剩餘的可利用區劃分出不均勻網格以方便戴克拉斯特法進行搜尋。根據情境測試，所完成的規劃不僅實用且令人滿意。

關鍵字

立體路徑問題 ； 戴克拉斯特法 ； 不均勻網格 ； 船舶管路

並列摘要

Due to the complexity of shipbuilding, shipbuilding 4.0 had been proposed and indicates how to currently promote shipbuilding industry: to arise production efficiency first. A ship is a tremendous product composed of numerous sub-products. Among them, piping systems are one of the most complicated sub-products. How to arrange ship piping systems is a 3D routing problem. Of a merchant ship, the engine room contains most ship piping systems arranged on various planes and connected by vertical pipes along walls. Thus, an auto-routing method is particularly proposed based on such piping systems. The method is called ＂auto-routing method by planarization＂ which is to divide a 3D routing problem into multiple 2D routing problems. Every divided 2D routing problem is planned with the shortest path as well as the least turns based on Dijkstra algorithm. A 3D piping system is therefore generated by connecting these arranged 2D piping systems using vertical pipes along walls. The proposed method will mesh a plane without obstacle areas into non-uniform grids for applying Dijkstra algorithm. All computation tests show that the proposed method provides useful and satisfying results.

並列關鍵字

3D routing problem ； Dijkstra algorithm ； Non-uniform meshes ； Ship piping system