A master thesis from Aalborg University
Querying Mobile Objects in Road Networks
Author(s)
Term
4. term
Education
Publication year
2003
Submitted on
2012-02-14
Abstract
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.
Documents
Colophon: This page is part of the AAU Student Projects portal, which is run by Aalborg University. Here, you can find and download publicly available bachelor's theses and master's projects from across the university dating from 2008 onwards. Student projects from before 2008 are available in printed form at Aalborg University Library.
If you have any questions about AAU Student Projects or the research registration, dissemination and analysis at Aalborg University, please feel free to contact the VBN team. You can also find more information in the AAU Student Projects FAQs.