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
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
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
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Fault-tolerant gathering algorithms for autonomous mobile robots
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
SIAM Journal on Computing
Online searching with an autonomous robot
Computational Geometry: Theory and Applications
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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 local O(n2) gathering algorithm
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
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
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
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
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
Local, self-organizing strategies for robotic formation problems
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Survey: A survey on relay placement with runtime and approximation guarantees
Computer Science Review
Continuous local strategies for robotic formation problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Energy-efficient strategies for building short chains of mobile robots locally
Theoretical Computer Science
| Hi-index | 5.23 |
We envision a scenario with robots moving on a terrain represented by a plane. A mobile robot, called explorer is connected by a communication chain to a stationary base camp. The chain is expected to pass communication messages between the explorer and the base camp. It is composed of simple, mobile robots, called relays. We are investigating strategies for organizing and maintaining the chain, so that the number of relays employed is minimized and nevertheless the distance between neighbored relays in the chain remains bounded. We are looking for local and distributed strategies employed by restricted relays that have to base their decision (''Where should I go?'') solely on the relative positions of its neighbors in the chain. We present the Manhattan-Hopper and the Hopper strategy which improve the performance of all known solutions to this problem significantly. They are the first such strategies that are optimal in this setting, i.e., that allow the explorer to move with constant speed, independent of the length of the chain, and keep this length minimum up to a constant factor.