Difference between revisions of "Accessibility Map"
| Line 16: | Line 16: | ||
Paths, Buildings, Distances | Paths, Buildings, Distances | ||
| + | -we will be collecting data to input into our algorithm | ||
| + | -this will include routes both handicapped accessible and not | ||
'''Algorithm''' | '''Algorithm''' | ||
Dijkstra's Algorithm | Dijkstra's Algorithm | ||
| + | - with inputed data distances, this will compute the shortest distance between a destination and current location | ||
'''Display''' | '''Display''' | ||
| Line 25: | Line 28: | ||
Website | Website | ||
ArcGIS | ArcGIS | ||
| + | - we want to display the fastest route using a website display. | ||
==Challenges== | ==Challenges== | ||
Revision as of 22:41, 14 February 2018
Team Members
Hannah Smith
Zahra Wright
Noah Kastelman
John Gibson (TA)
Description
We are creating an “Accessibility Map” program available to WashU students and visitors. This map will tell you the most efficient route to take while on the WashU campus. This will allow students or visitors to get different places as quickly as they can. It will also be able to tell you the best route if you are handicap by taking out the pathways that are not handicap accessible.
Components
Map
Paths, Buildings, Distances -we will be collecting data to input into our algorithm -this will include routes both handicapped accessible and not
Algorithm
Dijkstra's Algorithm - with inputed data distances, this will compute the shortest distance between a destination and current location
Display
Website ArcGIS - we want to display the fastest route using a website display.
Challenges
As a group, we will have challenges adapting to a new coding language (python) and adjusting our algorithm, GIS, to match our goals. Because we have never created a webpage, using an algorithm to make walking WashU's campus easier, will be hard to develop.
Gantt Chart
