61 results about "Dijkstra's algorithm" patented technology

An agile digital communications network has a number of routers that serve as nodes in a mesh network communicating between a user device (e.g., computer, server, etc.) and a target device (e.g., disc storage cabinets, tape, jukebox, etc.). The routers operate on an open shortest path first protocol, each router having two or more interfaces or links to other routers. When a link connected to a router is down and is in the shortest path to another router identified in a communication packet, the packet is forwarded to the identified router on a precalculated alternate route that does not use the unavailable link. IP tunneling assures that routing loops do not occur and send the packet back to the router with the unavailable link because it would have been in the shortest path of an intermediate router. A tunneling technique is provided that maximizes the levels of encapsulation needed at two, regardless of the size or configuration of the network. An unavailable link is not broadcast immediately throughout the network, giving the link an opportunity to be restored before all of the routers are called on to recalculate the shortest paths and alternate paths. During a short interval following the discovery of an unavailable link, then, a router connected to that link is in a state identified as the Use Alternate Path state, and the link is repeatedly checked for availability. Each router calculates and stores the alternative paths to each other router after first calculating the shortest path to each other router. The alternate paths are pulled up and used when an unavailable link is detected. Dijkstra's algorithm is used to calculate the shortest paths. A new algorithm called the iterative dynamic Dijkstra's algorithm is used to calculate the alternative routes.

Embodiments provide systems and methods that find the quickest route between two locations on a graph with multi-edge constraints in a time and space efficient manner. In some embodiments, Dijkstra's algorithm is split into separate universes when a) a multiple-edge constraint is reached, and b) along each edge of a multi-edge constraint. In some embodiments, the split is performed for the purpose of finding the quickest (i.e. lowest weighted) route to the intersect ion(s) at the end of the constraints. These universes, in some embodiments, are merged or discarded when the intersection at the end of the constraint is found. Using these systems and methods, in some embodiments, the shortest path between two locations of a multi-edge constrained road network can be efficiently determined.

Embodiments provide systems and methods that find the quickest route between two locations on a graph with multi-edge constraints in a time and space efficient manner. In some embodiments, Dijkstra's algorithm is split into separate universes when a) a multiple-edge constraint is reached, and b) along each edge of a multi-edge constraint. In some embodiments, the split is performed for the purpose of finding the quickest (i.e. lowest weighted) route to the intersection(s) at the end of the constraints. These universes, in some embodiments, are merged or discarded when the intersection at the end of the constraint is found. Using these systems and methods, in some embodiments, the shortest path between two locations of a multi-edge constrained road network can be efficiently determined.

A method and apparatus for updating a shortest path graph or a shortest path tree are disclosed. For example, an arc weight is changed for an arc in the network, where a plurality of affected nodes in the network is determined. The distance of each of the affected nodes is determined, where a subset of the plurality of affected nodes is then placed in a heap. One aspect of the present invention is that not all the affected nodes are placed in the heap. In one embodiment, the present reduced heap approach only applies the Dijkstra's algorithm to those affected nodes whose distances change in a smaller amount that the change in the arc weight. In turn, the shortest path graph or the shortest path tree is updated in accordance with the affected nodes placed in the heap.

A path computation method includes defining photonic constraints associated with a network, wherein the photonic constraints include wavelength capability constraints at each node in the network, wavelength availability constraints at each node in the network, and nodal connectivity constraints of each node in the network, and performing a constrained path computation in the network using Dijkstra's algorithm on a graph model of the network with the photonic constraints considered therein. An optical network includes a plurality of interconnected nodes each including wavelength capability constraints, wavelength availability constraints, and nodal connectivity constraints, and a path computation element associated with the plurality of interconnected photonic nodes, wherein the path computation element is configured to perform a constrained path computation through the plurality of interconnected nodes using Dijkstra's algorithm on a graph model with the photonic constraints considered therein.

