107 results about "Shortest path computation" patented technology

Methods, apparatus, and products for routing frames in a shortest path computer network for a multi-homed legacy bridge, wherein the network includes a plurality of bridges. At least two of the plurality of bridges operate as edge bridges through which the frames ingress and egress the network. A first edge bridge identifies a legacy bridge nickname for a legacy bridge connected to the network through the first edge bridge and a second edge bridge using active-active link aggregation. The first bridge receives a frame from the legacy bridge and determines, in dependence upon the frame's destination node address, an egress bridge nickname for a third bridge through which a destination node connects to the network. The first bridge then adds the legacy bridge nickname and the egress bridge nickname to the frame and routes the frame to the third bridge in dependence upon the egress bridge nickname.

A packet network of interconnected nodes employing dynamic backup routing of a Network Tunnel Path (NTP) allocates an active and backup path to the NTP based upon detection of a network failure. Dynamic backup routing employs local restoration to determine the allocation of, and, in operation, to switch between, a primary / active path and a secondary / backup path. Switching from the active path is based on a backup path determined with iterative shortest-path computations with link weights assigned based on the cost of using a link to backup a given link. Costs may be assigned based on single-link failure or single element (node or link) failure. Link weights are derived by assigning usage costs to links for inclusion in a backup path, and minimizing the costs with respect to a predefined criterion.

The embodiment of the invention provides order sorting method and system. The method comprises the steps of: generating a storehouse plane layout according to the putting condition of storehouse shelves; then computing the shortest path between nodes in a storehouse; finding out the positions, sizes and the weight of goods required for an order from pre-stored data; computing the shortest path and distance between any two pieces of required goods by using the shortest path between the nodes; and computing the optimal sorting path according to the capacity of sorting equipment and the required quantity of the required goods in the order so as to sort orders by the sorting equipment according to the optimal sorting path. The embodiment of the invention can effectively compute the sorting path, reduce the working cost, enhance the working efficiency, and solve the problems of inconsistent shelf arrangement, relatively small shelf height, and small expense difference caused by storing and taking the goods on different layers of shelves of the same goods position; and sorting workers mainly need to optimize order sorting problem in the horizontal movement distance for sorting work.

A network comprises a plurality of interconnected switches. At least one pair of switches is interconnected by a trunk formed from a plurality of individual links. A cost value is assigned to the trunk that is equal to the cost of one of the trunk's individual links. As such, a trunk is considered the same as an individual link when shortest path calculations are made. When multiple paths are computed as having the same lowest cost, the system balances load traffic between such lowest cost paths in a way that takes advantage of the higher bandwidth capabilities of trunks.

Embodiments disclosed herein provide systems, methods, and software for determining the shortest distance between vertices in relatively large graphs. In an embodiment a method includes identifying an original graph comprising a plurality of nodes and a plurality of edges, identifying a plurality of hub nodes from within the original graph, creating a hub matrix comprising the plurality of hub nodes and the shortest distance between the plurality of hub nodes, and determining a shortest distance between the at least two nodes using the original graph and / or the hub matrix.

Each network node in a network is configured for calculating a directed acylic graph that provides at least one path from all the other network nodes toward the one network node. The network node performs a modified shortest path first calculation by identifying next-hop nodes adjacent to the network node, and orienting the link of each next-hop node toward itself (i.e., the origin). The network node also identifies secondary adjacent nodes, adjacent to each of the next hop nodes, and extends paths from next-hop nodes to the associated secondary adjacent nodes while orienting each of the links of the path between adjacent nodes and next-hop nodes toward the next hop nodes. The paths of the nodes form a directed acyclic graph from any other network node toward the origin, enabling distribution of the directed acyclic graph to the other network nodes for optimized reachability to the network node.

Virtual routers that abstract photonic sub-domains are provided for GMPLS networks. A virtual router uses a link viability matrix to keep track of the set of viable connections between inputs and outputs of a photonic sub-domain. A virtual router may receive RSVP-TE signaling messages and either allocate a working input to output link pair or, if explicitly signaled, verify that the requested link is currently viable. A virtual router also advertises, in its link state updates, the current set of possible outputs for any input link. Shortest path computations can be implemented utilizing virtual routers by modifying a topology graph in accordance with the link viability matrix of the virtual router.

The invention discloses a shortest path calculation method by considering light damage based on a WSON. The shortest path calculation method comprises the following steps: after receiving a path request, calculating K shortest paths satisfying resource constraint from a source node to a sink node by using a KSP algorithm according to a physical damage perceptual RWA model based on a routing extension model; sequentially comparing light damage parameters of the K shortest paths with physical thresholds of the light damage parameters; and finally, selecting an optimal path satisfying resource constraint and physical damage constraint in the physical threshold range of the light damage parameters. In the event that a routing calculation core algorithm is unnecessary to reconstruct, the path establishing success rate is increased; the connection blocking rate is reduced; the service quality of the network is improved; and, after being applied in the WSON, the shortest path calculation method has relatively high economic benefits.

