Distributed Computing – IWDC 2005
From MaRDI portal
Publication:5491761
DOI10.1007/11603771zbMath1170.68614OpenAlexW2483758159MaRDI QIDQ5491761
Publication date: 10 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11603771
Related Items (17)
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane ⋮ On fast pattern formation by autonomous robots ⋮ Mutual visibility on grid by asynchronous luminous robots ⋮ Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality ⋮ Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots ⋮ Autonomous mobile robots with lights ⋮ The mutual visibility problem for fat robots ⋮ Equal-Area Locus-Based Convex Polygon Decomposition ⋮ Optimum Gathering of Asynchronous Robots ⋮ Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ Mutual visibility by luminous robots without collisions ⋮ Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement ⋮ Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement ⋮ Probability pooling for dependent agents in collective learning ⋮ Arbitrary pattern formation by asynchronous opaque robots with lights ⋮ Getting close without touching: near-gathering for autonomous mobile robots
This page was built for publication: Distributed Computing – IWDC 2005
