Planning the path an autonomous robotic vehicle will take is essential part of developing and utilizing such a system. The task deciding on best route navigating technique to get its destination quickly safely. purpose planning select for that result in greatest fuel savings. planner aids accomplishing goals least amount time using by determining optimal considering variables including traffic,...

The purpose of this report is to propose a new routing algorithm, Balanced Interference Routing Algorithm (BIRA), for the next generation cellular communication networks. The new network has high density base stations distribution to increase the capacity. The whole network is based on CDMA type of technology. One of the main features of the new routing algorithm BIRA is to take the interferenc...

Study on search algorithm of passenger travel route in railway transport network is of great importance in evaluation on railway operation benefit. Based on features of large-scale network and railway passenger transportation organization, the paper firstly innovatively puts forward the generation method of alternative route set in multiple constraint conditions. K short routes is proposed base...

Aiming at the instability and uncertainty of mobile nodes and low-power wireless communications links in Ad hoc networks, a parallel disjointed multi-path routing algorithm called DMP_EOLSR is proposed in the paper. It is based on the OLSR routing algorithm, and considers the living time of nodes and links according to the energy consumption and moving mode of nodes. At the same time, to find d...

This paper solves the problem of intercepting a moving object in FIFO graphs. In the graph, a first mobile (the target) is moving with a known fixed itinerary. The second mobile (the pursuer) aims to reach the first one with the minimum delay. So, our goal is to find the shortest path for the interception taking into account the dynamic nature of the graph. This interception problem can be appl...

—The problem of optimal multicast routing tree in WMNs subject to multiple QoS constraints, which is NPcomplete, is studied in this paper. As far as we know, the existing algorithms for finding such a multicast routing tree are not very efficient and effective in wireless mesh networks. Combining the previous effective algorithms, this paper devises a fast multicast path heuristic (FMPH) algor...

The self-stabilizing distributed depth-rst token circulation algorithms have many applications in distributed systems. The solution to this problem can be used to solve the mutual exclusion, spanning tree construction, synchronization, and many others. In this thesis, we propose several depth-rst token circulation algorithms for trees and arbitrary networks. The algorithms do not use the proces...

Distribution is an activity carried out to spread the product throughout market so that consumers can buy it. also affect price of goods. Therefore, distribution must be effective. The purpose this study determine shortest route effective in prices are not high and company does suffer losses. data analysis method used Dijkstra's Algorithm obtained with on distance between starting point destina...