CN-122020923-A - Intelligent pipe distribution connection path generation method for water supply and drainage pipeline

CN122020923ACN 122020923 ACN122020923 ACN 122020923ACN-122020923-A

Abstract

The invention relates to the technical field of path generation, in particular to an intelligent pipe distribution connection path generation method of a water supply and drainage pipeline, which is used for receiving and processing pipeline layout space data, barrier model data, pipeline node set data and engineering constraint condition sets, constructing a three-dimensional grid connected graph through space discretization, constructing an initial path in the three-dimensional grid connected graph by using a heuristic search algorithm, carrying out path optimization processing on the initial path by using a multi-objective optimization algorithm to generate an optimal candidate path set, evaluating the optimal candidate path set through a multistage screening and verification process, calculating comprehensive scores of candidate paths by using a weighted evaluation method and combining user preference setting, and outputting the optimal connection path. The invention realizes automatic and intelligent generation and optimization of the pipe distribution path, effectively solves the problems that the traditional method depends on manpower, has low efficiency and is difficult to globally optimize, and remarkably improves the design efficiency and quality.

Inventors

ZHANG XIANFENG
ZHENG HAIQIANG
LI YUANYUAN
LIU FENGLIN
DING YI
ZHANG HONGBING

Assignees

重庆中昂碳素材料有限公司

Dates

Publication Date: 20260512
Application Date: 20260119

Claims (10)

1. The intelligent pipe distribution connection path generation method of the water supply and drainage pipeline is characterized by comprising the following steps of: receiving and processing pipeline layout space data, barrier model data, pipeline node set data and engineering constraint condition sets, and constructing a unified intelligent piping path planning model; Constructing a three-dimensional grid connected graph through space discretization based on the intelligent management path planning model, constructing an initial path in the three-dimensional grid connected graph by using a heuristic search algorithm, and performing path optimization processing on the initial path by using a multi-objective optimization algorithm to generate an optimal candidate path set; And evaluating the optimal candidate path set through a multistage screening and verification process, calculating the comprehensive score of each candidate path by combining the user preference setting through a weighted scoring method, and outputting an optimal connection path.
2. The method for generating an intelligent pipe laying connection path for a water supply and drainage pipeline according to claim 1, wherein the steps of receiving and processing pipeline layout space data, barrier model data, pipeline node set data and engineering constraint condition sets to construct a unified intelligent pipe laying path planning model include: Performing geometric expansion processing on the barrier model data to generate an expansion barrier object, wherein the expansion processing is based on a preset safe construction interval; performing self-adaptive three-dimensional grid division on the pipeline layout space to generate a basic grid unit, and performing local encryption on the basic grid unit of a corresponding area according to the surface geometry of the expansion obstacle object and the position of the pipeline node set to form a multi-resolution grid environment; And analyzing the engineering constraint condition set into a constraint parameter table and an objective function weight coefficient, and fusing the constraint parameter table and the objective function weight coefficient with the multi-resolution grid environment and the pipeline node set to generate the intelligent piping route planning model.
3. The intelligent pipe laying connection path generation method of the water supply and drainage pipeline according to claim 2, characterized by constructing a three-dimensional grid connection graph through a spatial discretization process based on the intelligent pipe laying path planning model, comprising: labeling passable states and basic passing costs for each grid cell based on the multi-resolution grid environment, wherein the grid cells positioned in the expansion barrier body are marked as not passable; And establishing a three-dimensional adjacent relation among the grid cells, calculating the comprehensive passing cost of adjacent edges according to the adjacent direction, the basic passing cost of the grid cells and the distance between the grid cells and the non-passable grid cells, and generating the three-dimensional grid connected graph with weight.
4. The method for generating an intelligent pipe distribution connection path of a water supply and drainage pipeline according to claim 3, wherein the initial path construction in the three-dimensional grid connection graph by using a heuristic search algorithm comprises the following steps: adopting a hierarchical planning strategy, firstly searching global guiding paths connecting all nodes in the pipeline node set on a coarse-granularity grid layer by using a multi-constraint algorithm integrating a direction consistency factor and a construction friendly factor; Constructing a safety corridor along the global guide path, and searching a fine path in a high-precision grid layer in the safety corridor; And performing collision sensing smoothing and bending radius guaranteeing processing on the searched path to generate an initial path.
5. The method for generating an intelligent pipe distribution connection path of a water supply and drainage pipeline according to claim 4, wherein the method for generating an optimal candidate path set by performing path optimization processing on an initial path by adopting a multi-objective optimization algorithm comprises the following steps: carrying out population initialization by taking the initial path as a reference individual; comprehensively calculating the cost fitness, the construction fitness and the normalization fitness of the initialized initial path; In the genetic iteration process, intelligent crossover operators, self-adaptive mutation operators and constraint repair operators are applied to evolve the population, and an optimal candidate path set is output.
6. The method for generating an intelligent pipe arrangement connection path of a water supply and drainage pipeline according to claim 1, wherein the evaluating the optimal candidate path set through a multi-stage screening and verification process comprises: The first-stage screening, namely carrying out hard constraint compliance forced verification on each path in the optimal candidate path set, including geometric collision rechecking, gradient continuity verification and bending radius compliance verification, and removing unqualified paths to obtain a feasible path set; the second stage screening, namely carrying out engineering feasibility and construction friendliness evaluation on paths in the feasible path set, wherein the evaluation comprises installation accessibility simulation, standard pipe fitting degree analysis and repair on the problem paths found in the evaluation to generate corrected paths; And thirdly, screening, namely performing hydraulic characteristic simulation and comprehensive cost simulation on the paths passing through the second-stage screening to generate quantized performance index scores.
7. The method for generating intelligent pipe laying connection paths of water supply and drainage pipelines according to claim 6, wherein calculating the comprehensive score of each candidate path by using a weighted scoring method in combination with user preference setting comprises: constructing a multi-level evaluation index system comprising cost, technical feasibility and construction convenience; dynamically distributing the weights of all levels of evaluation indexes according to the acquired preference input by user interaction or a preset project type template; and calculating the comprehensive score of each candidate path based on the performance index score and the dynamically allocated weight, and sequencing.
8. The intelligent pipe distribution connection path generation method of a water supply and drainage pipeline according to claim 1, characterized in that the method further comprises: In the process of calculating the comprehensive score, the setting index of the candidate path on the setting evaluation item is identified, and the corresponding weight is adjusted.
9. The method for generating an intelligent pipe distribution connection path of a water supply and drainage pipeline according to claim 1, wherein the outputting the optimal connection path comprises: And recommending the path with the highest comprehensive score as the optimal connection path, and simultaneously outputting a detailed comparison report containing the five candidate paths before the comprehensive score, wherein the report comprises three-dimensional visual comparison, cost detail comparison and performance index radar graphs.
10. The intelligent pipe laying connection path generation method of a water supply and drainage pipeline as claimed in claim 9, wherein the method further comprises: Based on the obtained final confirmation instruction of the user, outputting final three-dimensional coordinate data, a bill of materials and construction parameters of the selected path.

Description

Intelligent pipe distribution connection path generation method for water supply and drainage pipeline Technical Field The invention relates to the technical field of path generation, in particular to an intelligent pipe distribution connection path generation method of a water supply and drainage pipeline. Background In water supply and drainage pipeline engineering, the traditional pipe distribution connection path design mainly depends on the manual experience and manual operation of engineers. Engineers typically draw pipeline trends manually through computer aided design software based on design drawings, site survey data, and engineering specifications, and individually adjust pipeline nodes and connection paths to avoid obstacles (e.g., building structures, other pipelines, etc.). The method has the following defects that firstly, the manual design efficiency is low, particularly for large-scale or complex pipe network systems, the design period is long and mistakes are easy to occur, secondly, experience-dependent subjectivity is high, global optimality of paths in cost, construction difficulty and performance is difficult to ensure, moreover, although the conventional computer aided design software can assist drawing, an intelligent automatic path generation function is lacking, a user is usually required to designate a rough path in advance, and then the rough path cannot be optimized by automatically considering various engineering constraints through trial-and-error adjustment. Therefore, a method capable of automatically and intelligently generating a water supply and drainage pipeline connection path is urgently needed to improve design efficiency and quality. Disclosure of Invention The invention aims to provide a method for generating an intelligent pipe distribution connection path of a water supply and drainage pipeline, which can automatically and intelligently generate the water supply and drainage pipeline connection path so as to improve the design efficiency and quality. In order to achieve the above purpose, the invention provides a method for generating an intelligent pipe distribution connection path of a water supply and drainage pipeline, which comprises the following steps: receiving and processing pipeline layout space data, barrier model data, pipeline node set data and engineering constraint condition sets, and constructing a unified intelligent piping path planning model; Constructing a three-dimensional grid connected graph through space discretization based on the intelligent management path planning model, constructing an initial path in the three-dimensional grid connected graph by using a heuristic search algorithm, and performing path optimization processing on the initial path by using a multi-objective optimization algorithm to generate an optimal candidate path set; And evaluating the optimal candidate path set through a multistage screening and verification process, calculating the comprehensive score of each candidate path by combining the user preference setting through a weighted scoring method, and outputting an optimal connection path. The method comprises the steps of receiving and processing pipeline layout space data, barrier model data, pipeline node set data and engineering constraint condition sets, and constructing a unified intelligent piping path planning model, and comprises the following steps: Performing geometric expansion processing on the barrier model data to generate an expansion barrier object, wherein the expansion processing is based on a preset safe construction interval; performing self-adaptive three-dimensional grid division on the pipeline layout space to generate a basic grid unit, and performing local encryption on the basic grid unit of a corresponding area according to the surface geometry of the expansion obstacle object and the position of the pipeline node set to form a multi-resolution grid environment; And analyzing the engineering constraint condition set into a constraint parameter table and an objective function weight coefficient, and fusing the constraint parameter table and the objective function weight coefficient with the multi-resolution grid environment and the pipeline node set to generate the intelligent piping route planning model. Based on the intelligent management path planning model, a three-dimensional grid connected graph is constructed through space discretization processing, and the method comprises the following steps: labeling passable states and basic passing costs for each grid cell based on the multi-resolution grid environment, wherein the grid cells positioned in the expansion barrier body are marked as not passable; And establishing a three-dimensional adjacent relation among the grid cells, calculating the comprehensive passing cost of adjacent edges according to the adjacent direction, the basic passing cost of the grid cells and the distance between the grid cells and the non-passable grid cells