Multi-Criteria Framework for Routing on Access Land: A Case Study on Dartmoor National Park

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.