Please use this identifier to cite or link to this item:
|Title:||ScenicRoute A travel-app that takes you from point A to B via points of interest in a given amount of time|
|Abstract:||This paper proposes a just-in-time routing algorithm and web application to en- hance the way people travel by helping them explore unfamiliar cities. We research a method to nd an interesting path from some point A to B via multiple points of interest (POI) and encapsulate this in a web application. There are three components to this body of work. Firstly, we devise a shortest path algorithm for pedestrian paths which is e cient in both memory and time based on the A star search algorithm. Sec- ondly, we build an online algorithm that dynamically incorporates multiple points of interests (POIs) into our route using the Smallest Increase Heuristic and Prim's Algo- rithm. Finally, we combine these components to build a travel web application which when given a starting point, destination and time constraint returns a reasonably ef- cient path from the starting point to the destination via multiple POIs in the given amount of time. 2|
|Type of Material:||Princeton University Senior Theses|
|Appears in Collections:||Computer Science, 1988-2016|
Files in This Item:
|Sinha_Asavari_2016_Thesis.pdf||1.23 MB||Adobe PDF||Request a copy|
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.