The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Heading Maintaining Oriented Compression Algorithm for GPS Trajectory Data
Open accessAbstract
The raw trajectories contain large amounts of redundant data that bring challenges to storage, transmission and processing. Trajectory compression algorithms can reduce the number of positioning points while minimizing the loss of information. This paper proposes a heading maintaining oriented trajectory compression algorithm, which takes into account both position information and direction information. By setting an angle threshold, the algorithm can achieve a more accurate approximation of trajectories than traditional position-preserving trajectory compression algorithms. The experimental results show that the algorithm can ensure certain effect on the direction information and is more flexible.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Understanding mobility based on GPS data
Zheng, Y., Li, Q., Chen, Y., Xie, X., & Ma, W.-Y. (2008) · Proceedings of the 10th international conference on Ubiquitous computing · doi:10.1145/1409635.1409677 · Cited by 1,132
Cited by
Agent Based Modelling and Simulation tools: A review of the state-of-art software
Abar, S., Theodoropoulos, G. K., Lemarinier, P., & O’Hare, G. M. P. (2017) · Computer Science Review · doi:10.1016/j.cosrev.2017.03.001 · Cited by 680
Artifacts in the A&A meta-model for multi-agent systems
Omicini, A., Ricci, A., & Viroli, M. (2008) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-008-9053-x · Cited by 347
Logic-based technologies for multi-agent systems: a systematic literature review
Calegari, R., Ciatto, G., Mascardi, V., & Omicini, A. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09478-3 · Cited by 117
Call graph profiling for multi agent systems
Doan Van Bien, D., Lillis, D., & Collier, R. W. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13338-1_9 · Cited by 3
Metadata
- Authors
- HAO, P., YAO, C., MENG, Q., YU, X., & LI, X.
- Venue
- Informatica
- Publisher
- Vilnius University Press
- Published
- 2019-03-19
- Volume
- 30
- Issue
- 1
- Pages
- 33-52
- ISSN
- 0868-4952 (ISSN-L)
- 1822-8844
- OpenAlex
- W2102826504
- Cited by
- 238
- References
- 1
- FWCI
- 6.11
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.