|Datum||Fr 10. Mai 2019, 11:30 Uhr|
|Ort||Raum 348 (Gebäude 50.34)|
|Vorheriger Termin||Fr 3. Mai 2019|
|Nächster Termin||Fr 17. Mai 2019|
|Titel||Flexible User-Friendly Trip Planning Queries|
|Kurzfassung||The users of the location-based services often want to find short routes that pass through multiple Points-of-Interest (PoIs); consequently, developing trip planning queries that can find the shortest routes that passes through user-specified categories has attracted considerable attention. If multiple PoI categories, e.g., restaurant and shopping mall, are in an ordered list (i.e., a category sequence), the trip planning query searches for a sequenced route that passes PoIs that match the user-specified categories in order.
Existing approaches find the shortest route based on the user query. A major problem with the existing approaches is that they only take the order of POIs and output the routes which match the sequence perfectly. However, users who they are interested in applying more constraints, like considering the hierarchy of the POIs and the relationship among sequence points, could not express their wishes in the form of query users. Example below, illustrates the problem:
Example: A user is interested in visiting three department stores (DS) but she needs to have some food after each visit. It is important for the user to visit three different department stores but the restaurants could be the same. How could the user, express her needs to a trip planning system?
The topic of this bachelor thesis is to design such a language for trip planning system which enables the user to express her needs in the form of user queries in a flexible manner.
- Neuen Vortrag erstellen