The invention discloses an indoor emergency path navigation method. The indoor emergency path navigation method comprises the steps of: deploying detecting nodes in an indoor scene corridor, deploying guide nodes at an intersection and an exit part; acquiring indoor scene nodes and path information through the detecting nodes and the guide nodes; acquiring position information of a starting point of a person and a dangerous point through the detecting nodes; building a path network diagram and storing by adopting a adjacency list data structure; determining a transferring target point of the person; limiting a search area within a rectangular area which takes the connecting line of the starting point and the target point as a diagonal to calculate the shortest path; expanding the search area to the minimum ellipse which comprises the rectangular area and takes the starting point and the target point as the two focal points and calculating the shortest path in the minimum ellipse; and according to the results of calculation, obtaining the shortest path. The indoor emergency path navigation method can be used for meeting the needs of emergency evacuation and navigation in emergency in public indoor spaces with large scales, complex spatial distribution and various types of people, such as hospitals, and is capable of reducing the time-space complexity, and improving the efficiency.

A professional field system cold start recommendation method based on a knowledge graph comprises the following steps of (1) constructing the professional field knowledge graph in a semi-automatic mode, firstly, the professional field knowledge graph is manually initialized based on a professional field classification directory, and then the professional field knowledge graph is automatically expanded through internet knowledge; (2) respectively extracting tags from registration information of a user and a description text of an article, and training a professional field word vector based on an internet text; (3) firstly, respectively carrying out entity linking on the user label and the article label in the knowledge graph, and then calculating a user / article matching degree value based on the shortest path between link nodes; and (4) recommending a plurality of articles with the highest matching degree values to the user. User registration information and article content informationare considered at the same time, and cold start of the system is achieved; a knowledge graph is constructed based on professional domain knowledge, and accurate and quantitative matching of user registration information and article content information is realized.

The invention provides a route planning method and device. The method mainly includes the steps: acquiring a starting point and an end point; calculating the shortest routes from the starting point and the end point; generating a route from the starting point to the end point according to a first shortest route, a middle route and a second shortest route. In the calculation process of the shortest routes, when a first road section of the first shortest route obtained by calculating the shortest routes from the starting point and a second road section of the second shortest route obtained by calculating the shortest routes from the end point have the same road signs according to judgment, middle road sections for communicating the first road section with the second road section are acquired from a road database and connected into the middle route, and road signs of the middle road sections are as same as those of the first road section and the second road section. According to the technical scheme, the calculation amount of the shortest routes can be decreased to a greater degree, and route planning efficiency is effectively improved.

The invention relates to an offshore wind plant submarine cable wiring acquisition method. The method comprises the following steps of according to an electrical connection graph of an offshore wind plant, acquiring an adjacent matrix among nodes of the offshore wind plant and using the adjacent matrix to express a topology mode in the electrical connection graph and a branch weight among the modes; according to a Dijkstra algorithm, acquiring a shortest path graph and calculating an influence coefficient of each branch according to the shortest path graph of two end points of each branch; multiplying the branch weight in the adjacent matrix by the corresponding influence coefficient so as to acquire the weight of the branch and form a new adjacent matrix; for the acquired new adjacent matrix, using a Prim algorithm and taking a summit of a tree as a lead so as to acquire a minimum spanning tree W; according to a direct current trend equation, calculating a current value of each cable, selecting a submarine cable model so that a current-carrying capacity parameter of the submarine cable is greater than a calculated current value, determining a parameter value of each segment of the submarine cable and calculating submarine cable investment cost of the minimum spanning tree.

The invention provides a fast evacuation algorithm FastEvac for evacuating personnel by using a traffic network during large-scale disasters and belongs to the field of computer application. The algorithm greatly improves the conventional fast evacuation algorithm CCRP, and stores calculated results iterated each time by using double-priority queues so as to accelerate the operation efficiency of the algorithm. Meanwhile, the fast evacuation algorithm FastEvac divides source points into two types, puts the source points with reserved paths and the sources points without the reserved paths into two double-priority queues respectively, and acquires source points needing source shortest path calculation by a method for acquiring top elements of the two double-priority queues during each iteration. Therefore, the fast evacuation algorithm FastEvac avoids the multi-source and multi-target point shortest path calculation between a source point set and a target point set during each iteration. Compared with the CCRP, the fast evacuation algorithm FastEvac greatly improves calculation efficiency.

