Problem Statement :

You are tasked with developing an intelligent agent for a delivery robot employed to deliver groceries in a bustling city. You are provided with a map of the city with important locations marked, including the households and the roads connecting them. The distance between each pair of households is given, representing the cost (in terms of travel distance) to deliver groceriesfrom one household to another. The Grocery Delivery Agent is tasked with finding the shortest route that covers all the households in a given neighborhood, starting from any node. For heuristic design, consider all the possiblepaths between any arbitrarynode n to the goal node. The average of the total distance cost across all these paths is the heuristic value h(n).

Graph representation

Use the following algorithms to solve the problem:

1. IDA*
2. Genetic Algorithm

Answer the following:

1. Explain the environment of the agent.
2. Define the heuristic and or fitness function for the given algorithms and the given problem.
3. Use appropriate data structures and implement given informed and local search algorithm and Print the path taken by the agent to reach home.
4. Find and print space and time complexity using code in your implementation.