46 results about "Shortest path computation" patented technology

The invention relates to the technical field of computer networks, and discloses a method for locating reasons for network dial test quality index abnormity, which comprises the following steps of: multi-source data acquisition and network topology modeling: generating state information of network equipment and links by acquiring performance data of each equipment and flow data of the links in a network, and establishing a network topology model; establishing a network topological graph model; shortest path calculation and abnormal path identification based on the graph theory: calculating a shortest path from source equipment to target equipment by using a shortest path algorithm in the graph theory, and identifying abnormal links and equipment in the path; and load evaluation and bottleneck analysis based on an information theory. Through combination of multi-source data acquisition, graph theory optimization, information theory evaluation, game theory resource allocation, deep reinforcement learning and multi-target optimization, network paths and loads are dynamically adjusted, abnormal sources are accurately positioned, and network performance, stability and adaptive capacity are improved.

The invention relates to the technical field of hot-line work assessment, and discloses a hot-line work risk assessment method and system based on multi-source data, and the method comprises the steps: collecting equipment data, environment data and geological data, and carrying out the preprocessing; the method comprises the following steps: constructing a knowledge graph structure based on connection of electrified equipment, calculating link cost, analyzing node priority change to carry out dynamic shortest path calculation, optimizing risk propagation of abnormal points, calculating risk change of each grid point, and carrying out anomaly detection. According to the method, the physical and logic relations between the nodes are determined through the knowledge graph, multi-dimensional risk modeling and analysis are facilitated, the method can adapt to field data changes and reflect the newest risk distribution state through real-time monitoring and updating of node priority ranking, negative weight edges are supported through the Bellman-Ford algorithm, and the method has the advantages of being high in reliability and high in reliability. Possible negative influence factors in risk propagation can be effectively processed, the risk diffusion range and intensity of nodes can be accurately described through a Gaussian diffusion model, and the influence of the nodes on surrounding grid points is quantified.

The invention relates to the technical field of machine tool tool magazines, in particular to a hydraulic inverted translation tool magazine tool changing control method and system.The hydraulic inverted translation tool magazine tool changing control method comprises the steps that S10, the tool storage positions of a tool magazine are numbered clockwise from 1 to n, and n is the tool storage upper limit; labeling each cutter to form a cutter number and installing the cutter number; s20, the tool magazine is initialized, tool storage position numbers and tool numbers are recorded into n columns and two rows, a comparison table is formed, and all tools are recorded; s30, according to the tool changing instruction, shortest path L calculation is conducted on the tool storage position number y corresponding to the target tool and the tool storage position number z of the tool changing position where the target tool is located; s40, the tool magazine is moved according to the calculation result of the L, and the target tool is moved to a tool changing position; s50, whether the tool changing position tool number is consistent with the target tool number or not is recognized, and if yes, the tool changing action is conducted; s60, the spindle tool is installed at the tool storage position where the tool changing position is located, the comparison table is updated, and the tool changing action is finished; the tool changing efficiency is effectively improved.

The invention provides a data acquisition method, system and device based on HPLC and HRF dual-mode communication and a medium, and relates to the technical field of data acquisition. The data acquisition method based on HPLC and HRF dual-mode communication comprises the following steps: acquiring a pre-constructed data acquisition network topology, a networking state of the data acquisition network topology and an initial routing table; determining a target data transmission path according to the networking state, the data acquisition network topology and a preset shortest path calculation mode; generating a target routing table according to the target data transmission path and the initial routing table; and acquiring key load data according to the target routing table, allocating weights to the plurality of ammeters, determining a data acquisition sequence according to the key load data, the weights and a preset sorting mode, and acquiring power utilization data of the plurality of ammeters according to the data acquisition sequence. According to the method, the shortest path is calculated and the acquisition sequence is set, so that the accuracy and integrity of the data are ensured, and the precision of the acquired power consumption data is improved.

