Pipeline path determination method and device, storage medium and electronic equipment

The pipeline path is generated through greedy algorithms or the minimum cost spanning tree algorithm, which solves the problems of inefficient and error-prone pipeline path determination in the installation of home appliance equipment components, and improves the efficiency and accuracy of installation design.

CN119047103APending Publication Date: 2024-11-29QINGDAO HAIER TECH +2
View PDF 0 Cites 2 Cited by

Patent Information

Application Number
CN202411044410.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-31
Publication Date
2024-11-29

AI Technical Summary

Technical Problem

The method of determining pipeline paths in the prior art is inefficient and prone to errors, resulting in insufficient installation design efficiency and accuracy of home appliance components.

Method used

By obtaining the connection relationship between the placement position and connection points of the target device components in the target area, a candidate pipeline path is generated based on greedy algorithms or the minimum cost spanning tree algorithm, and the target pipeline path is automatically calculated based on preset rules and room type information to reduce manual labor Draw and calculate the workload.

Benefits of technology

It improves the overall efficiency and accuracy of equipment installation design, reduces manual errors, and realizes smarter pipeline path planning.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119047103A_ABST
    Figure CN119047103A_ABST
Patent Text Reader

Abstract

The invention discloses a method and a device for determining a pipeline path, a storage medium and electronic equipment, and relates to the technical field of smart home, the method for determining the pipeline path comprises the following steps: obtaining placement positions of a plurality of components of target equipment in a target area, and determining a connection relationship of connection points of each component in the plurality of components; a plurality of candidate pipeline paths are generated according to condition information, and the condition information comprises preset rules corresponding to the pipeline paths, house type information of the target area, the placement position and the connection relation; a target pipeline path is determined in the multiple candidate pipeline paths on the basis of a target algorithm, the target algorithm at least comprises one of a greedy algorithm and a minimum cost spanning tree algorithm, and by adopting the technical scheme, the problems that the mode for determining the pipeline paths is low in efficiency and prone to making mistakes are solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of smart home technology, and more specifically, to a method and device for determining a pipeline path, a storage medium, and an electronic device. Background Art

[0002] With the development of science and technology, household appliances are becoming increasingly miniaturized, equipped with more and more functions, and increasingly integrated. However, some household appliances have multiple separate components due to their own functional problems. For example, air-conditioning equipment includes: indoor and outdoor units, and lamps include: light-emitting components and components for controlling the lighting status of the light-emitting components.

[0003] For multi-component equipment, it is necessary to consider the reasonable layout of each component and the accurate planning of the pipelines. Traditionally, this task is completed manually by experienced technicians based on the floor plan, involving complex calculations and repeated measurements. This process is not only inefficient, but also prone to errors due to human factors.

[0004] In view of the problem that the method of determining the pipeline path in the related art is inefficient and error-prone, no effective solution has been proposed yet. Summary of the invention

[0005] The embodiments of the present application provide a method and device for determining a pipeline path, a storage medium, and an electronic device, so as to at least solve the problem that the method for determining the pipeline path in the related art is inefficient and error-prone.

[0006] According to an embodiment of the present application, a method for determining a pipeline path is provided, including: obtaining placement positions of multiple components of a target device in a target area, and determining a connection relationship between connection points of each component in the multiple components; generating multiple candidate pipeline paths according to condition information, wherein the condition information includes: preset rules corresponding to the pipeline path, apartment type information of the target area, the placement positions, and the connection relationships; determining a target pipeline path from the multiple candidate pipeline paths based on a target algorithm, wherein the target algorithm includes at least one of the following: a greedy algorithm, a minimum cost spanning tree algorithm.

[0007] In an exemplary embodiment, obtaining placement positions of multiple components of a target device includes: determining a set of placement plans for the multiple components based on apartment type information of the target area; determining a score for each placement plan in the set of placement plans; determining a placement plan with the highest score in the set of placement plans, and determining the placement positions of the multiple components based on the placement plan with the highest score.

[0008] In an exemplary embodiment, determining the score of each placement scheme in the placement scheme set includes: determining the placement rules of the target device, and determining a set of influencing factors based on the placement rules and the operating performance of the target device; determining the individual score of each influencing factor in the set of influencing factors based on each placement scheme; determining the weight of each influencing factor in the set of influencing factors; and determining the score of each placement scheme based on the individual score of each influencing factor and the weight of each influencing factor.

