Querying Mobile Objects in Road Networks
Authors
Blazquez, Eva ; Ruano, Jose A.
Term
4. term
Education
Publication year
2003
Abstract
Denne rapport undersøger nærmeste-nabo problemet i et vejnet. Vi ser på, hvordan både bevægelige og stationære objekter kan finde deres nærmeste naboer blandt andre stationære eller mobile objekter. For et mobilt objekt beregner vi den rute, der gør det muligt at mødes hurtigst muligt, under hensyntagen til vejretning og andre begrænsninger i vejnettet. Vi præsenterer desuden en delvis løsning på problemet med omvendt nærmeste nabo (altså hvilke objekter der ville betragte et givet objekt som deres nærmeste) samt en første tilgang til at håndtere trafikpropper. Til sidst afprøver vi k-nærmeste-nabo (k-NN) algoritmen og præsenterer resultaterne.
This report examines the nearest neighbor problem in a road network. We study how both moving and stationary objects can find their nearest neighbors among other static or mobile objects. For a moving object, we compute the route that allows it to meet a chosen neighbor as quickly as possible, taking into account road direction and other network constraints. We also include a partial solution to the reverse nearest neighbor problem (identifying which objects would consider a given object their nearest) and a first step toward handling traffic jams. Finally, we test the k-nearest neighbors (k-NN) algorithm and present the results.
[This abstract was generated with the help of AI]
Documents