27 results about "Shortest path computation" patented technology

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 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 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 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 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 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.

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.

A kind of multi-source shortest path method based on bidirectional SPFA, comprising: according to the traffic road network map of obtained construction directed weighted graph;Obtain multi-source shortest path query request;Select specific node as pre-processing starting point, calculate the shortest distance of pre-processing starting point to all other nodes using shortest path fast algorithm, construct and initialize the evaluation function array;For each shortest path query request, empty the node scheduling queue for storing pending node and reset each auxiliary array;Based on the evaluation function array dynamic optimization node scheduling queue, calculate the shortest distance in combination with shortest path fast algorithm;Iterative processing all shortest path query requests and return query result.The present application can effectively process the directed graph containing negative weight edge but not containing negative weight ring, and is suitable for large-scale network environment under traffic road network map efficient shortest path calculation.

The invention discloses an air route planning method and device, equipment, a storage medium and a program product, and belongs to the technical field of air traffic management. The method comprises the following steps: acquiring flight route information of a flight plan route; determining a target flight area based on the flight route information; acquiring a temporary route located in the target flight area and temporary route information of the temporary route; constructing a weighted graph according to the flight route information and the temporary route information to obtain a route weighted graph; and calculating the shortest path according to the air route weighted graph to obtain the shortest air route. The embodiment of the invention can reduce the flight distance.

This invention proposes a method for extracting the curve skeleton line of a three-dimensional tubular body model based on a hierarchical graph. The method includes: inputting three-dimensional tubular body model data; preprocessing and extracting endpoints; calculating the shortest path, calculating the geometric features between different paths, and constructing initial discrete skeleton points; calculating the distance and angle of the paths to determine the positions of candidate bifurcation points; segmenting the original data; applying spherical B-splines for fitting and optimization to obtain skeleton line data; outputting the skeleton line data, estimating the position of bifurcation points by tracking the shortest path, and using an elastic ball collision movement algorithm to obtain the precise position of the bifurcation points; and using a dynamic ball expansion algorithm with the bifurcation points as the sphere centers to divide the data model into multiple branches, laying the foundation for subsequent hierarchical graph construction and parallel computation.

The invention discloses an indoor parking lot vehicle navigation method and device and a computer program product, and the method comprises the steps: firstly obtaining target scene data of an indoor parking lot where a target vehicle is located, such as elevator and other device data, business data, network data and the like; inputting the data into a scene prediction model, and predicting to obtain a classification result of a target scene in combination with a pre-constructed graph database related to a business scene of the indoor parking lot; according to the classification result, calculating a dynamic weight corresponding to the target scene; utilizing the dynamic weight to update the corresponding edge in the graph database to obtain an updated graph database; according to a path planning request provided by a vehicle-mounted user, a preset shortest path calculation method is utilized to inquire the shortest driving path with the minimum comprehensive weight from the updated graph database so as to guide the target vehicle to safely and efficiently drive to the target parking space, so that the navigation experience of the vehicle-mounted user is improved, and an ideal navigation effect is achieved.

The application discloses a multi-link dynamic access method and system with precise network positioning capability. The method comprises the following steps: sending a link access request to a wireless link access control device; the wireless link assigns a communication interface IP and a corresponding gateway IP to a mobile terminal; the mobile terminal fills in a default link table according to the obtained information, performs shortest path calculation, and sends an access request to the wireless link access control device; and the wireless link access control device returns a planned host IP. The application realizes network switching without interrupting services through the hot backup access of heterogeneous network links, and can improve the mobile application service experience. When there are multiple network links, the application can select a suitable wireless access link according to the own demand, ensure the service safety, and improve the utilization efficiency of network link resources. The application realizes the comprehensive network positioning capability which is independent of the hardware capability of the mobile terminal by using the position information provided by multiple network resources, and improves the precision of public network positioning.

The application discloses a vehicle path planning method and system based on a space-ground integrated network, which comprises the following steps: obtaining target point coordinates of a user navigation path; obtaining current position coordinates of a user vehicle; selecting a path bias, and obtaining a shortest path according to the path bias; calculating positioning accuracy and path accuracy, and judging whether the positioning accuracy and the path accuracy both meet the standards; obtaining traffic conditions of the shortest path at the current time, and judging whether the shortest path scheme is reasonable; outputting the shortest path scheme as a path planning result; obtaining the current position coordinates of the user vehicle and traffic conditions of a road where the user vehicle is located through a low-orbit satellite, and recalculating the shortest path scheme according to the position coordinates and the road traffic conditions obtained through the low-orbit satellite; and outputting a result after optimizing the navigation path by using a heuristic path optimization method. The application realizes global coverage and high-precision positioning, dynamic information fusion and real-time optimization, traffic flow optimization and reasonable resource allocation, and further enhances safety and emergency response capability.

