Querying Mobile Objects in Road Networks

Student thesis: Master thesis (including HD thesis)

  • Eva Blazquez
  • Jose A. Ruano
4. term, Computer Science, Master (Master Programme)
In this report, we are going more deeply into the problem of the nearest neighbor. We deal with the problem of a object, moving or static in a road network, that wants to find its nearest neighbors, which are also static or mobile objects. The mobile object will get the route that allows them meet in the faster way, according to the direction and the others resctrictions of the road. We include a partial solution to the reverse nearest neighbor and a first approximation to the traffic jam problem. Finally, we test the k-nearest neighbors algorithm and we present the results.
Publication dateJun 2003
ID: 61058125