Traveling wave positioning device distribution method, device and equipment and storage medium

Abstract

The embodiment of the invention discloses a traveling wave positioning device distribution method and device, equipment and a storage medium. Comprising the steps of obtaining power grid parameters of a to-be-distributed power distribution network, and determining an undirected graph adjacency matrix, node coordinate information and line parameter information of the to-be-distributed power distribution network according to the power grid parameters; according to the undirected graph adjacency matrix, the node coordinate information and the line parameter information, performing iterative solution meeting preset line length constraint and preset impedance constraint on the initialized particle population, and determining at least one candidate point distribution scheme; and determining the candidate point distribution scheme with the least points as a target point distribution scheme of the power distribution network to be subjected to point distribution. Therefore, observation of all lines in the distribution network to be subjected to point distribution is completed by using the least traveling wave positioning device, the fault positioning cost of the distribution network is reduced, and the safety and economy of the distribution network are better balanced.

Description

Technical Field

[0001] The present invention relates to the technical field of power grid fault detection, and in particular to a traveling wave positioning device deployment method, device, equipment and storage medium. Background Art

[0002] As the last link of power transmission, the distribution network is closely connected with users. Its safety and reliability will directly affect the user's power experience. When a distribution line fails, the user's power supply will be interrupted, directly affecting the user's production and life. Therefore, timely positioning and solving power grid faults is of great significance to ensure a reliable power supply environment, improve user power experience, and enhance the service quality of power grid companies.

[0003] At present, the fault detection of each line in the distribution network is generally achieved by installing a traveling wave positioning device in the distribution line. The distribution network is composed of many short line branches. If a traveling wave positioning device is installed on each branch line, although it can ensure that the status of each line can be monitored in time, it will consume huge manpower and material resources, and it is difficult to balance the safety and configuration economy of the distribution network. Summary of the invention

[0004] The present invention provides a method, device, equipment and storage medium for arranging points of traveling wave positioning devices. According to the grid parameters of the distribution network to be arranged where the traveling wave positioning devices are required, a point arrangement scheme with the least number of traveling wave positioning devices is determined, so that after the traveling wave positioning devices are installed according to the point arrangement scheme, when any line in the distribution network to be arranged fails, at least one traveling wave positioning device can detect the fault signal. The observation of all lines in the distribution network to be arranged is achieved by using the least number of traveling wave positioning devices, the cost of locating the distribution network fault is reduced, and the safety and economy of the distribution network are better balanced.

[0005] In a first aspect, an embodiment of the present invention provides a method for arranging points of a traveling wave positioning device, comprising:

[0006] Obtaining grid parameters of the distribution network to be deployed, and determining the undirected graph adjacency matrix, node coordinate information and line parameter information of the distribution network to be deployed according to the grid parameters;

[0007] According to the undirected graph adjacency matrix, node coordinate information and line parameter information, the initialized particle population is iteratively solved to satisfy the preset line length constraint and the preset impedance constraint, and at least one candidate point layout scheme is determined;

[0008] The candidate layout plan with the least number of points is determined as the target layout plan for the distribution network to be deployed.

[0009] In a second aspect, an embodiment of the present invention further provides a traveling wave positioning device deployment device, comprising:

[0010] The parameter information acquisition module is used to obtain the grid parameters of the distribution network to be deployed, and determine the undirected graph adjacency matrix, node coordinate information and line parameter information of the distribution network to be deployed according to the grid parameters;

[0011] A candidate solution determination module is used to iteratively solve the initialized particle population to meet the preset line length constraint and the preset impedance constraint according to the undirected graph adjacency matrix, node coordinate information and line parameter information, and determine at least one candidate point layout solution;

[0012] The target solution determination module is used to determine the candidate layout solution with the least number of points as the target layout solution of the distribution network to be deployed.

[0013] In a third aspect, an embodiment of the present invention further provides a traveling wave positioning device deployment device, comprising:

[0014] at least one processor; and a memory communicatively coupled to the at least one processor;

[0015] The memory stores a computer program that can be executed by at least one processor, and the computer program is executed by at least one processor so that the at least one processor can implement the traveling wave positioning device deployment method of any embodiment of the present invention.

[0016] In a fourth aspect, an embodiment of the present invention further provides a storage medium comprising computer executable instructions, which, when executed by a computer processor, are used to execute the method for deploying a traveling wave positioning device according to any embodiment of the present invention.

[0017] The embodiment of the present invention provides a method, device, equipment and storage medium for arranging points of a traveling wave positioning device, which obtains the grid parameters of the distribution network to be arranged, and determines the undirected graph adjacency matrix, node coordinate information and line parameter information of the distribution network to be arranged according to the grid parameters; iteratively solves the initialized particle population to meet the preset line length constraint and the preset impedance constraint according to the undirected graph adjacency matrix, node coordinate information and line parameter information, and determines at least one candidate arrangement scheme; the candidate arrangement scheme with the least number of points is determined as the target arrangement scheme of the distribution network to be arranged. By adopting the above technical scheme, when it is necessary to arrange the points of the traveling wave positioning device for the distribution network to be arranged, iteratively solves the initialized particle population according to the undirected graph adjacency matrix, node coordinate information and line parameter information related to the characteristics of the distribution network itself, and the preset line length constraint and preset impedance constraint set according to the detection capability of the traveling wave positioning device, and obtains at least one candidate arrangement scheme. Since preset line length constraints and preset impedance constraints are set according to the detection capability of the traveling wave positioning device, the obtained candidate layout schemes can achieve the goal that when any line in the distribution network to be deployed fails, at least one traveling wave positioning device can detect the fault signal. In order to reduce the cost of fault location in the distribution network, the candidate layout schemes are screened with the goal of configuring the minimum number of traveling wave positioning devices, and the target layout scheme for installing the traveling wave positioning device in the distribution network to be deployed is finally obtained, which realizes the observation of all lines in the distribution network to be deployed using the minimum number of traveling wave positioning devices, reduces the cost of fault location in the distribution network, and achieves a better balance between the safety and economy of the distribution network.

[0018] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present application, nor is it intended to limit the scope of the present application. Other features of the present application will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0020] Figure 1 A flow chart of a method for arranging points of a traveling wave positioning device provided in Embodiment 1 of the present invention;

