Designing emergent behaviors: from local interactions to collective intelligence
Proceedings of the second international conference on From animals to animats 2 : simulation of adaptive behavior: simulation of adaptive behavior
Adaptive action selection for cooperative agent teams
Proceedings of the second international conference on From animals to animats 2 : simulation of adaptive behavior: simulation of adaptive behavior
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Gathering of Asynchronous Oblivious Robots with Limited Visibility
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Distributed Computations by Autonomous Mobile Robots
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Decomposition of Fundamental Problems for Cooperative Autonomous Mobile Systems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
Theoretical Computer Science
Deaf, Dumb, and Chatting Asynchronous Robots
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Leader election problem versus pattern formation problem
DISC'10 Proceedings of the 24th international conference on Distributed computing
RoboCast: asynchronous communication in robot networks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Gathering few fat mobile robots in the plane
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Coherent formation for agents using flocking with cellular automata
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Convergence of autonomous mobile robots with inaccurate sensors and movements
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Local algorithms for autonomous robot systems
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed coordination algorithms for mobile robot swarms: new directions and challenges
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
An improved algorithm for reconstructing a simple polygon from its visibility angles
Computational Geometry: Theory and Applications
Biangular circle formation by asynchronous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
On the feasibility of gathering by autonomous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Self-deployment algorithms for mobile sensors on a ring
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Reconstructing visibility graphs with simple robots
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
An improved algorithm for reconstructing a simple polygon from the visibility angles
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Reconstructing visibility graphs with simple robots
Theoretical Computer Science
Observe and remain silent (communication-less agent location discovery)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Deterministic geoleader election in disoriented anonymous systems
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we aim at an understanding of the fundamental algorithmic limitations on what a set of autonomous mobile robots can or cannot achieve. We study a hard task for a set of weak robots. The task is for the robots in the plane to form any arbitrary pattern that is given in advance. The robots are weak in several aspects. They are anonymous; they cannot explicitly communicate with each other, but only observe the positions of the others; they cannot remember the past; they operate in a very strong form of asynchronicity. We show that the tasks that such a system of robots can perform depend strongly on their common knowledge about their environment, i.e., the readings of their environment sensors.