Systems consisting of a collection of independently operating mobile robots (a.k.a. robot swarms) have recently been studied from a distributed computing point of view. The paper reviews the basic model developed for such systems and some recent algorithmic results on a number of coordination and control tasks for robot swarms. The paper then discusses various possibilities for modifications in the basic model, and examines their effects via the example of the partitioning problem.