CS 371
Introduction to Artificial Intelligence
Homework #11
Due dates:
Line-follower design 11/21
Line-follower demo 11/30 (40%)
Intersection-finder design 11/30
Intersection-finder demo 12/5 (40%)
WWW documentation wrap-up 12/7 (10%)
Equipment return and accounting 12/7 (10%)
Challenge #1 - Line-Following:
Design
and implement a lego robot that will follow a line through sudden turns
up to 90 degrees.
Challenge #2 - Intersection-Finding: Design and implement a lego
robot that will follow a line as in (1), but stop when it comes to an intersection
of two or more lines.
Challenge #3 - Intersection-Choosing: Design and implement a lego
robot that will, beyond (1) and (2), exit the intersection at the nth spoke
clockwise from the line it travelled.
Challenge #4 - Intersection-Traversing: Design and implement a lego
robot that will perform (3) in succession given n1, n2, n3, ...
Challenge #5 - Search and Traverse: Design and implement a lego
robot that, given a graph topology, its current intersection and heading,
and its goal intersection and heading, will generate a sequence of moves
and perform (4).
Challenge #6 - Localize, Search, and Traverse: Design and implement
a lego robot that, given all that is given in (4) except its current intersection
and heading, will take action to ascertain its state (localize), and then
perform (5).
Challenge #7 - Explore, Search, and Traverse: Design and implement
a lego robot that explores lines and intersections, forms a graph roadmap,
and moves to a graph intersection with the following property: Let d(i,j)
be the minimum number of edges to travel to get from intersection i to
intersection j. Let D(i) be max(d(i,j)) for all j. A goal intersection
has the minimum D(i).