[0021] Figure 2 A flow chart of a method for arranging points of a traveling wave positioning device provided in Embodiment 2 of the present invention;

[0022] Figure 3A schematic diagram of a process for determining an initial annealing temperature according to node coordinate information and a first particle population provided in the second embodiment of the present invention;

[0023] Figure 4 A schematic diagram of a process for iteratively solving a first particle population to determine at least one to-be-screened point arrangement scheme according to an undirected graph adjacency matrix, node coordinate information, a starting inertia weight, a terminating inertia weight, a preset total number of iterations, a current number of iterations, an initial annealing temperature, and a preset annealing speed, provided in the second embodiment of the present invention;

[0024] Figure 5 A schematic diagram of a process for determining at least one candidate point arrangement scheme that satisfies a preset line length constraint and a preset impedance constraint from point arrangement schemes to be screened according to line parameter information and node coordinate information provided in the second embodiment of the present invention;

[0025] Figure 6 A schematic diagram of the structure of a traveling wave positioning device point arrangement device provided in Embodiment 3 of the present invention;

[0026] Figure 7 A schematic diagram of the structure of a traveling wave positioning device deployment device provided in Embodiment 4 of the present invention. DETAILED DESCRIPTION

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

[0028] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention 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 interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0029] Embodiment 1

[0030] Figure 1This is a flow chart of a method for arranging a traveling wave positioning device provided in the first embodiment of the present invention. The embodiment of the present invention can be applied to the situation where the device setting position is determined for a distribution network where a traveling wave positioning device needs to be arranged. The method can be executed by a traveling wave positioning device arranging device, and the traveling wave positioning device arranging device can be configured in a traveling wave positioning device arranging device. Optionally, the traveling wave positioning device arranging device can be an electronic device, and the electronic device can be a notebook, a desktop computer, a smart tablet, and other computing devices with computing functions, etc., which is not limited by the embodiment of the present invention.

[0031] like Figure 1 As shown, a method for arranging points of a traveling wave positioning device provided by an embodiment of the present invention specifically includes the following steps:

[0032] S101, acquiring grid parameters of the distribution network to be deployed, and determining an undirected graph adjacency matrix, node coordinate information, and line parameter information of the distribution network to be deployed according to the grid parameters.

[0033] In this embodiment, the distribution network to be deployed can be specifically understood as a distribution network that needs to be arranged with a traveling wave positioning device to detect possible faults in each line contained therein. The power grid parameters can be specifically understood as parameters used to indicate the operating status, performance and characteristics of the distribution network, which may include information about the equipment contained in the distribution network and the nodes where the equipment is located, and may also include the connection relationship between each node in the distribution network, and the working status parameter information of the cables connecting the nodes, etc., which are not limited by the embodiment of the present invention. The undirected graph can be specifically understood as a graph used to indicate the topological relationship between each node (such as a power station, a substation, etc.) in the distribution network and the transmission lines connecting these nodes. In this graph, the nodes indicate the equipment or facilities in the distribution network, and the transformers represent the electrical connections between different nodes, and the edges of the graph have no directionality, and the lines connecting two nodes can be considered to be bidirectional. The undirected graph adjacency matrix can be specifically understood as a two-dimensional array used to indicate the connection relationship between vertices in the undirected graph, which can be used to describe whether there is a direct connection relationship between each node in the distribution network in the embodiment of the present invention. The node coordinate information can be specifically understood as the coordinate information of the device corresponding to the node in the undirected graph in the distribution network to be deployed. The line parameter information can be specifically understood as the characteristic information of the line corresponding to the edge in the undirected graph in the distribution network to be deployed, such as the line length and line resistance, etc., which is not limited in the embodiment of the present invention.

[0034] For example, it is assumed that the undirected graph of the distribution network to be deployed can be represented as G = (V, E). Where V is a node in the undirected graph, that is, a bus, power supply or interruption node of the distribution network to be deployed; E is an edge in the undirected graph, which is used to represent the branch of the distribution network to be deployed. Correspondingly, the adjacency matrix of the undirected graph G = (V, E) can be represented by the following formula:

[0035]

[0036] Where n is the number of nodes in the undirected graph, and a indicates whether two nodes i and j are directly connected. That is, if there is an edge between nodes i and j, then the element a of the adjacency matrix A is ij Can be set to 1, otherwise set to 0.

[0037] Specifically, before installing a traveling wave positioning device in a distribution network, it is necessary to first clarify the installation position of the traveling wave positioning device in the distribution network. At this time, the distribution network can be used as a distribution network to be deployed, and according to the grid parameters of the equipment and lines contained in the distribution network to be deployed, the node coordinate information corresponding to each node in the distribution network to be deployed and the line parameter information corresponding to each line can be determined. At the same time, the distribution network to be deployed can be converted into an undirected graph form according to the grid parameters, and the undirected graph adjacency matrix corresponding to the undirected graph can be determined.

[0038] S102. According to the undirected graph adjacency matrix, node coordinate information and line parameter information, an initialized particle population is iteratively solved to satisfy a preset line length constraint and a preset impedance constraint, and at least one candidate point layout scheme is determined.

[0039] In this embodiment, the particle population can be specifically understood as a group of candidate solutions randomly distributed in the search space in the particle swarm optimization algorithm, and in the embodiment of the present invention, it can be understood as a set of multiple node positions where the traveling wave positioning device can be set in the distribution network to be deployed. It can be understood that each particle in the initialized particle population is randomly distributed in the search space, that is, each particle in the initialized particle population is only randomly distributed in the area where the distribution network to be deployed is located, rather than directly coinciding with or having a corresponding relationship with the node position in the distribution network to be deployed. The preset line length constraint can be specifically understood as a constraint condition pre-set according to the detection capability of the traveling wave positioning device, so that all lines in the distribution network to be deployed are covered within the maximum detection length of at least one traveling wave positioning device. The preset impedance constraint can be specifically understood as a constraint condition pre-set according to the detection capability of the traveling wave positioning device, so that all lines in the distribution network to be deployed are covered within the maximum impedance detection range of at least one traveling wave positioning device, wherein the maximum impedance detection range of the traveling wave positioning device can be specifically understood as the range in which the traveling wave positioning device can still obtain the traveling wave signal after the maximum impedance value. The candidate deployment plan can be specifically understood as a plan for arranging traveling wave positioning devices in the distribution network to be deployed that meets preset line length constraints and preset impedance constraints.

