|
|
Grid-Based Path Planning
Novella, Tomáš ; Balyo, Tomáš (advisor) ; Martínek, Vladislav (referee)
This thesis deals with effective ways of pathfinding in grid-based graphs. In the first part we pointed out the most important approaches to finding the shortest path. In the second part we proposed an algorithm that improves the speed of pathfinding in some special cases of grid-based graph. In the end we proved it by providing a series of experiments. Powered by TCPDF (www.tcpdf.org)
|
|
| |
|
|
Efficient shortest path search in the public transportation networks
Martínek, Vladislav ; Žemlička, Michal (advisor) ; Kopecký, Michal (referee)
The search for the shortest path is one of the most studied graph problems with interesting applications in various elds. One such eld is human mass transportation, where the path length depends on the time tables of the tra c relations, which implements the path. Goal of this study is to nd efficient algorithm for the shortest path search in human mass transportation network and implement it in the library, which will be also useable on portable devices. The possibilities of time tables preprocessing and use of heuristics on search acceleration will be explored during implementation.
|
|
|
Deviations prediction in timetables based on AVL data
Jiráček, Zbyněk ; Martínek, Vladislav (advisor)
Relevant path planning using public transport is limited by reliability of the transportation network. In some cases it turns out that we can plan paths with respect to expected delays and hereby improve the reliability of the resulting path. This study focuses on prediction of the delays in public transport systems using data from vehicle tracking systems -- known as the AVL data. These data are typically collected by the transit operators. Various algorithms are compared using real data from Prague trams tracking system. The study also includes a discussion about a possible utilization of the information gained from the used methods in passenger information systems. Powered by TCPDF (www.tcpdf.org)
|
|
|
Efficient shortest path search in the public transportation networks
Martínek, Vladislav
The search for the shortest path is one of the most studied graph problems with interesting applications in various elds. One such eld is human mass transportation, where the path length depends on the time tables of the tra c relations, which implements the path. Goal of this study is to nd efficient algorithm for the shortest path search in human mass transportation network and implement it in the library, which will be also useable on portable devices. The possibilities of time tables preprocessing and use of heuristics on search acceleration will be explored during implementation.
|
|
|
Deviations prediction in timetables based on AVL data
Jiráček, Zbyněk ; Martínek, Vladislav (advisor)
Relevant path planning using public transport is limited by reliability of the transportation network. In some cases it turns out that we can plan paths with respect to expected delays and hereby improve the reliability of the resulting path. This study focuses on prediction of the delays in public transport systems using data from vehicle tracking systems -- known as the AVL data. These data are typically collected by the transit operators. Various algorithms are compared using real data from Prague trams tracking system. The study also includes a discussion about a possible utilization of the information gained from the used methods in passenger information systems. Powered by TCPDF (www.tcpdf.org)
|
|
|
Deviations prediction in timetables based on AVL data
Jiráček, Zbyněk ; Martínek, Vladislav (advisor) ; Žemlička, Michal (referee)
Relevant path planning using public transport is limited by reliability of the transportation network. In some cases it turns out that we can plan paths with respect to expected delays and hereby improve the reliability of the resulting path. This study focuses on prediction of the delays in public transport systems using data from vehicle tracking systems -- known as the AVL data. These data are typically collected by the transit operators. Various algorithms are compared using real data from Prague trams tracking system. The study also includes a discussion about a possible utilization of the information gained from the used methods in passenger information systems. Powered by TCPDF (www.tcpdf.org)
|
|
|
Grid-Based Path Planning
Novella, Tomáš ; Balyo, Tomáš (advisor) ; Martínek, Vladislav (referee)
This thesis deals with effective ways of pathfinding in grid-based graphs. In the first part we pointed out the most important approaches to finding the shortest path. In the second part we proposed an algorithm that improves the speed of pathfinding in some special cases of grid-based graph. In the end we proved it by providing a series of experiments. Powered by TCPDF (www.tcpdf.org)
|
|
|
Framework for internet strategy & heroes
Pešek, Jan ; Čermák, Miroslav (advisor) ; Martínek, Vladislav (referee)
This bachelor's thesis describes a software project framework that enables the user to create an online turn-based game inside an internet browser, focusing on customizability. The framework allows the user to create a game for two players and enables him to implement advanced configuration of the game by programming additional modules. Part of the project is a model game with predefined data, example modules and graphic representation. The text contains an evaluation of current available technologies usable for developing interactive online applications, along with discussion of some key problems that show up during developing such application. The text includes description of project implementation, the structure of the application, database and object design and application documentation with a manual for creating customized modules.
|
|
|
Efficient shortest path search in the public transportation networks
Martínek, Vladislav
The search for the shortest path is one of the most studied graph problems with interesting applications in various elds. One such eld is human mass transportation, where the path length depends on the time tables of the tra c relations, which implements the path. Goal of this study is to nd efficient algorithm for the shortest path search in human mass transportation network and implement it in the library, which will be also useable on portable devices. The possibilities of time tables preprocessing and use of heuristics on search acceleration will be explored during implementation.
|
guest ::
RSS feed.