Modeling Accessibility-Constrained Networks with Time-Weighted Graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917214083350528 |
|---|---|
| author | Walden, Marc Liu, Jason Liu, Ryan Khan, Hamza |
| author_facet | Walden, Marc Liu, Jason Liu, Ryan Khan, Hamza |
| contents | Accessibility for the physically disabled is a prevalent issue on university campuses, where stairs and steep slopes make navigating campus arduous. Our work proposes a pipeline to model a college campus as a network by combining Strava and other APIs with depth-first search to derive insights into wheelchair-accessible paths. We then develop a custom Least Resistance algorithm to compute optimal paths between selected nodes and benchmark it against Dijkstra's algorithm. We highlight crucial nodes on campus using centrality measures, demonstrating that wheelchair users are significantly constrained by the lack of mobility options and accommodations. Our pipeline is designed to support future expansion in scope and accuracy, while enabling the proposal of engineering solutions to improve campus accessibility for physically disabled individuals. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_14278 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Modeling Accessibility-Constrained Networks with Time-Weighted Graphs Walden, Marc Liu, Jason Liu, Ryan Khan, Hamza Physics and Society Accessibility for the physically disabled is a prevalent issue on university campuses, where stairs and steep slopes make navigating campus arduous. Our work proposes a pipeline to model a college campus as a network by combining Strava and other APIs with depth-first search to derive insights into wheelchair-accessible paths. We then develop a custom Least Resistance algorithm to compute optimal paths between selected nodes and benchmark it against Dijkstra's algorithm. We highlight crucial nodes on campus using centrality measures, demonstrating that wheelchair users are significantly constrained by the lack of mobility options and accommodations. Our pipeline is designed to support future expansion in scope and accuracy, while enabling the proposal of engineering solutions to improve campus accessibility for physically disabled individuals. |
| title | Modeling Accessibility-Constrained Networks with Time-Weighted Graphs |
| topic | Physics and Society |
| url | https://arxiv.org/abs/2601.14278 |