[0040] Specifically, since the initialized particle population is composed of particles randomly distributed in the search space and having different speeds, each particle can be used to simulate the layout position of a traveling wave positioning device in the distribution network to be deployed. Only when the position of the particle is located at the node or line of the distribution network to be deployed, the deployment can be actually realized, and the feasibility of the scheme composed of all particles can be determined by the preset line length constraint and the preset impedance constraint. Therefore, the feasible layout position corresponding to each particle in the particle population can be screened according to the undirected graph adjacency matrix and node coordinate information. After all feasible layout positions are screened, the impedance information between different layout positions can be determined according to the line parameter information, and then the preset line length constraint and the preset impedance constraint are solved for all feasible layout positions, and the set of feasible layout positions that meet the two constraints is determined as a candidate layout scheme. At the same time, since the speed and position of each particle will change after iteration, the particle population can be iterated after solving the preset line length constraint and the preset impedance constraint for all feasible layout positions each time when the iteration termination condition is not met, and the above-mentioned solution based on the undirected graph adjacency matrix, node coordinate information and line parameter information, as well as the preset line length constraint and the preset impedance constraint is re-performed until multiple candidate layout solutions are obtained when the iteration termination condition is met.

[0041] S103: Determine the candidate layout plan with the least number of points as the target layout plan for the distribution network to be deployed.

[0042] In this embodiment, the target deployment plan can be specifically understood as a deployment plan of traveling wave positioning devices that is finally selected to be suitable for the distribution network to be deployed and can detect all line faults in the distribution network to be deployed at the lowest cost.

[0043] Specifically, in order to reduce the cost of fault detection and positioning in the distribution network to be deployed, the number of traveling wave positioning devices deployed in the distribution network to be deployed should be as small as possible. Since all candidate deployment plans can realize fault detection and positioning for each line in the distribution network to be deployed, the number of traveling wave positioning devices required to be set in each candidate deployment plan can be compared, and the candidate deployment plan with the least number of points, that is, the least number of traveling wave positioning devices required, can be determined as the target deployment plan for the distribution network to be deployed.

[0044] The technical solution of this embodiment is to obtain the grid parameters of the distribution network to be deployed, and determine the undirected graph adjacency matrix, node coordinate information and line parameter information of the distribution network to be deployed according to the grid parameters; according to the undirected graph adjacency matrix, node coordinate information and line parameter information, iteratively solve the initialized particle population to meet the preset line length constraint and preset impedance constraint, and determine at least one candidate layout scheme; determine the candidate layout scheme with the least number of points as the target layout scheme of the distribution network to be deployed. By adopting the above technical solution, when it is necessary to set up the distribution network to be deployed with the traveling wave positioning device, according to the undirected graph adjacency matrix, node coordinate information and line parameter information related to the characteristics of the distribution network itself, and the preset line length constraint and preset impedance constraint set according to the detection capability of the traveling wave positioning device, iteratively solve the initialized particle population to obtain at least one candidate layout scheme. Since the preset line length constraint and preset impedance constraint are set according to the detection capability of the traveling wave positioning device, the obtained candidate layout schemes can achieve the goal that when any line in the distribution network to be deployed fails, at least one traveling wave positioning device can detect the fault signal. Furthermore, in order to reduce the cost of locating distribution network faults, the candidate layout plans are screened with the goal of configuring the least number of traveling wave locating devices, and the target layout plan for installing traveling wave locating devices in the distribution network to be deployed is obtained. This achieves the use of the least traveling wave locating devices to complete the observation of all lines in the distribution network to be deployed, reduces the cost of locating distribution network faults, and achieves a better balance between the safety and economy of the distribution network.

[0045] Embodiment 2

[0046] Figure 2A flow chart of a method for placing points of a traveling wave positioning device provided in the second embodiment of the present invention is further optimized on the basis of the above-mentioned optional technical solutions. After determining the undirected graph adjacency matrix, node coordinate information and line parameter information according to the grid parameters of the distribution network to be placed, a particle population is randomly generated and initialized to obtain the corresponding first particle population, and the initial annealing temperature is determined based on the first particle population. Then, in the subsequent iterative operation process, the iteration termination condition is determined according to the determined initial annealing temperature, the preset annealing speed, the preset total number of iterations and the current number of iterations. Then, when the iteration is not terminated, the first particle population is solved according to the undirected graph adjacency matrix, the node coordinate information, the starting inertia weight, the ending inertia weight, the preset total number of iterations and the current number of iterations to obtain the corresponding point placement scheme to be screened, and then the point placement schemes to be screened are screened based on the line parameter information, the node coordinate information and the preset line length constraint and the preset impedance constraint, and the candidate point placement scheme that at least meets the full path detection requirements of the distribution network to be placed is obtained. The obtained candidate point layout schemes can achieve the goal that when any line in the distribution network to be deployed fails, at least one traveling wave positioning device can detect the fault signal. In order to reduce the cost of fault location in the distribution network, the candidate point layout schemes are screened with the goal of configuring the minimum number of traveling wave positioning devices, and the target point layout scheme for installing the traveling wave positioning device in the distribution network to be deployed is finally obtained, which realizes the observation of all lines in the distribution network to be deployed using the minimum number of traveling wave positioning devices, reduces the cost of fault location in the distribution network, and achieves a better balance between the safety and economy of the distribution network.

[0047] like Figure 2 As shown, a method for arranging points of a traveling wave positioning device provided by an embodiment of the present invention specifically includes the following steps:

[0048] S201. Obtain grid parameters of the distribution network to be deployed, and determine an undirected graph adjacency matrix, node coordinate information, and line parameter information of the distribution network to be deployed according to the grid parameters.

[0049] S202, randomly generate a particle population, initialize the particle position and particle velocity of the particle population, and determine the first particle population.

[0050] Specifically, a particle population is randomly generated in the area of ​​the distribution network to be deployed, and the particle position and particle velocity of each particle in the particle population are initialized, and the initialized particle population is determined as the first particle population.

[0051] S203 . Determine an initial annealing temperature according to the node coordinate information and the first particle population.