[0009] In an exemplary embodiment, a plurality of candidate pipeline paths are generated based on condition information, including: determining a first area and a second area in the target area based on the preset rules and the apartment type information, wherein the first area is an area where pipelines are prohibited from passing through, and the second area is an area where pipelines can pass through; generating the plurality of candidate pipeline paths in the second area based on the placement positions and the connection relationships.

[0010] In an exemplary embodiment, a target pipeline path is determined from the multiple candidate pipeline paths based on a target algorithm, including: generating a topology map based on the multiple candidate pipeline paths, wherein the nodes of the topology map are used to indicate the multiple components and turning points of the candidate pipeline paths; a determination step: determining the distance between any node of the topology map and a neighbor node of any node, and determining the neighbor node with the shortest distance corresponding to any node; looping through the determination step until the neighbor node with the shortest distance corresponding to each node is determined; and determining the target pipeline path based on the neighbor node with the shortest distance corresponding to each node.

[0011] In an exemplary embodiment, a target pipeline path is determined from the multiple candidate pipeline paths based on a target algorithm, including: generating a topology graph based on the multiple candidate pipeline paths, wherein the nodes of the topology graph are used to indicate the multiple components and turning points of the candidate pipeline paths; determining a minimum cost subgraph containing any node in the topology graph based on a PCST algorithm until the minimum cost subgraph corresponding to each node is determined; and determining the target pipeline path based on the minimum cost subgraph corresponding to each node.

[0012] In an exemplary embodiment, after determining the target pipeline path among the multiple candidate pipeline paths based on the target algorithm, the method further includes: when the target pipeline path is determined, optimizing the turning points of the target pipeline path, and converting the line form of the target pipeline path into a pipeline form to obtain a processed target pipeline path; sending the processed target pipeline path to a terminal device so that the terminal device displays the processed target pipeline path.

[0013] According to another embodiment of the embodiment of the present application, a device for determining a pipeline path is also provided, including: an acquisition module, used to obtain the placement positions of multiple components of a target device in a target area, and determine the connection relationship between the connection points of each component in the multiple components; a generation module, used to generate multiple candidate pipeline paths according to condition information, wherein the condition information includes: preset rules corresponding to the pipeline path, the apartment type information of the target area and the placement position and the connection relationship; a determination module, used to determine the target pipeline path among the multiple candidate pipeline paths based on a target algorithm, wherein the target algorithm includes at least one of the following: a greedy algorithm, a minimum cost spanning tree algorithm.

[0014] According to another aspect of the embodiments of the present application, a computer-readable storage medium is provided, in which a computer program is stored, wherein the computer program is configured to execute the above pipeline path determination method when running.

[0015] According to another aspect of an embodiment of the present application, an electronic device is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the pipeline path determination method through the computer program.

[0016] According to another embodiment of the present application, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the above-mentioned pipeline path determination method is implemented.

[0017] In an embodiment of the present application, the placement positions of multiple components of a target device in a target area are obtained, and the connection relationship between the connection points of each component in the multiple components is determined; multiple candidate pipeline paths are generated according to condition information, wherein the condition information includes: preset rules corresponding to the pipeline path, the apartment type information of the target area, the placement position, and the connection relationship; the target pipeline path is determined from the multiple candidate pipeline paths based on a target algorithm, wherein the target algorithm includes at least one of the following: a greedy algorithm, a minimum cost spanning tree algorithm; the above-mentioned technical solution is adopted to solve the problem that the method of determining the pipeline path is inefficient and error-prone. In the present application, the pipeline path is automatically calculated through the preset rules corresponding to the pipeline path, the apartment type information of the target area, the placement position, and the connection relationship, thereby greatly reducing the workload of manual drawing and calculation, and improving the overall efficiency and accuracy of equipment installation design. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0019] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0020] Figure 1 It is a hardware environment diagram of a method for determining a pipeline path according to an embodiment of the present application;

[0021] Figure 2 is a flow chart (I) of a method for determining a pipeline path according to an embodiment of the present application;

[0022] Figure 3 is a flow chart (II) of a method for determining a pipeline path according to an embodiment of the present application;

[0023] Figure 4 is a schematic diagram of an air conditioning layout solution according to an embodiment of the present application;

[0024] Figure 5 is a schematic diagram of the relative relationship between the connection points and the space according to an embodiment of the present application;

