| Distributed Anonymous Mobile Robots - Formation and Agreement Problems (1996) | |||||||||||||||
Abstract | |||||||||||||||
| ) Ichiro Suzuki 1 and Masafumi Yamashita 2 1 Department of Electrical Engineering and Computer Science University of Wisconsin -- Milwaukee P.O. Box 784, Milwaukee, WI 53201, U.S.A. suzuki@cs.uwm.edu 2 Department of Electrical Engineering Faculty of Engineering Hiroshima University Kagamiyama, Higashi-Hiroshima 739, Japan mak@se.hiroshima-u.ac.jp Abstract. Consider a system of multiple mobile robots in which each robot, at infinitely many unpredictable time instants, observes the positions of all the robots and moves to a new position determined by the given algorithm. The robots are anonymous in the sense that they all execute the same algorithm and they cannot be distinguished by their appearances. The robots are not necessarily synchronous, and initially they do not have a common x-y coordinate system. Such a system can be viewed as a distributed system of asynchronous, anonymous processes in which the processes (i.e., robots) can "communicate" with each other only by means o... | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||