A method for calculating the shortest vehicle finding path in a parking lot comprises the following steps: (1) making a map of a parking lot, marking parking space points, path points, a vehicle finding point and an elevator point, and determining the names; (2) describing the connection relationship among the path points, the vehicle finding point and the elevator point; (3) connecting all the path points in each layer to form line segments, calculating the vertical distances from each parking space point to the line segments, taking the line segment with the shortest vertical distance from the parking space point as the nearest line segment of the parking space point, and recording the horizontal and vertical coordinates of the vertical point; (4) calculating the shortest path from the vehicle finding point to the elevator point; and (5) calculating the shortest path from the vehicle finding point and the elevator point to the vertical points of the parking space points, calculating the sum of distances of the connection line segments between the vehicle finding point and the parking space points, wherein the vehicle finding path with the shortest distance is the shortest vehicle finding path. The advantage lies in that through calculation of the shortest path from the vehicle finding point to the parking space points, artificial workload is reduced, accuracy is ensured, and the problem of shortest path calculation for same-floor and cross-floor vehicle finding is solved.

The invention discloses a strip-shaped robot path planning method based on a self-learning ant colony algorithm. The strip-shaped robot path planning method based on the self-learning ant colony algorithm is characterized by comprising the following steps: step 1, environment modeling; step 2, initializing stage; step 3, initial searching; step 4, overall updating of grid map pheromone; step 5, self-learning searching; and step 6, outputting of a planning path. The strip-shaped robot path planning method based on the self-learning ant colony algorithm is greatly improved for an ant colony algorithm calculating process, a self-learning strategy is introduced, grid-process environment modeling is treated specially, by the used grid method, the ant colony algorithm deals with a strip-shaped robot path planning process under the condition that barrier cells do not need to be expanded, a new shortest path calculating method is provided, thought of machine learning is fused in the ant colonyalgorithm, the efficiency of path planning of the ant colony algorithm is improved by effective combination of methods such as pheromone, heuristic information, positive feedback and greedy search, and a strip-shaped robot can pass through a narrow channel according to the outline of the strip-shaped robot so as to implement the shortest path planning.

The invention relate to a shortest route planning and navigating method. The method comprises the following steps: step one, according to the user preference, adding a user preference weight to a route distance weight, and using a formula: M(n)=P(n)+Q(n)*A to preprocessing the data to obtain a comprehensive evaluation weight M(n); step two, selecting a special node that a user has to pass by, taking the special node as the cutting point, cutting the road network into a first network and a second network by the cutting point, wherein the first network is a node network from the start point to the special node, and the second network is a node network from the special node to the final point; step three, replacing the route distance weight P(n) in Dijkstra algorithm by the comprehensive evaluation weight M(n) obtained in the step one, and then using the improved Dijkstra algorithm to carry out shortest route on the first network and the second network so as to obtain the shortest route from the start point to the special node to the final point.

The invention discloses a virtual vehicle routing method applicable to large-scale traffic flow simulation, which comprises the following steps: storing paths in the routing table of each node in a next hop marking method; when a vehicle reaches one node, looking up the routing table of the node; if the next hop node ID which wants to reach the destination can be found in the table, moving in accordance with the target to finish the whole routing; and otherwise, calculating the whole path, decomposing the path and storing the path into each relevant routing table. By using a table lookup modeto reduce the repeated path calculation, the invention can obviously save a lot of time for calculating the shortest path of the vehicle; by using the dynamic variation of the table to characterize dynamic road conditions, the method has big advantages in path calculation of the dynamic road net; and in the path inquiring mode, the update of the optimal path completely depends on the periodic update of the routing table, and the update mode of the optimal path is similar to the computer network routing update mechanism.

The invention discloses an electric bicycle driving path matching method and device and a storage medium, and belongs to the technical field of intelligent traffic. The problems that in the prior art, GPS and video monitoring positioning data are excessively dependent, the operation time is long, the needed storage space is large, and jumping is prone to occurring are solved. The method is characterized by comprising the following steps of: acquiring data, cleaning and processing, establishing a road network, breaking road sections in the road network at mounting positions of readers, converting bidirectional road sections into unidirectional road sections, associating data, and calculating a linear distance between every two readers and a shortest path between breakpoints at the mounting positions of the two readers. The method comprises the following steps: calibrating the average speed of time-phased and classified road sections and the average delay time of intersections, obtaining the first K shortest paths between breakpoints at the mounting positions of two readers of a driving path to be matched, calculating the corresponding travel time, comparing the corresponding travel time with the travel time calculated by vehicle passing data, and taking the path with the minimum difference between the two travel time as the driving path. The matching efficiency of the driving track of the electric vehicle is improved.

The invention provides a data processing method and device based on an electronic map. The method comprises steps as follows: for all roads, sequentially acquiring parameter information of road shape points corresponding to roads from starting points of the roads, wherein the parameter information comprises longitude and latitude information as well as gradient information and / or curvature information of the road shape points; sequentially calculating 3D lengths between every two adjacent road shape points according to the parameter information of the road shape points of the roads; calculating 3D lengths of all sections of the roads according to the 3D lengths between the adjacent road shape points of the roads; when receiving an initial position point and a target position point input by a user, determining a path which connects the initial position point and the target position point and has the shortest 3D length according to the initial position point, the target position point and the 3D lengths of the sections of the roads. As the sections involved in the shortest path calculation adopt 3D lengths and the 3D lengths can reflect actual lengths of the sections more really, the calculated shortest path is more accurate.

