Scribd
Upload
7 views1 page

Efficient Route Planning for Food Delivery

The document outlines a scenario where a food delivery boy must navigate to a remote location using a travel agent for optimal route selection due to time constraints. It emphasizes the need for a program that dynamically calculates the most efficient route using the Greedy Best First Search algorithm, considering travel times between homes as costs. Additionally, it specifies evaluation criteria including the explanation of the PEAS and task environment, implementation of search algorithms, and analysis of space and time complexity.

Uploaded by

aakashraj912317
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views1 page

Efficient Route Planning for Food Delivery

The document outlines a scenario where a food delivery boy must navigate to a remote location using a travel agent for optimal route selection due to time constraints. It emphasizes the need for a program that dynamically calculates the most efficient route using the Greedy Best First Search algorithm, considering travel times between homes as costs. Additionally, it specifies evaluation criteria including the explanation of the PEAS and task environment, implementation of search algorithms, and analysis of space and time complexity.

Uploaded by

aakashraj912317
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

A food delivery boy needs to travel from his home to a remote location for deliver food.

Due
to unexpected delays, he has a limited amount of time to reach the destination. The delivery
boy is relying on a travel agent that provides navigation assistance. Homes along the route are
connected by various roads, and the travel agent must help him choose the best route. The
goal is to reach the destination in minimum time. The agent will assist by calculating the
most efficient route. The road network is depicted in a diagram with travel times (costs)
between homes(nodes). The program should be able to take-in start and goal nodes
dynamically from the user at run time. For the heuristic design, we will consider all possible
paths between the start home and the destination, using the average travel time across all
paths as the heuristic value h(n).
Use the following algorithms to determine the minimum travel time and ensure the
delivery boy reaches his destination on time by using Greedy Best first Search
Algorithm.

Evaluations will be based on the following.

1. Explain the PEAS and Task environment of the agent. (1 Mark)


2. Use appropriate data structures and implement search algorithms. ( 5 Mark)
3. Find and print space and time complexity using code in your implementation. (1 Mark)

You might also like