On the public citation graph
Planning constrained motion
0 signed · 49 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/3-540-07407-4_17openalex-snapshot
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
inferredcites →https://doi.org/10.1007/bf01840370openalex-snapshot
Motion planning with inertial constraints
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.1017/cbo9780511565977openalex-snapshot
Transcendental Number Theory
inferredcites →https://doi.org/10.1109/sfcs.1985.36openalex-snapshot
Motion planning in the presence of moving obstacles
inferredcites →https://doi.org/10.1109/sfcs.1987.1openalex-snapshot
A new algebraic method for robot motion planning and real geometry
inferredcites →https://doi.org/10.1137/0313012openalex-snapshot
Plane Motion of a Particle Subject to Curvature Constraints
inferredcites →https://doi.org/10.1137/1025123openalex-snapshot
Determining the Path of the Rear Wheels of a Bus
inferredcites →https://doi.org/10.2140/pjm.1990.145.367openalex-snapshot
Optimal paths for a car that goes both forwards and backwards
inferredcites →https://doi.org/10.2307/2372560openalex-snapshot
On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_29openalex-snapshot
Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points
inferred← citeshttps://doi.org/10.1007/3-540-63938-1_68openalex-snapshot
Implementing a general-purpose edge router
inferred← citeshttps://doi.org/10.1007/978-3-319-13287-7_5openalex-snapshot
On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_56openalex-snapshot
A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
inferred← citeshttps://doi.org/10.1007/s00453-002-0950-0openalex-snapshot
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s10711-019-00444-2openalex-snapshot
Census of bounded curvature paths
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.07.003openalex-snapshot
Reachability by paths of bounded curvature in a convex polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.10.008openalex-snapshot
The cost of bounded curvature
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.09.001openalex-snapshot
Approximating minimum bending energy path in a simple corridor
inferred← citeshttps://doi.org/10.1109/acc.2008.4587292openalex-snapshot
Elastic multi-particle systems for bounded-curvature path planning
inferred← citeshttps://doi.org/10.1109/acc.2010.5530772openalex-snapshot
On the existence and synthesis of curvature-bounded paths inside nonuniform rectangular channels
inferred← citeshttps://doi.org/10.1109/acc.2010.5531607openalex-snapshot
A practical path-planning algorithm for a simple car: a Hamilton-Jacobi approach
inferred← citeshttps://doi.org/10.1109/access.2020.2975114openalex-snapshot
Constrained Hopping Traversability Analysis on Non-Uniform Polygonal Chains
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434966openalex-snapshot
Time-optimal paths for a Dubins airplane
inferred← citeshttps://doi.org/10.1109/icara.2015.7081133openalex-snapshot
SAMMY - an algorithm for efficient computation of a smooth path for reference trajectory generation
inferred← citeshttps://doi.org/10.1109/icra.2016.7487438openalex-snapshot
Planning motions for a planar robot attached to a stiff tether
inferred← citeshttps://doi.org/10.1109/lra.2018.2867069openalex-snapshot
On Existence and Synthesis of Smooth Four Parameter Logistic Paths Inside Annular Passages
inferred← citeshttps://doi.org/10.1109/robot.1995.525553openalex-snapshot
Planning paths of minimal curvature
inferred← citeshttps://doi.org/10.1109/robot.2009.5152520openalex-snapshot
Multi-vehicle path planning in dynamically changing environments
inferred← citeshttps://doi.org/10.1109/tro.2014.2315711openalex-snapshot
Curvature-Bounded Traversability Analysis in Motion Planning for Mobile Robots
inferred← citeshttps://doi.org/10.1137/100816079openalex-snapshot
Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization
inferred← citeshttps://doi.org/10.1137/s0097539700374550openalex-snapshot
Curvature-Constrained Shortest Paths in a Convex Polygon
inferred← citeshttps://doi.org/10.1137/s0097539796307790openalex-snapshot
Approximation Algorithms for Curvature-Constrained Shortest Paths
inferred← citeshttps://doi.org/10.1137/s0097539798331975openalex-snapshot
Nonuniform Discretization for Kinodynamic Motion Planning and its Applications
inferred← citeshttps://doi.org/10.1142/s0218195903001128openalex-snapshot
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles
inferred← citeshttps://doi.org/10.1145/1064092.1064135openalex-snapshot
Curvature-bounded traversals of narrow corridors
inferred← citeshttps://doi.org/10.1145/1247069.1247080openalex-snapshot
Finding curvature-constrained paths that avoid polygonal obstacles
inferred← citeshttps://doi.org/10.1145/225058.225158openalex-snapshot
Motion planning for a steering-constrained robot through moderate obstacles
inferred← citeshttps://doi.org/10.1145/276884.276928openalex-snapshot
Curvature-constrained shortest paths in a convex polygon (extended abstract)
inferred← citeshttps://doi.org/10.1145/336154.336211openalex-snapshot
Reachability by paths of bounded curvature in convex polygons
inferred← citeshttps://doi.org/10.1145/98524.98594openalex-snapshot
Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open chain manipulators
inferred← citeshttps://doi.org/10.14483/22487638.19197openalex-snapshot
Cooperative strategy to reduce path length in risky environments
inferred← citeshttps://doi.org/10.22517/23447214.24341openalex-snapshot
Two agents with GBFS algorithms working cooperatively to get a shortest path
inferred← citeshttps://doi.org/10.48550/arxiv.1008.4244openalex-snapshot
Reachability by Paths of Bounded Curvature in a Convex Polygon
inferred← citeshttps://doi.org/10.48550/arxiv.1106.6214openalex-snapshot
The Cost of Bounded Curvature
inferred← citeshttps://doi.org/10.5555/313852.314093openalex-snapshot
Approximation algorithms for curvature-constrained shortest paths
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.