[0052] In this embodiment, the initial annealing temperature can be specifically understood as a set value set at the beginning of the simulated annealing algorithm, which is used to enable the algorithm to perform extensive random search in the problem solution space to jump out of the local optimal solution and increase the chance of finding the global optimal solution. In this embodiment of the present invention, the initial annealing temperature can be determined based on the particle fitness of the particle at the global optimal position in the particle population.

[0053] Specifically, according to the position and speed of each particle in the first particle population, the particle fitness of each particle in the first particle population can be determined. At the same time, according to the position of each particle in the first particle population and the node position coordinate information, the global optimal position of each particle in the first particle population can be determined. Then, the determination of the initial annealing temperature can be completed based on the particle fitness of the example in the first particle population located at the global optimal position.

[0054] Optional, Figure 3 A schematic diagram of a process for determining an initial annealing temperature according to node coordinate information and a first particle population is provided in the second embodiment of the present invention, such as Figure 3 As shown, the specific steps include:

[0055] S2031. Determine the particle fitness of each particle according to the particle position and particle velocity of each particle in the first particle population.

[0056] Specifically, the particle position and particle velocity of each particle in the first particle population are respectively substituted into a preset particle population fitness function to determine the particle fitness of each particle.

[0057] It is understandable that the particle swarm fitness function can be adaptively set and adjusted according to the actual optimization objectives and constraints, and the embodiment of the present invention does not limit this.

[0058] S2032. Determine the particle whose particle position coincides with the node coordinate information as the initial optimal position particle.

[0059] Specifically, when the particle position coincides with the node coordinates in the node coordinate information, it can be considered that the particle is located at the node of the distribution network to be deployed, and the node can certainly be used to arrange the traveling wave positioning device, that is, the particle position can certainly be retained as an optimal solution. Therefore, at this time, the particle whose particle position coincides with the node coordinate information can be determined as the initial optimal position particle that can be directly adopted after the particle population is initialized.

[0060] S2033. Determine the sum of the particle fitness corresponding to each initial optimal position particle as the optimal fitness, and determine the initial annealing temperature according to the optimal fitness.

[0061] Specifically, since the number of particles at the initial optimal position may not be unique, the sum of the particle fitnesses corresponding to all particles at the initial optimal position may be determined as the optimal fitness, and then the optimal fitness is substituted into a preset initial annealing temperature determination formula to determine the initial annealing temperature.

[0062] Exemplarily, the initial annealing temperature determination formula can be expressed as: Among them, Z best is the optimal fitness.

[0063] S204, iteratively solving the first particle population according to the undirected graph adjacency matrix, node coordinate information, starting inertia weight, ending inertia weight, preset total number of iterations, current number of iterations, initial annealing temperature and preset annealing speed, and determining at least one point distribution scheme to be screened.

[0064] In this embodiment, the initial inertia weight and the termination inertia weight can be specifically understood as preset parameters used to adjust the search performance in the particle swarm algorithm. Among them, the initial inertia weight is usually set to a larger value to help global exploration in the early stage of the search, so that particles can wander widely in the search space to avoid falling into a local optimal solution. Among them, the termination inertia weight is usually set to a smaller value to help local search in the later stage of the search, so that particles can perform detailed searches near the currently found optimal solution, so as to accurately approach the optimal solution. Exemplarily, in an embodiment of the present invention, the initial inertia weight can be set to 0.8 and the termination inertia weight can be set to 0.4. The two can also be adjusted according to actual conditions, and the embodiment of the present invention does not limit this.

[0065] In this embodiment, the preset total number of iterations can be specifically understood as the total number of iterative operations to be performed, which is preset according to actual conditions. The current number of iterations can be specifically understood as the number of solution operations performed at the current moment in all iterative operations. The preset annealing speed can be specifically understood as the attenuation function used to control parameters in the simulated annealing algorithm. It can be understood that the slower the simulated annealing process, the greater the probability that the algorithm finds the global optimum. In the embodiment of the present invention, the preset annealing speed can be set to 0.95.

[0066] Optional, Figure 4 A schematic diagram of a process for iteratively solving a first particle population to determine at least one to-be-screened point arrangement scheme according to an undirected graph adjacency matrix, node coordinate information, a starting inertia weight, a terminating inertia weight, a preset total number of iterations, a current number of iterations, an initial annealing temperature, and a preset annealing speed is provided for the second embodiment of the present invention, such as Figure 4 As shown, the specific steps include:

[0067] S2041, determining a point arrangement scheme to be screened and a current annealing fitness according to the position of each particle in the first particle population, the speed of each particle, the undirected graph adjacency matrix, the node coordinate information and the current annealing temperature.

[0068] Among them, when it is executed for the first time, the current annealing temperature is the initial annealing temperature.

[0069] Specifically, according to the particle position and particle velocity of each particle in the first particle population, the particle fitness of each particle in the first particle population can be determined respectively, and then the optimal position particle in the first particle population in the current iteration process can be determined from each particle based on the node coordinate information, and the current annealing fitness of each particle in the first particle population can be determined based on the particle fitness of the optimal position particle, the particle fitness of each other particle and the current annealing temperature. At the same time, according to the particle position of each particle in the first particle population, the undirected graph adjacency matrix and the node coordinate position information, all particles whose particle positions coincide with the nodes and lines of the distribution network to be deployed can be extracted, and the scheme composed of the extracted particles can be determined as the point deployment scheme to be screened.

[0070] S2042: fix the positions of particles in the first particle population whose particle positions coincide with the node coordinate information, and determine them as the particle population to be iterated.

[0071] Specifically, since the particles whose particle positions in the first particle population coincide with the node coordinate information are already in the optimal position, their positions must be kept unchanged in the subsequent solution determination. Therefore, the positions of the particles whose particle positions in the first particle population coincide with the node coordinate information can be fixed, and the states of other particles in the first particle population are kept unchanged. The obtained particle population is determined as the particle population to be iterated that needs to be processed in the next iteration.

[0072] S2043. If the current number of iterations is less than the preset total number of iterations, or the current annealing temperature and the current annealing fitness do not meet the preset annealing convergence conditions, determine the current inertia weight according to the current number of iterations, the preset total number of iterations, the starting inertia weight and the ending inertia weight.

