Reverse Tracking Graph Based on Dynamics Path Planning
Dublin Core
Title
Reverse Tracking Graph Based on Dynamics Path Planning
Subject
Reverse Tracking, Dijkstra Algorithm, Depth First Search Algorithm, pre path planning, availability path planning
Description
This paper gives substance to Dynamic Path Planning focusing on reverse tracking method. The
development of this method are proposed and expected to reduce the algorithm scanning the
whole graph repeatedly. In this paper, several approachment will be presented sequentially.
First, analysis and modeling of the obstacle and environment, pre-path planning, Depth First
Search for availability path planning, and improvement of the Dijkstra algorithm for the shortest
path. There-in the proposed model is defined by adopting the reverse feature in the Depth First
Search algorithm in the finding of the availability path on the graph.
development of this method are proposed and expected to reduce the algorithm scanning the
whole graph repeatedly. In this paper, several approachment will be presented sequentially.
First, analysis and modeling of the obstacle and environment, pre-path planning, Depth First
Search for availability path planning, and improvement of the Dijkstra algorithm for the shortest
path. There-in the proposed model is defined by adopting the reverse feature in the Depth First
Search algorithm in the finding of the availability path on the graph.
Creator
Devanta Abraham Tarigan , Muhammad Zarlis, Rahmat Widia Sembiring
Publisher
Perpustakaan Horizon Karawang
Date
2021
Contributor
Fajar bagus W
Format
PDF
Language
Indonesia
Type
Text
Files
Collection
Citation
Devanta Abraham Tarigan , Muhammad Zarlis, Rahmat Widia Sembiring, “Reverse Tracking Graph Based on Dynamics Path Planning,” Repository Horizon University Indonesia, accessed November 14, 2024, https://repository.horizon.ac.id/items/show/3363.