Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
From MaRDI portal
Publication:1699417
DOI10.1007/S00446-017-0293-3zbMATH Open1425.68413OpenAlexW2581043681MaRDI QIDQ1699417FDOQ1699417
Authors: 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
Recommendations
distributed computinggatheringoptimization problemsasynchronous systemautonomous mobile robotsobliviousnessunlimited visibilityWeber-point
Artificial intelligence for robotics (68T40) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- The power of a pebble: Exploring and mapping directed graphs
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Gathering on rings under the look-compute-move model
- Gathering asynchronous oblivious mobile robots in a ring
- Deterministic rendezvous in graphs
- Distributed computing by mobile robots: gathering
- How to meet asynchronously (almost) everywhere
- Design and Analysis of Distributed Algorithms
- Deterministic Rendezvous in Trees with Little Memory
- Almost optimal asynchronous rendezvous in infinite multidimensional grids
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Gathering despite mischief
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering of asynchronous robots with limited visibility
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Title not available (Why is that?)
- Gathering few fat mobile robots in the plane
- The algebraic degree of geometric optimization problems
- Gathering fat mobile robots with slim omnidirectional cameras
- Leader election and gathering for asynchronous fat robots without common chirality
- LATIN 2004: Theoretical Informatics
- On the point for which the sum of the distances to \(n\) given points is minimum
- Title not available (Why is that?)
- Tight bounds for black hole search with scattered agents in synchronous rings
- Euclidean Constructibility in Graph-Minimization Problems
- Time optimal algorithms for black hole search in rings
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Mobile robots gathering algorithm with local weak multiplicity in rings
- Leader election problem versus pattern formation problem
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Rendezvous with constant memory
- Gathering an even number of robots in an odd ring without global multiplicity detection
- Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
- Computing on rings by oblivious robots: a unified approach for different tasks
- A distributed algorithm for gathering many fat mobile robots in the plane
- Gathering of robots on anonymous grids and trees without multiplicity detection
- The gathering problem for two oblivious robots with unreliable compasses
- Mobile Agent Rendezvous in a Synchronous Torus
- Rendezvous of mobile agents without agreement on local orientation
- Rendezvous of two robots with visible bits
- Optimal gathering of oblivious robots in anonymous graphs
- Rendezvous Search: A Personal Perspective
- n-Ellipses and the Minimum Distance Sum Problem
- Synchronous black hole search in directed graphs
- Minmax-distance gathering on given meeting points
- Rendezvous in networks in spite of delay faults
- Explore and repair graphs with black holes using mobile entities
- Autonomous mobile robots with lights
- Pattern formation by oblivious asynchronous mobile robots
- Asynchronous embedded pattern formation without orientation
- Rendezvous of mobile agents in directed graphs
- Evacuating two robots from multiple unknown exits in a circle
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Time versus space trade-offs for rendezvous in trees
- Stigmergic optimization
- Deterministic Rendezvous in Restricted Graphs
- Theoretical Computer Science
Cited In (18)
- Gathering robots in graphs: the central role of synchronicity
- Arbitrary pattern formation on infinite regular tessellation graphs
- Time optimal gathering of myopic robots on an infinite triangular grid
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
- On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
- \(k\)-circle formation by disoriented asynchronous robots
- Near-gathering of energy-constrained mobile agents
- Gathering over Meeting Nodes in Infinite Grid*
- Minmax-distance gathering on given meeting points
- Time optimal gathering of myopic robots on an infinite triangular grid
- Gathering over meeting nodes in infinite grid
- Embedded pattern formation by asynchronous robots without chirality
- Parking problem by oblivious mobile robots in infinite grids
- On gathering of semi-synchronous robots in graphs
- Gathering of oblivious robots on infinite grids with minimum traveled distance
- Computing an approximation of the 1-center problem on weighted terrain surfaces
- On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
This page was built for publication: Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699417)
