A Force-Directed Approach for Offline GPS Trajectory Map Matching

We present a novel algorithm to match GPS trajectories onto maps offline (in batch mode) using techniques borrowed from the field of force-directed graph drawing. We consider a simulated physical system where each GPS trajectory is attracted or repelled by the underlying road network via electrical-like forces. We let the system evolve under the action of these physical forces such that individual trajectories are attracted towards candidate roads to obtain a map matching path. Our approach has several advantages compared to traditional, routing-based, algorithms for map matching, including the ability to account for noise and to avoid large detours due to outliers in the data whilst taking into account the underlying topological restrictions (such as one-way roads). Our empirical evaluation using real GPS traces shows that our method produces better map matching results compared to alternative offline map matching algorithms on average, especially for routes in dense, urban areas.Comment: 10 pages, 12 figures, accepted version of article submitted to ACM SIGSPATIAL 2018, Seattle, US

Snapping Graph Drawings to the Grid Optimally

In geographic information systems and in the production of digital maps for small devices with restricted computational resources one often wants to round coordinates to a rougher grid. This removes unnecessary detail and reduces space consumption as well as computation time. This process is called snapping to the grid and has been investigated thoroughly from a computational-geometry perspective. In this paper we investigate the same problem for given drawings of planar graphs under the restriction that their combinatorial embedding must be kept and edges are drawn straight-line. We show that the problem is NP-hard for several objectives and provide an integer linear programming formulation. Given a plane graph G and a positive integer w, our ILP can also be used to draw G straight-line on a grid of width w and minimum height (if possible).Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

History navigation in location-based mobile systems

The aim of this paper is to provide an overview and comparison of concepts that have been proposed to guide users through interaction histories (e.g. for web browsers). The goal is to gain insights into history design that may be used for designing an interaction history for the location-based Tourist Information Provider (TIP) system [8]. The TIP system consists of several services that interact on a mobile device

Seller Reputation and Trust in Pre-Trade Communication

We characterize the unique equilibrium in which high ability sellers always announce the quality of their items truthfully, in a repeated game model of experienced good markets with adverse selection on a seller's propensity to supply good quality items. In this equilibrium a seller's value function strictly increases in reputation and a seller's type is revealed within finite time. The analysis highlights a new reputation mechanism based on an endogenous complementarity the market places between a seller's honesty in pre-trade communication (trust) and his/her ability to deliver good quality (reputation). As maintaining honesty is less costly for high ability sellers who anticipate less “bad news” to disclose, they can signal their ability by communicating in a more trustworthy manner. Applying this model, we examine the extent to which consumer feedback systems foster trust in online markets, including the possibility that sellers may change identities or exit.cheap talk, consumer rating system, reputation, trust.