Review and classification of trajectory summarisation algorithms: From compression to segmentation Articles uri icon

publication date

  • October 2021

start page

  • 1

end page

  • 27


  • 10


  • 17

International Standard Serial Number (ISSN)

  • 1550-1477

Electronic International Standard Serial Number (EISSN)

  • 1550-1447


  • With the continuous development and cost reduction of positioning and tracking technologies, a large amount of trajectories are being exploited in multiple domains for knowledge extraction. A trajectory is formed by a large number of measurements, where many of them are unnecessary to describe the actual trajectory of the vehicle, or even harmful due to sensor noise. This not only consumes large amounts of memory, but also makes the extracting knowledge process more difficult. Trajectory summarisation techniques can solve this problem, generating a smaller and more manageable representation and even semantic segments. In this comprehensive review, we explain and classify techniques for the summarisation of trajectories according to their search strategy and point evaluation criteria, describing connections with the line simplification problem. We also explain several special concepts in trajectory summarisation problem. Finally, we outline the recent trends and best practices to continue the research in next summarisation algorithms.


  • Computer Science


  • trajectory summarisation; trajectory segmentation; trajectory compression; data compression; douglas–peucker; spatial data analysis, trajectory partitioning