Skip to main content

Trajectory Prediction of Moving Objects

  • Chapter
  • First Online:
Moving Objects Management

Abstract

The trajectory prediction is an important part for the management of moving objects. For example, it can be used to improve the performance of the location update strategy and to support the predictive index and queries. In this chapter, we first review some linear prediction methods and analyze their problems in handling moving objects in spatial networks and then present our simulation-based prediction methods: Fast-Slow Bounds Prediction and Time-Segment Prediction. In addition, we also present our uncertain path prediction method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aggarwal C, Agrawal D (2003) On nearest neighbor indexing of nonlinear trajectories. In: Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (PODS 2003), San Diego, pp 252–259

    Google Scholar 

  2. Hellerstein JM (1994) The Rd-tree: an index structure for sets. Technical report no. 1252, University of Wisconsin, Madison

    Google Scholar 

  3. Karimi HA, Liu X (2003) A predictive location model for location-based services. In: Proceedings of the 11st ACM international symposium on advances in geographic information systems (GIS 2003), New Orleans, pp 126–133

    Google Scholar 

  4. Mamoulis N, Cheung D, Lian W (2003) Similarity search in sets and categorical data using the signature tree. In: Proceedings of the 19th international conference on data engineering, Bangalore, 2003. IEEE Computer Society, Washington, DC, pp 75–86

    Google Scholar 

  5. Morzy M, Morzy T, Nanopoulos A (2003). Hierachical bitmap index: an efficient and scalable indexing technique for set-valued attribute. In: Proceedings of ADBIS’03, Berlin, pp. 236–252

    Google Scholar 

  6. Tao Y, Faloutsos C, Papadias D, Liu B (2004) Prediction and indexing of moving objects with unknown motion patterns. In: Proceedings of the 2004 ACM SIGMOD international conference on management of data (SIGMOD 2004), Paris, pp 611–622

    Google Scholar 

  7. Xu B, Wolfson O (2003) Time-series prediction with applications to traffic and moving objects databases. In: Proceedings of the 3rd ACM international workshop on data engineering for wireless and mobile access (MobiDE 2003), San Diego, pp 56–60

    Google Scholar 

  8. Zaki MJ (2001) SPADE: an efficient algorithm for mining frequent sequences. Mach Learn 42(1/2):31–60

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Tsinghua University Press, Beijing and Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Meng, X., Ding, Z., Xu, J. (2014). Trajectory Prediction of Moving Objects. In: Moving Objects Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38276-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38276-5_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38275-8

  • Online ISBN: 978-3-642-38276-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics