Dynamic Programming-based Pedestrian Hotspot Identification Approach

Aditya Medury and Offer Grembek

Institute of Transportation Studies, Research Reports, Working Papers, Proceedings from Institute of Transportation Studies, UC Berkeley

Abstract: Network screening techniques are widely used by state agencies to identify locations with high collision concentration, also referred to as hotspots. However, most of the research in this regard has focused on identifying highway segments that are of concern to automobile collisions. A major difference between pedestrian and automobile hotspots is that pedestrian-based conflicts are more likely to arise in localized regions, such as near intersections, mid-blocks, and/or other crossings, as opposed to along long stretches of roadway. Hence, in order to address this issue, a dynamic programming-based hotspot identification approach is proposed which provides efficient hotspot definitions for pedestrian crashes. The proposed approach is compared with the sliding window method and the results reveal that the dynamic programming method generates more hotspots with a higher number of crashes, while covering fewer miles.

Keywords: Engineering; safeTREC (search for similar items in EconPapers)
Date: 2014-11-15
New Economics Papers: this item is included in nep-tre
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.escholarship.org/uc/item/10d0x1z7.pdf;origin=repeccitec (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cdl:itsrrp:qt10d0x1z7

Access Statistics for this paper

More papers in Institute of Transportation Studies, Research Reports, Working Papers, Proceedings from Institute of Transportation Studies, UC Berkeley Contact information at EDIRC.
Bibliographic data for series maintained by Lisa Schiff ().