The invention relates to a resource allocation method and system for dynamic load balancing of a data center elastic optical network, and belongs to the technical field of communication. Comprising the following steps: initializing data center elastic optical network parameters, and generating a connection request; judging whether the residual computing power resources of the source node and the destination node meet the request requirement or not, if so, calculating K working paths, selecting the shortest path, calculating the number of required spectrum slots, and judging whether the paths have residual spectrum resources or not; if yes, layered traffic grooming evaluation parameters are calculated, and the optimal spectrum layer is selected for grooming traffic; if not, selecting the highest-price modulation format; judging whether bandwidth and optical channel resources on the path are enough, if so, allocating spectrum resources, otherwise, returning to select the next shortest path; judging whether the spectrum resources meet constraint conditions or not, if yes, allocating computing power resources, and requesting successfully; if not, returning to reselect the path; and after success, updating the network transmission path weight. According to the invention, the network resource waste and blocking rate are effectively reduced, and the optical network energy consumption is reduced.

The invention belongs to the technical field of power system operation, and provides a collaborative optimization method and system for a multi-region interconnected power system, and the technical scheme is as follows: determining a direct consumption coefficient matrix and a final demand vector according to the power production and consumption data of each region; combining the consumption coefficient matrix and the final demand vector to construct a power quasi input-output model constraint; analyzing a node degree, a clustering coefficient and a shortest path based on the obtained power grid topological graph, calculating an importance index of nodes based on the obtained node degree, the clustering coefficient and the shortest path, performing identification to obtain key nodes, and performing vulnerability evaluation based on the key nodes obtained through identification to obtain a transmission optimization constraint; and designing a double-layer optimization structure, introducing the power quasi input-output model constraint into upper-layer optimization, and respectively introducing the transmission optimization constraint into double-layer optimization to obtain an optimized multi-region interconnected power system collaborative optimization scheme. The impact of cross-regional power transmission on carbon emissions is evaluated.

The embodiment of the invention discloses a cross-graph database shortest path calculation method and device, electronic equipment and a medium. Obtaining a shortest path request of a user; the shortest path request comprises a starting node, a knowledge graph to which the starting node belongs, a termination node, a knowledge graph to which the termination node belongs and a maximum degree; judging whether the knowledge graph to which the starting node belongs and the knowledge graph to which the ending node belongs are stored in the same graph database or not; if not, acquiring a first sub-graph in the knowledge graph to which the starting node belongs according to the starting node and the maximum degree, and acquiring a second sub-graph in the knowledge graph to which the termination node belongs according to the termination node and the maximum degree; splicing the first sub-graph and the second sub-graph to obtain a target knowledge graph; and determining the shortest path according to the target knowledge graph and the maximum degree. According to the embodiment of the invention, the shortest path calculation of the cross-graph database is realized.

The invention relates to the technical field of data processing, in particular to a calculation method for simulating urban road network traffic efficiency by spatial partitions, which comprises the following steps: acquiring population raster data and road network data; converting the population raster data into a two-dimensional matrix and standardizing the two-dimensional matrix; spatial clustering is carried out by adopting a comprehensive distance index fusing geographic distance and population difference, a partition set is generated, a shortest path between point pairs is searched in a road network, the ratio of the length of a spatial linear path to the length of the shortest path is calculated as a length efficiency index, and a comprehensive traffic efficiency index is output. According to the method, population distribution characteristics are fused through a space partitioning technology, diversified travel scenes are covered by Monte Carlo simulation, and the accuracy of urban road network traffic efficiency evaluation is remarkably improved by combining a path length and shape two-dimensional evaluation mechanism. The comprehensive traffic efficiency index directly represents the overall efficiency level of the road network, and a quantitative basis is provided for road network structure optimization.

The invention discloses an intelligent patrol control method, and relates to the technical field of intelligent patrol, and the intelligent patrol control method mainly comprises the steps: obtaining a resource data storage model according to patrol resources; according to the resource data storage model, a quick response police force task is obtained based on shortest path calculation and a task matching method; a major alarm condition or a safety event is confirmed, and emergency response processing is performed according to the quick response police force task; and performing multi-device cooperative scheduling according to the scheduling task and the patrol resources. By implementing the intelligent patrol management and control method provided by the invention, the police scheduling efficiency and response capability can be improved, the accuracy and collaboration of police resource integration can be improved, the system construction and operation cost can be reduced, the safety and reliability of the system can be enhanced, and the handling capability of emergency events can be improved.

The invention discloses a TTE integrated Ethernet test data time delay deterministic transmission method, which comprises the following steps that: a time synchronization core module is designed in a TTE protocol by utilizing an FPGA (Field Programmable Gate Array), and the module can process a received protocol control frame (PCF) to realize multi-node high-precision time synchronization; the state and other core signals are controlled by adopting a command-condition interaction method; a maximum matching algorithm combined with cut-off priority is used for generating a scheduling table, and the method comprises the eight steps of scheduling parameter input, period calculation, shortest path calculation, cut-off priority preprocessing, maximum matching sorting, message distribution, conflict detection and scheduling table loading. The FPGA is used for loading the scheduling table to the scheduling configuration module, Ethernet transmission is fused, periodic time slot distribution is carried out on links, and the stability of time synchronization and the time delay certainty of test data transmission are ensured. According to the method, the link load can be balanced on the premise of reducing the real-time data packet loss rate.

The present invention discloses a method for realizing orthogonal connection of flow chart nodes, and relates to the field of information technology. The method comprises the following steps: processing the boundary boxes of the starting node and the ending node in the flow chart respectively to obtain the processed node positions and boundary information; constructing the scale layer, grid layer and reference points of the flow chart in sequence based on the processed node positions and boundary information, and establishing an optimized grid route map according to the adjacent relationship between the reference points; calculating the shortest path between the starting node and the ending node in the optimized grid route map, and extracting the best orthogonal connection path from the shortest path calculation result. The present invention comprehensively considers factors such as path length, number of inflection points, overlap between the connection line and the node boundary, and connection line crossing nodes by improving the Dijkstra algorithm, so as to generate more beautiful and standardized orthogonal connection lines of flow chart nodes.

The invention discloses a method, system and device for generating an airport road coverage polygon, and a storage medium. The method comprises the following steps: obtaining geographic coordinates of an airport center point; generating a circle by taking the airport center point as a reference, and generating a plurality of sampling points on the circumference of the circle according to a preset sampling rule to obtain a sampling point set; acquiring road network data, and calculating the shortest path from the center point of the field to each sampling point in the sampling point set based on the road network data to obtain a shortest path set; traversing each shortest path in the shortest path set, calculating target points on the shortest path, the highway distance between the target points and the airport center point being equal to a preset highway distance, and obtaining a target point set; and connecting all the target points in the target point set to generate an airport road coverage polygon. For airports with different topographic conditions, conditions in all directions around the airports can be considered more comprehensively through reasonable sampling distances.

The invention discloses a fault positioning method and device, equipment, a storage medium and a program product, and the method comprises the steps: obtaining key index information of a node, a container group and a service which are involved when a target cluster breaks down; performing knowledge graph construction based on the nodes, the container groups and the key index information of the services to obtain a cluster topological graph; performing fault analysis and positioning on the cluster topological graph by adopting a target analysis algorithm to obtain one or more of a fault node, a fault container group and a fault service in the cluster topological graph and fault causes of one or more of the fault node, the fault container group and the fault service; wherein the target analysis algorithm is used for performing connectivity analysis or shortest path calculation or centrality analysis on the cluster topological graph.

The present invention discloses a wind farm station monitoring and alarm method and system based on multi-packaging point rules, which relates to the technical field of wind power generation, including: collecting the status data and monitoring point data of each wind turbine in real time through the data acquisition module of each wind turbine, and performing preprocessing; constructing a graph of the wind turbine status data and the monitoring point data, and finding the shortest path from the monitoring point to the alarm state; constructing a bipartite graph according to the shortest path result, and performing matching optimization between the monitoring point and the alarm state; constructing a flow network, using the network flow algorithm to optimize the global data flow distribution, and comprehensively optimizing the system performance indicators; monitoring the wind turbine status in real time through the multi-packaging point rule, and pushing the alarm event message to the database. Through the shortest path calculation and bipartite graph matching optimization, the risk of false alarm and missed alarm is effectively reduced. Improve the response speed and ensure efficient and real-time data transmission. Adapt to complex operating environments and achieve high-precision monitoring and rapid fault alarm.

The invention provides an unmanned aerial vehicle route planning method and system based on control points, and the method comprises the steps: 1, obtaining the terrain information of a task region, and determining the flight environment of an unmanned aerial vehicle; step 2, setting a plurality of control points in the task area, and establishing connection lines among the control points to form an air route network; 3, setting a corresponding optimization objective function according to the task requirements and the actual situation of the task area, and establishing a mathematical model; step 4, carrying out shortest path calculation on the air route network to obtain an optimal air route planning scheme; 5, training an intelligent agent to intelligently manage opening and closing of the control points, optimizing the utilization rate of the control points by the multiple unmanned aerial vehicles, reducing the air waiting time of the multiple unmanned aerial vehicles, and improving the route planning efficiency of the multiple unmanned aerial vehicles; the unmanned aerial vehicle can be restrained to be always in the control range of the ground station in the flight process by setting the positions of the control points, and the flight path planning efficiency and the control precision of the unmanned aerial vehicle are improved.

The invention discloses a model vehicle path optimization method based on a Dijkstra algorithm. The path optimization method comprises the following steps: defining requirements and constraint conditions influencing path optimization; and according to the shortest path calculation, all constraints are ensured to be satisfied, the number of used vehicles or the total travel time is reduced, and a path optimal algorithm is determined. And through innovative means of constructing a congestion prediction model and the like, the coping capacity of the algorithm to the uncertainty of the real business is further enhanced, and the bank vehicle distribution business is protected.

The present invention relates to the technical field of geographic information processing, and specifically to a geographic mapping method and system based on an unmanned aerial vehicle, comprising the following steps: acquiring the point cloud data and the vectorized boundary data of aerial survey of the unmanned aerial vehicle, calculating the spatial distance to screen adjacent points, and constructing a topological adjacent point set. In the present invention, the construction of the topological adjacent point set is optimized through the spatial screening of the point cloud data and the vectorized boundary data, reducing data redundancy and improving the structural rationality of the mapping result. The projection difference analysis is combined with the point cloud density to screen out abnormal data, realizing the accurate identification of the conflict area. The shortest path calculation optimizes the connection between the conflict points and the boundary points, reducing path redundancy and improving the spatial consistency of the mapping data. The fitting error screening adjusts the boundary points, enhancing the stability of the mapping boundary. The closure calculation is combined with the topological weight optimization to improve the integrity of the regional mapping and the boundary connection quality, making the mapping result more standardized in terms of spatial distribution and connectivity.

The present invention discloses a networking protocol design method for collaborative over-the-air computing in a highly hostile environment. This method primarily addresses the existing problems of poor data transmission reliability, high protocol complexity, and high control overhead in self-organizing networks. The implementation scheme comprises: designing a networking protocol frame structure comprising control time slots and service time slots, obtaining the full network topology within the control time slot; calculating the shortest path based on the full network topology; finding Y sub-shortest paths based on the shortest path calculation, and selecting m paths with the same number of hops from these Y paths as the active paths; a source node searches for time slots outside the two-hop range for all nodes; based on the found time slots outside the two-hop range, the source node finds all available time slots for relay nodes along the path using the node adjacency matrix; and filling all available time slots for all relay nodes along the path into a data packet, which is then distributed to the relay nodes. The present invention offers high reliability, low protocol complexity, and low control overhead, and can be used in the MAC layer and network layer of self-organizing networks of unmanned systems.

Systems and methods for diversifying k-shortest path computation results for multiple vertices as destination or as inclusion constraint include receiving a request for k paths, in a network from a source port at a source node to a node, wherein the node includes a plurality of ports; representing the network as a graph with vertices representing ports, edges representing connections between the ports, and with weights assigned to each of the edges; assigning a dummy destination vertex to connect to each of the plurality of ports and associated edges between each of the plurality of ports and the dummy destination vertex having a same weight; determining up to the k paths between the source port and the dummy destination vertex, and, subsequent to the determining each of the k paths, assigning a corresponding edge of the associated edges in each of the k paths a predetermined value.

The invention discloses a data processing method and device, equipment and a storage medium. Comprising the steps that a target relation graph is obtained, and the target relation graph is formed by connecting a plurality of relation nodes and edges between the relation nodes; searching an intra-graph neighbor node of each relation node in the target relation graph; based on each relation node and the intra-graph neighbor node corresponding to each relation node, determining the intra-graph neighbor relation of each relation node in the target relation graph; according to the intra-graph neighbor relation of each relation node, calculating the node relation importance degree of each relation node, and according to the shortest path of each relation node pair in the target relation graph, calculating the node position importance degree of each relation node; and based on the node relation importance and the node position importance corresponding to each relation node, determining a target key node in the target relation graph. According to the method, the recognition speed and expansibility of the key nodes in different application scenes are improved.

The invention discloses a method, a device, equipment and a storage medium for dynamically planning the use quantity and the relocation path of a drilling machine. The method comprises the following steps of: counting well position coordinate data of a to-be-drilled well in a well site in a research range; performing clustering analysis on the well location coordinate data of the to-be-drilled well according to a K-means algorithm; obtaining a plurality of blocks according to a clustering analysis result; the ant colony algorithm is adopted to calculate the dynamic scheduling paths of the initial number of drilling machines in the block, and the shortest paths of the initial number of drilling machines for the multiple to-be-drilled wells in the block at the same time are obtained; according to the shortest path, the total development period of the multiple to-be-drilled wells in the block is calculated; judging whether the total development period exceeds a preset period or not; according to the shortest path obtained through calculation of the number of the drilling machines increased last time, the drilling machine using number and a drilling machine moving path dynamic planning graph are determined. According to the method, the K-means algorithm and the ant colony algorithm are combined, the running track of the drilling machine is reasonably planned, and the method has the advantages of being higher in timeliness and higher in data processing capacity.

The invention discloses a satellite network controller deployment method and device, electronic equipment and a program product, and relates to the field of satellite networks, and the method comprises the steps: reading the position data of each satellite node in a satellite network model, calculating the network topology and the shortest path of each time slice, carrying out the population initialization strategy based on betweenness centrality, and carrying out the optimization of the network topology and the shortest path of each time slice; an initial controller deployment population is generated, population selection operation executed on the initial controller deployment population is restrained based on an objective function value until a preset population iteration number threshold value is reached, a target solution set is obtained, and the objective function value comprises network topology based on a time slice, flow establishment duration calculated by a shortest path and load variance between controllers; and determining the position of the satellite node deployed by each controller based on the target solution set. According to the invention, the technical problem of high network delay caused by difficulty in effectively processing multi-target conflicts when a satellite network deploys a controller in the prior art is solved.

The invention relates to the technical field of artificial intelligence, and discloses a book recommendation system and method based on artificial intelligence, and the system comprises a relation confidence calculation module which obtains the relation confidence of node embedding and edges; the target translation screening module is used for screening to obtain a target translation set; the cross-layer shortest path calculation module is used for calculating and obtaining the cost of the cross-layer shortest borrowed path; the cross-layer cost calculation module is used for calculating to obtain candidate cross-layer cost; the recommendation list generation module is used for generating a recommendation list; and the online updating module is used for updating the learnable parameters. According to the method, a knowledge graph multi-level association model is constructed, so that a user work layer demand is accurately mapped to a version and copy layer; meanwhile, real business constraints such as a borrowing state, authorization limitation and geographical allocation cost are fused, and through cross-layer path cost quantification and reachability gradient calculation, it is ensured that a recommendation result stably points to a target translation expected by a user and can be borrowed at present.

The invention discloses a real-time routing optimization method and system based on two-dimensional matrix dynamic planning, and belongs to the field of communication network optimization, and the method comprises the steps: constructing a whole routing system into a multipoint-to-multipoint shortest path model, and defining matrixes Dm, n as the calculation result of the shortest path; initializing a longitudinal axis, a transverse axis and an initial state of the matrix; for each node m, gradually calculating the shortest path from the starting point to the node, and for calculation of each step, calculating the shortest path of the current step number through the shortest path of the previous step and the weight of the edge; calculating the shortest path from the starting point to all the nodes under each step number, and carrying out iterative calculation step by step until the shortest path of all the nodes; for each node and path, determining the relative balance of the distribution of the overall flow according to the Nth short path distributed by the user; and periodically updating path information in the matrix, and calculating a new shortest path. Through a dynamic planning algorithm based on a two-dimensional matrix, the efficiency and stability of route selection are remarkably improved.

