On the public citation graph
Linear and Competitive Strategies for Continuous Robot Formation Problems
0 signed · 34 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.
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.
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/3-540-45061-0_90openalex-snapshot
Solving the Robots Gathering Problem
inferredcites →https://doi.org/10.1007/978-0-387-34733-2openalex-snapshot
Biologically Inspired Cooperative Computing
inferredcites →https://doi.org/10.1007/978-0-387-34733-2_14openalex-snapshot
Maintaining Communication Between an Explorer and a Base Station
inferredcites →https://doi.org/10.1007/978-3-540-72951-8_22openalex-snapshot
Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
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-540-87527-7_7openalex-snapshot
Gathering Multiple Robotic Agents with Crude Distance Sensing Capabilities
inferredcites →https://doi.org/10.1007/978-3-642-05434-1_23openalex-snapshot
Self-stabilizing Deterministic Gathering
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-22212-2_12openalex-snapshot
Convergence with Limited Visibility by Asynchronous Mobile Robots
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.2008.04.010openalex-snapshot
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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.1137/s0097539704446475openalex-snapshot
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
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
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-11072-7_13openalex-snapshot
Continuous Protocols for Swarm Robotics
inferred← citeshttps://doi.org/10.1007/978-3-030-54921-3_4openalex-snapshot
Local Gathering of Mobile Robots in Three Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-030-64348-5_6openalex-snapshot
A Discrete and Continuous Study of the Max-Chain-Formation Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-89240-1_3openalex-snapshot
Gathering a Euclidean Closed Chain of Robots in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_19openalex-snapshot
The Max-Line-Formation Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_1openalex-snapshot
Unifying Gathering Protocols for Swarms of Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_19openalex-snapshot
On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies
inferred← citeshttps://doi.org/10.1007/s00446-021-00406-6openalex-snapshot
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications
inferred← citeshttps://doi.org/10.1007/s11721-017-0140-yopenalex-snapshot
Continuous time gathering of agents with limited visibility and bearing-only sensing
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104877openalex-snapshot
A discrete and continuous study of the Max-Chain-Formation problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.10.031openalex-snapshot
Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
inferred← citeshttps://doi.org/10.1080/00207179.2018.1435906openalex-snapshot
Formation control for multi-robot systems with collision avoidance
inferred← citeshttps://doi.org/10.1137/20m1387584openalex-snapshot
Continuous Rendezvous Algorithm for Memoryless Agents with Limited Visibility in the Euclidean Space
inferred← citeshttps://doi.org/10.1145/3350755.3400263openalex-snapshot
A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up
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.