scientific article; zbMATH DE number 6469252
From MaRDI portal
Publication:5501371
zbMath1318.68176MaRDI QIDQ5501371
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reliability, testing and fault tolerance of networks and computer systems (68M15) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items (14)
Gathering over Meeting Nodes in Infinite Grid* ⋮ Optimal strategies for maintaining a chain of relays between an explorer and a base camp ⋮ Impossibility of gathering by a set of autonomous mobile robots ⋮ Energy-efficient strategies for building short chains of mobile robots locally ⋮ Compatibility of convergence algorithms for autonomous mobile robots (extended abstract) ⋮ A survey on relay placement with runtime and approximation guarantees ⋮ Self-deployment of mobile sensors on a ring ⋮ A New Approach for Analyzing Convergence Algorithms for Mobile Robots ⋮ Gathering of asynchronous robots with limited visibility ⋮ Optimal Byzantine-resilient convergence in uni-dimensional robot networks ⋮ Gathering few fat mobile robots in the plane ⋮ Collisionless Gathering of Robots with an Extent ⋮ 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:
