60 results about "Route finding" patented technology

The invention relates to wireless self organized network energy saving needed route method based on ant colony optimization. The route building includes the following steps: broadcasting state information of asking ant to search network and store in each node reverse information pheromone list; responding the anti while receiving the request and selecting one neighbor node as the next step reverse source node; building the route from the source node to destination node. The route maintenance is that energy parameter is inducted; and new route finding process will be forced to do to avoid node from dying untimely while node energy consumption is overmuch.

The invention discloses an automatic relay networking method in electric line carrier communication, which comprises a route finding part and a route maintaining part. The route finding part is performed by two cycles: cycle 1, finding a common node which can be directly communicated with a central node; and cycle 2, finding a node which can be communicated by the transfer of a relay node. In the whole route finding process, the processing on the carrier interception, conflict avoidance and optimum path problems among the nodes is realized. At the route maintaining stage, the optimum path is managed, and the path is ensured to be stable and smooth. By adopting the method, the invention can effectively solve the problems of conflict and optimum path in the self networking process, and enables the carrier communication based on the electric line to be stable and high-efficient.

In a process for determining a route from a predetermined starting point to a predetermined destination, firstly, weights are assigned to route segments interconnected at route nodes. At least a first weight relating to a first route segment is varied by querying at least a data source based on at least a second weight relating to a second route segment. The second route segment is prior to the first route segment in a consideration of the route from the starting point to the destination. Subsequently, the route is determined by using a route finding algorithm, the algorithm taking the weights into account.

The invention relates to an AOMDV-based energy aware node-disjoint multipath routing algorithm, and belongs to the technical field of a wireless sensor network. The method includes the following steps: searching all possible disjoint multiple paths through flooding in a routing finding stage and a routing reply stage; and in a data transmission stage, designing a routing data package, increasing node energy fields in a routing table to count energy of current nodes, distributing weights to each path according to the energy of each path node, screening links, and obtaining an optimal link. Factors such a disjoint multiple paths, the link quality and node energy consumption are taken into consideration comprehensively, so node energy consumption is reduced, network loads are equalized, and the energy utilization efficiency is increased.

The invention discloses an ant algorithm-based distributed self-network dynamic-routing method, comprises the courses of route finding and route maintaining. The route finding course is completed by both forward ant packet and backward ant packet, where the forward ant packet takes charge of establishing a path back to the source node and the backward ant packet takes charge of establishing a path to the destination node; each middle node implements distributed treatment of jamming problem, chain breaking problem and shortcut problem in the data transmitting course in the route maintaining stage. The method can reduce added expenses and makes network loads trend to balance and reduces end-end delay time for packet transmission.

The invention relates to a trafficability route-finding algorithm of a vehicle navigation system. The trafficability route-finding algorithm is characterized in that a starting point and a finishing point of a route are respectively arranged in two road networks by a trafficability road network model so that the two road networks can be communicated with each other in a passing region range so as to ensure a specified passing region is in the route-finding process from the starting point to the finishing point; a large passing region semidiameter is set when the distance of the starting point and the finishing point is far and the large passing region semidiameter is set when the road network density is small by adopting a region semidiameter adjusting scheme so as to ensure a planned route to effectively pass through the region semidiameter and not necessarily to pass through a control point; and the route is guided to pass through the specified region by adopting virtual finishing point route-finding, setting a virtual finishing point and utilizing A* algorithm and the route is guided to be planned from the specific region to the finishing point by adopting direction changing route finding and changing route finding guide cost so as to ensure the accuracy and the reliability of the results. A route planned by the trafficability route-finding algorithm can meet user's intent to pass through the passing region, can meet cost minimum standards, and can be used for various embedded vehicle navigation systems.

The invention discloses an instant route-finding method for a three-dimensional scene, and the method comprises the steps: (1) presenting topographic data according to a triangular line model, and initializing the topographic data; (2) detecting an obstacle through a ray method; (3) carrying out the pre-calculation of a travelling position point; (4) verifying whether a pre-calculation point is an effective position meeting constraint conditions or not; (5) carrying out the diffusion calculation of a frontal surface; (6) updating movement coordinates; (7) carrying out a reachable stopping mode of an object. Aiming at obstacle state complexity, topographic data irregularity and wide range of the three-dimensional scene and the different demands of an application scene for instant or global route finding, the method makes the most of the characteristics of the triangular line model, combines the technology of three-dimensional collision detection and a method of frontal surface propagation, optimizes the instant, quick and effective route-finding mode of the three-dimensional scene, enables the route-finding process to be intelligent and self-adaptive, meets the demands of automatic route finding, and reduces the risks of calculation failures and the calculation cost.

The invention discloses a routing selection method for a wireless mesh return network. The method comprises the following steps: determining a QoS (quality of service) requirement value after servicesof different types of a source node are converged; determining supporting capacity values for the QoS requirement value when the source node is connected to different links of an external network; and comparing the supporting capacity values, and selecting routing when the source node is connected to the external network according to a comparison result. Meanwhile, the invention discloses the wireless mesh return network. The wireless mesh return network and the routing selection method thereof can provide QoS assurance for the converged services, avoid data congestion, and save the expensesof routing finding and maintenance processes.

The invention provides a fast and stable routing method and device suitable for vehicle networking based on a clustering structure, applied to a communication network established according to road geographical layout information and vehicle running dynamic, wherein the communication network is used for data transmission among any vehicles within a preset range. The fast and stable routing method and device suitable for the vehicle networking based on the clustering structure comprises the following steps: sending a route finding RF message to a preset gateway node; receiving a route returningRR message sent by the preset gateway node when confirming that a destination node is contained in the routing table of the preset gateway node, wherein the RR message contains a target routing path from the source node to the destination node; and sending a packet to the destination node according to the target routing path. By means of the fast and stable routing method and device suitable for the vehicle networking based on the clustering structure, the local optimum problem caused by the greedy algorithm can be avoided, and the time delay of data transmission among vehicle nodes is reduced.

The embodiment of the invention provides a route finding method and device. The method includes the steps of detecting the current position information of a player, adopting the current position information as a first position point, detecting target position information and adopting the target position information as a second position point; judging whether or not there are barriers between the first position point and the second position point; if yes, on the basis of the relative position relation among the barriers, the first position point and the second position point, finding an intermediate transit point between the first position point and the second position point; on the basis of the first position point, the intermediate transit point and the second position point, generating aflight route to control the player to fly from a current position to pass by the intermediate transit point and reach a target position. By means of the embodiment, the flight route can be more comprehensive, and the game experience of users is improved.

PCT No. PCT/GB96/01914 Sec. 371 Date Feb. 5, 1998 Sec. 102(e) Date Feb. 5, 1998 PCT Filed Aug. 6, 1996 PCT Pub. No. WO97/06645 PCT Pub. Date Feb. 20, 1997PURPOSE: To obtain a processing method capable of executing processing by a small memory and restricting the memory in accordance with the number of searching routes. CONSTITUTION: Retrieving processing is started (10, 11) by using start point node as a start node, and in each end of processing, a node existing in a queue table 3 is used as a start node and the retrieving processing is repeated (12, 13). In retrieving processing (14, 15), the 1st processing is repeated by successively using the start node as a master node until there i no start node. The 1st processing (16) retrieves all slave nodes connected to the master node and the 2nd processing of the slave nodes is executed. If an item corresponding to a node in a data table 2 is in an idle state when the slave node is not an end point node in the 2nd processing (17 to 24), link information to the master node is recorded and the slave node is used as a start node, and when an idle state exists in the queue table in the recorded state of the link information, the identification (ID) information of the master node is recorded, and at the end point node, a route searching result is obtained from the link information stored in the data table 2.

The invention relates to a multi-biological inspiration-based wireless sensor network adaptive route decision method comprising three parts of a trust evaluation mechanism, a route decision, and a route adaptive adjusting method. To be specific, the trust evaluation mechanism carries out credibility evaluation on a neighbor of each node and stores the evaluation information to a trust evaluation list of the node itself, wherein the information is used as one of determinants of the route decision. When the node needs to send data to a convergence node, the route decision selects a proper route for the node; and when no proper route exits, a route finding unit searches a route leading to the convergence node. And when the node needs to forward data to the convergence node, a route forwarding unit selects a proper next-hop node for forwarding; and when two or more than two routes can be selected, a route selection unit selects an optimum route according to a physarum algorithm. According to the invention, credibility evaluation and route decision of a sensor node can be realized; and a route decision parameter can be adjusted according to a network state and thus the adaptive adjustment of the route decision can be realized.

The invention discloses a reverse navigation system, which concretely comprises a walking route drawing module, an artificial annotation module, a data storage module, a path display module, a path hiding module and a reverse navigation module, wherein the path display module is respectively connected with the path hiding module and the reverse navigation module; the data storage module is connected with the walking path drawing module, the artificial annotation module and the path display module. In the use process, the electronic map and network support is not needed; a user can install the reverse navigation device on electronic equipment for use at any time; the path hiding module achieves the goal of automatically or manually hiding some repeated routes for effectively improving the route finding efficiency of the user; the reverse navigation system can be applied to outdoor navigation and outdoor navigation.

The invention relates to a underwater acoustic sensor network routing algorithm and system. The underwater acoustic sensor network routing algorithm comprises the following steps: step S1, acquiring a network topological structure; step S2, electric potential distributing; and step S3, constructing routing. The technical problem that the routing finding is failed due to local minimum point is overcome by use of the underwater acoustic sensor network routing algorithm disclosed by the invention, and the method is especially suitable for determining the routing in a underwater acoustic sensor network in the marine environment.

An information providing device, having a route acquisition unit that acquires a reference travel route between two points, a route finding unit that finds a fuel-saving travel route between the two points, a fuel cost calculating unit that calculates a difference in cost of fuel between the reference travel route and the fuel-saving travel route based on fuel consumption and a fee of fuel, a communication cost calculating unit that calculates a communication cost concerning the fuel-saving travel route, and a control unit that executes control for transmitting predetermined information to a terminal device based on the result of a comparison between the difference in cost of fuel and the communication cost.

This invention provides a kind of management method for two-level routing conversion table in data transmission device. It concludes: the first-level chip and second-level chip set up cascade; the message carries out routing finding in the first-level chip firstly. If it does not find out matched route in the first chip, the message will be sent to second-level chip through default route. This method can organize the two-level routing list into a reasonable structure.

The invention provides a route-finding method and a route-finding device. The route-finding method comprises the following steps: when a role receives an operational command, determining route-finding time according to the current motion state and the motion direction of the role; finding the route at the route-finding time and reporting the route-finding result to a server; and checking and returning the route-finding result by the server. In view of different motion directions and motion states, a in-time route-finding method or a method of route-finding after starting a cooling timer and waiting for overtime is employed for role selection, so that when the role walks, if a user continuously clicks and the difference between motion directions is not large, route-finding requests can not be raised repeatedly so as to reduce route-finding cost and route checking requests sent to the server end. When the difference between motion directions is large or the role is in the static state, the method and the device ensure in-time response to users' operation so as to avoid users' feeling of delay (time lag) of the game.

A method for concurrent search and select of routing patterns for a routing system is provided. The provided method introduces a metric for indicating the goodness of a routing pattern for guiding the selection of search engine at the route finding stage. Next, the method explores routes based on a plurality of feasible routing track segments that represent the longest continuous span of possible routes on a routing layer. Next, the preferred routing patterns can be selected. After that, the method goes to find one or more routing violations and then avoid the routing violations. Furthermore, the avoidance of the routing violation(s) can be implemented by reducing the length of the feasible routing track segment, or removing portion of a routed segment running in parallel and adjacent track(s) of the feasible routing track segment.