Algorithm for Automatic Path Routing in Mountain Areas

被引:1
|
作者
Adamek, Katarzyna [1 ]
Lupa, Michal [1 ]
Sarlej, Wojciech [1 ]
机构
[1] AGH Univ Sci & Technol, Dept Geoinformat & Appl Comp Sci, Al Mickiewicza 30, PL-30059 Krakow, Poland
来源
WORLD MULTIDISCIPLINARY EARTH SCIENCES SYMPOSIUM (WMESS 2018) | 2019年 / 221卷
关键词
D O I
10.1088/1755-1315/221/1/012081
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
The main purpose of the research is to achieve a fully automated technique for calculation of new trails in the mountain areas. The main idea is to provide the user with a possibility to move around the area regardless of the existing routes, which can make the user independent of using trails. Such a concept is nowadays getting a lot of attention due to the growing need for revitalisation and enabling new areas to be used for tourism and educational purposes. Moreover, the proposed solution can become a useful tool for emergency services, foresters or park employees. The main project assumption was to create a tool able to find a new path between two locations given a set of input parameters provided by the user. The new path had to be distinct from any existing paths in the area. The algorithm was designed to be a solution for path routing in poorly recognised areas or within big acreage as it can take a long time to explore the area in enough detail manually create a plan of the new path. The result of the project is the new ArcMap toolbox, built with a help of spatial analysis tools of the ArcGIS platform. The project uses GIS methods, taking advantage of remote sensing, spatial analyses and Python scripting. This makes it possible to create an automatic tool that is able to process various data in a relatively short time (comparing to manual work on planning new paths). As the end result algorithm generates a map with least cost path, which after conversion to GPX file is ready to use with supporting devices, e.g. smartphones. The project has been verified in the surroundings of Gorczanski National Park in southern Poland. Performed tests allowed to find optimal settings and proved that an algorithm works correctly.
引用
收藏
页数:7
相关论文
共 50 条
  • [1] UAV path planning in mountain areas based on a hybrid parallel compact arithmetic optimization algorithm
    Wang, Ruo-Bin
    Wang, Wei-Feng
    Geng, Fang-Dong
    Pan, Jeng-Shyang
    Chu, Shu-Chuan
    Xu, Lin
    NEURAL COMPUTING & APPLICATIONS, 2023,
  • [2] Automatic path finding algorithm
    Goto, Y
    Nagao, H
    Nagao, T
    Hayashi, H
    CAR '98 - COMPUTER ASSISTED RADIOLOGY AND SURGERY, 1998, 1165 : 875 - 875
  • [3] A Routing Algorithm with Candidate Shortest Path
    潘启敬
    JournalofComputerScienceandTechnology, 1986, (03) : 33 - 52
  • [4] A multi-path routing algorithm base on A* algorithm
    Zhao, Qi
    Zhao, A-Qun
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2013, 35 (04): : 952 - 957
  • [5] Simple path diversity algorithm for interdomain routing
    Shieh, Y. -P.
    Hsu, W. -H.
    IET COMMUNICATIONS, 2011, 5 (16) : 2310 - 2316
  • [6] Light Search Algorithm for FPGA Routing Path
    Wang D.
    Zhang L.
    Lu X.
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2023, 35 (05): : 789 - 795
  • [7] Multiple path routing algorithm for IP networks
    Rios, M
    Marianov, V
    Avagliano, A
    COMPUTER COMMUNICATIONS, 2005, 28 (07) : 829 - 836
  • [8] A limited path unicast QoS routing algorithm
    Zheng, YX
    Tian, J
    Liu, ZF
    Dou, WH
    ISCC2004: NINTH INTERNATIONAL SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1 AND 2, PROCEEDINGS, 2004, : 870 - 875
  • [9] A Distributed Routing Algorithm Based on the Reliable Path
    Ma Zan
    Xu Zhen
    Rui Liyang
    2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 2993 - 2996
  • [10] Analyses of the reverse path forwarding routing algorithm
    Bolton, C
    Lowe, G
    2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2004, : 485 - 494