[0073] In this embodiment, the preset annealing convergence condition can be specifically understood as a condition for the simulated annealing algorithm to exit iteration, which is predetermined according to actual conditions. For example, the current annealing temperature may be lower than the preset minimum annealing temperature, or the difference between the current annealing fitness and the previous annealing fitness may be less than the preset annealing fitness difference, etc., and the embodiment of the present invention does not limit this.

[0074] Specifically, if the current number of iterations is less than the preset total number of iterations, or the current annealing temperature and the current annealing fitness do not meet the preset annealing convergence conditions, it can be considered that it is still necessary to continue to perform iterative operations on the particle population to be iterated, and determine a new point distribution scheme to be screened. At this time, the current inertia weight used for the parameter update in the particle population to be iterated can be determined based on the current number of iterations, the preset total number of iterations, the starting inertia weight, and the ending inertia weight.

[0075] Exemplarily, the current inertia weight can be represented as:

[0076]

[0077] Among them, k is the current iteration number, k max is the total number of preset iterations, ω start is the initial inertia weight, ω end is the ending inertia weight.

[0078] S2044. Update the velocity and position of the particle population to be iterated according to the current inertia weight, and determine it as a new first particle population.

[0079] For example, a roulette strategy can be used to select an optimal position in the particle population to be iterated and put it into the global optimal position P zd Then, the position and velocity of each particle in the particle population to be iterated are updated by the following formula:

[0080]

[0081] in, is the velocity of the ith particle at the k+1th iteration; ω is the current inertia weight, which is used to balance the previous velocity of the particle and affects the globality and locality of the particle search space; is the speed of the ith particle at the kth iteration; c1 and c2 are acceleration coefficients, which are used to control the pace of the particle moving to its own optimal position and the global optimal position, and the initial value is usually set at around 2.0; r1 and r2 are random numbers, usually in the range of [0,1], to introduce randomness into the algorithm, avoid premature maturation and enhance the algorithm's search ability; is the optimal position (local optimal position) found by the i-th particle in history; is the optimal position (global optimal position) found by the entire particle swarm in history; is the position of the i-th particle at the k-th iteration.

[0082] S2045, adding one to the current iteration number to determine it as a new current iteration number, determining the product of the current annealing temperature and the preset annealing speed as a new current annealing temperature, and returning to execute S2041.

[0083] Specifically, before the next iteration operation is required, the current number of iterations must first be increased by one as the new current number of iterations used for the next iteration. At the same time, since the annealing temperature needs to be reduced once each iteration operation is performed, the reduction method can be calculated by a preset annealing temperature formula. In the embodiment of the present invention, the product of the current annealing temperature and the preset annealing speed can be determined as the annealing speed required for the next iteration operation, that is, after the product is determined as the new current annealing speed, the new current number of iterations, the current annealing speed and the new first particle population are substituted into the step of determining the to-be-screened point distribution scheme and the current annealing fitness according to the positions of each particle in the first particle population, the speeds of each particle, the undirected graph adjacency matrix, the node coordinate information and the current annealing temperature, so as to achieve iterative solution for the first particle population.

[0084] It can be understood that if the number of iterations is greater than or equal to the preset total number of iterations, or the current annealing speed and the current back-off fitness have met the preset annealing convergence conditions, then it can be considered that the iterative operation for the first particle population has been completed. At this time, the obtained point distribution scheme to be screened can be determined as the basis for subsequent determination of candidate point distribution schemes, and subsequent candidate point distribution scheme screening can be carried out.

[0085] S205. Determine at least one candidate point layout scheme that satisfies a preset line length constraint and a preset impedance constraint from the point layout schemes to be screened according to the line parameter information and the node coordinate information.

[0086] Specifically, after the point distribution scheme to be screened is determined, the actual position of the points in each point distribution scheme to be screened in the distribution network to be distributed can be determined. Then, the line length and impedance value between each adjacent point in each point distribution scheme to be screened can be determined according to the line parameter information and the node coordinate information, and then the constraint conditions of each line length and impedance value in the distribution network to be distributed can be judged by the preset line length constraint and the preset impedance constraint, and the point distribution scheme to be screened that satisfies both constraints can be determined as the candidate point distribution scheme that can be actually put into use.

[0087] Optional, Figure 5 A schematic diagram of a process for determining at least one candidate point arrangement scheme that satisfies a preset line length constraint and a preset impedance constraint from the point arrangement schemes to be screened according to line parameter information and node coordinate information is provided in Embodiment 2 of the present invention, such as Figure 5 As shown, the specific steps include:

[0088] S2051. For each point distribution scheme to be screened, determine the shortest line length between each node in the distribution network to be screened and the point distribution scheme corresponding to the point distribution scheme to be screened according to the node coordinate information.

[0089] Specifically, for each point arrangement scheme to be screened, each point arrangement corresponds to an actual position in the distribution network to be arranged, and the coordinates of each point arrangement in the distribution network to be arranged can be clearly defined. At the same time, since the node coordinate information contains the coordinates of each node in the distribution network to be arranged in the distribution network to be arranged, the line length between each node in the distribution network to be arranged and the nearest point arrangement can be determined according to the wiring method in the distribution network to be arranged, and the line length is determined as the shortest line length corresponding to the node, which can be understood as the line length between the nearest traveling wave positioning device and the node for fault detection of the node when the traveling wave positioning device is arranged according to the point arrangement scheme to be screened.

[0090] S2052: If the lengths of the shortest lines are all less than or equal to the maximum coverage line length of the preset device, then the impedance value of the line corresponding to each shortest line length is determined according to the line parameter information.

[0091] In this embodiment, the maximum coverage line length of the preset device can be specifically understood as being determined according to the detection capability of the traveling wave positioning device, and the maximum line length that can be covered and detected by a traveling wave positioning device.

[0092] Specifically, if the lengths of the shortest lines are less than or equal to the maximum coverage line length of the preset device, it can be considered that there is at least one traveling wave positioning device that can detect the node corresponding to each shortest line length, and it can be considered that the point layout scheme to be screened meets the preset line length constraint. At this time, the impedance value corresponding to each line constituting each shortest line length can be determined according to the line parameter information, and the impedance values ​​of all lines in the shortest line length are added as the impedance value of the line corresponding to the shortest line length.

