Robots On A Collision Course

1
Robots On A Collision Course

• Cooperative Processes

2
Authors

• John Neitzke, Truman State University
• Scott Sigman, Drury University

3
Overview

• The students will develop independent processes
  that utilize multiple sharable resources using a
  distributed solution.
• Resource management will be via message passing.

4
Problem Statement

• The town Lego has a road system on which robots
  wander. Obeying the traffic laws, of course.

5
Traffic Laws (1)

• Roads are only wide enough for a single robot but
  are two way.
• Intersections are all four way stops.
• The first robot to arrive at an intersection has
  the right of way.
• Robots may proceed thorough an intersection or
  turn either left or right.
• When a robot arrives at an intersection it
  randomly decides which way to go.

6
Traffic Laws (2)

• When robots meet on a road the one that has
  traveled farthest from the last intersection must
  yield the road to the other robot.
• A green strip across the road indicates an
  intersection six (6) inches ahead.

7
Tasks

• Task 0 (Assumed) Robot can follow an oval
  track.
• Task 1 Single robot on a figure 8 track
  stopping at intersection and turning randomly.
• Task 2 Add a second robot check for robot at
  intersection, listens to see if intersection
  clear, announces intention to go through
  intersection, proceeds, and announces is clear of
  intersection.
• Task 3 When two robots meet head to head
  negotiate who yields the road.

8
Track
9
Grading Criteria

• Multiple robots in competition.
• One point off for each traffic violation.
• Standard evaluation of solution and program
  characteristics otherwise.