Abstract
ABSTRACT Previous studies on automatic pipe routing algorithms in ships have typically used pathfinding and optimisation algorithms to satisfy relevant constraints in the field and improve the results of pipe auto-routing. However, the existing path-search algorithm takes a long time to search for nodes that do not need to be searched. Therefore, this study was conducted to identify the key nodes worth searching for when pipes are routed in a ship and accelerate pipe routing by reducing the search nodes. Key nodes in piping routing serve to connect points that require changes in the location of the piping; after node creation, the path search is performed using the A* algorithm the algorithm in the key-node environment proposed in this study and the existing algorithm were compared and verified. Finally, the effectiveness of the proposed algorithm was verified by analyzing the performance of each parameter.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