[0025] Figure 6 is a schematic diagram of the connection relationship of the connection points according to an embodiment of the present application;

[0026] Figure 7a is a schematic diagram of a graph according to an embodiment of the present application (I);

[0027] Figure 7b is a schematic diagram of a graph according to an embodiment of the present application (II);

[0028] Figure 7c is a schematic diagram of a graph according to an embodiment of the present application (III);

[0029] Figure 8 is a schematic diagram of rules according to an embodiment of the present application;

[0030] Fig. 9 1 is a schematic diagram of a pipeline path according to an embodiment of the present application (I);

[0031] Fig.10 Schematic diagram of pipeline path according to an embodiment of the present application (II);

[0032] Fig.11 It is a structural block diagram of a pipeline path determination device according to an embodiment of the present application. DETAILED DESCRIPTION

[0033] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0034] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0035] According to one aspect of an embodiment of the present application, a method for determining a pipeline path is provided. The method for determining a pipeline path is widely used in smart home, smart home, smart home device ecology, smart residential (Intelligence House) ecology and other whole-house intelligent digital control application scenarios. Optionally, in this embodiment, the above pipeline path determination method can be applied to Figure 1 In the hardware environment composed of the terminal device 102 and the server 104 shown in FIG. Figure 1 As shown, the server 104 is connected to the terminal device 102 via a network, and can be used to provide services (such as application services, etc.) for the terminal or a client installed on the terminal. A database can be set on the server or independently of the server to provide data storage services for the server 104. Cloud computing and / or edge computing services can be configured on the server or independently of the server to provide data computing services for the server 104.

[0036] The network may include but is not limited to at least one of the following: wired network, wireless network. The wired network may include but is not limited to at least one of the following: wide area network, metropolitan area network, local area network, and the wireless network may include but is not limited to at least one of the following: WIFI (Wireless Fidelity), Bluetooth. The terminal device 102 may be but is not limited to a PC, a mobile phone, a tablet computer, a smart air conditioner, a smart range hood, a smart refrigerator, a smart oven, a smart stove, a smart washing machine, a smart water heater, a smart washing device, a smart dishwasher, a smart projection device, a smart TV, a smart clothes drying rack, a smart curtain, a smart audio and video, a smart socket, a smart speaker, a smart fresh air device, a smart kitchen and bathroom device, a smart bathroom device, a smart sweeping robot, a smart window cleaning robot, a smart mopping robot, a smart air purification device, a smart steamer, a smart microwave oven, a smart kitchen treasure, a smart purifier, a smart water dispenser, a smart door lock, etc.

[0037] In this embodiment, a method for determining a pipeline path is provided, which is applied to the above terminal device. Figure 2 1 is a flow chart of a method for determining a pipeline path according to an embodiment of the present application (I), the flow chart comprising the following steps:

[0038] Step S202, obtaining placement positions of multiple components of the target device in the target area, and determining connection relationships between connection points of each component in the multiple components;

[0039] It should be noted that, when the target device is an air conditioner, the multiple components include: an air conditioner indoor unit and an air conditioner outdoor unit; when the target device is a lamp, the multiple components include: a light emitting component and a control component.

[0040] Step S204, generating a plurality of candidate pipeline paths according to the condition information, wherein the condition information includes: a preset rule corresponding to the pipeline path, the apartment type information of the target area, the placement position and the connection relationship;

[0041] Step S206 , determining a target pipeline path from the plurality of candidate pipeline paths based on a target algorithm, wherein the target algorithm includes at least one of the following: a greedy algorithm, a minimum cost spanning tree algorithm.

[0042] Through the above steps, the placement positions of multiple components of the target device in the target area are obtained, and the connection relationship between the connection points of each component in the multiple components is determined; multiple candidate pipeline paths are generated according to the condition information, wherein the condition information includes: preset rules corresponding to the pipeline path, the apartment type information of the target area, the placement position and the connection relationship; based on the target algorithm, the target pipeline path is determined among the multiple candidate pipeline paths, wherein the target algorithm includes at least one of the following: a greedy algorithm, a minimum cost spanning tree algorithm, which solves the problem that the method of determining the pipeline path in the related art is inefficient and error-prone. In the present application, the pipeline path is automatically inferred through the preset rules corresponding to the pipeline path, the apartment type information of the target area, the placement position and the connection relationship, thereby greatly reducing the workload of manual drawing and calculation, and improving the overall efficiency and accuracy of equipment installation design.

[0043] In an exemplary embodiment, obtaining placement positions of multiple components of a target device includes: determining a set of placement plans for the multiple components based on apartment type information of the target area; determining a score for each placement plan in the set of placement plans; determining a placement plan with the highest score in the set of placement plans, and determining the placement positions of the multiple components based on the placement plan with the highest score.

[0044] In the embodiment of the present application, multiple solutions are generated for the placement of each component in the target area. Multiple solutions for each component are combined together through Cartesian products to generate multiple placement solutions, and then each placement solution is scored through a scoring function to obtain the placement solution with the highest score, and the placement positions of the multiple components are determined according to the placement solution with the highest score.

[0045] Specifically, the method for determining the score of each placement plan in the placement plan set is as follows: determine the placement rules of the target device, and determine the influencing factor set based on the placement rules and the operating performance of the target device; determine the individual score of each influencing factor in the influencing factor set based on each placement plan; determine the weight of each influencing factor in the influencing factor set; determine the score of each placement plan based on the individual score of each influencing factor and the weight of each influencing factor.

[0046] It should be noted that the placement rules of the target device include but are not limited to: as close to the window as possible, as close to the wall as possible, away from the door, etc.; the operating efficiency of the target device.

[0047] For the indoor unit of the air conditioner, the placement position will affect the blowing area. The smaller the blowing area, the lower the operating efficiency. Therefore, the blowing area can also be used as an influencing factor. For lamps, the placement position will affect the lighting area. The smaller the lighting area, the lower the operating efficiency. Therefore, the lighting area can also be used as an influencing factor.

[0048] In an exemplary embodiment, a plurality of candidate pipeline paths are generated based on condition information, including: determining a first area and a second area in the target area based on the preset rules and the apartment type information, wherein the first area is an area where pipelines are prohibited from passing through, and the second area is an area where pipelines can pass through; generating the plurality of candidate pipeline paths in the second area based on the placement positions and the connection relationships.

[0049] It should be noted that the apartment type information is used to indicate the three-dimensional information of the target area.

[0050] In an embodiment of the present application, a prohibited area (i.e., a first area) and an area that can be passed (a second area) are determined based on apartment information, wherein the first area may be a window area or a door area, and the second area may be a wall, a ground area, or the like; when the first area and the second area are determined, a plurality of candidate pipeline paths may be generated in the second area based on the location information and the connection relationship.

[0051] Through the embodiments of the present application, the determined candidate pipeline paths are more in line with actual needs, thereby making the candidate pipeline paths more intelligently determined.

[0052] In an exemplary embodiment, a target pipeline path is determined from the multiple candidate pipeline paths based on a target algorithm, including: generating a topology map based on the multiple candidate pipeline paths, wherein the nodes of the topology map are used to indicate the multiple components and turning points of the candidate pipeline paths; a determination step: determining the distance between any node of the topology map and a neighbor node of any node, and determining the neighbor node with the shortest distance corresponding to any node; looping through the determination step until the neighbor node with the shortest distance corresponding to each node is determined; and determining the target pipeline path based on the neighbor node with the shortest distance corresponding to each node.

[0053] Through the embodiment of the present application, the neighbor node closest to the current node can be determined in each selection step, thereby obtaining the target pipeline path. Specifically: find the shortest path from a single node to all other nodes in the topology graph, and loop through the above steps to obtain the neighbor node with the shortest distance corresponding to each node; determine the target pipeline path based on the neighbor node with the shortest distance corresponding to each node.

[0054] In an exemplary embodiment, a target pipeline path is determined from the multiple candidate pipeline paths based on a target algorithm, including: generating a topology graph based on the multiple candidate pipeline paths, wherein the nodes of the topology graph are used to indicate the multiple components and turning points of the candidate pipeline paths; determining a minimum cost subgraph containing any node in the topology graph based on a PCST algorithm until the minimum cost subgraph corresponding to each node is determined; and determining the target pipeline path based on the minimum cost subgraph corresponding to each node.

