Abstract
Pipe routing can be briefly formulated as seeking the shortest collision-free pipe paths while meeting certain engineering constraints. This article presents a new rectilinear pipe routing algorithm called Manhattan visibility graph (MVG) by extending the Visibility Graph method used for finding the shortest collision-free paths in Euclidean spaces to Manhattan spaces. Subsequently, the article proves that MVG can theoretically guarantee an optimal solution. Further, the article extends MVG algorithm to surface cases to meet requirements of routing pipes in aero-engine rotational spaces. Unlike previous graph methods that commonly yield more than n nodes (where n is the total number of terminals and obstacle vertices), MVG significantly reduces computation complexity because of containing only n nodes. Finally, numerical computations on a developed pipe routing system are performed to demonstrate the effectiveness and efficiency of the proposed method.
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 callMore From: International Journal of Computer Integrated Manufacturing
Disclaimer: 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.
