Answers are grounded in this paper and cite their sources.
Proposed method reduces repetitive graph scanning while improving pathfinding efficiency.
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.
No takes yet. Share an insight, caveat, or question.
Tarigan et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: