Talk by Stefan Funke “Personalized Route Planning: Deducing Driving Preferences and Fast Querying”

Published

Date/Time
Date(s) - 21/09/2017
10:00 am - 11:00 am

Categories


Title: Personalized Route Planning: Deducing Driving Preferences and Fast Querying

Abstract:

We study the problem of learning individual route preferences of drivers. Most current route planning services only compute shortest or quickest paths. But many other criteria might play a role for a user to prefer a certain route, as, e.g., fuel consumption, jam likeliness, road conditions, scenicness of the route, turns, allowed maximum speeds, toll costs and many more. Specifying the importance of each criterion manually is a non-trivial, unintuitive and time consuming undertaking for a user. Therefore, we develop approaches that deduce such preferences automatically based on paths previously driven by the user. We present an LP-formulation of the problem making use of a Dijkstra-based separation oracle.

The resulting algorithm runs in polynomial time and allows for the user preference computation in few seconds even if several hundred routes are taken into account. As a side product, the same LP-formulation also allows for the elegant construction of multicriteria Contraction Hierarchies.

Biography:

Stefan earned his Ph.D. in Computer Science at the Max-Planck-Institut f. Informatik and the University of the Saarland in 2001. During his PostDoc years in Saarbruecken and Urbana-Champaign he was a Visiting Assistant Professor at Stanford University in 2004/5 before becoming a professor at the University of Greifswald in 2007. Since 2010 he holds the chair for Algorithmics at the University of Stuttgart. His research interests range from problems in computational geometry and discrete optimization to algorithms in general. He has been recepient of best paper awards or honorable mentions at VLDB 2014, AAAI 2014, SIGSPATIAL GIS 2011, ACM SPM 2005, and awardee of the Otto-Hahn-Medal and the Heinz-Billing-Award of the Max-Planck-Society, as well as two Google Research Awards.

You may also like

Talk by Reynold Cheng on Meta Paths and Meta Structures
Published

Talk by Reynold Cheng on Meta Paths and Meta Structures

A heterogeneous information network (HIN) is a graph model in which objects and edges are annotated with types. Large and complex databases, such as YAGO and DBLP, can be modeled as HINs. In this talk, we will give a review of meta paths, as well as how they are used to define relevance.
We further generalise the notion of a meta path to “meta structure”. Meta structure, which is more expressive than the meta path, describes complex relationship between two HIN objects.

Daisy and Uber event
Published

Daisy and Uber event

Program:

Steffen Grarup from Uber Technologies’ Danish office will talk about how it is to work for a US internet company, developing software that runs 24/7, where updates are deployed many times a day, where the time from idea to production is counted in hours, not months, and where systems are built to be self-healing, scalable, and run over multiple data centers. He will also talk about how Uber handles Big Data, including Big Spatio-Temporal Data such as GPS positions.

Christian S. Jensen from Daisy will talk about “A to B Reloaded”, Kristian Torp from Daisy will talk about “Very Large GPS Data Sets for Traffic Analysis”, and
Gyozo Gidofalvi from KTH and Torben Bach Pedersen from Daisy will talk about “Scalable Trip Grouping and Social Ride-Sharing”. […]