The invention provides an intelligent matching and route optimization-base carpooling method and system. The method includes the following steps that: a passenger travel information set and a vehicle state information set are acquired; spatial-temporal distances between passengers and vehicles are calculated, a passenger and vehicle matching candidate set is created according to the calculated spatial-temporal distances, the travel time of the passengers and the number of the passengers; an integer planning model is created, and passenger and vehicle matching results are obtained according to the created integer planning model; and based on the combination of the passenger and vehicle matching results and real-time traffic states, time-varying Dijkstra's algorithm or a time-varying A star algorithm is utilized to obtain optimal vehicle driving paths. According to the intelligent matching and route optimization-base carpooling method, dynamic traffic information is utilized to measure the spatial-temporal proximity of the travel demands of individuals; spatial-temporal locality is adopted to guide group intelligent carpooling matching; and dynamic vehicle paths with minimum cost are designed; and therefore, spatial-temporal precise matching of massive travel demand services and efficient path planning can be realized.

The invention discloses a parking path planning method for an automatic driving system of a parking lot. The method comprises the following steps: mathematical modeling is performed on the parking lotaccording to road network information in the parking lot; a corresponding node at a road intersection of the parking lot and each parking space is selected and numbered, and a corresponding matrix relationship is established; line information in a line information table is read, and the distance between a starting point and an ending point is taken as a weight value; a Dijkstra map is constructedon the basis of a node graph of a road network, and the optimal path is calculated with the Dijkstra algorithm. The optimal path from the starting point of the parking lot to the parking space can berapidly planned.

Embodiments provide systems and methods that find the quickest route between two locations on a graph with multi-edge constraints in a time and space efficient manner. In some embodiments, Dijkstra's algorithm is split into separate universes when a) a multiple-edge constraint is reached, and b) along each edge of a multi-edge constraint. In some embodiments, the split is performed for the purpose of finding the quickest (i.e. lowest weighted) route to the intersection(s) at the end of the constraints. These universes, in some embodiments, are merged or discarded when the intersection at the end of the constraint is found. Using these systems and methods, in some embodiments, the shortest path between two locations of a multi-edge constrained road network can be efficiently determined.

A hybrid of initial time consuming phase of a Single Directional Dijkstra's Algorithm is embodied on an unclocked CMOS logic chip using a parallelized approach with Asynchronous Digital Logic (ADL). The chip includes a a plurality of addressable configurable cells arranged as a multidimensional orthogonal array. The cell array only executes mathematical operations based on a communication between immediately adjacent cells.

The present invention discloses a method and a device for control of an automated guide vehicle. The method comprises the steps of: employing a Dijkstra's algorithm to calculate the shortest path of adistance between an initial node and a target node, wherein the initial node and the target node are any two nodes on a map of a moving place of an automated guide vehicle; allowing the automated guide vehicle to move according to the shortest path, and determining the pose information of the automated guide vehicle by the automated guide vehicle according to a laser scanning device; and performing path deviation correction of the automated guide vehicle according to the pose information and a fuzzy control algorithm. The fuzzy control algorithm is utilized on the automated guide vehicle employing laser navigation to improve the robustness of the control system and greatly reduce the influence of system interference and parameter change on a control effect.

The invention discloses a rapid transmission method of model data in distributed simulation of power equipment. The method comprises the steps of constructing a network topological graph of each site in a simulation system of the distributed power equipment, obtaining mean data transmission time between the sites, generating a shortest path tree taking a target site as a root node by using a Dijkstra's algorithm, generating a structure tree of a simulation model, analyzing a required submodule in a target included in each site, forming a submodule transmission candidate list, carrying out submodule transmission path planning from small to large from a leaf node according to the transmission time based on the list and the structure tree of the model to achieve rapid distributed transmission of the simulation model of the power equipment. The method greatly improves model transmission efficiency in the distributed simulation system, shortens the transmission time of a model network, and therefore ensures a simulation effect and continuity.

The invention relates to a minimum distance calculating method of a moving object in a restricted space, and belongs to the technical field of moving objects management in the computer spatial database. According to the minimum distance calculating method of a moving object in a restricted space, obstacles in an indoor space are modeled and a visible area of the moving object is calculated. By using a method of using boundary vertices of the moving object and the obstacle space to construct a maximum angular difference, an optimum vertex in the obstacle space is obtained, and the visible area is constructed. Based on this, in the invention, the visible area is used, and for different position relationships between the moving object and the visible area: for the moving object in the visible area, the distance is directly calculated by using an Euclidean distance calculating method; and for the moving object not in the visual area, the minimum distance between the moving object and a target object is obtained by using the Dijkstra's Algorithm and the method of constructing a weighted directed graph.

