Keyword

gathering problem

Description: A distributed robotics problem in which autonomous agents must move to meet at a common location, often under limited information or communication.

Primary topic: Optimization and Search Problems (79%)

OpenAlex ID: keywords/gathering-problem

Distributed Computing by Mobile Robots: Gathering

2012 · Mark Cieliebak, Paola Flocchini, et al. · SIAM Journal on Computing · 240

Gathering asynchronous oblivious mobile robots in a ring

2007 · Ralf Klasing, Euripides Markou, et al. · Theoretical Computer Science · 190

PDF

Impossibility of gathering by a set of autonomous mobile robots

2007 · Giuseppe Prencipe · Theoretical Computer Science · 156

Gathering few fat mobile robots in the plane

2008 · Jurek Czyzowicz, Leszek Ga̧sieniec, et al. · Theoretical Computer Science · 140

PDF

Gathering of Asynchronous Oblivious Robots with Limited Visibility

2001 · Paola Flocchini, Giuseppe Prencipe, et al. · Lecture notes in computer science · 120

How to meet in anonymous network

2008 · Dariusz R. Kowalski, Adam Malinowski · Theoretical Computer Science · 115

Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring

2010 · Ralf Klasing, Adrian Kosowski, et al. · Theoretical Computer Science · 101

The Gathering Problem for Two Oblivious Robots with Unreliable Compasses

2012 · Taisuke Izumi, Samia Souissi, et al. · SIAM Journal on Computing · 98

PDF

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

2012 · Paola Flocchini, David Ilcinkas, et al. · Algorithmica · 82

Using eventually consistent compasses to gather memory-less mobile robots with limited visibility

2009 · Samia Souissi, Xavier Défago, et al. · ACM Transactions on Autonomous and Adaptive Systems · 76

Gathering Autonomous Mobile Robots.

2002 · Mark Cieliebak, Giuseppe Prencipe · 62

On the Feasibility of Gathering by Autonomous Mobile Robots

2005 · Giuseppe Prencipe · Lecture notes in computer science · 61

Gathering on rings under the Look–Compute–Move model

2014 · Gianlorenzo D’Angelo, Gabriele Di Stefano, et al. · Distributed Computing · 59

Gathering Asynchronous Mobile Robots with Inaccurate Compasses

2006 · Samia Souissi, Xavier Défago, et al. · Lecture notes in computer science · 56

Hardness and approximation of Gathering in static radio networks

2006 · J.-C. Bermond, N. Morales, et al. · IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) · 53

PDF

Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result

2007 · Taisuke Izumi, Yoshiaki Katayama, et al. · Lecture notes in computer science · 52

Gathering Non-oblivious Mobile Robots

2004 · Mark Cieliebak · Lecture notes in computer science · 50

Self-stabilizing gathering with strong multiplicity detection

2011 · Yoann Dieudonné, Franck Petit · Theoretical Computer Science · 48

PDF

Gathering of robots on meeting-points: feasibility and optimal resolution algorithms

2017 · Serafino Cicerone, Gabriele Di Stefano, et al. · Distributed Computing · 45

Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings

2010 · Tomoko Izumi, Taisuke Izumi, et al. · Lecture notes in computer science · 45

PDF

Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots

2007 · Yoshiaki Katayama, Yuichi Tomida, et al. · Springer eBooks · 45

Gathering of oblivious robots on infinite grids with minimum traveled distance

2016 · Gabriele Di Stefano, Alfredo Navarra · Information and Computation · 44

Gathering in dynamic rings

2018 · Giuseppe Antonio Di Luna, Paola Flocchini, et al. · Theoretical Computer Science · 41

Gathering asynchronous oblivious agents with local vision in regular bipartite graphs

2012 · Samuel Guilbault, Andrzej Pelc · Theoretical Computer Science · 41

PDF

Anonymous Meeting in Networks

2015 · Yoann Dieudonné, Andrzej Pelc · Algorithmica · 40

Works count: 211

Citation count: 3,019