On the public citation graph
Coordinated motion planning for two independent robots
0 signed · 48 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.1002/cpa.3160360305openalex-snapshot
On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers
inferredcites →https://doi.org/10.1002/cpa.3160390402openalex-snapshot
Generalized voronoi diagrams for moving a ladder. I: Topological analysis
inferredcites →https://doi.org/10.1007/bf01840348openalex-snapshot
Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
inferredcites →https://doi.org/10.1007/bf01840368openalex-snapshot
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
inferredcites →https://doi.org/10.1007/bf02187683openalex-snapshot
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
inferredcites →https://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferredcites →https://doi.org/10.1007/bf02187779openalex-snapshot
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
inferredcites →https://doi.org/10.1007/bf02187890openalex-snapshot
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
inferredcites →https://doi.org/10.1007/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1016/0097-3165(89)90032-0openalex-snapshot
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1016/0196-6774(85)90021-5openalex-snapshot
A “retraction” method for planning the motion of a disc
inferredcites →https://doi.org/10.1016/0196-6774(87)90038-1openalex-snapshot
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
inferredcites →https://doi.org/10.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1109/robot.1985.1087248openalex-snapshot
Algorithmic motion planning in robotics: Coordinated motion of several disks amidst polygonal obstacles
inferredcites →https://doi.org/10.1109/robot.1986.1087555openalex-snapshot
Coordinated motion of two robot arms
inferredcites →https://doi.org/10.1145/41958.41972openalex-snapshot
Moving a ladder in three dimensions: upper and lower bounds
inferredcites →https://doi.org/10.1145/73393.73432openalex-snapshot
Triangles in space or building (and analyzing) castles in the Air
inferredcites →https://doi.org/10.1177/027836498300200204openalex-snapshot
A Torque-Sensitive Tactile Array for Robotics
inferredcites →https://doi.org/10.1177/027836498300200304openalex-snapshot
On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers
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-44051-0_46openalex-snapshot
Motion Planning for Multiple Unit-Ball Robots in $$\mathbb {R}^{{\varvec{d}}}$$
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_28openalex-snapshot
Shortest Coordinated Motion for Square Robots
inferred← citeshttps://doi.org/10.1007/978-3-032-09970-9_22openalex-snapshot
Localization with Single or Antipodal Distance Measurements
inferred← citeshttps://doi.org/10.1007/978-3-319-16595-0_1openalex-snapshot
Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons
inferred← citeshttps://doi.org/10.1007/978-3-319-16595-0_34openalex-snapshot
Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-robot Motion Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-45058-0_15openalex-snapshot
Hybrid Motion Planning: Coordinating Two Discs Moving among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-41610-1_166-1openalex-snapshot
Complexity of Planning
inferred← citeshttps://doi.org/10.1007/pl00009476openalex-snapshot
Motion Planning for Multiple Robots
inferred← citeshttps://doi.org/10.1007/s00025-025-02479-2openalex-snapshot
Computing Shortest Paths Amid Non-overlapping Weighted Disks
inferred← citeshttps://doi.org/10.1007/s10514-025-10198-4openalex-snapshot
Shortest coordinated motions for square robots
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103898openalex-snapshot
On approximating shortest paths in weighted triangular tessellations
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114583openalex-snapshot
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
inferred← citeshttps://doi.org/10.1017/s0263574700016957openalex-snapshot
Avoidance of obstacles with unknown trajectories: locally optimal paths and path complexity, Part II
inferred← citeshttps://doi.org/10.1109/icra.2019.8793647openalex-snapshot
Efficient Kinodynamic Multi-Robot Replanning in Known Workspaces
inferred← citeshttps://doi.org/10.1109/tase.2015.2470096openalex-snapshot
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons
inferred← citeshttps://doi.org/10.1137/s0363012901387562openalex-snapshot
Optimal Coordinated Motions of Multiple Agents Moving on a Plane
inferred← citeshttps://doi.org/10.1142/s0218195902000724openalex-snapshot
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
inferred← citeshttps://doi.org/10.1145/276884.276926openalex-snapshot
Motion planning for multiple robots
inferred← citeshttps://doi.org/10.1145/336154.336219openalex-snapshot
Kinetic collision detection for simple polygons
inferred← citeshttps://doi.org/10.1177/0278364915615688openalex-snapshot
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning
inferred← citeshttps://doi.org/10.1177/0278364916672311openalex-snapshot
On the hardness of unlabeled multi-robot motion planning
inferred← citeshttps://doi.org/10.1177/0278364918784660openalex-snapshot
Effective metrics for multi-robot motion-planning
inferred← citeshttps://doi.org/10.15607/rss.2015.xi.046openalex-snapshot
On the hardness of unlabeled multi-robot motion planning
inferred← citeshttps://doi.org/10.22215/etd/2024-16080openalex-snapshot
Shortest Path Problems in Weighted Regions
inferred← citeshttps://doi.org/10.48550/arxiv.1305.2889openalex-snapshot
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning
inferred← citeshttps://doi.org/10.48550/arxiv.1705.10300openalex-snapshot
Effective Metrics for Multi-Robot Motion-Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1807.05428openalex-snapshot
Motion Planning for Multiple Unit-Ball Robots in $\mathbb{R}^d$
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.