Update 3 and Summary – Optimization of Tribe Pathways

This is the final update and summary of the project thus far. I am happy to say data transcription and mapping are finally finished.  Below is the simplified map I created based off of the data I collected on campus. Compared to the official campus map available on the William and Mary website, the new set of data includes multiple new paths, does not show buildings or pathways which no longer exist, and contains data on the features of each pathway in the code. This new map is not intended to be used to navigate but offers the opportunity to display the data I collected.

[Read more…]

Update 2 – Optimization of Tribe Pathways

Since the last update, I have gathered all data needed to create a map of campus. Working with the timeline I set up at the beginning of the project, it would not be feasible to map the entirety of campus. Instead, I spent two days on campus walking paths and recording data for a smaller section of the map. I made sure to include all different kinds of path features in the area I selected and that the area was used enough so that the program could still be useful. Adding the rest of campus would not require changing anything or adding new features, only inputting more data. This choice was based off of time constraints and not technical difficulty.

[Read more…]

Update 1 – Optimization of Tribe Pathways

At this point in time, I have finished coding the core structure of the algorithm in python. Given a point on a map, the program will output the shortest distance from the start point to every other point on the map and record the path it takes to get there. For the next step in the project, I hope to organize the single script into a class with multiple functions contained within it. I have tested the algorithm enough to be certain that it functions correctly, but there may be some bugs in the programming I have not yet encountered. There is also a fair bit of optimization that could go into the program and there needs to be an easier way to input map data. That being said, with the small sample graphs I have been using, the results are almost instantaneous.

[Read more…]

Abstract – Optimization of Tribe Pathways

With my freshman research project, I propose to create a program that will use data from the walkways on the William & Mary campus to calculate the shortest route from one point to another based off a set of conditions. These conditions will allow users to avoid specific paths per their limitations or desires. Examples of these conditions would be paths with stairways in them, unpaved walkways, or paths that go through forested areas. The program will allow students to select a starting point, an ending point, and to decide which kind of pathways they want to avoid or include before calculating the shortest path they can take based on the remaining walkways. To calculate the shortest route, I will be implementing Dijkstra’s Algorithm into python. This algorithm will calculate the optimal path on a graph of connected nodes based on distance. I hope to help students who are new to campus, those that cannot use stairways or other potentially difficult obstacles, or anyone who wishes to find a faster path to class.