The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper compared the algorithms proposed in the method in wireless sensor network. Energy consumption is very important for self-powered radio nodes. But in some applications energy balancing is more important. Wireless sensor networks used in large areas like farmland or warehouses consist of hundreds of nodes. In classic method routing is directed to short time of transmission or low energy...
The path planning is a very important part of AGV control. Firstly, The OpenCV is called to fitting the contour of obstacles with polygon and to optimize the result. Then a model of AGV work space is built by the method of network topology. So the problem of AGV path planning can be transformed into the problem of searching for the shortest path of the network topology. In the process of searching,...
This paper considers the Euclidean shortest path problem among obstacles in ℝn. Adaptations of Dijkstra's and A* algorithms are introduced that compute the approximate cost-to-go function over a simplicial complex embedded in the free space. Interpolation methods are carefully designed and analyzed so that they are proven to converge numerically to the optimal cost-to-go function. As the result, the...
In order to improve the efficiency of road network route planning,many experts and scholars have conducted some studies, Dijkstra's algorithm is a research hotspot. The Dijkstra's algorithm has its own shortcomings when seeking an optimal path between two points, but it has irreplaceable advantages. Through the analysis of strengths and weaknesses of the classic Dijkstra's algorithm, we can find that...
An efficient solution for a single-source problem called Thorup's algorithm has been proposed, whose computational complexity, O(N), is smaller than that of Dijkstra's algorithm, O(N log N). In this paper, we compare the performance of Dijkstra's algorithm and Thorup's algorithm for large-scale network simulation. Through extensive experiments, we show that Thorup's algorithm is slightly faster with...
The shortest path problem in network has been studied widely and intensively over years, both in theoretical and in computational viewpoints. Many speed-up techniques for Dijkstra's algorithm have been developed. However, only few of those techniques work in time-dependent networks. This paper studies how to promptly answer the shortest path between a pair of nodes over a large time-dependent road...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.