Solve the questions with complex real problem

Assignment objective:

This assignment provides a comprehensive exploration of both uninformed and informed search algorithms, encouraging students to gain hands$-$on experience with implementation, analysis, and optimization.

Assignment description:

Implement and analyze both uninformed search algorithms and informed search algorithms to solve a complex real$-$world problem. Evaluate and compare their performance based on time and space complexity, as well as optimality. Additionally, experiments with different heuristic values $($related to informed searching algorithms$)$ determine the most appropriate one for the given problem.

Assignment Tasks:

Problem Definition and formulation:

Formulate the problem with start and goal locations.

Generate different problem with varying complexities $($size$,$ obstacles, etc.$).$

Algorithm Implementation:

Implement minimum one of uninformed search algorithms and one of the informed search algorithms using any programing language.

Ensure that the algorithms can handle the problem representation and provide solutions.

Performance Metrics:

Develop a framework to measure and compare the performance of algorithms.

Record the time taken by each algorithm to find the solution.

Track the space complexity of each algorithm.

Optimality Analysis:

Analyze and compare the optimality of solutions provided by each algorithm.

Discuss situations where optimality may be compromised.

Heuristic Evaluation:

Introduce different heuristic functions for the informed searching algorithms.

Experiment with heuristic values such as Euclidean distance, Manhattan distance, custom heuristics, or any other appropriate heuristic.

Compare the performance of the informed searching algorithms using different heuristics.