On the public citation graph

Dynamic Motion Planning using a distributed representation

https://doi.org/10.1007/bf01258351
0 signed · 24 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/978-1-4613-8997-2_22openalex-snapshot
Solving the Find-Path Problem by Good Representation of Free Space
inferredcites →https://doi.org/10.1007/bf01840370openalex-snapshot
Motion planning with inertial constraints
inferredcites →https://doi.org/10.1007/bf01840371openalex-snapshot
On multiple moving objects
inferredcites →https://doi.org/10.1016/0167-8191(96)80006-8openalex-snapshot
Parallel path planning on the distributed array processor
inferredcites →https://doi.org/10.1016/s0921-8890(05)80025-9openalex-snapshot
Elephants don't play chess
inferredcites →https://doi.org/10.1109/21.214770openalex-snapshot
Stealth terrain navigation
inferredcites →https://doi.org/10.1109/70.88018openalex-snapshot
A hierarchical strategy for path planning among moving obstacles (mobile robot)
inferredcites →https://doi.org/10.1109/robot.1984.1087218openalex-snapshot
Obstacle avoidance using an octree in the configuration space of a manipulator
inferredcites →https://doi.org/10.1109/sfcs.1985.36openalex-snapshot
Motion planning in the presence of moving obstacles
inferredcites →https://doi.org/10.1109/tsmc.1983.6313112openalex-snapshot
Solving the find-path problem by good representation of free space
inferredcites →https://doi.org/10.1109/tsmc.1985.6313352openalex-snapshot
A subdivision algorithm in configuration space for findpath with rotation
inferredcites →https://doi.org/10.1177/027836498400300101openalex-snapshot
Automatic Synthesis of Fine-Motion Strategies for Robots
inferredcites →https://doi.org/10.1177/027836498600500304openalex-snapshot
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
inferredcites →https://doi.org/10.5244/c.4.68openalex-snapshot
A parallel path planning algorithm for 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.1016/0167-8191(96)80006-8openalex-snapshot
Parallel path planning on the distributed array processor
inferred← citeshttps://doi.org/10.1016/j.micpro.2005.02.002openalex-snapshot
A parallel algorithm, architecture and FPGA realization for high speed determination of the complete visibility graph for convex objects
inferred← citeshttps://doi.org/10.1016/j.robot.2005.03.003openalex-snapshot
VLSI-efficient schemes for high-speed construction of tangent graph
inferred← citeshttps://doi.org/10.1016/s0167-739x(02)00077-8openalex-snapshot
A directional diffusion algorithm on cellular automata for robot path-planning
inferred← citeshttps://doi.org/10.1023/a:1013949515552openalex-snapshot
High-Speed Environment Representation Scheme for Dynamic Path Planning
inferred← citeshttps://doi.org/10.1023/a:1020292101435openalex-snapshot
Environment Modelling for Robot Navigation Using VLSI-Efficient Logarithmic Approximation Method
inferred← citeshttps://doi.org/10.1109/iros.1996.569036openalex-snapshot
A decentralized approach for the conflict-free motion of multiple mobile robots
inferred← citeshttps://doi.org/10.1109/iscas.2003.1206206openalex-snapshot
Low cost logarithmic techniques for high-precision computations
inferred← citeshttps://doi.org/10.1109/robot.1997.606881openalex-snapshot
Conflict-free motion of multiple mobile robots based on decentralized motion planning and negotiation
inferred← citeshttps://doi.org/10.1163/156855397x00353openalex-snapshot
A decentralized approach for the conflict-free motion of multiple mobile robots
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.