Structural Information and Communication Complexity

DOI10.1007/b136628zbMath1085.68705OpenAlexW2480963397MaRDI QIDQ5710088

Giuseppe Prencipe

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b136628

zbMATH Keywords

ComputabilityDistributed CoordinationDistributed ModelsMobile RobotsMultiplicity Detection

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items (8)

Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses ⋮ Self-stabilizing gathering of mobile robots under crash or Byzantine faults ⋮ Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity ⋮ Gathering asynchronous oblivious mobile robots in a ring ⋮ Optimal Byzantine-resilient convergence in uni-dimensional robot networks ⋮ Gathering few fat mobile robots in the plane ⋮ Distributed algorithms for partitioning a swarm of autonomous mobile robots ⋮ Rendezvous in planar environments with obstacles and unknown initial distance

This page was built for publication: Structural Information and Communication Complexity