Assignment 6: behavior trees

In assignment 1, problem 2, you wrote a finite state machine to
control a robot so that it gets out of a locked room.

1. (40 points)  Write a behavior tree for robot C to solve problem 2
in assignment 1.
2. (40 points)   Assume that the key is already in the lock and the
door is open, but there are two characters in the room.  Write a
behavior tree that will get both of them out of the room, one at
location (9,3) and one at location (9,5).  The characters can never
occupy the same location at the same time and they must move from
(7,4) to (8,4) to (9,4) to get through the (open) door.  Note: when
move(dx,dy) is called for a character, its coordinates get updated
instead of C's.  However, if both characters attempt to move to the
same location at the same time, neither moves.  You have to either
get around or avoid that possibility.

Draw the behavior trees and send them to the TA.  You do not have to
write any java code for this assignment.