A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Algorithms for Nearest Neighbor Search on Moving Object Trajectories
2007
Geoinformatica
Preserved Fulltext
In this paper, we investigate mechanisms to perform NN search on R-tree-like structures storing historical information about moving object trajectories. ...
Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. ...
We also thank the anonymous reviewers for providing valuable comments which improved the quality of the paper. ...
doi:10.1007/s10707-006-0007-7
fatcat:gpwumvhwifhkldm235ygmxxzve
Approximate Continuous K Nearest Neighbor Queries for Continuous Moving Objects with Pre-defined Paths
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Continuous K nearest neighbor queries (C-KNN) on moving objects retrieve the K nearest neighbors of all points along a query trajectory. ...
The cost includes the location updates of the moving objects when the velocities change over time and the number of continuous KNN queries posed by the moving object to the server. ...
The continuous nearest neighbor search has been defined as the set of nearest points to all points on a given moving object's path. Song et al. ...
doi:10.1007/11568346_29
fatcat:zpsvxqsem5dzlklf5ecyv7xjui
Nearest Neighbor Search on Moving Object Trajectories
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate mechanisms to perform NN search on R-tree-like structures storing historical information about moving object trajectories. ...
Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. ...
We are grateful to Emphasis Telematics S.A. for providing the real Buses and Trucks datasets. ...
doi:10.1007/11535331_19
fatcat:6jy5iwygh5csbgzfyif6hc5ana
Efficient mutual nearest neighbor query processing for moving object trajectories
2010
Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In addition, we extend our techniques to tackle historical continuous MNN (HCMNN) search for moving object trajectories, which returns the mutual nearest neighbors of q (for a specified k 1 and k 2 ) at ...
the k 1 nearest neighbors (NNs) of q within C, and meanwhile, have q as one of their k 2 NNs. ...
In this paper, we introduce and solve a new type of queries, namely, mutual nearest neighbor (MNN) search for moving object trajectories. ...
doi:10.1016/j.ins.2010.02.010
fatcat:rdg3hpwcbrhjpnb2x43qje6n24
Algorithms for constrained k-nearest neighbor queries over moving object trajectories
2009
Geoinformatica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic focuses on the closest trajectories in the whole data space. ...
In this paper, we introduce and solve constrained k-nearest neighbor (CkNN) queries and historical continuous CkNN (HCCkNN) queries on R-tree-like structures storing historical information about moving ...
Acknowledgements We would like to thank Elias Frentzos for his useful feedback on the source-codes of the proposed algorithms in [10, 11] . ...
doi:10.1007/s10707-009-0084-5
fatcat:aaaf27oqozcsdnktbtth626qg4
Scalable Continuous Query Processing and Moving Object Indexing in Spatio-temporal Databases
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We focus on two aspects of spatio-temporal database systems: 1) the query processing algorithms for a large set of concurrent queries, and 2) the underlying indexing structures for constantly moving objects ...
For continuous query processing, we explore the techniques of Incremental Evaluation and Shared Execution, especially to k-nearest-neighbor queries. ...
Specifically, we propose the SEA-CNN algorithm for evaluating a large set of continuous k-Nearest-Neighbor queries. ...
doi:10.1007/11896548_2
fatcat:bk2hujyfgfgo5gdznitwcipyde
Special issue on data management for mobile services
2011
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This special issue focuses on managing information about moving objects in space and time, both for online applications and for analysis of 'historical' trajectory data. ...
The complex form of trajectory data obtained from objects (typically moving in road networks) calls for specialized methods for indexing, in order to meet the demands of online query evaluation. ...
results; based on this, they propose efficient algorithms for query evaluation, with a special focus on the case where objects are moving along road networks. ...
doi:10.1007/s00778-011-0250-x
fatcat:syidvlat35h3vliureceixmivy
A Trajectory Privacy Preserving Scheme in the CANNQ Service for IoT
2019
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Furthermore, an aggregate nearest neighbor query algorithm based on strategy optimization, is adopted, to minimize the overhead of the LSP. ...
The response speed of the results is improved by narrowing the search scope of the points of interest (POIs) and speeding up the prune of the non-nearest neighbors. ...
The main idea is, first, calculate the centroid of the group, and then specify that all users search for the nearest neighbors, based on the principle of 'Towards the Centroid', then search for the nearest ...
doi:10.3390/s19092190
fatcat:73wfdz5pqzfplj3foswlzykdly
Kinetic Nearest Neighbor Search in Black-Box Model
2018
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, a new algorithm is presented for kinetic nearest neighbor search problem in the black-box model, under assumptions on the distribution of the moving point set P. ...
In this study, a nearest neighbor search is presented to move points in the plane, while query point is static. ...
The nearest neighbor search is latter type; so as previously mentioned, the algorithm does not need to ask for all new positions at every time step. ...
doi:10.5281/zenodo.3808272
fatcat:vbpcsfpc7jgnxow5qomtbqxg2q
Kinetic Nearest Neighbor Search in Black-Box Model
[article]
2021
figshare.com
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, a new algorithmis presented for kinetic nearest neighbor search problemin the black-box model, under assumptions on the distribution of the moving point set P. ...
Model, Kinetic, Nearest Neighbor. ...
The nearest neighbor search is latter type; so as previously mentioned, the algorithm does not need to ask for all new positions at every time step. ...
doi:10.6084/m9.figshare.14348075.v1
fatcat:b2txvklb55fqnbqkcnf4syfix4
Grid-based k-Nearest Neighbor Queries over Moving Object Trajectories with MapReduce
2017
International Journal of Database Theory and Application
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
k-Nearest Neighbor Trajectory (k-NNT) Query is a basic and important spatial query operation widely used in many fields, such as intelligent transportation and urban planning. ...
Therefore, in order to support the efficient k-NNT query algorithm in distributed environment, we provide a grid index for trajectory data and an auxiliary structure of the trajectory rebuilding table ...
Preliminaries For simplicity, we use Euclidean space to describe the trajectory of moving objects. ...
doi:10.14257/ijdta.2017.10.4.01
fatcat:k6svhyionjfo7naznjs5cmjv3e
Interval-Based Nearest Neighbor Queries over Sliding Windows from Trajectory Data
2009
2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a new type of query for moving object trajectories -Continuous Interval-based Nearest Neighbor (CINN) Query. ...
Extensive experiment results on large trajectory datasets show that CINN queries can be effectively answered using our proposed algorithms. ...
Nearest neighbor (NN) query is one of the most important queries in both static spatial databases and moving object databases. ...
doi:10.1109/mdm.2009.32
dblp:conf/mdm/HuangZ09
fatcat:hn725i7efzaaxcoxxctgf5modi
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
2017
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
More generally, we consider a data structure version of the problem: for any linearly moving query point q, we want a (1 + )-factor approximation to the minimum nearest neighbor distance to q over time ...
Given a set of n moving points in R d , where each point moves along a linear trajectory at arbitrary but constant velocity, we present anÕ(n 5/3 )-time algorithm 1 to compute a (1 + )-factor approximation ...
There have been previous papers on approximate nearest neighbor search in the setting when the data objects are lines and the query objects are points [13] , or when the data objects are points and the ...
doi:10.1016/j.comgeo.2016.04.001
fatcat:sit6kpdoyzhf5md4yp6iz2cmoy
Efficient k-nearest neighbor search on moving object trajectories
2010
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper we consider the following problem: Given a set of moving object trajectories D and a query trajectory mq, find the k nearest neighbors to mq within D for any instant of time within the life ...
Nearest neighbor search is a fundamental problem in spatial and spatio-temporal databases. ...
We also thank the anonymous referees for their valuable suggestions for improvement. ...
doi:10.1007/s00778-010-0185-7
fatcat:ne2htenb55cm5jaspmabe6ifyi
MOPL: A multi-modal path planner for generic manipulation tasks
2015
2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
For intelligent robots to solve real-world tasks, they need to manipulate multiple objects, and perform diverse manipulation actions apart from rigid transfers, such as pushing and sliding. ...
Our evaluation shows that this generic search technique allows MOPL to solve several challenging scenarios over different types of kinematics and tools with reasonable performance. ...
ACKNOWLEDGEMENTS The authors would like to thank Torsten Kröger for his help with the Kuka experiments. This research was supported by the European Union's Seventh Framework Programme ...
doi:10.1109/iros.2015.7354263
dblp:conf/iros/JentzschGKK15
fatcat:jfco3sq62bg3hohke6yck4a4fq
« Previous
Showing results 1 — 15 out of 13,909 results