eprintid: 10191751
rev_number: 6
eprint_status: archive
userid: 699
dir: disk0/10/19/17/51
datestamp: 2024-05-09 15:27:16
lastmod: 2024-05-09 15:27:16
status_changed: 2024-05-09 15:27:16
type: article
metadata_visibility: show
sword_depositor: 699
creators_name: Sprent, Rafael Felipe
creators_name: Haworth, James
creators_name: Cavazzi, Stefano
creators_name: Ilyankou, Ilya
title: Multi-Criteria Framework for Routing on Access Land: A Case Study on Dartmoor National Park
ispublished: pub
divisions: UCL
divisions: B04
divisions: C05
divisions: F44
keywords: Open space; pedestrian; shortest path; surface effects; multiple criteria;Weighted Sum–Dijkstra’s algorithm; graph databases
note: This work is licensed under a Creative Commons Attribution 4.0 International License. The images
or other third-party material in this article are included in the Creative Commons license,
unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license,
users will need to obtain permission from the license holder to reproduce the material. To view a copy of this
license, visit http://creativecommons.org/licenses/by/4.0/
abstract: Creating routes across open areas is challenging due to the absence of a defined routing network and the complexity of the environment, in which multiple criteria may affect route choice. In the context of urban environments, research has found Visibility and Spider-Grid subgraphs to be effective approaches that generate realistic routes. However, the case studies presented typically focus on plazas or parks with defined entry and exit points; little work has been carried out to date on creating routes across open areas in rural settings, which are complex environments with varying terrain and obstacles and undefined entry or exit points. To address this gap, this study proposes a method for routing across open areas based on a Spider-Grid subgraph using queen contiguity. The method leverages a Weighted Sum–Dijkstra’s algorithm to allow multiple criteria such as surface condition, total time, and gradient to be considered when creating routes. The method is tested on the problem of routing across two areas of Dartmoor National Park, United Kingdom. The generated routes are compared with benchmark algorithms and real paths created by users of the Ordnance Survey’s Maps App. The generated routes are found to be more realistic than those of the benchmark methods and closer to the real paths. Furthermore, the routes are able to bypass hazards and obstacles while still providing realistic and flexible routes to the user.
date: 2024-04-14
date_type: published
publisher: MDPI AG
official_url: http://dx.doi.org/10.3390/ijgi13040130
oa_status: green
full_text_type: pub
language: eng
primo: open
primo_central: open_green
verified: verified_manual
elements_id: 2270878
doi: 10.3390/ijgi13040130
lyricists_name: Haworth, James
lyricists_id: JHAWO13
actors_name: Flynn, Bernadette
actors_id: BFFLY94
actors_role: owner
full_text_status: public
publication: ISPRS International Journal of Geo-Information
volume: 13
number: 4
article_number: 130
citation:        Sprent, Rafael Felipe;    Haworth, James;    Cavazzi, Stefano;    Ilyankou, Ilya;      (2024)    Multi-Criteria Framework for Routing on Access Land: A Case Study on Dartmoor National Park.                   ISPRS International Journal of Geo-Information , 13  (4)    , Article 130.  10.3390/ijgi13040130 <https://doi.org/10.3390/ijgi13040130>.       Green open access   
 
document_url: https://discovery.ucl.ac.uk/id/eprint/10191751/1/ijgi-13-00130-v2.pdf