Web application for keyword-aware walking route search
| Název práce v češtině: | Webová aplikace pro vyhledávání pěších tras s ohledem na klíčová slova |
|---|---|
| Název v anglickém jazyce: | Web application for keyword-aware walking route search |
| Klíčová slova: | prostorové dotazy|vyhledávání tras|osobní data|Solid|otevřená data |
| Klíčová slova anglicky: | spatial queries|route search|personal data|Solid|open data |
| Akademický rok vypsání: | 2022/2023 |
| Typ práce: | bakalářská práce |
| Jazyk práce: | angličtina |
| Ústav: | Katedra softwarového inženýrství (32-KSI) |
| Vedoucí / školitel: | doc. Mgr. Martin Nečaský, Ph.D. |
| Řešitel: | Ing. Bc. Dmitry Zhukov - zadáno a potvrzeno stud. odd. |
| Datum přihlášení: | 24.10.2022 |
| Datum zadání: | 26.10.2022 |
| Datum potvrzení stud. oddělením: | 25.11.2022 |
| Datum a čas obhajoby: | 05.02.2024 09:00 |
| Datum odevzdání elektronické podoby: | 08.01.2024 |
| Datum odevzdání tištěné podoby: | 08.01.2024 |
| Datum proběhlé obhajoby: | 05.02.2024 |
| Oponenti: | RNDr. Michal Kopecký, Ph.D. |
| Zásady pro vypracování |
| Modern map applications (Mapy.cz, Google Maps, etc.) allow efficient route planning. A typical example of such services is when a user enters the mode of transport and marks points of interest on the map in the order he wants to visit them. The application then searches for optimal routes connecting pairs of points according to the ordering and displays the result. Sometimes the points of interest are not essential or known in advance. The user wants to visit some points that meet specific characteristics. For example, a tourist in an unfamiliar city would like to see a restaurant, clothing store, and museum on the way to the hotel. More complex queries involving keywords or otherwise formulated characteristics cannot simply be expressed through the interfaces of the aforementioned applications.
This bachelor thesis aims to design, implement and test a web application for keyword-aware walking route search. The given problem and its variants are NP-hard [1, 2]. The theoretical part of the work will include an analysis of existing algorithms capable of answering queries in the mentioned form. The thesis will choose a suitable algorithm or its modification. It will emphasize the efficiency of the computation and obtaining an approximate solution. The application will use the OpenStreetMap project [3] as a base and selected libraries for working with maps. The found paths will be rendered with a rating of the task completion. The mapped points of interest will be interactive and enriched with information from publicly available knowledge bases, e.g., DBPedia [4], Wikidata [5], or similar. The project source code will be published on GitHub.com. |
| Seznam odborné literatury |
| [1] Xin Cao, Lisi Chen, Gao Cong, and Xiaokui Xiao. Keyword-aware optimal route search. 2012. DOI: 10.14778/2350229.2350234
[2] Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, and Yerach Doytsher. Heuristic algorithms for route-search queries over geographical data. 2008. DOI: 10.1145/1463434.1463449 [3] Wiki projektu OpenStreetMap [online]. [cit. 2022-10-19]. Dostupné z: https://wiki.openstreetmap.org/wiki/Main_Page [4] Wiki projektu DBPedia [online]. [cit. 2022-10-19]. Dostupné z: http://wikidata.dbpedia.org/ [5] Wiki projektu Wikidata [online]. [cit. 2022-10-19]. Dostupné z: https://www.wikidata.org/wiki/Wikidata:Main_Page |