Comparative Analysis of Algorithms for Path Optimization
The project involves Simulating 6 pathfinding algorithms: 1. A* 2. Dijkstra's Shortest Path Algorithm 3. Breadth First Search 4. Depth First Search 5. Best First Search and 6. Modified A* on a common map to compare, analyse and then select the most optimum algorithm on the basis of 1. Total Time taken to reach Destination 2. Total Distance covered to reach Destination 3. Total Nodes in path 4. Total Nodes examined 5. Time Efficiency 6. Memory Efficiency 7. Time to execute. AND a performance optimization for the standard A* pathfinding algorithm. Find out more about my research here:
Aparant Mane
Designer and Programmer at Kangarooster LLC - Designer