[0093] S2053. If all impedance values ​​are less than or equal to the preset maximum impedance value of the device, the point layout scheme to be screened is determined as a candidate point layout scheme.

[0094] In this embodiment, the preset device maximum impedance value can be specifically understood as a maximum impedance value that is determined according to the detection capability of the traveling wave positioning device and that can be passed by a traveling wave positioning device when it is able to obtain a traveling wave signal.

[0095] Specifically, if all impedance values ​​are less than or equal to the preset maximum impedance value of the device, it can be considered that the impedance generated by the line between the node corresponding to each shortest line length and the nearest traveling wave positioning device is within the maximum impedance value detectable by the traveling wave positioning device, that is, there is at least one traveling wave positioning device that can detect the node, and it can be considered that the to-be-screened point layout scheme meets the preset impedance constraint. At this time, the to-be-screened point layout scheme can be determined as a candidate point layout scheme.

[0096] S206: Determine the candidate layout plan with the least number of points as the target layout plan for the distribution network to be deployed.

[0097] Optionally, before determining the candidate layout scheme with the least number of points as the target layout scheme for the distribution network to be deployed, the method further includes: performing node screening on each candidate layout scheme according to preset node weights.

[0098] Specifically, since the installation of the traveling wave positioning device may have been completed on some nodes of the distribution network to be deployed before the deployment plan is planned, there is no need to install the traveling wave positioning device again for these nodes that have been installed with the traveling wave positioning device, which means that the number of points required to set the traveling wave positioning device in the corresponding deployment plan can be simplified for the nodes that have been installed with the traveling wave positioning device. Therefore, before screening each candidate deployment plan, according to the setting of the traveling wave positioning device on each node in the current distribution network to be deployed, the corresponding preset node weights can be set for different nodes in the distribution network to be deployed, so as to reduce the weight of the node containing the traveling wave positioning device in the candidate deployment plan, complete the node screening for the candidate deployment plan, and then for the screened candidate deployment plan, select the plan with the smallest number of points as the target deployment plan for the distribution network to be deployed, so as to achieve the determination of the target deployment plan based on the actual distribution network situation and with the least number of traveling wave positioning devices required to be added.

[0099] Exemplarily, the weight of the node with the traveling wave positioning device in the distribution network to be deployed can be set to 0, and the weight of the node without the traveling wave positioning device can be set to 1. At this time, when the nodes of each candidate deployment scheme are screened by the preset node weight, the points with the preset node weight of 0 in each candidate deployment scheme can be deleted to reduce the influence of the node that has been currently equipped with the traveling wave positioning device on the candidate deployment scheme.

[0100] In an embodiment of the present invention, by setting weights for each node in the distribution network to be deployed according to the settings of the traveling wave positioning device, the actual distribution of the traveling wave positioning device can be more fully considered when determining the candidate deployment plan, so that the determined target deployment plan can indeed become the deployment plan with the least number of traveling wave positioning devices required to be added, thereby avoiding the candidate deployment plan with the least number of traveling wave positioning devices actually required to be added from being mistakenly deleted, reducing the cost of distribution network fault locating, and achieving a better balance between the safety and economy of the distribution network.

[0101] The technical solution of this embodiment is to randomly generate a particle population and initialize the particle population to obtain the corresponding first particle population after determining the undirected graph adjacency matrix, node coordinate information and line parameter information according to the grid parameters of the distribution network to be deployed, and complete the determination of the initial annealing temperature based on the first particle population. Then, in the subsequent iterative operation process, the iteration termination condition is determined according to the determined initial annealing temperature, the preset annealing speed, the preset total number of iterations and the current number of iterations. Then, when the iteration is not terminated, the first particle population is solved according to the undirected graph adjacency matrix, node coordinate information, starting inertia weight, ending inertia weight, preset total number of iterations and current number of iterations to obtain the corresponding to-be-screened point distribution scheme, and then screen each to-be-screened point distribution scheme based on the line parameter information, node coordinate information and preset line length constraint and preset impedance constraint, and obtain a candidate point distribution scheme that at least meets the full path detection requirements of the distribution network to be deployed. The obtained candidate point distribution schemes can all achieve the goal that when any line in the distribution network to be deployed fails, at least one traveling wave positioning device can detect the fault signal. Furthermore, in order to reduce the cost of locating distribution network faults, the candidate layout plans are screened with the goal of configuring the least number of traveling wave locating devices, and the target layout plan for installing traveling wave locating devices in the distribution network to be deployed is obtained. This achieves the use of the least traveling wave locating devices to complete the observation of all lines in the distribution network to be deployed, reduces the cost of locating distribution network faults, and achieves a better balance between the safety and economy of the distribution network.

[0102] Embodiment 3

[0103] Figure 6 A schematic diagram of a traveling wave positioning device point arrangement device provided in Embodiment 3 of the present invention is shown in FIG. Figure 6 As shown, the traveling wave positioning device deployment device includes a parameter information acquisition module 31, a candidate solution determination module 32 and a target solution determination module 33.

[0104] Among them, the parameter information acquisition module 31 is used to obtain the grid parameters of the distribution network to be deployed, and determine the undirected graph adjacency matrix, node coordinate information and line parameter information of the distribution network to be deployed according to the grid parameters; the candidate solution determination module 32 is used to iteratively solve the initialized particle population to meet the preset line length constraint and the preset impedance constraint according to the undirected graph adjacency matrix, node coordinate information and line parameter information, and determine at least one candidate layout solution; the target solution determination module 33 is used to determine the candidate layout solution with the least number of points as the target layout solution of the distribution network to be deployed.

[0105] The technical solution of the embodiment of the present invention, when it is necessary to set up the traveling wave positioning device for the distribution network to be deployed, iteratively solves the initialized particle population according to the undirected graph adjacency matrix, node coordinate information and line parameter information related to the characteristics of the distribution network itself, and the preset line length constraint and preset impedance constraint set according to the detection capability of the traveling wave positioning device, and obtains at least one candidate deployment scheme. Since the preset line length constraint and preset impedance constraint are set according to the detection capability of the traveling wave positioning device, the obtained candidate deployment schemes can achieve the goal that when any line in the distribution network to be deployed fails, at least one traveling wave positioning device can detect the fault signal. In order to reduce the cost of locating the distribution network fault, the candidate deployment schemes are screened with the goal of configuring the minimum number of traveling wave positioning devices, and the target deployment scheme for installing the traveling wave positioning device for the distribution network to be deployed is obtained, which realizes the observation of all lines in the distribution network to be deployed using the minimum number of traveling wave positioning devices, reduces the cost of locating the distribution network fault, and achieves a better balance between the safety and economy of the distribution network.