The invention discloses an edge-computing-oriented equipment calling method and an edge-computing-oriented equipment calling device. The edge-computing-oriented equipment calling method comprises thesteps of: establishing an equipment calling resource library according to operating states of processing equipment, a current planned production task number, a current completed task number, single-piece task time and the like after a new production task requirement instruction is sent out; establishing a task chart structure of edge side equipment in the equipment calling resource library according to the relevance, dependency and substitutability analysis of equipment required by a new production task, adopts a Dijkstra algorithm on the premise that the new production task is completed to obtain an equipment calling scheme with the fewest production time. The edge-computing-oriented equipment calling method and the edge-computing-oriented equipment calling device solve the problems of multi-task equipment calling conflicts, poor real-time performance of calling scheme and the like for the equipment calling problem in multi-task production, have flexibility and expandability, and improve the resource utilization rate of equipment scheduling in multi-task production.

The present invention discloses a method for optimizing an OLSR protocol through multiple parameters, comprising: sampling a link signal-to-noise ratio and a link transmission rate according to a predetermined cycle; according to a range corresponding to the link signal-to-noise ratio obtained by sampling, correcting the link transmission rate to obtain a final link transmission rate; according to the final link transmission rate, acquiring a link overhead; according to the link overhead and a packet loss rate, calculating to obtain a total link overhead; and calculating to obtain routes of the entire network using the Dijkstra's Algorithm according to the total link overhead. The method can meet the requirements of timeliness, accuracy and effectiveness of link overheads in multi-point networking, and can accurately reflect the current most-true link condition. The present invention furthermore discloses a device for optimizing an OLSR protocol through multiple parameters.

The present invention discloses a method and system for Open-type automation navigation based on a robot. According to the user requirements, navigation scenes are determined as general navigation areas, accurate navigation areas and main path areas, the main path areas employ the Dijkstra algorithm based on a path network to obtain a path between the endpoint of the nearest path from the current position of the robot and the endpoint of the nearest path from the endpoint of a destination; and the human intervention of path planning is realized through the endpoints of the paths so as to allow the navigation to be accurate and controllable and allow the efficiency to be higher. The automatic navigation and accurate line patrol location of the robot are combined, and a buffer zone is employed to realize the transition from the general navigation areas or the main path areas to the accurate navigation areas. The width of a buffer strip is gradually reduced to 0.5-1 com from 5-10cm, the length of the buffer strip is between 20cm-100cm, and the location modes with different precisions are effectively connected to realize applicability transition of the location precision and realize smooth navigation effect.

The invention is suitable for the technical field of power distribution networks, and provides a power distribution network load transfer method and device, equipment and a storage medium, and the load transfer method comprises the steps: when a fault occurs in a target section of a power distribution network, according to a Dijkstra algorithm and the network topology information of the section of the power distribution network, determining a plurality of non-fault sections corresponding to the target section in the power distribution network and a target standby power supply for performing load transfer on the non-fault sections; under the condition that the available load capacity of the target standby power supply is smaller than the total load capacity of the rated load capacities of all the non-fault sections, determining a target non-fault section to be subjected to load transfer in the plurality of non-fault sections according to a preset load transfer algorithm corresponding to the load transfer characteristics of the power distribution network, wherein the load transfer characteristics at least comprise a load transfer utilization rate, a load grade, a load capacity and a load weight; and carrying out load transfer on the target non-fault section. According to the invention, the load transfer effect can be improved.

The invention provides a method for cleaning veihcle GPS data based on road network data, and relates to the field of traffic big data processing. According to the method, HDFS is adopted to store data, and a MapReduce calculation framework is adopted to process the data, so that abnormal records in the GPS data are eliminated. The abnormal records comprise drift points with overlarge distance deviation under continuous timestamps, track points of multiple records under the same timestamp, namely repeated data, and jump points with overlarge time difference and distance between two adjacent records. For the duplicate data, the duplicate data is removed through a time stamp-based duplicate removal algorithm. The speed of two adjacent points in the GPS track is calculated according to the time and the distance, and if the speed is greater than a set threshold value, the speed is regarded as a drift point, and the data is rejected. For the jump points, a shortest weighted path is calculated between the jump points by using a Dijkstra algorithm in combination with road network data, the shortest weighted path is taken as a supplementary trajectory between the jump points, and road nodes passing through the path are sequentially inserted between the jump points.

The invention discloses an attack risk balanced power communication network optimal security link configuration method and system, and relates to the field of smart power grids. The method comprises the following steps: firstly, giving a global risk equalization problem data model, and carrying out description and mathematical modeling on a service security link selection problem; then, using a fuzzy analytic hierarchy process (FAHP) to construct a business importance evaluation and sorting model; and finally, solving the multi-objective optimization problem by using an improved Dijkstra algorithm and a particle swarm optimization (PSO) algorithm, and configuring the optimal security link of the power communication network with balanced attack risks.

The invention discloses an energy-saving communication method in an abnormal state of a gateway of the Internet of Things. The method comprises the following steps that: firstly, gateway abnormity is divided into northbound interface abnormity and southbound interface abnormity; the sensor nodes are clustered, gateway states are obtained through cluster heads and are broadcasted to member nodes, the purpose of saving communication energy consumption is achieved by reducing the total radio transmission frequency of the nodes in unit time, and meanwhile uniform consumption of energy of all the nodes is achieved through cluster head alternation; in addition, the scheme can be applied to a large-scale Internet of Things scene, and a routing scheme is provided for each cluster through a Dijkstra algorithm, so that the communication energy consumption is further reduced.

The invention relates to a use case generation method of a vehicle-mounted electronic product based on artificial intelligence. The method comprises the following steps: identifying all elements of a page through a yolk model of PyTorch; whether a page appears or not is judged through a double-submodel of Siamese; recording jump keys among the pages and elements required to be clicked by jump; and according to an Euler loop and a Dijkstra algorithm thought, dynamically planning the page jump relation into a logic sequence which can be continuously executed. The efficiency of case generation is improved, the test case based on page coverage is automatically generated, compared with the prior art that multiple automated script development engineers need to be put into use case writing, manpower is shortened, use case operation is intelligently improved, the influence of implanted test software on a tested system is avoided, the test is conducted through a pure black box method, and the test efficiency is greatly improved. The actual operation condition of a user can be better simulated, and the situation that the performance of the tested system is interfered and the judgment on the product quality is influenced when the implanted test software exists is avoided.

The invention relates to an Internet of Things shopping system, in particular to a network technology-based convenient delivery system, which comprises a merchant basic database and management system, a user basic database and management system, an order management system, a fund management system, a delivery management system and an evaluation system. An urban geographic information basic database is used; registered merchants generate point shp files for storage; shp conversion is carried out on the user distribution address; 5km is taken as a dotted buffer area; superposition analysis with a merchant point shp file is carried out; merchants capable of providing services are automatically selected for the user; a basic database line shp file of the urban geographic information system is combined; the distance between a user and a merchant is calculated by adopting the Dijkstra's algorithm for sorting, commodity is selected, order is generated and payment is performed to a platform fund management system, the system receives funds, sends order information and collection related information to the merchant, and the merchant processes the order and delivers the order to the user.

The invention relates to the field of data processing, in particular to an environmental data lattice point processing method based on a graph convolutional network. The method comprises the following steps: acquiring air quality monitoring data and meteorological monitoring data in a target area; missing processing is carried out on all the monitoring data, and the monitoring data of the sites are mapped into a lattice point matrix divided by the target area; generating a dynamic wind field graph by using the wind direction data and the wind speed data, and calculating a wind field adjacent matrix by using a Dijkstra algorithm; constructing a mask matrix at each moment according to the air mass concentration data, and constructing a feature vector set Z at each moment according to the wind field adjacent matrix, the mask matrix and the meteorological monitoring data; generating a target matrix Y at each moment according to the mask matrix and the air mass concentration data; and inputting the eigenvector set Z matrix into the trained graph convolutional neural network model to obtain an estimation matrix P of the target matrix. According to the invention, the accuracy of environmental data gridding can be improved.

