A formation behavior for large-scale micro-robot force deployment
Proceedings of the 32nd conference on Winter simulation
Circle formation for oblivious anonymous mobile robots with no common sense of orientation
Proceedings of the second ACM international workshop on Principles of mobile computing
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
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
Fault-tolerant gathering algorithms for autonomous mobile robots
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed, Physics-Based Control of Swarms of Vehicles
Autonomous Robots
Coordination without communication: the case of the flocking problem
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Gradual spatial pattern formation of homogeneous robot group
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Intelligent embedded agents
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Circle formation of weak robots and Lyndon words
Information Processing Letters
Local strategies for maintaining a chain of relay stations between an explorer and a base station
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Theoretical Computer Science
Local spreading algorithms for autonomous robot systems
Theoretical Computer Science
Gathering two stateless mobile robots using very inaccurate compasses in finite time
Proceedings of the 1st international conference on Robot communication and coordination
Self-deployment of mobile sensors on a ring
Theoretical Computer Science
Models and algorithmic approaches for cooperative multi-robot systems: thesis abstract
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: doctoral mentoring program
Distributed Models and Algorithms for Mobile Robot Systems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Gathering Multiple Robotic Agents with Crude Distance Sensing Capabilities
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science
Circle formation of weak mobile robots
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Adaptive self-management of teams of autonomous vehicles
Proceedings of the 6th international workshop on Middleware for pervasive and ad-hoc computing
Anonymous graph exploration without collision by mobile robots
Information Processing Letters
Self-stabilizing Mobile Robot Formations with Virtual Nodes
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Gathering few fat mobile robots in the plane
Theoretical Computer Science
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
Algorithmic Aspects of Wireless Sensor Networks
Distributed algorithms for partitioning a swarm of autonomous mobile robots
Theoretical Computer Science
A geometric approach to deploying robot swarms
Annals of Mathematics and Artificial Intelligence
Byzantine-Resilient Convergence in Oblivious Robot Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Self-stabilizing robot formations over unreliable networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
On the Inability of Gathering by Asynchronous Mobile Robots with Initial Movements
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
Theoretical Computer Science
Brief announcement: deaf, dumb, and chatting robots
Proceedings of the 28th ACM symposium on Principles of distributed computing
Team member reallocation via tree pruning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Communication-based decomposition mechanisms for decentralized MDPs
Journal of Artificial Intelligence Research
Multirobot rendezvous with visibility sensors in nonconvex environments
IEEE Transactions on Robotics
Optimal Byzantine Resilient Convergence in Asynchronous Robots Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Randomized Gathering of Mobile Robots with Local-Multiplicity Detection
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Oracle-Based Flocking of Mobile Robots in Crash-Recovery Model
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Byzantine Convergence in Robot Networks: The Price of Asynchrony
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Deaf, Dumb, and Chatting Asynchronous Robots
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Rapidly convergent leader-enabled multi-agent deployment into planar curves
ACC'09 Proceedings of the 2009 conference on American Control Conference
Positional consensus in multi-agent systems using a broadcast control mechanism
ACC'09 Proceedings of the 2009 conference on American Control Conference
Adaptive triangular mesh generation of self-configuring robot swarms
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Gradual spatial pattern formation of homogeneous robot group
Information Sciences: an International Journal
A Resilient and Scalable Flocking Scheme in Autonomous Vehicular Networks
Mobile Networks and Applications
Remembering without memory: Tree exploration by asynchronous oblivious robots
Theoretical Computer Science
Circle formation of weak mobile robots
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Using eventually consistent compasses to gather oblivious mobile robots with limited visibility
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Robots and demons: the code of the origins
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Swing words to make circle formation quiescent
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Distributed algorithms for partitioning a swarm of autonomous mobile robots
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Dynamic compass models and gathering algorithms for autonomous mobile robots
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A distributed formation algorithm to organize agents with no coordinate agreement
ECAL'07 Proceedings of the 9th European conference on Advances in artificial life
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Deterministic leader election in anonymous sensor networks without common coordinated system
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Stabilizing flocking via leader election in robot networks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Characterizing geometric patterns formable by oblivious anonymous mobile robots
Theoretical Computer Science
Randomized rendez-vous with limited memory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The cost of probabilistic agreement in oblivious robot networks
Information Processing Letters
Mobile Networks and Applications
Optimal Byzantine-resilient convergence in uni-dimensional robot networks
Theoretical Computer Science
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Theoretical Computer Science
On the computational power of oblivious robots: forming a series of geometric patterns
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: leader election vs pattern formation
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Autonomous multi-agent cycle based patrolling
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Multi-agent deployment on a ring graph
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Leader election problem versus pattern formation problem
DISC'10 Proceedings of the 24th international conference on Distributed computing
Connectivity-preserving scattering of mobile robots with limited visibility
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Uniform multi-agent deployment on a ring
Theoretical Computer Science
Network exploration by silent and oblivious robots
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Pattern formation through optimum matching by oblivious CORDA robots
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
RoboCast: asynchronous communication in robot networks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Reliably detecting connectivity using local graph traits
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Consensus in networked multi-agent systems with adversaries
Proceedings of the 14th international conference on Hybrid systems: computation and control
Practical formation control of multiple underactuated ships with limited sensing ranges
Robotics and Autonomous Systems
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A new approach for analyzing convergence algorithms for mobile robots
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
How many oblivious robots can explore a line
Information Processing Letters
Review: Of robot ants and elephants: A computational comparison
Theoretical Computer Science
Convergence with limited visibility by asynchronous mobile robots
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Practical Formation Control of Multiple Unicycle-Type Mobile Robots with Limited Sensing Ranges
Journal of Intelligent and Robotic Systems
Robot networks with homonyms: the case of patterns formation
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Brief announcement: the BG-simulation for Byzantine mobile robots
DISC'11 Proceedings of the 25th international conference on Distributed computing
Synchronous rendezvous for location-aware agents
DISC'11 Proceedings of the 25th international conference on Distributed computing
Gathering asynchronous mobile robots with inaccurate compasses
OPODIS'06 Proceedings of the 10th 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
Convergence of autonomous mobile robots with inaccurate sensors and movements
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
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
Automatica (Journal of IFAC)
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Lattice formation in mobile autonomous sensor arrays
SAB'04 Proceedings of the 2004 international conference on Swarm Robotics
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Fault-tolerant and self-stabilizing mobile robots gathering
DISC'06 Proceedings of the 20th international conference on Distributed Computing
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-stabilizing gathering with strong multiplicity detection
Theoretical Computer Science
Towards a theory of self-organization
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Towards a theory of self-organization
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Self-deployment algorithms for mobile sensors on a ring
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Gathering asynchronous oblivious mobile robots in a ring
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Convergence of mobile robots with uniformly-inaccurate sensors
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Optimal deterministic ring exploration with oblivious asynchronous robots
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Deterministic network exploration by a single agent with Byzantine tokens
Information Processing Letters
Circle formation by asynchronous fat robots with limited visibility
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Self-Management Framework for Mobile Autonomous Systems
Journal of Network and Systems Management
The optimal tolerance of uniform observation error for mobile robot convergence
Theoretical Computer Science
Collaborative search on the plane without communication
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
SIAM Journal on Computing
The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Getting close without touching
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Gathering autonomous mobile robots with dynamic compasses: an optimal result
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On the self-stabilization of mobile oblivious robots in uniform rings
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Optimal grid exploration by asynchronous oblivious robots
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Asynchronous pattern formation by anonymous oblivious mobile robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
How to gather asynchronous oblivious robots on anonymous rings
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Position discovery for a system of bouncing robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Brief announcement: wait-free gathering of mobile robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Distributed algorithms for barrier coverage using relocatable sensors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Theoretical Computer Science
Localization for a system of colliding robots
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Deterministic geoleader election in disoriented anonymous systems
Theoretical Computer Science
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
Theoretical Computer Science
Price of asynchrony in mobile agents computing
Theoretical Computer Science
| Hi-index | 0.03 |
Consider a system of multiple mobile robots in which each robot, at infinitely many unpredictable time instants, observes the positions of all the robots and moves to a new position determined by the given algorithm. The robots are anonymous in the sense that they all execute the same algorithm and they cannot be distinguished by their appearances. Initially they do not have a common x-y coordinate system. Such a system can be viewed as a distributed system of anonymous mobile processes in which the processes (i.e., robots) can "communicate" with each other only by means of their moves. In this paper we investigate a number of formation problems of geometric patterns in the plane by the robots. Specifically, we present algorithms for converging the robots to a single point and moving the robots to a single point in finite steps. We also characterize the class of geometric patterns that the robots can form in terms of their initial configuration. Some impossibility results are also presented.