Circle formation for oblivious anonymous mobile robots with no common sense of orientation

Défago, Xavier; Konagaya, Akihiko

doi:10.1145/584490.584509

Cited by 112 publications

(113 citation statements)

References 11 publications

Supporting

Mentioning

112

Contrasting

Order By: Relevance

“…The differences are in the amount of synchrony assumed in the execution of the cycles. In [13,30] cycles were executed synchronously in rounds by all active robots, and the adversary could only decide which robots are active in a given cycle. In [9][10][11]19, 26] they were executed asynchronously: the adversary could interleave operations arbitrarily, stop robots during the move, and schedule Look operations of some robots while others were moving.…”

Section: Related Workmentioning

confidence: 99%

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

et al. 2012

View full text Add to dashboard Cite

Abstract. We consider the problem of exploring an anonymous unoriented ring by a team of k identical, oblivious, asynchronous mobile robots that can view the environment but cannot communicate. This weak scenario is standard when the spatial universe in which the robots operate is the two-dimentional plane, but (with one exception) has not been investigated before. We indeed show that, although the lack of these capabilities renders the problems considerably more difficult, ring exploration is still possible. We show that the minimum number ρ(n) of robots that can explore a ring of size n is O(log n) and that ρ(n) = Ω(log n) for arbitrarily large n. On one hand we give an algorithm that explores the ring starting from any initial configuration, provided that n and k are co-prime, and we show that there always exist such k in O(log n). On the other hand we show that Ω(log n) agents are necessary for arbitrarily large n. Notice that, when k and n are not co-prime, the problem is sometimes unsolvable (i.e., there are initial configurations for which the exploration cannot be done). This is the case, e.g., when k divides n.

show abstract

Section: Related Workmentioning

confidence: 99%

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

et al. 2012

View full text Add to dashboard Cite

show abstract

“…The formation generation problem is defined as the coordination of a group of robots to get into and maintain a formation with a certain shape, such as circle [61], line [62][63] or even arbitrary shapes [64]. Erkin et al [65] has divided formation generation into two groups.…”

Section: G Motion Coordinationmentioning

confidence: 99%

An extensive review of research in swarm robotics

Yogeswaran

Ponnambalam

2009

2009 World Congress on Nature &Amp; Biologically Inspired Computing (NaBIC)

112

View full text Add to dashboard Cite

Abstract-Swarm robotics is a new approach to the coordination of multi-robot systems which consist of large numbers of relatively simple robots which takes its inspiration from social insects. The most remarkable characteristic of swarm robots are the ability to work cooperatively to achieve a common goal.In this paper, classification of existing researches, problems and algorithms aroused in the study of swarm robotics are presented. The existing studies are classified into major areas and relevant sub-categories in the major areas.

show abstract

“…In fact, algorithmic robotic research usually assume unlimited visibility: the entities are capable of determining the location of all other regardless of their position in the region, e.g. [1,9,12,19,35,52,53,70,77,81,83,91]. Additional differences between robotic sensors and traditional models of autonomous robots and micro-robots robotic sensors are that usually the robots are more powerful (both memory-wise and computationally) than sensors, and typically there is no requirement for the robots to reach a state of static equilibrium (e.g., in most cases the swarm just converges towards a desired formation or pattern).…”

Section: Mobile Robotic Sensorsmentioning

confidence: 99%

Computing by Mobile Robotic Sensors

Flocchini

Prencipe

Santoro

2010

Monographs in Theoretical Computer Science. An EATCS Series

View full text Add to dashboard Cite

The research areas of mobile robotic sensors lie in the intersection of two major fields of investigations carried out by quite distinct communities of researchers: autonomous robots and mobile sensor networks. Robotic sensors are micro-robots capable of locomotion and sensing. Like the sensors in wireless sensor networks, they are myopic: their sensing range is limited. Unlike the sensors in wireless sensor networks, robotic sensors are silent: they have no direct communication capabilities. This means that synchronization, interaction, and communication of information among the robotic sensors can be achieved solely by means of their sensing capability, usually called vision. In this Chapter, we review the results of the investigations on the computability and complexity aspects of systems formed by these myopic and silent mobile sensors.

show abstract

Circle formation for oblivious anonymous mobile robots with no common sense of orientation

Cited by 112 publications

References 11 publications

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

An extensive review of research in swarm robotics

Computing by Mobile Robotic Sensors

Contact Info

Product

Resources

About