The invention relates to a cost-minimized cross-regional traffic scheduling method, and belongs to the technical field of communication. The invention aims to solve the technical problems of high traffic scheduling cost, low resource utilization rate and large service blocking rate caused by electricity price difference of different regions and elastic optical network spectrum resource constraint in the existing cross-region computing power network. According to the technical scheme, a traffic scheduling problem is modeled into a mixed integer linear programming model, and an approximate solution algorithm is designed; comprising the steps of searching for a shortest path from a source node to a data center node for each service request, calculating energy consumption cost, screening candidate nodes, constructing a service request-data center bipartite graph to carry out minimum cost and maximum flow matching, dynamically evaluating a spectrum state, allocating resources and the like, and minimizing the total transmission and calculation cost. According to the invention, the operation cost can be effectively reduced, the network resource utilization efficiency is improved, and service congestion is reduced.

Transmission device (10), which is one of transmission devices (10) forming a network, wherein the transmission device (10) comprises: an information holding unit (11) to hold topology information of the network, and priority of the transmission facility (10) and priorities of other transmission facilities (10) forming the network, to be used in a path calculation; a shortest-path calculation unit (121) to calculate a shortest path from a first transmission facility (10) to a second transmission facility among the transmission facilities (10) forming the network, based on the topology information; and a priority adjustment unit (13) to adjust the priority of the transmission facility (10) on the basis of the shortest path calculated by the shortest path calculation unit (121) and the priority of the transmission facility (10) and the priorities of the other transmission facilities (10), wherein The priority adjustment unit (13) adjusts the priority of the transmission device (10) so that the number of overlaps with the priority of another transmission device (10) that is located with the transmission device (10) in a shortest path from a starting point to a destination and at the same distance from the starting point as the transmission device (10) is reduced.

Systems and methods for diversifying k-shortest path computation results for multiple vertices as destination or as inclusion constraint include receiving a request for k paths, in a network from a source port at a source node to a node, wherein the node includes a plurality of ports; representing the network as a graph with vertices representing ports, edges representing connections between the ports, and with weights assigned to each of the edges; assigning a dummy destination vertex to connect to each of the plurality of ports and associated edges between each of the plurality of ports and the dummy destination vertex having a same weight; determining up to the k paths between the source port and the dummy destination vertex, and, subsequent to the determining each of the k paths, assigning a corresponding edge of the associated edges in each of the k paths a predetermined value.

Systems and methods for k-shortest paths computation in Segment Routing considering segment depth include receiving a request for a path in a Segment Routing network from a first node to a second node with the path having a pruning criteria; determining a shortest path utilizing a Constrained Shortest Path First (CSPF) algorithm with a sorting criteria used as a metric in the CSPF algorithm; utilizing a modified Yen's algorithm to determine one or more additional paths based on diversions from the shortest path, wherein the modified Yen's algorithm explores the diversions based on the pruning criteria; and providing the shortest path and the one or more additional paths as a response to the request, each of the shortest path and the one or more additional paths pass the pruning criteria.

The invention discloses a power distribution network fault positioning method and device, electronic equipment and a storage medium, which are used for solving the technical problem that the existing power distribution network fault positioning accuracy is relatively low. The method comprises the following steps: calculating a shortest path from a measurement point to a preset virtual fault point; optimizing the traveling wave calculation wave velocity of the virtual fault point by adopting a PLO algorithm to obtain an optimized wave velocity; according to the optimized wave velocity and the shortest path, calculating the theoretical time for the fault initial traveling wave generated by the virtual fault point to reach each measurement point; constructing a virtual time difference matrix according to all the theoretical time; when a real fault occurs in the power distribution network, initial traveling wave arrival time detected by the measurement point is collected; constructing a real time difference matrix according to the initial traveling wave arrival time; calculating a time information difference degree according to the virtual time difference matrix and the real time difference matrix; and carrying out fault positioning according to the information difference degree.