Rychlé hledání cesty v obřích grafech

RNDr. Ondrej Moriš

Bakalářská práce

Route-planning in huge graphs

Abstract:

In this thesis we are concerned with route-planning in huge graphs representing real-world road maps: for a given pair of vertices of a road map we want to very effectively find optimal path between them. The application area of this are car GPS navigation systems. Our work introduces a completely new promising approach based on a branch-decomposition and bidirectional search. The main focus of our approach is on applicability to ``weak'' mobile devices, and hence we employ a powerful preprocessing first. We note that the interest of our work is in global view of long distance route-planning. Our theoretical work is supported by extensive experimental results on real road maps of Europe. Possible improvements and trends of future work are also indicated.

Keywords

bidirectional search, branch-decomposition, Dijkstra's algorithm, GPS navigation systems, graph theory, reach, route-planning, scope

Jazyk práce: angličtina

Datum vytvoření / odevzdání či podání práce: 19. 5. 2008

Obhajoba závěrečné práce

• Obhajoba proběhla 23. 6. 2008
• Vedoucí: prof. RNDr. Petr Hliněný, Ph.D.
• Oponent: doc. Mgr. Jan Obdržálek, PhD.

Masarykova univerzita

Fakulta informatiky

Bakalářský studijní program / obor:
Aplikovaná informatika / Aplikovaná informatika