A network management device includes a topology information generation unit which generates topology information of multi-layer network, a link identification information setting unit which sets identification information to identify links of the multi-layer network, a topology information transmission unit which transmits, to a route calculation engine, the topology information of the multi-layer network generated by the topology information generation unit, a shortest route calculation request transmission unit which transmits, to the route calculation engine, a calculation request of a shortest route, a multi-layer restriction checking unit which checks a restriction condition to the shortest route information received from the route calculation engine, based on the identification information of each link set by the link identification information setting unit, and an exception link selection unit which selects an exception link when the shortest route information transmitted from the route calculation engine does not satisfy the restriction condition of the multi-layer, wherein when the shortest route information received from the route calculation engine does not satisfy the restriction condition of the multi-layer, the network management device repeats setting the exception link and transmitting a re-calculation request of the shortest route, until the restriction condition of the multi-layer is satisfied.

The invention provides a position calibration device and method based on an LED visible light source and relates to a device which is used for forming a honeycomb-shaped array by a location-coded LED visible light source (a visible light emitting device), is arranged in a field needing positioning services, and is used for receiving a visible light signal by holding a visible light terminal so as to realize a positioning function. The device comprises hardware equipment including terminal equipment, the LED visible light source, a geographic information server, a wireless accessing point and the like, and also comprises corresponding software operating on intelligent terminal equipment and the geographic information server. All the equipment can commonly realize the functions, such as visible light signal acquisition and processing, position inquiring and display, calculation and display of a shortest path between two points, and calculation and display of an optimal accessing path among a plurality of points.

The invention provides a one-button target search optimization method for an intelligent vehicle-mounted information service terminal. The method comprises the following steps: S1, acquiring latitude and longitude coordinates of a point A1 where a vehicle lies and acquiring information of a surrounding target site Ck; S2, acquiring latitude and longitude coordinates of a point A2 where the vehicle lies after the vehicle runs for a time of delta t; S3, working out the distances between the point A1 and the point A2 and between the target site Ck and the point A1 as well as the point A2; S4, judging that whether the site Ck is a point in the forward path of the vehicle or not; S5, working out the shortest path of the points in the forward path of the vehicle and finding out the target in the minimum distance; and S6, invoking the latitude and longitude of the target site in the minimum distance and tagging in a map for navigation. The method not only can ensure that a user can obtain the optimal path to the best destination that is most suitable for the current travelling state and satisfy special requirements of the user, but also can allow the user not to select search results manually, so as to ensure safety driving of a driver and saving time for the user.

A computer aided design application modifies a CAD drawing having one or more electrical components by optimizing a plurality of circuits and associated panels, and assigning circuit and panel identifiers to each component for producing an engineering drawing. Further such identified components can be placed in home run groups, implementing shortest path calculations for various wire types and using neutral wires sharing options for producing an engineering drawing illustrating the home run grouping and identifiers, panel schedules and complete bills of materials.

The present invention relates to an undirected connected network shortest path-based network division method. The objective of the invention is to solve practical problems. When a Voronoi diagram is generated on the network, the L2 Euclidean distance is replaced by a shortest path in connected lines between nodes along the network. According to the undirected connected network shortest path-based network division method, after a group of randomly distributed seed points are provided, Voronoi units on the current network are calculated based on the shortest path; a Voronoi diagram in the Euclidean space is generalized into the Voronoi diagram in the connected network through a CVT (centroidal Voronoi tessellation) algorithm; and iteration is performed, the weighting length of the network corresponding to each seed point on the network is made to be identical as much as possible, and therefore, the optimal division of the network model is obtained. With the method of the invention adopted, problems in the distribution of public infrastructure such as gas stations, charging stations and sanitation facilities, and the distribution of logistics warehouse nodes on urban road can be solved.

The invention belongs to the technical field of customized bus passable shortest path calculation methods, particularly relates to a customized bus passable shortest path calculation method based on ahierarchical algorithm and an A * algorithm, and mainly aims at calculating the shortest path of a starting point and an ending point of an urban road network. Firstly, a road network is layered, andthen a classic A * algorithm and a two-way A * algorithm are flexibly selected according to different levels of the road network where different starting points and end points are located to calculate the shortest distance between the starting points and the end points in an accelerated mode; and the time for calculating the shortest path is shorter than the time for calculating the shortest pathby simply adopting an A * algorithm, so that the method is more accurate, the calculation speed is greatly increased, and the executability is high.