Abstract
The paper presents a review on a new algorithm for path finding, namely Depth Direction A* Algorithm, which uses linear graph theory in collaboration with A* Algorithm. The algorithm increases the efficiency of A* Algorithm for avoiding obstacles and finding the path of minimum distance to its goal in any map. Further, the path is more naturalistic, data structure requires less number of nodes for expansion and computation, and less memory is required. To prove this, we compare the results obtained by using various pathfinding algorithms such Dijkstra’s, BFS, DFS, A*, and Depth Direction A*.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Educational Overview of AI (1997) The history of artificial intelligence
Hu J, Wan WG, Yu X (2012) A pathfinding algorithm in real-time strategy game based on unity3D
Padmanabhan V, Goud P, Pujari AK, Sethy H (2015) Learning in real-time strategy games. In: 2015 14th international conference on information technology
Ng PHF, Li YJ, Shiu SCK (2011) Unit formation planning in RTS game by using potential field and fuzzy integral. In: 2011 IEEE international conference on fuzzy systems
Khantanapoka K, Chinnasarn K (2009) Pathfinding of 2D & 3D game real-time strategy with depth direction A* algorithm for multi-layer. In: Eighth international symposium on natural language processing
Yang C-W, Lee T-H, Huang C-L, Hsu K-S (2016) Unity 3D production and environmental perception vehicle simulation platform. IEEE-ICAMSE
Angel D (2015) A breadth first search approach for minimum vertex cover of grid graphs. In: IEEE sponsored 9th international conference on intelligent systems and control (ISCO)
Tarjan R. “DEPTH-FIRST SEARCH .ANI) LmEAR GRAm ALGORITHMS
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Singh, A., Agrawal, A., Patil, P., Pal, P., Udawant, P. (2018). A New Way to Find Way Using Depth Direction A*. In: Kolhe, M., Trivedi, M., Tiwari, S., Singh, V. (eds) Advances in Data and Information Sciences. Lecture Notes in Networks and Systems, vol 38. Springer, Singapore. https://doi.org/10.1007/978-981-10-8360-0_18
Download citation
DOI: https://doi.org/10.1007/978-981-10-8360-0_18
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-8359-4
Online ISBN: 978-981-10-8360-0
eBook Packages: EngineeringEngineering (R0)