On the public citation graph

Tight Analysis of a Collisionless Robot Gathering Algorithm

0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11945529_24openalex-snapshot
Gathering Asynchronous Mobile Robots with Inaccurate Compasses
inferredcites →https://doi.org/10.1007/978-3-319-14472-6_17openalex-snapshot
Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
inferredcites →https://doi.org/10.1007/978-3-540-27796-5_8openalex-snapshot
Robot Convergence via Center-of-Gravity Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-75142-7_24openalex-snapshot
Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
inferredcites →https://doi.org/10.1007/978-3-642-05118-0_27openalex-snapshot
Randomized Gathering of Mobile Robots with Local-Multiplicity Detection
inferredcites →https://doi.org/10.1007/978-3-642-11659-9_17openalex-snapshot
Gathering Asynchronous Transparent Fat Robots
inferredcites →https://doi.org/10.1007/978-3-642-13284-1_14openalex-snapshot
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
inferredcites →https://doi.org/10.1007/978-3-642-16023-3_27openalex-snapshot
Connectivity-Preserving Scattering of Mobile Robots with Limited Visibility
inferredcites →https://doi.org/10.1007/978-3-642-18381-2_15openalex-snapshot
Collisionless Gathering of Robots with an Extent
inferredcites →https://doi.org/10.1007/978-3-642-22012-8_52openalex-snapshot
A New Approach for Analyzing Convergence Algorithms for Mobile Robots
inferredcites →https://doi.org/10.1007/978-3-642-28073-3_8openalex-snapshot
Circle Formation by Asynchronous Fat Robots with Limited Visibility
inferredcites →https://doi.org/10.1007/978-3-642-29353-5_4openalex-snapshot
Gathering of Fat Robots with Limited Visibility and without Global Navigation
inferredcites →https://doi.org/10.1007/978-3-642-31104-8_27openalex-snapshot
Getting Close without Touching
inferredcites →https://doi.org/10.1007/978-3-642-45346-5_7openalex-snapshot
Fast Localized Sensor Self-Deployment for Focused Coverage
inferredcites →https://doi.org/10.1007/bf01784239openalex-snapshot
Greedy hot-potato routing on the two-dimensional mesh
inferredcites →https://doi.org/10.1007/s10846-015-0287-yopenalex-snapshot
Formation Control and Tracking for Co-operative Robots with Non-holonomic Constraints
inferredcites →https://doi.org/10.1016/j.tcs.2007.04.023openalex-snapshot
Impossibility of gathering by a set of autonomous mobile robots
inferredcites →https://doi.org/10.1016/j.tcs.2007.09.032openalex-snapshot
Gathering asynchronous oblivious mobile robots in a ring
inferredcites →https://doi.org/10.1016/j.tcs.2008.04.010openalex-snapshot
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
inferredcites →https://doi.org/10.1016/j.tcs.2008.10.005openalex-snapshot
Gathering few fat mobile robots in the plane
inferredcites →https://doi.org/10.1016/j.tcs.2012.10.056openalex-snapshot
Energy-efficient strategies for building short chains of mobile robots locally
inferredcites →https://doi.org/10.1109/70.795787openalex-snapshot
Distributed memoryless point convergence algorithm for mobile robots with limited visibility
inferredcites →https://doi.org/10.1109/icc.2009.5199144openalex-snapshot
Localized Sensor Self-Deployment for Guaranteed Coverage Radius Maximization
inferredcites →https://doi.org/10.1109/iros.2015.7354108openalex-snapshot
Tight analysis of a collisionless robot gathering algorithm
inferredcites →https://doi.org/10.1109/isic.1995.525098openalex-snapshot
Formation and agreement problems for synchronous mobile robots with limited visibility
inferredcites →https://doi.org/10.1109/mobhoc.2009.5336967openalex-snapshot
Focused-coverage by mobile sensor networks
inferredcites →https://doi.org/10.1109/tmc.2010.261openalex-snapshot
Strictly Localized Sensor Self-Deployment for Optimal Focused Coverage
inferredcites →https://doi.org/10.1137/s0097539704446475openalex-snapshot
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
inferredcites →https://doi.org/10.1145/1810479.1810523openalex-snapshot
A local O(n 2 ) gathering algorithm
inferredcites →https://doi.org/10.1145/1989493.1989515openalex-snapshot
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility
inferredcites →https://doi.org/10.1145/1989493.1989517openalex-snapshot
Convergence of local communication chain strategies via linear transformations
inferredcites →https://doi.org/10.1145/2312005.2312009openalex-snapshot
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
inferredcites →https://doi.org/10.1145/2484239.2484266openalex-snapshot
A distributed algorithm for gathering many fat mobile robots in the plane
inferredcites →https://doi.org/10.1145/2910584openalex-snapshot
Distributed Multirobot Formation and Tracking Control in Cluttered Environments
inferredcites →https://doi.org/10.5555/982792.982951openalex-snapshot
Fault-tolerant gathering algorithms for autonomous mobile robots

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_2openalex-snapshot
The Mutual Visibility Problem for Fat Robots
inferred← citeshttps://doi.org/10.1007/978-3-319-69084-1_23openalex-snapshot
Universally Optimal Gathering Under Limited Visibility
inferred← citeshttps://doi.org/10.1007/s41315-020-00150-3openalex-snapshot
Adaptive formation-switching of a multi-robot system in an unknown occluded environment using BAT algorithm
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102161openalex-snapshot
Pattern formation for fat robots with lights
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102189openalex-snapshot
Pattern formation for fat robots with memory
inferred← citeshttps://doi.org/10.1063/5.0329975openalex-snapshot
Circle formation of fat mobile robots using memory
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00083openalex-snapshot
Complete Visitability for Autonomous Robots on Graphs
inferred← citeshttps://doi.org/10.1109/jsen.2018.2879187openalex-snapshot
A Gray Relational Analysis-Based Motion Detection Algorithm for Real-World Surveillance Sensor Deployment
inferred← citeshttps://doi.org/10.1145/3154273.3154319openalex-snapshot
The Complete Visibility Problem for Fat Robots with Lights
inferred← citeshttps://doi.org/10.1145/3463369openalex-snapshot
SARDE
inferred← citeshttps://doi.org/10.3390/books978-3-0365-2843-4openalex-snapshot
Distributed Systems and Mobile Computing
inferred← citeshttps://doi.org/10.3390/info12110448openalex-snapshot
Time-Optimal Gathering under Limited Visibility with One-Axis Agreement
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.