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.
As to the major building in the city currently, the traditional fixed signs of the fire evacuation system can't meet people's security needs any longer and the intelligent fire evacuation system has been the current development direction. This article combined the Dijkstra's algorithm with intelligent fire evacuation system self-developed which identified the fires by analyzing the fire linkage signal...
This paper is concerned with how to accurately position and find an optimal path through Vehicle Navigation System. This article designed a vehicle dynamic navigation system based on Internet of Things, by using the improved Ant Colony Algorithm. Through computer simulation, we obtained two simulation figures of static navigation route and dynamic navigation route. Besides, the driving directions...
Nowadays, to avoid over-speed and parking violation, repair vehicles are commonly monitored and positioned under monitoring and dispatching system by most of local-level power supply enterprises. With the development of electric utilities, power supply enterprises are urged to improve their response speed to power troubles. In such a situation, electrical repair vehicles must be under a status of...
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...
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...
We present a statistical learning approach for finding recreational trails in aerial images. While the problem of recognizing relatively straight and well defined roadways in digital images has been well studied in the literature, the more difficult problem of extracting trails has received no attention. However, trails and rough roads are less likely to be adequately mapped, and change more rapidly...
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.