[0055] Optionally, you can also start from a node in the topology graph, initialize the path and total weight; select the next element to be added to the path from the candidate edges or vertices in order of increasing weight; after each selection, update the current path and total weight; in each step, if it is found that it is no longer possible to find a shorter path, stop searching; if the current selection cannot lead to a complete connection of the target set, go back to the previous step to try other selections; when all points are connected or all candidate selections have been tried, the algorithm terminates to obtain the target pipeline path.

[0056] In an exemplary embodiment, after determining the target pipeline path among the multiple candidate pipeline paths based on the target algorithm, it also includes: when the target pipeline path is determined, optimizing the turning points of the target pipeline path, and converting the line form of the target pipeline path into a pipeline form to obtain a processed target pipeline path; sending the processed target pipeline path to a terminal device so that the terminal device displays the processed target pipeline path.

[0057] For the target pipeline path, rule processing is also required to make the result more in line with the requirements. The specific processing includes:

[0058] 1. Optimization of pipeline turning;

[0059] 2. From wire to tube;

[0060] Since,in the target pipeline path is just a path, without width, it is a pipe when actually displayed;

[0061] 3. The initial connection between multiple connection points of any component.

[0062] In order to better understand the process of the above pipeline path determination method, the implementation method flow of the above pipeline path determination is described below in combination with an optional embodiment, but it is not used to limit the technical solution of the embodiment of the present application.

[0063] In this embodiment, a method for determining a pipeline path is provided. Taking air conditioning as an example, Figure 3is a flow chart (II) of a method for determining a pipeline path according to an embodiment of the present application, such as Figure 3 As shown, the specific steps are as follows:

[0064] Step S301: Determine the placement positions of the indoor and outdoor units of the air conditioner;

[0065] The specific implementation is as follows:

[0066] The air conditioner is placed in multiple ways. For each room and indoor and outdoor units, multiple plans will be generated, such as Figure 4 As shown, Figure 4 This is a schematic diagram of the air conditioning layout scheme according to the embodiment of the present application. Multiple schemes for each room are combined together through Cartesian products to generate multiple whole-house schemes, and then each whole-house scheme is scored through a scoring function to obtain the indoor and outdoor unit layout scheme with the highest score and return it.

[0067] Step S302: Determine the connection point of the indoor / outdoor unit of the air conditioner according to the position of the indoor / outdoor unit and the structure of the air conditioner itself;

[0068] Specific:

[0069] When the position of the indoor / outdoor unit is determined, the coordinates of the connection point in the entire house space are calculated based on the size of the equipment and the relative position of the connection point on the equipment; different models of air conditioners have different connection point information, and the connection point of the equipment is also a Steiner point, such as Figure 5 As shown, Figure 5 It is a schematic diagram of the relative relationship between the connection points and the space according to an embodiment of the present application.

[0070] Step S303: Determine the connection order of the connection points of the indoor / outdoor units of the air conditioner;

[0071] It should be noted that the connection relationship between the steiner points is fixed for the air system, which is a 0-hop mesh structure, that is, there is no order for the connections to be set. Figure 6 shown.

[0072] Step S304: Generate a graph of the target area;

[0073] It should be noted that the graph includes multiple candidate pipeline paths.

[0074] In the process of generating candidate paths, that is, how to go from one port (Steiner point) of an indoor / outdoor unit to another port of an indoor / outdoor unit. There are many ways to meet the connection requirements. The most basic way is to run the pipeline along the wall as much as possible, bypassing windows, doors, beams and other buildings; at the same time, we also refer to the modeling method of related papers on pipeline generation and model the candidate path as follows, such as Figure 7a , 7b , as shown in 7c, Figure 7a , 7b The yellow part in 7c represents windows, and the green part represents doors. The yellow and green parts represent areas that cannot be passed through.

[0075] Step S305: Determine the weights of the edges and nodes in the graph in combination with the rule module;

[0076] Step S306: solving the Steiner Tree problem to determine a target candidate pipeline path among multiple candidate pipeline paths;

[0077] When generating these pipeline paths, certain rules must be met. By pre-setting extracted features, they can be assigned to different other modules such as graph generation and Steiner solution. Figure 8 It is a schematic diagram of the rules.

[0078] How to determine the target candidate pipeline path from multiple candidate pipeline paths, under certain conditions (the pipeline length is as short as possible), so as to achieve the purpose of connecting all Steiner points. There are direct solutions to the original problem, such as greedy solution, genetic algorithm, etc., and there are also solutions that relax constraints and transform the problem into PCST. The figure below is a solution for the connection of a room light, switch and power supply. Fig. 9 is the target pipeline path determined by the greedy algorithm, Fig.10 It is the solution method after relaxing the constraints and obtaining the target pipeline path.

