Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
From MaRDI portal
Publication:1699417
DOI10.1007/s00446-017-0293-3zbMath1425.68413OpenAlexW2581043681MaRDI QIDQ1699417
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Publication date: 23 February 2018
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-017-0293-3
optimization problemsdistributed computingautonomous mobile robotsgatheringasynchronous systemobliviousnessunlimited visibilityWeber-point
Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items
Gathering over Meeting Nodes in Infinite Grid*, Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane, \(k\)-circle formation by disoriented asynchronous robots, Time optimal gathering of myopic robots on an infinite triangular grid, Optimal Gathering Over Weber Meeting Nodes in Infinite Grid, Gathering robots in graphs: the central role of synchronicity, Near-gathering of energy-constrained mobile agents, Embedded pattern formation by asynchronous robots without chirality, On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis, Arbitrary pattern formation on infinite regular tessellation graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Gathering fat mobile robots with slim omnidirectional cameras
- Tight bounds for black hole search with scattered agents in synchronous rings
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Leader election and gathering for asynchronous fat robots without common chirality
- Computing on rings by oblivious robots: a unified approach for different tasks
- Gathering of asynchronous robots with limited visibility
- Synchronous black hole search in directed graphs
- Explore and repair graphs with black holes using mobile entities
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Autonomous mobile robots with lights
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Gathering few fat mobile robots in the plane
- On the point for which the sum of the distances to \(n\) given points is minimum
- The algebraic degree of geometric optimization problems
- Asynchronous embedded pattern formation without orientation
- Evacuating two robots from multiple unknown exits in a circle
- Rendezvous of two robots with visible bits
- The power of a pebble: Exploring and mapping directed graphs
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Time versus space trade-offs for rendezvous in trees
- Gathering on rings under the look-compute-move model
- Gathering asynchronous oblivious mobile robots in a ring
- Stigmergic optimization
- Deterministic rendezvous in graphs
- Rendezvous in networks in spite of delay faults
- n-Ellipses and the Minimum Distance Sum Problem
- Optimal Gathering of Oblivious Robots in Anonymous Graphs
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
- MinMax-Distance Gathering on Given Meeting Points
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
- Distributed Computing by Mobile Robots: Gathering
- How to meet asynchronously (almost) everywhere
- Design and Analysis of Distributed Algorithms
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Mobile Agent Rendezvous in a Synchronous Torus
- Deterministic Rendezvous in Trees with Little Memory
- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
- Rendezvous of Mobile Agents without Agreement on Local Orientation
- Leader Election Problem versus Pattern Formation Problem
- Rendezvous of Mobile Agents in Directed Graphs
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Rendezvous Search: A Personal Perspective
- Gathering Despite Mischief
- Deterministic Rendezvous in Restricted Graphs
- A distributed algorithm for gathering many fat mobile robots in the plane
- Pattern Formation by Oblivious Asynchronous Mobile Robots
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Theoretical Computer Science
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Euclidean Constructibility in Graph-Minimization Problems
- LATIN 2004: Theoretical Informatics
- Rendezvous with constant memory