The invention provides an aviation accessibility measuring and calculating method and system and a storage medium. The aviation accessibility measuring and calculating method comprises the steps of arrival time calculation, waypoint coverage calculation, flight density calculation and flight balance degree calculation. According to the method, the requirement of accessibility measurement and calculation is met mainly through four indexes of accessibility time, waypoint coverage, flight density and flight balance degree, and a path algorithm suitable for aviation path calculation and accessibility measurement and calculation is developed on the basis of dynamic planning, a greedy algorithm and a forward and reverse Dijkstra algorithm. The method effectively makes up for the vacancy that a traditional route calculation mode cannot calculate a flight route of one-time transfer or two-time transfer and the defect that manual calculation consumes too long time, and a flight season gt can be calculated within one and a half hours through a server; all waypoints of the whole country to all waypoints gt of the whole country; the optimal arrival path and arrival time of the normal commuting time point in one week ensure the accuracy and effectiveness of the result, and are far higher than the manual calculation efficiency.

The invention relates to an anti-swing path planning method and device for a bridge crane. The anti-swing path planning device mainly comprises a host computer module and a crane control module, wherein the host computer module constructs a two-dimensional map model in a simulation way according to an on-site safety area, a hazard area and the like, the Dijkstra algorithm is used to plan the optimal path at the same time according to the working background of the bridge crane, and functions such as an initial point and an end point can be set by inputting a control command on the human-computer interaction interface of a host computer. The host computer monitors the operating condition of the bridge crane in real time and displays the same in a main interface, and the whole interface is intuitive and concise and has a clear functional design. The crane control module is used to receive the operation of the optimal path planned by the host computer, and calculate the compensated velocity according to the change of running speed in real time, so as to achieve the anti- swing effect. The invention realizes the path planning function on the anti-swing base, and greatly improves the work efficiency.

An energy priority routing method based on extended transmission distance and retransmission comprises the following steps that a digraph composed of vertexes, directed sides, a source node and a termination node is obtained, sensor nodes serve as the vertexes, and sensor paths serve as the directed sides among the vertexes; each vertex includes initial energy, each side is associated with the transmission cost, and an energy consumption model is used to represent a value of energy consumed by a distance between two nodes; maximal transmission distance and maximal retransmission frequency of adata packet are defined; and a bandwidth value when the distance (between adjacent nodes) d<=R and R<d<=dmax is obtained by combining MREPE and ARMEP algorithms, and a maximal residual energy path issearched via an improved Dijkstra's algorithm. The method of the invention aims at solving the problem that the system lifetime is short on the premise that the wireless network environment is severeand node energy is finite, the robustness is high, and energy utilization is optimized.

The invention discloses a storage robot indoor mapping navigation system based on a laser radar, and the system comprises a storage robot which is used for automatically scanning the surrounding environment through the laser radar, obtaining a laser data point set, and building a two-dimensional grid map through employing an approximation synchronous positioning and mapping algorithm based on the laser data point set, performing pose estimation on the laser data point set by using a least square method or singular value decomposition, constructing a two-dimensional grid map according to a pose estimation result, updating the two-dimensional grid map to a warehouse system in real time, determining an optimal path by using a Dijkstra algorithm based on the two-dimensional grid map, and performing positioning navigation according to the optimal path; a warehouse system which is used for receiving and storing the two-dimensional grid map and sending instruction information to the storage robot; and a mobile control terminal which is used for sending instruction information to the storage robot; the indoor mapping navigation system disclosed by the invention has relatively high mapping and directional navigation precision and relatively low data processing amount.

The invention discloses a rapid transmission method of model data in distributed simulation of power equipment. The method comprises the steps of constructing a network topological graph of each site in a simulation system of the distributed power equipment, obtaining mean data transmission time between the sites, generating a shortest path tree taking a target site as a root node by using a Dijkstra's algorithm, generating a structure tree of a simulation model, analyzing a required submodule in a target included in each site, forming a submodule transmission candidate list, carrying out submodule transmission path planning from small to large from a leaf node according to the transmission time based on the list and the structure tree of the model to achieve rapid distributed transmission of the simulation model of the power equipment. The method greatly improves model transmission efficiency in the distributed simulation system, shortens the transmission time of a model network, and therefore ensures a simulation effect and continuity.