Route-Finder-Agent

Problem Statement

Given is weighted locality routes graph with :

1. Vertices as Checkpoints.
2. Edges as the routes.
3. Edge Weights as the Travel Time.(Randomly alloted to each edge)

Moreover, each route is randomly given a status as follows:

Status	Edge Colour	Delay in Travel Time
Congestion	Red	4
Construction Work	Blue	8
Accident	Orange	6
No issue	Green	0

Comparative analysis of the outcome of a Goal-based agent and a Utility-based agent based on the condition that Lower Estimated Time of Arrival(ETA) better the route.

Agent Programming

Environment: Graph of locality

Agent: The agent will be deployed in the environment and it will use the Depth First Search(DFS) to find all the possible routes. Finally, it will evaluate each path based on the Utility that Lower ETA better the path.