Discrete cosine transform: algorithms, advantages, applications
Discrete cosine transform: algorithms, advantages, applications
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Selected writings on computing: a personal perspective
Selected writings on computing: a personal perspective
Multiresolution Signal Decomposition: Transforms, Subbands, and Wavelets
Multiresolution Signal Decomposition: Transforms, Subbands, and Wavelets
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
From Ants to A(ge)nts: A Special Issue on Ant-Robotics
Annals of Mathematics and Artificial Intelligence
Cooperative Mobile Robotics: Antecedents and Directions
Autonomous Robots
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Experiments in Realising Cooperation between Autonomous Mobile Robots
Proceedings of the 5th International Symposium on Experimental Robotics V
Interaction and intelligent behavior
Interaction and intelligent behavior
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Local algorithms for autonomous robot systems
SIROCCO'06 Proceedings of the 13th 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
Deaf, Dumb, and Chatting Asynchronous Robots
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Remembering without memory: Tree exploration by asynchronous oblivious robots
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
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
Uniform multi-agent deployment on a ring
Theoretical Computer Science
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
Review: Of robot ants and elephants: A computational comparison
Theoretical Computer Science
Gathering of fat robots with limited visibility and without global navigation
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Observe and remain silent (communication-less agent location discovery)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Position discovery for a system of bouncing robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
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
| Hi-index | 5.23 |
This paper studies local algorithms for autonomous robot systems, namely, algorithms that use only information of the positions of a bounded number of their nearest neighbors. The paper focuses on the spreading problem. It defines measures for the quality of spreading, presents a local algorithm for the one-dimensional spreading problem, proves its convergence to the equally spaced configuration and discusses its convergence rate in the synchronous and semi-synchronous settings. It then presents a local algorithm achieving the exact equally spaced configuration in finite time in the synchronous setting, and proves it is time optimal for local algorithms. Finally, the paper also proposes a possible algorithm for the two-dimensional case and presents partial simulation results of its effectiveness.