Cooperating in Uncertain Situations
Suppose there are two robots trying to meet in a fairly complex maze: one is starting from the entrance and the other from the exit. Each robot always knows its current location in the maze, and can communicate with the other robot; thus, each robot always knows its goal location. Even though the robots do not have a map of the maze, they can gather information around them through various sensors.
KeywordsGoal State Problem Solver Problem Space Heuristic Function Manhattan Distance
Unable to display preview. Download preview PDF.