Consider a robot wandering around an unfamiliar environment. The robot's task is to con(cid:173) struct an internal model of its environment. The heart of this algorithm is a clever representation of the environment called an update graph. We have developed a connectionist implementation of the update graph using a highly-specialized network architecture. The network has the additional strength that it can accommodate stochastic environments.

Consider a robot wandering around an unfamiliar environment.

Consider a robot wandering around an unfamiliar environment.

Consider a robot wandering around an unfamiliar environment.