This Project is Based on solving some real world based problems using symbolic AI methods. Symbolic AI methods are also called classical ai methods and are ground work for modern ai technologies. The technologies this project emphasis are the following:
This assignment uses Greedy Search or Best First Search to solve a simple fully observable and deterministic path navigation problem. Which is a classical example of how a simple algorithm like this can be used to study about navigation problem of robots.
In this assignment we try to solve a classical scheduling problem of Indian railways using an Indian Railway Dataset and a search algorithm called Djkstra which computes shortest paths using different heuristics. We use a Data set to generate a big graph of indian railways and then do search algorithms using various heuristics.
Assignment 3: