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
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Byzantine-Resilient Convergence in Oblivious Robot Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
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
Optimal Byzantine Resilient Convergence in Asynchronous Robots Networks
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
A local O(n2) gathering algorithm
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Optimal Byzantine-resilient convergence in uni-dimensional robot networks
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
Network exploration by silent and oblivious robots
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Collisionless gathering of robots with an extent
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
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
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
Convergence with limited visibility by asynchronous mobile robots
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Energy-efficient strategies for building short chains of mobile robots locally
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Synchronous rendezvous for location-aware agents
DISC'11 Proceedings of the 25th international conference on Distributed computing
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Convergence of autonomous mobile robots with inaccurate sensors and movements
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Gathering asynchronous transparent fat robots
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Convergence of mobile robots with uniformly-inaccurate sensors
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
A continuous, local strategy for constructing a short chain of mobile robots
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
The optimal tolerance of uniform observation error for mobile robot convergence
Theoretical Computer Science
Survey: A survey on relay placement with runtime and approximation guarantees
Computer Science Review
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
SIAM Journal on Computing
Collecting information by power-aware mobile agents
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
How to meet asynchronously at polynomial cost
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Deterministic polynomial approach in the plane
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Energy-efficient strategies for building short chains of mobile robots locally
Theoretical Computer Science
Price of asynchrony in mobile agents computing
Theoretical Computer Science
| Hi-index | 0.01 |
This paper considers the convergence problem in autonomous mobile robot systems. A natural algorithm for the problem requires the robots to move towards their center of gravity. This paper proves the correctness of the gravitational algorithm in the fully asynchronous model. It also analyzes its convergence rate and establishes its convergence in the presence of crash faults.