Gathering of asynchronous robots with limited visibility
نویسندگان
چکیده
منابع مشابه
Gathering of asynchronous robots with limited visibility
In this paper we study the problem of gathering in the same location of the plane a collection of identical oblivious mobile robots. Previous investigations have focused mostly on the unlimited visibility setting, where each robot can always see all the other ones, regardless of their distance. In the more difficult and realistic setting where the robots have limited visibility, the existing al...
متن کاملGathering of Asynchronous Oblivious Robots with Limited Visibility
W e consid er a collection of rob ots wh ich are id entical (anonym ou s), h ave lim ited visib ility of th e environm ent, and no m em ory of th e p ast (ob liviou s); fu rth erm ore, th ey are totally asynch ronou s in th eir ac tions, com p u tations, and m ovem ents. W e sh ow th at, even in su ch a totally asynch ronou s setting , it is p ossib le for th e rob ots to g ath er in th e sam e...
متن کاملEventually Consistent Compasses for Robust Gathering of Asynchronous Mobile Robots with Limited Visibility
Reaching agreement among a set of mobile robots is one of the most fundamental issues in distributed robotic systems. This problem is often illustrated by the gathering problem, where the robots must self-organize to eventually meet at some arbitrary location. That problem has the advantage that, while being very simple to express, it retains the inherent difficulty of agreement, namely the pro...
متن کاملCircle Formation by Asynchronous Fat Robots with Limited Visibility
This paper proposes a distributed algorithm for circle formation by multiple autonomous mobile robots with limited visibility. Each robot sees up to a fixed distance around it and moves to a new position. Eventually they form a circle of a given radius. The robots do not store past actions. The robots are anonymous and cannot be distinguished by their appearances. All robots agree upon a common...
متن کاملGathering Asynchronous Mobile Robots with Inaccurate Compasses
This paper considers a system of asynchronous autonomous mobile robots that can move freely in a two dimensional plane with no agreement on a common coordinate system. Startingfrom any initial configuration, the robots are required to eventually gather at a single point, notfixed in advance (gathering problem). Prior work has shown that gathering oblivious (i.e., stateless) robots cannot be ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.01.001