P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer, Gathering of asynchronous oblivious robots with limited visibility, Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....11, 13] or in the plane, see, e.g. 8, 9] and those discussing rendezvous in graphs, e.g. 1, 4] Most of the papers, e.g. 1, 2, 6, 10] consider the probabilistic scenario: inputs and or rendezvous strategies are random. A natural extension of the rendezvous problem is that of gathering [12, 15, 17], when more than 2 agents have to meet in one location. To the best of our knowledge, the present paper is the rst to consider deterministic rendezvous in unlabeled graphs assuming that each agent knows only its own identity. 1.3 Terminology and notation Labels of agents are denoted by L 1 and ....

P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer, Gathering of asynchronous oblivious robots with limited visibility, Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001.

....robots to be able to remember all past actions. Our paper actually builds upon their work and, most notably, inherits from the definition of their model. Under the same model, Ando et al. 1] propose an algorithm by which robots with a limited range of vision gather to a point. Flocchini et al. [9] give an algorithm to solve the same problem in a slightly di#erent model; dropping the assumption of instantaneous computation and movement, but assuming a common sense of direction as given by compasses. Flocchini et al. 8] study the solvability of the formation of arbitrary patterns, depending ....

....the robots initially have about a global coordinate system. Uny Cao et al. 16] provide a wide survey of researches in cooperative mobile robotics, and observe that only few researches take the problem from a computational point of view. This observation is later echoed by Flocchini et al. [9]. Structure. The rest of the paper is structured as follows. Section 2 presents the system model, the definition of the problem, and the notation. Section 3 gives an intuition of the algorithm and a decomposition into two subproblems: the formation of a circle (detailed in Sect. 4) and the ....

[Article contains additional citation context not shown here]

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Gathering of asynchronous oblivious robots with limited visibility. In Proc. 18th Annual Symp. on Theoretical Aspects of Computer Science (STACS 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC