Finding Shortest Path on a Terrain Surface by Using Finite Element Method

01/10/2022
by   Gokhan Altintas, et al.
0

The solution of the shortest path problem on a surface is not only a theoretical problem to be solved in the field of mathematics, but also problems that need to be solved in very different fields such as medicine, defense and construction technologies. When it comes to the land specific, solution algorithms for these problems are also of great importance in terms of determination of the shortest path in an open area where the road will pass in the field of civil engineering, or route determination of manned or unmanned vehicles for various logistic needs, especially in raw terrains. In addition, path finding problems in the raw terrains are also important for manned and unmanned ground vehicles (UGV) used in the defense industry. Within the scope of this study, a method that can be used for instant route determinations within sight range or for route determinations covering wider areas is proposed. Although the examples presented within the scope of the study are land-based, the method can be applied to almost all problem types of similar nature. The approach used in the study can be briefly described as the mechanical analysis of a surface transformed into a structural load bearing system based on mechanical analogies. In this approach, the determination of the shortest path connecting two points can be realized by following the stress-strain values that will occur by moving the points away from each other or by following a linear line that will be formed between two points during the mechanical analysis. If the proposed approach is to be carried out with multiple rigid body dynamics approaches instead of flexible bodies mechanics, it can be carried out easily and very quickly by determining the shortest path between two points or by tracking the forces. However, the proposed approach in this study is presented by simulating examples of flexible bodies using FEM.

READ FULL TEXT

page 1

page 11

page 12

page 13

page 16

page 18

page 20

page 29

research
04/29/2021

Reverse Shortest Path Problem for Unit-Disk Graphs

Given a set P of n points in the plane, a unit-disk graph G_r(P) with re...
research
06/10/2019

A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs

Finding a shortest path or cycle in graphs is a fundamental problem. In ...
research
08/02/2021

Constrained Shortest Path Search with Graph Convolutional Neural Networks

Planning for Autonomous Unmanned Ground Vehicles (AUGV) is still a chall...
research
12/14/2017

Cellular Automata Applications in Shortest Path Problem

Cellular Automata (CAs) are computational models that can capture the es...
research
06/15/2022

Finding Control Synthesis for Kinematic Shortest Paths

This work presents the analysis of the properties of the shortest path c...
research
09/18/2023

The Optimized path for the public transportation of Incheon in South Korea

Path-finding is one of the most popular subjects in the field of compute...
research
12/04/2019

Differentiation of Blackbox Combinatorial Solvers

Achieving fusion of deep learning with combinatorial algorithms promises...

Please sign up or login with your details

Forgot password? Click here to reset