|
|
Searching trails in maps
Drahovský, Robin ; Pangrác, Ondřej (advisor) ; Veselý, Pavel (referee)
This thesis describes design and implementation of an application capable of finding the shortest paths in real world map data, while taking elevation data into account. Path finding is fast and can be adjusted to user's needs without the need for graph rebuilding, what differentiates this application from others, that only allow user to work with predefined search profiles. In addition to path finding, the application can generate highly compact graph from map data in OSM format. This allows fast access to information necessary for finding the shortest path. The application can render map data with custom rendering style and contour lines, but also can display map from OpenStreetMaps project servers.
|
|
| |
|
|
Analysis and Prediction from GPS Data
Kováčik, Dušan ; Bartík, Vladimír (referee) ; Burget, Radek (advisor)
This paper deals with the analysis of the collected GPS data and the possibility of the prediction of most advantageous route on its basis, by the application written in the PHP scripting language. The suitability of the route is considered by the distance, driving time, or elevation. The thesis also describes a GPS system, the format of the source data and their storing in an appropriate database. There is also a description of the search of the shortest path in the graph and some famous algorithms for finding it. The paper includes information about implementation of new data integration and path finding within this data in PHP scripting language. In conclusion it is evaluated what are the benefits of this application and design saying how this application can be improved in the future.
|
|
|
Optimal Route Planning for Electric Vehicles
Juřík, Tomáš ; Franek, Lešek (referee) ; Fiedler, Petr (advisor)
In this work we present algorithms that are capable of calculating paths to destination for electric vehicles. These paths can be based on the simple metrics such as the distance, time or the paths can be based on more advanced metric such as the minimum energy demanding metric. This metric is parameterizable by the physical construction of the electrical vehicle. We also propose a new algorithm that computes energy optimal paths that are more acceptable by the driver, because it also takes into consideration the time metric while computing the path.
|
|
|
Application of neural networks in telecommunications
Šulák, Michal ; Koula, Ivan (referee) ; Kacálek, Jan (advisor)
This Master’s Thesis consists of description of current routing protocols and routers, basic principles of neural networks and their interpretation in connection with the use for routing in data networks and telecommunications networks. In the thesis I focused on neural networks, which use energetic functions to find solution stabled states and their use for data routing. I produced the application software to test and find suitable variables for each function. This application counts the shortest path and is able to change variables to reach the best solution of stabled state of neural network. These solutions are compared with other functions that are usually used in nowadays systems for data network routing.
|
guest ::
