Pattern Formation for Asynchronous Robots without Agreement in Chirality
نویسندگان
چکیده
This paper presents a deterministic algorithm for forming a given asymmetric pattern in finite time by a set of autonomous, homogeneous, oblivious mobile robots under the CORDA model. The robots are represented as points on the 2D plane. There is no explicit communication between the robots. The robots coordinate among themselves by observing the positions of the other robots on the plane. Initially all the robots are assumed to be stationary. The robots have local coordinate systems defined by Sense of Direction (SoD), orientation or chirality and scale. Initially the robots are in asymmetric configuration. We show that these robots can form any given asymmetric pattern in finite time.
منابع مشابه
Pattern Formation by Anonymous Robots Without Chirality
Consider a set of anonymous mobile robots, and the patterns they can collectively form in the plane. If each robot has a compass needle that indicates North but there is no agreement on East and West (i.e., no chirality), it is known that every arbitrary pattern given in input can be formed if and only if the number of robots is odd. In this paper we study what patterns can be formed by an even...
متن کاملAsynchronous Pattern Formation without Chirality
We propose a new probabilistic pattern formation algorithm for oblivious mobile robots that operate in the ASYNC model. Unlike previous work, our algorithm makes no assumptions about the local coordinate systems of robots (the robots do not share a common “North” nor a common “Right”), yet it preserves the ability to form any general pattern (and not just patterns that satisfy symmetricity pred...
متن کاملLeader Election and Gathering for Asynchronous Transparent Fat Robots without Chirality
Gathering of autonomous mobile robots is a well known and challenging research problem for a system of multiple mobile robots. Most of the existing works consider the robots to be dimensionless or points. Algorithm for gathering fat robots (a robot represented as a unit disc) has been reported for three and four robots. This paper proposes a distributed algorithm which deterministically gathers...
متن کاملSquare Formation by Asynchronous Oblivious Robots
A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a given figure from every possible (non-degenerate) initial configuration. In the present paper, we consider robots that operate in the Euclidean plane and are dimensionless, anonymous, oblivious, silent, as...
متن کاملDistributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem
Consider a set of n 6= 4 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past, deterministic) initially in distinct locations, moving freely in the plane and able to sense the positions of the other robots. We study the primitive task of the robots arranging themselves eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.2625 شماره
صفحات -
تاریخ انتشار 2014