A rectilinear pipe routing algorithm: Manhattan visibility graph

Liu, Qiang

doi:10.1080/0951192x.2015.1033019

Cited by 4 publications

(8 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The reliability of the results obtained is ensured by the use of proven methods of theoretical and experimental research and does not contradict the works [13][14][15][16][17][18][19]. The reliability is confirmed by comparing the experimental data obtained by field measurements during the production of 88 pipeline routes for the Azimuth Rotor Tug 85-32W tugboats of the YN-512546 project, built according to the requirements of Bureau Veritas Register (France) and VR Register (Vietnam).…”

Section: Fig 4 Theoretical Position Of Routementioning

confidence: 55%

Piping assembly with regard to the design trace of ship systems

et al. 2021

View full text Add to dashboard Cite

The influence of design routing on the possibility of assembling pipelines of ship systems is considered. As a result, it is planned to manufacture pipes for the backlog, ensuring successful installation to reduce the labor intensity of pipeline work and shorten the construction time of the vessel as a whole. To exclude deviations during the installation of ship pipelines systems, it is proposed to use direct pipes made with an admissible mixing and connection. According to the proposed approach, in which the joints are not installed perpendicular to the pipe axis, but mutually parallel, a line consisting only of straight pipes (or having straight sections in its composition) can be moved to eliminate possible deviations of rigidly fixed joints by the actually required value. The process of excluding pipeline deviations when using straight pipes made with an allowable offset of mutual arrangement of joints and pipe turning is simulated.

show abstract

Section: Fig 4 Theoretical Position Of Routementioning

confidence: 55%

Piping assembly with regard to the design trace of ship systems

et al. 2021

View full text Add to dashboard Cite

show abstract

“…In Lee’s work, the problem domain is divided into cells, and the pipe path is routed upon the cells. His domain-decomposition method has had profound influences on later researches, including [ 2 , 3 , 4 , 5 , 7 , 8 , 12 , 13 , 14 , 15 ] and this work. In [ 12 ], Kim et al propose to split the domain into regions first.…”

Section: Related Workmentioning

confidence: 99%

“…Finally, they build a graph upon the domain and compute the pipe path by using Dijkstra’s algorithm. In another work [ 14 ], Liu revises Lee’s method and uses the underlying regular grid to construct a rectilinear visibility graph such that collisions are avoided and the computation is sped up. A similar approach to representing the problem domain by using a graph can be found in the work of [ 5 ].…”

Section: Related Workmentioning

confidence: 99%

“…To meet conditions 3–6, many piping algorithms rely on specialized cost functions to guide the direction and position of the pipe. Under the supervision of these cost functions, the pipe will receive penalties if it is close to hazards and win advantages if it is attaching to unharmful obstacles and pipes [ 1 , 5 , 10 , 13 , 14 , 15 ]. Nonetheless, these cost functions are usually heuristic, flexible, and numerical but not rigid.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Distance-Field-Based Pipe-Routing Method

Ueng

Huang²

2022

Materials

View full text Add to dashboard Cite

Pipes are commonly used to transport fuels, air, water, gas, hydraulic power, and other fluid-like materials in engine rooms, houses, factories, airplanes, and ships. Thus, pipe routing is essential in many industrial applications, including ship construction, machinery manufacturing, house building, laying out engine rooms, etc. To be functional, a pipe system should be economical while satisfying spatial constraints and safety regulations. Numerous routing algorithms have been published to optimize the pipe length and the number of elbows. However, relatively few methods have been designed to lay out pipes which strictly meet the spatial constraints and safety regulations. This article proposes a distance-field-based piping algorithm to remedy this problem. The proposed method converts the workspace into a 3D image and computes a distance field upon the workspace first. It then creates a feasible space out of the workspace by peeling the distance field and segmenting the 3D image. The resultant feasible space is collision-free and satisfies the spatial constraints and safety regulations. In the following step, a path-finding process, subjected to a cost function, is triggered to arrange the pipe inside the feasible space. Consequently, the cost of the pipe is optimized, and the pipe path rigidly meets the spatial constraints and safety regulations. The proposed method works effectively even if the workspace is narrow and complicated. In three experiments, the proposed method is employed to lay out pipes inside an underwater vehicle, a machinery room, and a two-story house, respectively. Not only do the resultant pipes possess minimal costs, but they also meet the spatial constraints and safety regulations, as predicted. In addition to developing the routing procedure, we also design a visualization subsystem to reveal the progression of the piping process and the variation of the workspace in the run time. Based on the displayed images, users can therefore evaluate the quality of the pipes on the fly and tune the piping parameters if necessary.

show abstract

“…Liu and Wang [8][9] used the European viewable method to establish the viewable view of the curved surface in the space, which was used to solve the layout planning of the shortest pipe on the surface of the casing of typical complex aviation engine with complex equipment. Based on the European viewable method, they studied and rose to the Manhattan visibility graph to solve the problem of the shortest pipe planning of right-angle pipe [10].…”

Section: Introductionmentioning

confidence: 99%

Multi-pipe Routing in Bundles for Aero-engine using MOPSO

ZHAO¹,

Liu²,

TONG³

2019

dtcse

Self Cite

View full text Add to dashboard Cite

Complex equipment such as aero-engine commonly contains a number of pipes. Appropriately routing these pipes poses a considerable challenge to complex product developments. In some cases, pipes need to be paved in bundles to save space, improve stability and obtain artistic configurations. In this paper, a bundled pipe routing method for aero-engine based on Multi-Objective Particle Swarm Optimization (MOPSO) is presented. Firstly, space modeling and problem description are introduced. Subsequently, the individual encoding for bundled routing is designed, where the nodes of a reference pipe is selected as particle encoding, and the coordinates of other pipe nodes are obtained according to geometrical constraints such as pipe spacing and diameters. Further, objective function formulation and constraint processing method are given. By using MOPSO, the Pareto set in which pipes are paved in bundles on routing layers are solved. Finally, some routing examples on a simplified CAD piping model are performed to demonstrate the feasibility of the presented method.

show abstract

A rectilinear pipe routing algorithm: Manhattan visibility graph

Cited by 4 publications

References 24 publications

Piping assembly with regard to the design trace of ship systems

Piping assembly with regard to the design trace of ship systems

A Distance-Field-Based Pipe-Routing Method

Multi-pipe Routing in Bundles for Aero-engine using MOPSO

Contact Info

Product

Resources

About