[0079] Step S307: perform post-processing to complete the deployment of air conditioners and the generation of pipelines.

[0080] For the results after the Steiner layout, it is necessary to do some rule processing to make the results more in line with the requirements. Specifically:

[0081] 1. Optimization of pipeline bends;

[0082] 2. From line to tube: In the solution result, it is just a path without width, but in actual display, it is a tube;

[0083] 3. Initial connection between the three pipes of the external unit.

[0084] In an optional embodiment of the present application, 1) multiple possible placement schemes are designed for each room and the indoor and outdoor units of the air conditioner, and then a comprehensive scoring system is used to comprehensively evaluate the pros and cons of each scheme to select the most suitable layout scheme for the whole house. This scoring system takes into account the efficiency of the air conditioner, space limitations and other environmental factors, which helps to improve the placement of the air conditioner;

[0085] 2) Using a fixed 0-hop connection mesh structure to reduce complex redundant designs and simplify the pipeline planning process;

[0086] 3) Simulate the candidate path generation process. This includes taking into account building features such as walls, windows, doors and beams to achieve a pipeline layout that is as natural and concealed as possible.

[0087] 4) The target algorithm is used to solve the Steiner problem and find the shortest path set connecting all Steiner points, while ensuring the efficiency of pipeline design.

[0088] 5) In view of the results after the Steiner layout is completed, the invention proposes a variety of post-processing measures, such as pipeline bend optimization, pipeline width adjustment, and initial setting of external machine connection pipes, to ensure the practicality and aesthetics of the design scheme.

[0089] That is, through this application, not only can the optimal placement of the indoor and outdoor units of the air conditioner be provided, but also a comprehensive solution for automatic pipeline planning and optimization can be provided.

[0090] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes a number of instructions for a terminal device (which can be a mobile phone, computer, server, or network device, etc.) to execute the methods of each embodiment of the present application.

[0091] Fig.11 is a structural block diagram of a pipeline path determination device according to an embodiment of the present application; Fig.11 As shown, including:

[0092] An acquisition module 1102 is used to acquire the placement positions of multiple components of a target device in a target area, and determine the connection relationship between the connection points of each component in the multiple components;

[0093] A generating module 1104 is used to generate a plurality of candidate pipeline paths according to condition information, wherein the condition information includes: preset rules corresponding to the pipeline path, apartment type information of the target area, the placement position and the connection relationship;

[0094] The determination module 1106 is used to determine a target pipeline path from the multiple candidate pipeline paths based on a target algorithm, wherein the target algorithm includes at least one of the following: a greedy algorithm and a minimum cost spanning tree algorithm.

[0095] Through the above-mentioned device, the placement positions of multiple components of the target equipment in the target area are obtained, and the connection relationship between the connection points of each component in the multiple components is determined; multiple candidate pipeline paths are generated according to the condition information, wherein the condition information includes: preset rules corresponding to the pipeline path, the apartment type information of the target area, the placement position and the connection relationship; based on the target algorithm, the target pipeline path is determined among the multiple candidate pipeline paths, wherein the target algorithm includes at least one of the following: a greedy algorithm, a minimum cost spanning tree algorithm, which solves the problem that the method of determining the pipeline path in the related art is inefficient and error-prone. In the present application, the pipeline path is automatically inferred through the preset rules corresponding to the pipeline path, the apartment type information of the target area, the placement position and the connection relationship, thereby greatly reducing the workload of manual drawing and calculation, and improving the overall efficiency and accuracy of equipment installation design.

[0096] In an exemplary embodiment, an acquisition module is used to determine a set of placement plans for the multiple components based on the apartment type information of the target area; determine a score for each placement plan in the set of placement plans; determine the placement plan with the highest score in the set of placement plans, and determine placement positions of the multiple components based on the placement plan with the highest score.

[0097] In an exemplary embodiment, an acquisition module is used to determine the placement rules of the target device, and determine a set of influencing factors based on the placement rules and the operating performance of the target device; determine the individual score of each influencing factor in the set of influencing factors based on each placement plan; determine the weight of each influencing factor in the set of influencing factors; and determine the score of each placement plan based on the individual score of each influencing factor and the weight of each influencing factor.