[0106] Optionally, the candidate solution determination module 32 includes:

[0107] The first population determination unit is used to randomly generate a particle population, initialize the particle position and particle velocity of the particle population, and determine the first particle population.

[0108] The initial temperature determination unit is used to determine the initial annealing temperature according to the node coordinate information and the first particle population.

[0109] The unit for determining a scheme to be screened is used to iteratively solve the first particle population according to the undirected graph adjacency matrix, node coordinate information, starting inertia weight, ending inertia weight, preset total number of iterations, current number of iterations, initial annealing temperature and preset annealing speed to determine at least one point distribution scheme to be screened.

[0110] The candidate solution determination unit is used to determine at least one candidate layout solution that meets the preset line length constraint and the preset impedance constraint from the layout solutions to be screened according to the line parameter information and the node coordinate information.

[0111] Optionally, the initial temperature determination unit is specifically used for:

[0112] Determine the particle fitness of each particle according to the particle position and particle velocity of each particle in the first particle population;

[0113] The particle whose particle position coincides with the node coordinate information is determined as the particle with the initial optimal position;

[0114] The sum of the particle fitness corresponding to each initial optimal position particle is determined as the optimal fitness, and the initial annealing temperature is determined according to the optimal fitness.

[0115] Optionally, the unit for determining the scheme to be screened is specifically used for:

[0116] Determine the to-be-screened point distribution scheme and the current annealing fitness according to the positions of each particle in the first particle population, the speed of each particle, the undirected graph adjacency matrix, the node coordinate information and the current annealing temperature; wherein the current annealing temperature is the initial annealing temperature during the first execution;

[0117] The particles in the first particle population whose particle positions coincide with the node coordinate information are fixed in position and determined as the particle population to be iterated;

[0118] If the current number of iterations is less than the preset total number of iterations, or the current annealing temperature and the current annealing fitness do not meet the preset annealing convergence conditions, the current inertia weight is determined according to the current number of iterations, the preset total number of iterations, the starting inertia weight and the ending inertia weight;

[0119] The velocity and position of the iterated particle population are updated according to the current inertia weight, and determined as a new first particle population;

[0120] The current number of iterations is incremented by one to determine the new current number of iterations, the product of the current annealing temperature and the preset annealing speed is determined as the new current annealing temperature, and the step of determining the to-be-screened layout scheme and the current annealing fitness according to the positions of each particle in the first particle population, the speed of each particle, the undirected graph adjacency matrix, the node coordinate information and the current annealing temperature is returned to be executed.

[0121] Optionally, the candidate solution determination unit is specifically used to:

[0122] For each point distribution scheme to be screened, determine the shortest line length between each node in the distribution network to be distributed and the point distribution scheme corresponding to the point distribution scheme to be screened according to the node coordinate information;

[0123] If the lengths of the shortest lines are all less than or equal to the maximum coverage line length of the preset device, the impedance value of the line corresponding to each shortest line length is determined according to the line parameter information;

[0124] If all impedance values ​​are less than or equal to the preset maximum impedance value of the device, the point layout scheme to be screened is determined as a candidate point layout scheme.

[0125] Optionally, the traveling wave positioning device deployment device further includes:

[0126] The node screening module is used to screen the nodes of each candidate point distribution scheme according to the preset node weights before determining the candidate point distribution scheme with the least number of points as the target point distribution scheme of the distribution network to be distributed.

[0127] The traveling wave positioning device point placement device provided in the embodiment of the present invention can execute the traveling wave positioning device point placement method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0128] Embodiment 4

[0129] Figure 7 A schematic diagram of the structure of a traveling wave positioning device point distribution device provided for the fourth embodiment of the present invention. The traveling wave positioning device point distribution device 40 can be intended to represent various forms of digital computers, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The traveling wave positioning device point distribution device 40 can also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smart phones, wearable devices (such as helmets, glasses, watches, etc.) and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present invention described and / or required herein.

[0130] like Figure 7 As shown, the traveling wave positioning device point distribution device 40 includes at least one processor 41, and a memory connected to the at least one processor 41, such as a read-only memory (ROM) 42, a random access memory (RAM) 43, etc., wherein the memory stores a computer program that can be executed by at least one processor, and the processor 41 can perform various appropriate actions and processes according to the computer program stored in the read-only memory (ROM) 42 or the computer program loaded from the storage unit 48 to the random access memory (RAM) 43. In the RAM 43, various programs and data required for the operation of the traveling wave positioning device point distribution device 40 can also be stored. The processor 41, the ROM 42 and the RAM 43 are connected to each other through a bus 44. The input / output (I / O) interface 45 is also connected to the bus 44.

[0131] Multiple components in the traveling wave positioning device 40 are connected to the I / O interface 45, including: an input unit 46, such as a keyboard, a mouse, etc.; an output unit 47, such as various types of displays, speakers, etc.; a storage unit 48, such as a disk, an optical disk, etc.; and a communication unit 49, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 49 allows the traveling wave positioning device 40 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0132] The processor 41 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the processor 41 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special artificial intelligence (AI) computing chips, various processors running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The processor 41 executes the various methods and processes described above, such as the traveling wave positioning device deployment method.

[0133] In some embodiments, the traveling wave positioning device deployment method can be implemented as a computer program, which is tangibly contained in a computer-readable storage medium, such as a storage unit 48. In some embodiments, part or all of the computer program can be loaded and / or installed on the traveling wave positioning device deployment device 40 via the ROM 42 and / or the communication unit 49. When the computer program is loaded into the RAM 43 and executed by the processor 41, one or more steps of the traveling wave positioning device deployment method described above can be performed. Alternatively, in other embodiments, the processor 41 can be configured to execute the traveling wave positioning device deployment method in any other appropriate manner (for example, by means of firmware).

