|
Implementation and Evaluation of an Optimal Algorithm for Neural Networks Association in Machine Learning |
|---|---|
| รหัสดีโอไอ | |
| Creator | S. Balapriya, N. Srinivasan |
| Title | Implementation and Evaluation of an Optimal Algorithm for Neural Networks Association in Machine Learning |
| Contributor | - |
| Publisher | TuEngr Group |
| Publication Year | 2565 |
| Journal Title | International Transaction Journal of Engineering, Management, & Applied Sciences & Technologies |
| Journal Vol. | 13 |
| Journal No. | 6 |
| Page no. | 13A6K: 1-10 |
| Keyword | A* algorithm, path finding algorithm, parallel computing, modular programming architecture, modularity |
| URL Website | http://TuEngr.com/Vol13-6.html |
| Website title | ITJEMAST V13(6) 2022 @ TuEngr.com |
| ISSN | 2228-9860 |
| Abstract | This 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. |