The invention discloses a CoT-MARL gate single-point root cause positioning method based on large model prior injection, and the method comprises the steps: writing all modal data into a cache on a unified time axis, carrying out the pulling of dimensions through an exclusive encoder, inputting the data into a double-fork coupling layer, generating a cross-domain vector, and transmitting the cross-domain vector to a hierarchical time memory stack to maintain a multi-scale feature; a scene semantic vector passes through a causal decoding chain, firstly, open line nodes are extracted by an explicit access control rule set, then dark line nodes are captured by a coupling feature miner, and a single event causal graph is fused; calculating the confidence coefficient of the shortest path capable of explaining the non-moving symptom of the door wing, and forming a root cause sequence and mapping a minimum action frame after combining with historical track distillation; the central scheduler schedules actions among the four agents according to the root cause confidence coefficient and the resource real-time load, the agents collect observed objects in an action life cycle and compare measured values with a threshold value, and the confidence coefficient is iteratively refreshed until a single root cause is advanced; a minimized field repair action is automatically generated and performed.

The application provides a multi-party graph shortest path query method based on differential privacy, mainly reducing the complexity and communication overhead in the existing privacy protection shortest path query method. The application constructs a mutual exclusion multi-party graph model, a server determines unified node identification and differential privacy budget epsilon of each participant, each client carries out privacy processing on local data by using a corresponding perturbation mechanism according to the allocated privacy budget, the client uploads the perturbed data to the server, the server aggregates sub-graphs to build a synthetic graph after receiving the data, finally, the server carries out global shortest path calculation on the synthetic graph based on the aggregation result by using the Floyd-Warshall algorithm, and finally obtains the shortest path query result meeting the differential privacy requirement.

The invention discloses a shortest path determination method and device, equipment and a storage medium. The method comprises the following steps: acquiring a start node and a stop node for path planning, and path structure information representing distribution of all paths between the start node and the stop node; and constructing a plurality of interval range containers according to node distances among path nodes in the path structure information. And determining to-be-expanded nodes corresponding to the starting node and node distances between the starting node and the to-be-expanded nodes, and updating the interval range containers according to the node distances corresponding to the to-be-expanded nodes. And after updating each interval range container, planning a shortest path between the starting node and the ending node according to the node to be expanded in the non-empty and minimum interval range container. According to the technical scheme, the overhead of node selection and updating can be remarkably reduced so as to adapt to efficient shortest path calculation in a mass data environment.

The application provides a coal mine equipment fault detection method, medium and system based on PHM, belongs to the technical field of coal mine equipment fault detection, and comprises the following steps: collecting operation data based on PHM, including vibration, current and other indexes; next, the data is pretreated, denoised and features are extracted. Based on the pretreated data, a mathematical model covering dynamics, electrical characteristics and wear and tear is established, and an optimized model is obtained through parameter identification and optimization. The optimized model is discretized, a multi-dimensional state space is constructed, and normal state and fault state are defined. Based on the A* algorithm, the shortest path from the normal state to each fault state is searched, the difficulty of fault occurrence is calculated, and a fault weight vector is obtained. Real-time data is input into the optimized model, the distance from the current state to each fault endpoint is calculated, the fault weight is combined, and the fault probability distribution and early warning information are output, thereby solving the technical problem that the prior art cannot meet the requirements of fault diagnosis accuracy, reliability and explainability.

The invention relates to the technical field of graph theory algorithms, and discloses a shortest path calculation method and device based on a GPU (Graphics Processing Unit), electronic equipment and a medium. The method comprises the following steps: calling different CUDA thread blocks to obtain first graph information of different target graphs from a GPU global memory; for each target graph, second graph information of the target graph is calculated through a Bellman-Ford algorithm based on the first graph information of the target graph by using the corresponding CUDA thread block, the second graph information is stored in a GPU shared memory, and the second graph information comprises a target weight of each edge in the target graph and a precursor node of each vertex; and calculating the shortest path of each vertex pair in the target graph by using the corresponding CUDA thread block based on a Dijkstra algorithm and the second graph information. According to the method, frequent access to the global memory of the GPU can be reduced, extra overhead of reading and writing the global memory for multiple times is avoided, the memory bandwidth pressure is reduced, and the calculation efficiency is improved.

This invention discloses a service-aware NFV network routing method and apparatus, belonging to the field of communication network and network function virtualization technology. After acquiring network topology, link load / bandwidth, node intermediate box processing capacity and space resources, and flow request information, the method determines the dependencies of required intermediate boxes and configures a traffic change rate ratio for each intermediate box type. Under the constraint of dependency, the partial-order service set is converted into a full-order service chain based on the ratio. Then, based on the full-order service chain, the shortest path calculation is performed in stages to jointly determine the routing path and intermediate box service location. When the processing capacity of existing instances is insufficient, new instances are started based on the remaining space. Finally, the SDN controller issues flow tables to realize forwarding. This invention can effectively reduce end-to-end latency and packet loss rate, improve flow success rate, and achieve network load balancing.