Design of Simulation Program for Analysis of Shortest Path Algorithms in Grid-Based Path Planning
This study examines the analysis of algorithms used to find the shortest path between cells with different terrain types and elevation levels on a map comprising hexagonal cells ranging from 91 to 7651. A simulation program is designed for the analysis. The simulation program is implemented using th...
Saved in:
| Main Authors: | İbrahim Şanlialp, İbrahim Yandı |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Gazi University
2025-03-01
|
| Series: | Gazi Üniversitesi Fen Bilimleri Dergisi |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/tr/pub/gujsc/issue/90949/1570730 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm
by: Yijie Zhang, et al.
Published: (2025-06-01) -
An Algorithm to Find the Shortest Path through Obstacles of Arbitrary Shapes and Positions in 2D
by: Gilles Labonté
Published: (2024-09-01) -
The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
by: Alexander Valeryevich Smirnov
Published: (2023-04-01) -
Threaded block-parallel algorithm for finding the shortest paths on graph
by: O. N. Karasik, et al.
Published: (2019-06-01) -
The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph
by: Alexander Valeryevich Smirnov
Published: (2022-12-01)