Computational geometry: an introduction
Computational geometry: an introduction
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Experiments in Realising Cooperation between Autonomous Mobile Robots
Proceedings of the 5th International Symposium on Experimental Robotics V
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots
Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]
Fault-tolerant gathering algorithms for autonomous mobile robots
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Convergence of autonomous mobile robots with inaccurate sensors and movements
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the feasibility of gathering by autonomous mobile robots
SIROCCO'05 Proceedings of the 12th international conference 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
Self-stabilizing Mobile Robot Formations with Virtual Nodes
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
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
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
Gathering asynchronous transparent fat robots
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Getting close without touching
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Geometric computations by broadcasting automata
Natural Computing: an international journal
| Hi-index | 0.00 |
Systems consisting of a collection of independently operating mobile robots (a.k.a. robot swarms) have recently been studied from a distributed computing point of view. The paper reviews the basic model developed for such systems and some recent algorithmic results on a number of coordination and control tasks for robot swarms. The paper then discusses various possibilities for modifications in the basic model, and examines their effects via the example of the partitioning problem.