On the public citation graph

Gathering Asynchronous Mobile Robots with Inaccurate Compasses

0 signed · 64 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/11429647_20openalex-snapshot
On the Feasibility of Gathering by Autonomous Mobile Robots
inferredcites →https://doi.org/10.1007/11672142_45openalex-snapshot
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
inferredcites →https://doi.org/10.1007/11864219_4openalex-snapshot
Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
inferredcites →https://doi.org/10.1007/11945529_24openalex-snapshot
Gathering Asynchronous Mobile Robots with Inaccurate Compasses
inferredcites →https://doi.org/10.1007/3-540-45061-0_90openalex-snapshot
Solving the Robots Gathering Problem
inferredcites →https://doi.org/10.1007/3-540-45446-2_10openalex-snapshot
Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Sset of Autonomous Mobile Robots
inferredcites →https://doi.org/10.1007/978-3-540-24698-5_60openalex-snapshot
Gathering Non-oblivious Mobile Robots
inferredcites →https://doi.org/10.1007/978-3-540-49823-0_34openalex-snapshot
Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility
inferredcites →https://doi.org/10.1016/j.tcs.2005.01.001openalex-snapshot
Gathering of asynchronous robots with limited visibility
inferredcites →https://doi.org/10.1017/cbo9781139168724openalex-snapshot
Introduction to Distributed Algorithms
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/ivs.2000.898389openalex-snapshot
Distributed coordination of a set of autonomous mobile robots
inferredcites →https://doi.org/10.1137/050631562openalex-snapshot
Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
inferredcites →https://doi.org/10.1137/s009753979628292xopenalex-snapshot
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
inferredcites →https://doi.org/10.1145/151254.151256openalex-snapshot
Self-stabilization
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.5555/982792.982951openalex-snapshot
Fault-tolerant gathering algorithms for autonomous mobile robots
inferredcites →https://doi.org/10.7551/mitpress/6156.001.0001openalex-snapshot
Self-Stabilization

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-030-01325-7_30openalex-snapshot
Gathering in the Plane of Location-Aware Robots in the Presence of Spies
inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_13openalex-snapshot
Continuous Protocols for Swarm Robotics
inferred← citeshttps://doi.org/10.1007/978-3-0348-0130-0_35openalex-snapshot
Energy-Awareness in Self-organising Robotic Exploration Teams
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/978-3-319-72050-0_10openalex-snapshot
Evacuation from a Disc in the Presence of a Faulty Robot
inferred← citeshttps://doi.org/10.1007/978-3-319-72751-6_6openalex-snapshot
Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_3openalex-snapshot
Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_5openalex-snapshot
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_22openalex-snapshot
Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_24openalex-snapshot
Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_8openalex-snapshot
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
inferred← citeshttps://doi.org/10.1007/978-3-540-87527-7_7openalex-snapshot
Gathering Multiple Robotic Agents with Crude Distance Sensing Capabilities
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_10openalex-snapshot
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_27openalex-snapshot
Randomized Gathering of Mobile Robots with Local-Multiplicity Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_32openalex-snapshot
Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_24openalex-snapshot
Convergence of Mobile Robots with Uniformly-Inaccurate Sensors
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_15openalex-snapshot
Collisionless Gathering of Robots with an Extent
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_52openalex-snapshot
A New Approach for Analyzing Convergence Algorithms for Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-642-22212-2_13openalex-snapshot
Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_30openalex-snapshot
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
inferred← citeshttps://doi.org/10.1007/s00446-017-0296-0openalex-snapshot
Search on a line with faulty robots
inferred← citeshttps://doi.org/10.1007/s00453-011-9611-5openalex-snapshot
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
inferred← citeshttps://doi.org/10.1007/s00453-016-0233-9openalex-snapshot
When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.042openalex-snapshot
Distributed algorithms for partitioning a swarm of autonomous mobile robots
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.07.026openalex-snapshot
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.056openalex-snapshot
Energy-efficient strategies for building short chains of mobile robots locally
inferred← citeshttps://doi.org/10.1109/dsn.2007.61openalex-snapshot
Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2013.27openalex-snapshot
Gathering of Mobile Robots Tolerating Multiple Crash Faults
inferred← citeshttps://doi.org/10.1109/icnc.2011.71openalex-snapshot
Distributed Algorithms for Cooperative Mobile Robots: A Survey
inferred← citeshttps://doi.org/10.1109/iros.2015.7354108openalex-snapshot
Tight analysis of a collisionless robot gathering algorithm
inferred← citeshttps://doi.org/10.1109/tpds.2012.212openalex-snapshot
Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots
inferred← citeshttps://doi.org/10.1142/s1793830922500306openalex-snapshot
Optimal rendezvous on a line by location-aware robots in the presence of spies*
inferred← citeshttps://doi.org/10.1145/1462187.1462196openalex-snapshot
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility
inferred← citeshttps://doi.org/10.1145/1810479.1810523openalex-snapshot
A local O(n 2 ) gathering algorithm
inferred← citeshttps://doi.org/10.1145/1989493.1989515openalex-snapshot
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility
inferred← citeshttps://doi.org/10.1145/2312005.2312009openalex-snapshot
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
inferred← citeshttps://doi.org/10.1145/2742341openalex-snapshot
Linear and Competitive Strategies for Continuous Robot Formation Problems
inferred← citeshttps://doi.org/10.1145/2933057.2933102openalex-snapshot
Search on a Line with Faulty Robots
inferred← citeshttps://doi.org/10.1145/3056460openalex-snapshot
Tight Analysis of a Collisionless Robot Gathering Algorithm
inferred← citeshttps://doi.org/10.2139/ssrn.6987139openalex-snapshot
The Defected View Model: A New Model for Autonomous Mobile Robots and the Solvability of Gathering Problem
inferred← citeshttps://doi.org/10.22215/etd/2021-14519openalex-snapshot
Search and Rendezvous by Mobile Robots in Continuous Domains
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
inferred← citeshttps://doi.org/10.4108/icst.robocomm2007.2199openalex-snapshot
Gathering Two Stateless Mobile Robots Using Very v
inferred← citeshttps://doi.org/10.5555/1377868.1377927openalex-snapshot
Gathering two stateless mobile robots using very inaccurate compasses in finite time
showing the first 45 of 46 · page through all 46
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.