[0134] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0135] Computer programs for implementing the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that when the computer program is executed by the processor, the functions / operations specified in the flow chart and / or block diagram are implemented. The computer program may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0136] In the context of the present invention, a computer-readable storage medium may be a tangible medium that may contain or store a computer program for use by or in combination with an instruction execution system, device or equipment. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices or equipment, or any suitable combination of the foregoing. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0137] To provide interaction with a user, the systems and techniques described herein may be implemented on a wave positioning device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the wave positioning device. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).

[0138] The systems and techniques described herein may be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), a blockchain network, and the Internet.

[0139] A computing system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The client and server relationship is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services.

[0140] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in the present invention can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solution of the present invention can be achieved, and this document does not limit this.

[0141] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for arranging points of a traveling wave positioning device, characterized in that: include: Obtaining grid parameters of the distribution network to be deployed, and determining an undirected graph adjacency matrix, node coordinate information, and line parameter information of the distribution network to be deployed according to the grid parameters; According to the undirected graph adjacency matrix, the node coordinate information and the line parameter information, an initialized particle population is iteratively solved to satisfy a preset line length constraint and a preset impedance constraint, and at least one candidate point layout scheme is determined; The candidate point layout scheme with the least number of points is determined as the target point layout scheme of the distribution network to be deployed.

2. The method for arranging points of the traveling wave positioning device according to claim 1, characterized in that: The step of iteratively solving the initialized particle population to satisfy the preset line length constraint and the preset impedance constraint according to the undirected graph adjacency matrix, the node coordinate information and the line parameter information, and determining at least one candidate point layout scheme includes: Randomly generate a particle population, initialize the particle position and particle velocity of the particle population, and determine a first particle population; Determining an initial annealing temperature according to the node coordinate information and the first particle population; Iteratively solving the first particle population according to the undirected graph adjacency matrix, the node coordinate information, the starting inertia weight, the ending inertia weight, the preset total number of iterations, the current number of iterations, the initial annealing temperature and the preset annealing speed, to determine at least one point arrangement scheme to be screened; According to the line parameter information and the node coordinate information, at least one candidate point layout scheme that satisfies a preset line length constraint and a preset impedance constraint is determined from the point layout schemes to be screened.

3. The method for arranging points of the traveling wave positioning device according to claim 2, characterized in that: The step of determining the initial annealing temperature according to the node coordinate information and the first particle population includes: Determining the particle fitness of each particle according to the particle position and particle velocity of each particle in the first particle population; Determine the particle whose particle position coincides with the node coordinate information as the initial optimal position particle; The sum of the particle fitness corresponding to each of the initial optimal position particles is determined as the optimal fitness, and the initial annealing temperature is determined according to the optimal fitness.

4. The method for arranging points of the traveling wave positioning device according to claim 2, characterized in that: The iterative solution of the first particle population is performed according to the undirected graph adjacency matrix, the node coordinate information, the starting inertia weight, the ending inertia weight, the preset total number of iterations, the current number of iterations, the initial annealing temperature and the preset annealing speed to determine at least one to-be-screened point arrangement scheme, including: Determine the to-be-screened point distribution scheme and the current annealing fitness according to the position of each particle in the first particle population, the speed of each particle, the undirected graph adjacency matrix, the node coordinate information and the current annealing temperature; wherein the current annealing temperature is the initial annealing temperature when the method is executed for the first time; Fixing the positions of particles in the first particle population whose positions coincide with the node coordinate information, and determining them as the particle population to be iterated; If the current number of iterations is less than the preset total number of iterations, or the current annealing temperature and the current annealing fitness do not meet the preset annealing convergence condition, then determining the current inertia weight according to the current number of iterations, the preset total number of iterations, the starting inertia weight and the ending inertia weight; According to the current inertia weight, the velocity and position of the to-be-iterated particle population are updated to determine it as a new first particle population; The current number of iterations is incremented by one to determine a new current number of iterations, the product of the current annealing temperature and the preset annealing speed is determined as a new current annealing temperature, and the step of determining the point distribution scheme to be screened and the current annealing fitness according to the position of each particle in the first particle population, the speed of each particle, the undirected graph adjacency matrix, the node coordinate information and the current annealing temperature is returned to be executed.

5. The method for arranging points of the traveling wave positioning device according to claim 2, characterized in that: The determining, according to the line parameter information and the node coordinate information, at least one candidate point layout scheme satisfying a preset line length constraint and a preset impedance constraint from the point layout schemes to be screened comprises: For each of the point layout schemes to be screened, determining the shortest line length between each node in the point distribution network to be screened and the point layout corresponding to the point layout scheme to be screened according to the node coordinate information; If the shortest line lengths are all less than or equal to the maximum coverage line length of the preset device, then determining the impedance value of the line corresponding to each of the shortest line lengths according to the line parameter information; If each of the impedance values ​​is less than or equal to the preset maximum impedance value of the device, the point layout scheme to be screened is determined as a candidate point layout scheme.

6. The method for arranging points of a traveling wave positioning device according to any one of claims 1 to 5, characterized in that: Before determining the candidate point layout scheme with the least number of points as the target point layout scheme of the distribution network to be deployed, the method further includes: Node screening is performed on each of the candidate point layout schemes according to preset node weights.

7. A traveling wave positioning device point arrangement device, characterized in that: include: A parameter information acquisition module is used to acquire the grid parameters of the distribution network to be deployed, and determine the undirected graph adjacency matrix, node coordinate information and line parameter information of the distribution network to be deployed according to the grid parameters; A candidate solution determination module is used to iteratively solve the initialized particle population to meet the preset line length constraint and the preset impedance constraint according to the undirected graph adjacency matrix, the node coordinate information and the line parameter information, and determine at least one candidate point layout solution; The target solution determination module is used to determine the candidate point layout solution with the least number of points as the target point layout solution of the distribution network to be deployed.

8. A traveling wave positioning device deployment device, characterized in that: include: at least one processor; and a memory communicatively coupled to the at least one processor; Wherein, the memory stores a computer program executable by the at least one processor, and the computer program is executed by the at least one processor so that the at least one processor can execute the traveling wave positioning device deployment method according to any one of claims 1-6.

9. A storage medium containing computer executable instructions, characterized in that: The computer executable instructions are used to execute the traveling wave positioning device deployment method as described in any one of claims 1 to 6 when executed by a computer processor.

Images