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.

中文翻译：

---

通路土地路由的多标准框架：达特穆尔国家公园案例研究

由于缺乏定义的路由网络以及环境的复杂性，在开放区域创建路由具有挑战性，其中多个标准可能会影响路由选择。在城市环境中，研究发现可见性和蜘蛛网格子图是生成真实路线的有效方法。然而，所提供的案例研究通常集中于具有明确入口和出口点的广场或公园；迄今为止，在农村开放地区修建路线方面开展的工作很少，这些地区环境复杂，地形和障碍物各不相同，出入点不明确。为了解决这一差距，本研究提出了一种基于使用皇后邻接性的蜘蛛网格子图跨开放区域进行路由的方法。该方法利用加权总和 - Dijkstra 算法，允许在创建路线时考虑多个标准，例如表面状况、总时间和坡度。该方法在英国达特穆尔国家公园两个区域的路由问题上进行了测试。将生成的路线与基准算法和英国地形测量局地图应用程序用户创建的真实路径进行比较。发现生成的路线比基准方法更真实，更接近真实路径。此外，这些路线能够绕过危险和障碍，同时仍然为用户提供现实和灵活的路线。