[0098] In an exemplary embodiment, a generation module is used to determine a first area and a second area in the target area according to the preset rules and the apartment type information, wherein the first area is an area where pipelines are prohibited from passing through, and the second area is an area where pipelines can pass through; and generate the multiple candidate pipeline paths in the second area according to the placement position and the connection relationship.

[0099] In an exemplary embodiment, a determination module is used to generate a topology map based on the multiple candidate pipeline paths, wherein the nodes of the topology map are used to indicate the multiple components and the turning points of the candidate pipeline paths; a determination step: determining the distance between any node of the topology map and a neighbor node of any node, and determining the neighbor node with the shortest distance corresponding to any node; looping the determination step until the neighbor node with the shortest distance corresponding to each node is determined; and determining the target pipeline path based on the neighbor node with the shortest distance corresponding to each node.

[0100] In an exemplary embodiment, a determination module is used to generate a topology map based on the multiple candidate pipeline paths, wherein the nodes of the topology map are used to indicate the multiple components and turning points of the candidate pipeline paths; based on the PCST algorithm, a minimum cost subgraph containing any node is determined in the topology map until the minimum cost subgraph corresponding to each node is determined; and the target pipeline path is determined according to the minimum cost subgraph corresponding to each node.

[0101] In an exemplary embodiment, a generation module is used to optimize the turning points of the target pipeline path when the target pipeline path is determined, and convert the line form of the target pipeline path into a pipeline form to obtain a processed target pipeline path; and send the processed target pipeline path to a terminal device so that the terminal device displays the processed target pipeline path.

[0102] An embodiment of the present application further provides a storage medium, which includes a stored program, wherein the program executes any of the above methods when it is run.

[0103] Optionally, in this embodiment, the storage medium may be configured to store program codes for executing the following steps:

[0104] S1, obtaining placement positions of multiple components of a target device in a target area, and determining connection relationships between connection points of each component in the multiple components;

[0105] S2, generating a plurality of candidate pipeline paths according to condition information, wherein the condition information includes: preset rules corresponding to the pipeline path, apartment type information of the target area, the placement position and the connection relationship;

[0106] S3, determining a target pipeline path from the multiple candidate pipeline paths based on a target algorithm, wherein the target algorithm includes at least one of the following: a greedy algorithm and a minimum cost spanning tree algorithm.

[0107] An embodiment of the present application further provides an electronic device, including a memory and a processor, wherein a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.

[0108] Optionally, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.

[0109] Optionally, in this embodiment, the processor may be configured to perform the following steps through a computer program:

[0110] S1, obtaining placement positions of multiple components of a target device in a target area, and determining connection relationships between connection points of each component in the multiple components;

[0111] S2, generating a plurality of candidate pipeline paths according to condition information, wherein the condition information includes: preset rules corresponding to the pipeline path, apartment type information of the target area, the placement position and the connection relationship;

[0112] S3, determining a target pipeline path from the multiple candidate pipeline paths based on a target algorithm, wherein the target algorithm includes at least one of the following: a greedy algorithm and a minimum cost spanning tree algorithm.

[0113] Optionally, in this embodiment, the above-mentioned storage medium may include but is not limited to: a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk, and other media that can store program codes.

[0114] An embodiment of the present application further provides a computer program product, which includes a computer program. When the computer program is executed by a processor, the steps in any one of the above method embodiments are implemented.

[0115] An embodiment of the present application further provides another computer program product, including a non-volatile computer-readable storage medium, wherein the non-volatile computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in any of the above method embodiments are implemented.

[0116] The embodiments of the present application also provide a computer program, which includes computer instructions, which are stored in a computer-readable storage medium; a processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the steps in any one of the above method embodiments.

[0117] Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments and optional implementation modes, and this embodiment will not be described in detail here.

[0118] Obviously, those skilled in the art should understand that the above modules or steps of the present application can be implemented by a general computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, and optionally, they can be implemented by a program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, the steps shown or described can be executed in a different order from that herein, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. Thus, the present application is not limited to any specific combination of hardware and software.

[0119] The above is only a preferred implementation of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A method for determining a pipeline path, It is characterized in that include: Obtaining placement positions of multiple components of a target device in a target area, and determining connection relationships between connection points of each component in the multiple components; Generate multiple candidate pipeline paths according to condition information, wherein the condition information includes: preset rules corresponding to the pipeline path, apartment type information of the target area, the placement position and the connection relationship; A target pipeline path is determined from the plurality of candidate pipeline paths based on a target algorithm, wherein the target algorithm includes at least one of the following: a greedy algorithm and a minimum cost spanning tree algorithm.

2. The method for determining a pipeline path according to claim 1, It is characterized in that Get the location of multiple components of the target device, including: Determining a set of placement solutions for the multiple components according to the apartment type information of the target area; Determining a score for each placement solution in the set of placement solutions; A placement scheme with the highest score is determined in the placement scheme set, and placement positions of the multiple components are determined according to the placement scheme with the highest score.

3. The method for determining a pipeline path according to claim 2, It is characterized in that Determining a score for each placement solution in the set of placement solutions includes: Determining a placement rule for the target device, and determining a set of influencing factors according to the placement rule and the operating performance of the target device; Determine a single score for each influencing factor in the influencing factor set according to each placement scheme; Determining the weight of each impact factor in the impact factor set; The score of each placement scheme is determined according to the individual score of each influencing factor and the weight of each influencing factor.

4. The method for determining a pipeline path according to claim 1, It is characterized in that Generate multiple candidate pipeline paths based on the condition information, including: Determine a first area and a second area in the target area according to the preset rule and the apartment type information, wherein the first area is an area where pipelines are prohibited from passing through, and the second area is an area where pipelines can pass through; The plurality of candidate pipeline paths are generated in the second area according to the placement positions and the connection relationships.

5. The method for determining a pipeline path according to claim 1, It is characterized in that Determining a target pipeline path from among the plurality of candidate pipeline paths based on a target algorithm includes: Generating a topology graph according to the plurality of candidate pipeline paths, wherein nodes of the topology graph are used to indicate turning points of the plurality of components and the candidate pipeline paths; Determining step: determining the distance between any node of the topological graph and a neighboring node of the any node, and determining the neighboring node with the shortest distance corresponding to the any node; The determining step is executed in a loop until the neighboring node with the shortest distance corresponding to each node is determined; and the target pipeline path is determined according to the neighboring node with the shortest distance corresponding to each node.

6. The method for determining a pipeline path according to claim 1, It is characterized in that Determining a target pipeline path from among the plurality of candidate pipeline paths based on a target algorithm includes: Generating a topology graph according to the plurality of candidate pipeline paths, wherein nodes of the topology graph are used to indicate turning points of the plurality of components and the candidate pipeline paths; Determine a minimum cost subgraph containing any node in the topological graph based on the PCST algorithm until a minimum cost subgraph corresponding to each node is determined; The target pipeline path is determined according to the minimum cost subgraph corresponding to each node.

7. The method for determining a pipeline path according to claim 1, It is characterized in that After determining a target pipeline path from among the plurality of candidate pipeline paths based on a target algorithm, the method further includes: When the target pipeline path is determined, the turning part of the target pipeline path is optimized, and the line form of the target pipeline path is converted into a pipeline form to obtain a processed target pipeline path; The processed target pipeline path is sent to a terminal device, so that the terminal device displays the processed target pipeline path.

8. A device for determining a pipeline path, It is characterized in that include: An acquisition module, used to acquire the placement positions of multiple components of the target device in the target area, and determine the connection relationship between the connection points of each component in the multiple components; A generating module, configured to generate a plurality of candidate pipeline paths according to condition information, wherein the condition information includes: preset rules corresponding to the pipeline path, apartment type information of the target area, the placement position and the connection relationship; A determination module is used to determine a target pipeline path among the multiple candidate pipeline paths based on a target algorithm, wherein the target algorithm includes at least one of the following: a greedy algorithm and a minimum cost spanning tree algorithm.

9. A computer-readable storage medium, It is characterized in that The computer-readable storage medium includes a stored program, wherein the program executes the method described in any one of claims 1 to 7 when executed.

10. An electronic device comprising a memory and a processor, It is characterized in that A computer program is stored in the memory, and the processor is configured to execute the method according to any one of claims 1 to 7 through the computer program.

Citation Information

Cited By

  • Hoisting process configuration method, hoisting system, electronic equipment and storage medium

    CN119338215A

  • Hoisting process configuration method, hoisting system, electronic equipment and storage medium

    CN119338215B