Proc. IEEE Int. Sym. on Intelligent Control, 1988, pp. 76-80.
Ömer Egecioglu and Beatrix Zimmermann
The One Dimensional Random Pairing Problem in a Cellular Robotic System
Abstract.
A typical reconfiguration problem for an autonomous robotic system on the
one dimensional grid is considered. The global goal of the system is
to self-organize into units of physically adjacent pairs of robots
separated by empty seats. By making use of randomization in the
decision making process of each robot, the evolution of the system is
modeled as a Markov chain, where each state represents a nonuniform
random walk. The chain is absorbing, showing that the desired
configuration will be reached with probability one.
omer@cs.ucsb.edu