Local spreading algorithms for autonomous robot systems

From MaRDI portal
Publication:930905

DOI10.1016/j.tcs.2008.02.007zbMath1147.68740OpenAlexW1967871771MaRDI QIDQ930905

Reuven Cohen, David Peleg

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.007




Related Items

On synchronization and orientation in distributed barrier coverage with relocatable sensorsGathering a Euclidean closed chain of robots in linear timeInformation Spreading by Mobile Particles on a LineA discrete and continuous study of the \textsc{Max-Chain-Formation} problemDeterministic geoleader election in disoriented anonymous systemsLeader Election and Shape Formation with Self-organizing Programmable MatterThe mutual visibility problem for fat robotsUniform multi-agent deployment on a ringExplicit Communication Among Stigmergic RobotsComputing by Mobile Robotic SensorsUNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRIDPosition discovery for a system of bouncing robotsLocalization for a system of colliding robotsA New Approach for Analyzing Convergence Algorithms for Mobile RobotsMutual visibility by luminous robots without collisionsUniversal coating for programmable matterRemembering without memory: tree exploration by asynchronous oblivious robotsOf robot ants and elephants: a computational comparisonFault-tolerant complete visibility for asynchronous robots with lights under one-axis agreementFormation of General Position by Asynchronous Mobile Robots Under One-Axis AgreementFault-induced dynamics of oblivious robots on a lineGathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formationForming sequences of geometric patterns with oblivious mobile robots



Cites Work