Faster pipe auto-routing using improved jump point search

• Main Authors: Jwa-Geun Min, Won-Sun Ruy, Chul Su Park
• Format: Article
• Language: English
• Published: Elsevier 2020-01-01
• Series: International Journal of Naval Architecture and Ocean Engineering
• Subjects: Pipe routing; Path-finding algorithm; Jump Point Search (JPS); Design automation; Optimization
• Online Access: http://www.sciencedirect.com/science/article/pii/S2092678220300273

Previous studies on pipe auto-routing algorithms generally used such algorithms as A∗, Dijkstra, Genetic Algorithm, Particle Swarm Optimization, and Ant Colony Optimization, to satisfy the relevant constraints of its own field and improve the output quality. On the other hand, this study aimed to significantly improve path-finding speed by applying the Jump Point Search (JPS) algorithm, which requires lower search cost than the abovementioned algorithms, for pipe routing. The existing JPS, however, is limited to two-dimensional spaces and can only find the shortest path. Thus, it requires several improvements to be applied to pipe routing. Pipe routing is performed in a three-dimensional space, and the path of piping must be parallel to the axis to minimize its interference with other facilities. In addition, the number of elbows must be reduced to the maximum from an economic perspective, and preferred spaces in the path must also be included. The existing JPS was improved for the pipe routing problem such that it can consider the above-mentioned problem. The fast path-finding speed of the proposed algorithm was verified by comparing it with the conventional A∗ algorithm in terms of resolution.