:: International Transaction Journal of Engineering, Management, & Applied Sciences & Technologies
http://TuEngr.com
ISSN 2228-9860
eISSN 1906-9642
CODEN: ITJEA8
FEATURE PEER-REVIEWED ARTICLE
Vol.13(6)(2022) |
Implementation and Evaluation of an Optimal Algorithm for Neural Networks Association in Machine Learning
S. Balapriya
(Sathyabama University, Chennai, INDIA),
N. Srinivasan (Department of CSE, Rajalakshmi Engineering College, Chennai, INDIA).
Disciplinary: Artificial Intelligent.
doi: 10.14456/ITJEMAST.2022.116
Keywords: A* algorithm; Pathfinding algorithm; Parallel computing; Modular programming Architecture; modularity.
AbstractThis study attempts to investigate the efficient and simple incorporation of a basic pathfinding algorithm that is suitable for students, graduates, freshmen, and scholars for exploring and upgrading research-related studies and theories. The aim of writing this paper is to present the fundamentals of AI path-finding algorithms most simply and effectively. The algorithm takes inspiration from the popular pathfinding A* algorithm used widely in modular programming architecture in association with parallel computing. This algorithm is well suitable for games or game levels created with the modular designing methodology or any application using modularity as its core foundation. The algorithm enables navigation of any game entity within the game world on a plane surface with obstacle detection.Paper ID: 13A6K
Cite this article:
Balapriya, S., N., Srinivasan.(2022). Implementation and Evaluation of an Optimal Algorithm for Neural Networks Association in Machine Learning. International Transaction Journal of Engineering, Management, & Applied Sciences & Technologies, 13(6), 13A6K, 1-11. http://TUENGR.COM/V13/13A6K.pdf DOI: 10.14456/ITJEMAST.2022.116
References
- Beamer, S., Asanovic, K and Patterson, D. (2012). Direction-optimizing breadth-first search. In SC'12: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis (pp. 1-10). IEEE.
- Luo, L., Wong, M and Hwu, W. M. (2010). An eective GPU implementation of breadthfirst search. In Design Automation Conference (pp. 52-55). IEEE.
- Awerbuch, B. (1985). A new distributed depth-first-search algorithm. Information Processing Letters, 20(3), 147-150.
- Holzmann, G. J., Peled, D. A and Yannakakis, M. (1996). On nested depth first search. The Spin Verication System, 32, 81-89.
- Duchon, F., Babinec, A., Kajan, M., Beno, P., Florek, M., Fico, T and Jurisica, L. (2014). Path planning with modied a star algorithm for a mobile robot. Procedia Engineering, 96, 59-69.
- AlShawi, I. S., Yan, L., Pan, W and Luo, B. (2012). Lifetime enhancement in wireless sensor networks using fuzzy approach and A-star algorithm.
- Yao, J., Lin, C., Xie, X., Wang, A. J., & Hung, C. C. (2010, April). Path planning for virtual human motion using improved A* star algorithm. In 2010 Seventh international conference on information technology: new generations (pp. 1154-1158). IEEE.
- Noto, M abd Sato, H. (2000). A method for the shortest path search by extended Dijkstra algorithm. In Smc 2000 conference proceedings 2000 ieee international conference on systems, man and cybernetics.'cybernetics evolving to systems, humans, organizations, and their complex interactions'(Vol.3, pp. 2316-2320). IEEE.
- Deng, Y., Chen, Y., Zhang, Y and Mahadevan, S. (2012). Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment. Applied Soft Computing, 12(3), 1231-1237
Other issues:
Vol.13(5)(2022)
Vol.13(4)(2022)
Vol.13(3)(2022)
Archives
Call-for-Papers
Call-for-Scientific PapersCall-for-Research Papers: ITJEMAST invites you to submit high quality papers for full peer-review and possible publication in areas pertaining engineering, science, management and technology, especially interdisciplinary/cross-disciplinary/multidisciplinary subjects.
To publish your work in the next available issue, your manuscripts together with copyright transfer document signed by all authors can be submitted via email to Editor @ TuEngr.com (please see all detail from Instructions for Authors)
Publication and peer-reviewed process:
After the peer-review process, articles will be on-line published in the available next issue. However, the International Transaction Journal of Engineering, Management, & Applied Sciences & Technologies cannot guarantee the exact publication time as the process may take longer time, subject to peer-review approval and adjustment of the submitted articles.