Do the following exercises:
Build a new domain for the GPS system we studied in the lab that allows you to solve maze problems such as the following:
In this example, the mechanism should produce a sequence commands of
the form “Executing 1, Executing 2, ...”. The GPS should
be able to find a path from square 1 to square 16 without crossing
the walls (e.g., there is no path from square 3 to square 4). It
would be a good idea to implement tools that automatically create
plan operators based on simple cell-pair specifications (e.g.,
[[1,2], [2,3], [3,7], ...]
)
What does your implementation do if you modify the maze so that it has no solution?
Final project suggestion - Study one of the great questions from one of the founding disciplines of AI and include one or more implementations of key ideas as they evolved over time (e.g., human reasoning starting with GPS or epistemology and KR systems)
Submit the files specified above in Moodle under homework 1. We will grade your work according to the following criteria:
Homework assignments are always due by the beginning of the next lab.