Pathlet learning for compressing and planning trajectories

The wide deployment of GPS devices has generated gigantic datasets of pedestrian and vehicular trajectories. These datasets offer great opportunities for enhancing our understanding of human mobility patterns, thus benefiting many applications ranging from location-based services (LBS) to transportation system planning. In this work, we introduce the notion of pathlet for the purpose of compressing and planning trajectories. Given a collection of trajectories on a roadmap as input, we seek to compute a compact dictionary of pathlets so that the number of pathlets that are used to represent each trajectory is minimized. We propose an effective approach whose complexity is linear in the number of trajectories. Experimental results show that our approach is able to extract a compact pathlet dictionary such that all trajectories can be represented by the concatenations of a few pathlets from the dictionary. We demonstrate the usefulness of the learned pathlet dictionary in route planning.

[1]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[2]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[3]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[4]  J. FransM. The context-tree weighting method: basic properties-Information Theory, IEEE Transactions on , 2004 .

[5]  Y. Shtarkov,et al.  The context-tree weighting method: basic properties , 1995, IEEE Trans. Inf. Theory.

[6]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[7]  Thomas S. Huang,et al.  ‘Bag of segments’ for motion trajectory analysis , 2008, 2008 15th IEEE International Conference on Image Processing.

[8]  Albert-László Barabási,et al.  Understanding individual human mobility patterns , 2008, Nature.

[9]  John Krumm,et al.  Hidden Markov map matching through noise and sparseness , 2009, GIS.

[10]  Dražen Odobašić Open Street Map , 2009 .

[11]  Maike Buchin,et al.  An algorithmic framework for segmenting trajectories based on spatio-temporal criteria , 2010, GIS '10.

[12]  Xing Xie,et al.  T-drive: driving directions based on taxi trajectories , 2010, GIS '10.

[13]  Santi Phithakkitnukoon,et al.  Sensing urban mobility with taxi flow , 2011, LBSN '11.

[14]  Yu Zheng,et al.  Computing with Spatial Trajectories , 2011, Computing with Spatial Trajectories.

[15]  Xing Xie,et al.  A greener transportation mode: flexible routes discovery from GPS trajectory data , 2011, GIS.

[16]  Shashi Shekhar,et al.  Discovering interesting sub-paths in spatiotemporal datasets: a summary of results , 2011, GIS.

[17]  Marc J. van Kreveld,et al.  Median trajectories using well-visited regions and shortest paths , 2011, GIS.

[18]  P. Pardalos,et al.  Experimental algorithms : 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011 : proceedings , 2011 .

[19]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[20]  Andrew V. Goldberg,et al.  Shortest Paths in Road Networks: From Practice to Theory and Back , 2011, it Inf. Technol..

[21]  Joachim Gudmundsson,et al.  Of motifs and goals: mining trajectory data , 2012, SIGSPATIAL/GIS.

[22]  Leah Epstein,et al.  Algorithms-- ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings , 2012 .

[23]  Kai-Florian Richter,et al.  Semantic trajectory compression: Representing urban movement in a nutshell , 2012, J. Spatial Inf. Sci..

[24]  Ranit Gotsman,et al.  Compact Representation of GPS Trajectories over Vectorial Road Networks , 2013, SSTD.

[25]  Leonidas J. Guibas,et al.  Large-scale joint map matching of GPS traces , 2013, SIGSPATIAL/GIS.