Computational Model Library

Least cost path mobility (version 2.0.0)

This model tries to mimic human behavior in a topographical environment. It aims to go beyond the GIS approach to least-cost path that requires perfect knowledge of the whole environment to choose the best path between two points. This model is different in that the agent does not have a perfect knowledge of the whole surface, but rather evaluates the best path locally, at each step, thus mimicking imperfect human behavior more accurately. It relies on the work by Naismith (1892, in Aitken 1977) and Langmuir (1984) on walking time expenditure in rugged environments. Their walking time values are used to calculate the agent’s travel time.

v. 1.3.0 introduces the Lorentz mobility algorithm, created by Campbell et al. (2019) using fitness trackers. It also allows for multiple hikers and goals.

Release Notes

This new release is a more user-friendly version of the model. On modes Grid, Import, and startRadius, it creates multiple hikers and goals to avoid having to run the model multiple times to iterate through combinations of start-end points.

It also introduces the Lorentz algorithm to calculate walking speed, which is calibrated based on fitness tracking data collated and analyzed by Campbell et al. (2019).

For this version, the user no longer needs to move the GIS maps to a different folder. The GIS maps should stay in the folder structure found when downloading the model (GIS maps in data, model in code).

Download Version 2.0.0
Version Submitter First published Last modified Status
2.0.0 Claudine Gravel-Miguel Mon Oct 4 20:33:41 2021 Mon Oct 4 20:33:41 2021 Published
1.2.0 Claudine Gravel-Miguel Thu May 30 23:20:23 2019 Thu May 30 23:20:23 2019 Published Peer Reviewed
1.1.0 Claudine Gravel-Miguel Wed Aug 29 17:06:37 2018 Wed Aug 29 17:06:37 2018 Published


This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.