Skip to content

[Feat] New walking speed algorithm for r.walk #2042

@rbanick

Description

@rbanick

R.walk uses Langmuir's walking speed algorithm to calculate walking speeds. Langmuir's algorithm is essentially a souped-up version of Naismith's rule, an approximate heuristic developed in the late 19th century. Recent empirical work has returned more accurate walking speed algorithms based on actual data collected under experimental conditions.

This newer work tends to return significantly different speed values from Langmuir's algorithm, and to a lesser extent the popular Tobler's algorithm, particularly at moderate slopes. This would naturally lead to significantly different costs being generated by r.walk, particularly in areas where walking is a primary modality. See Figures 4 - 10 in the below linked article for a graphical illustration of this.

I would like to suggest that the GRASS team incorporate one of the newer, empirical walking speed algorithms as r.walk's default. I am most familiar with that developed by Irmischer and Clarke (2018, https://www.tandfonline.com/doi/abs/10.1080/15230406.2017.1292150) and would advocate for it.

I am open to other possibilities, though I'm only aware of similarly empirical work from Marquéz-Pérez (2017, https://www.tandfonline.com/doi/full/10.1080/00167223.2017.1316212?src=recsys). Pingel (2013, https://www.tandfonline.com/doi/abs/10.1559/152304010791232163?src=recsys) also convincingly argues that humans perceive slopes to be more costly than they are and route accordingly -- but I'm not sure how to integrate that in with the above algorithms.

Metadata

Metadata

Assignees

No one assigned

    Labels

    enhancementNew feature or request

    Type

    No type

    Projects

    No projects

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions