research-article

Hiking Path Planning Algorithm Based on Dynamic Parameters and Anisotropy in Field Integrated Terrain

Authors:

Qunyao Tan,

Shuai WangAuthors Info & Claims

ICRAI '22: Proceedings of the 8th International Conference on Robotics and Artificial Intelligence

Pages 64 - 68

https://doi.org/10.1145/3573910.3573923

Published: 20 January 2023 Publication History

Get Access

Abstract

The purpose of this paper is to solve hiking path planning in the field integrated terrain and establish a method (DA-FM2) to find the shortest path based on anisotropy and dynamic parameters. In combination with geographical characteristics, the cost function of this method is creatively represented as the weighted sum of isotropic and anisotropic factors, which comprehensively uses the isotropic and anisotropic algorithms to meet the needs of path finding with the lowest cost. Simulation results show that DA-FM2 algorithm has good stability and reliability.

References

[1]

Xue, Y., Clelland, D., Lee, B.S., & Han, D. (2011). Automatic simulation of ship Navigation. Ocean Engineering, 38 (17-18), 2290-2305.

Crossref

Google Scholar

[2]

Garrido, S., Á lvarez, D., & Moreno, L. (2016). Path planning for mars rovers using the fast marching method. In Robot 2015: Second Iberian Robotics Conference (pp. 93-105). Springer, Cham.

Google Scholar

[3]

Rawlinson, N., & Sambridge, M. (2005). The fast marching method: an effective tool for tomographic imaging and tracking multiple phases in complex layered media. Exploration Geophysics, 36 (4), 341-350.

Crossref

Google Scholar

[4]

Liao, W., Rohr, K., & Wörz, S. (2013, September). Global optimal curvature-regulated fast marching for vessel segmentation. In International Conference on Medical Image Computing and Computer-Assisted Intervention (pp. 550-557). Springer, Berlin, Heidelberg.

Google Scholar

[5]

Shuai Wang and Wingting Su 2021 J. Phys.: Conf. Ser. 1961 012038

Google Scholar

[6]

Sethian, J.A. (1999). Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision and Materials Sciences. UK, Cambridge: Cambridge University Press.

Google Scholar

[7]

Kimmel, R. & Sethian, J. A. (1998). Proc. Natl. Acad. Sci. USA 95, 8431-8435.

Crossref

Google Scholar

[8]

Sethian, J. A., & Vladimirsky, A. (2001). Ordered upwind methods for static Hamilton-Jacobi equations. Proceedings of the National Academy of Sciences, 98 (20), 11069-11074.

Crossref

Google Scholar

Index Terms

Hiking Path Planning Algorithm Based on Dynamic Parameters and Anisotropy in Field Integrated Terrain
1. Human-centered computing
  1. Visualization
    1. Visualization application domains
      1. Geographic visualization
2. Information systems
  1. Information systems applications
    1. Spatial-temporal systems

Index terms have been assigned to the content through auto-classification.

Recommendations

Shortest monotone descent path problem in polyhedral terrain

Given a polyhedral terrain with n vertices, the shortest monotone descent path problem deals with finding the shortest path between a pair of points, called source (s) and destination (t) such that the path is constrained to lie on the surface of the ...
Path planning on a compressed terrain
GIS '08: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems

We present a better algorithm for path planning on complex terrain in the presence of observers and define several metrics related to path planning to evaluate the quality of various terrain compression strategies.

The path-planning algorithm simulates ...
An Algorithm to Find the kth Shortest Path in Halin Networks
IITAW '08: Proceedings of the 2008 International Symposium on Intelligent Information Technology Application Workshops

K shortest path problem finds the kth shortest path from the source node to the destination node. It’s known that the k shortest path problem is NP-complete. In this paper, we restrict the problem in Halin Networks and give an algorithm to find the kth ...

Comments

Information & Contributors

Information

Published In

ICRAI '22: Proceedings of the 8th International Conference on Robotics and Artificial Intelligence

November 2022

89 pages

ISBN:9781450397544

DOI:10.1145/3573910

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 January 2023

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ICRAI 2022

ICRAI 2022: 2022 8th International Conference on Robotics and Artificial Intelligence

November 18 - 20, 2022

Singapore, Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
37
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)1

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Abstract

References

Index Terms

Recommendations

Shortest monotone descent path problem in polyhedral terrain

Path planning on a compressed terrain

An Algorithm to Find the kth Shortest Path in Halin Networks

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Login options

Full Access

View options

PDF

eReader

HTML Format

Share

Share this Publication link

Share on social media

Affiliations