skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Owens, Justin"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract This research presents an adaptive and personalized routing model that enables individuals with mobility impairments to save their route preferences to a mobility assistant platform. The proactive approach based on anticipated user need accommodates vulnerable road users' personalized optimum dynamic routing rather than a reactive approach passively awaiting input. Most currently available trip planners target the general public's use of simpler route options prioritized based on static road characteristics. These static normative approaches are only satisfactory when conditions of intermediate intersections in the network are consistent, a constant rate of change occurs per each change of the segment condition, and the same fixed routes are valid every day regardless of the user preference. In this study, the vulnerable road user mobility problem is modeled by accommodating personalized preferences changing by time, sidewalk segment traversability, and the interaction between sidewalk factors and weather conditions for each segment contributing to a path choice. The developed reinforcement learning solution presents a lower average cost of personalized, accessible, and optimal path choices in various trip scenarios and superior to traditional shortest path algorithms (e.g., Dijkstra) with static and dynamic extensions. 
    more » « less