Cooperating in Uncertain Situations

Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 406)


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.


Goal State Problem Solver Problem Space Heuristic Function Manhattan Distance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1997

Personalised recommendations