SafeRoute
Authors:
Open Access
- 27 September 2020
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
- Vol. 11 (6) , 1-17
Abstract
Recent studies show that 85% of women have changed their traveled routes to avoid harassment and assault. Despite this, current mapping tools do not empower users with information to take charge of their personal safety. We propose SafeRoute, a novel solution to the problem of navigating cities and avoiding street harassment and crime. Unlike other street navigation applications, SafeRoute introduces a new type of path generation via deep reinforcement learning. This enables us to successfully optimize for multi-criteria path-finding and incorporate representation learning within our framework. Our agent learns to pick favorable streets to create a safe and short path with a reward function that incorporates safety and efficiency. Given access to recent crime reports in many urban cities, we train our model for experiments in Boston, New York, and San Francisco. We test our model on areas of these cities, specifically the populated downtown regions with high foot traffic. We evaluate SafeRoute and successfully improve over state-of-the-art methods by up to 17% in local average distance from crimes while decreasing path length by up to 7%.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- node2vec2016
- Mastering the game of Go with deep neural networks and tree searchNature, 2016
- The shortest path to happiness2014
- SocRoutes2014
- Modeling of route planning system based on Q value-based dynamic programming with multi-agent reinforcement learning algorithmsEngineering Applications of Artificial Intelligence, 2014
- Walking Distance by Trip Purpose and Population SubgroupsAmerican Journal of Preventive Medicine, 2012
- Simple statistical gradient-following algorithms for connectionist reinforcement learningMachine Learning, 1992
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Remarks on Some Nonparametric Estimates of a Density FunctionThe Annals of Mathematical Statistics, 1956