On the public citation graph
Motion planning with inertial constraints
0 signed · 87 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.3160390402openalex-snapshot
Generalized voronoi diagrams for moving a ladder. I: Topological analysis
inferredcites →https://doi.org/10.1080/00029890.1986.11971849openalex-snapshot
A Variation on the Landau Problem
inferredcites →https://doi.org/10.1109/sfcs.1985.36openalex-snapshot
Motion planning in the presence of moving obstacles
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-57132-9_2openalex-snapshot
Kinodynamic planning in a structured and time-varying workspace
inferred← citeshttps://doi.org/10.1007/978-1-4471-0765-1_27openalex-snapshot
To Learn or To Be Taught? Design Issues Towards Cognitive Robotics
inferred← citeshttps://doi.org/10.1007/978-1-4471-1021-7_27openalex-snapshot
Robot Motion Planning in Dynamic Environments
inferred← citeshttps://doi.org/10.1007/978-1-4615-3176-0_5openalex-snapshot
Singularities and Topological Aspects in Nonholonomic Motion Planning
inferred← citeshttps://doi.org/10.1007/978-1-4757-9805-0_10openalex-snapshot
Finding the Safest One-Dimensional Path among Obstacles for the Acceleration Constrained Robot
inferred← citeshttps://doi.org/10.1007/978-981-33-4932-2_10openalex-snapshot
Probability-Based Time-Optimal Motion Planning of Multi-robots Along Specified Paths
inferred← citeshttps://doi.org/10.1007/bf01258351openalex-snapshot
Dynamic Motion Planning using a distributed representation
inferred← citeshttps://doi.org/10.1007/bf01530890openalex-snapshot
Motion planning in the presence of movable obstacles
inferred← citeshttps://doi.org/10.1007/bf01586636openalex-snapshot
Provably good approximation algorithms for optimal kinodynamic planning: Robots with decoupled dynamics bounds
inferred← citeshttps://doi.org/10.1007/bf01891838openalex-snapshot
Continuous alternation: The complexity of pursuit in continuous domains
inferred← citeshttps://doi.org/10.1007/bf02526032openalex-snapshot
Time-optimal trajectories of a rod in the plane subject to velocity constraints
inferred← citeshttps://doi.org/10.1007/bf02574702openalex-snapshot
An exact algorithm for kinodynamic planning in the plane
inferred← citeshttps://doi.org/10.1007/bfb0036070openalex-snapshot
Guidelines in nonholonomic motion planning for mobile robots
inferred← citeshttps://doi.org/10.1007/s10514-018-9743-4openalex-snapshot
On the relationship between dynamics and complexity in multi-agent collision avoidance
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90153-9openalex-snapshot
Fastest path across constrained moving rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/0898-1221(94)90074-4openalex-snapshot
Approximate kinodynamic planning using L2-norm dynamic bounds
inferred← citeshttps://doi.org/10.1016/0952-1976(92)90092-xopenalex-snapshot
A simple path search strategy based on calculation of free sections of motions
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50013-8openalex-snapshot
Algorithmic Motion Planning in Robotics
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/b978-075065093-9/50013-xopenalex-snapshot
Decisional architectures for motion autonomy
inferred← citeshttps://doi.org/10.1017/s0263574700016556openalex-snapshot
Avoidance of obstacles with unknown trajectories: locally optimal paths and path complexity, Part I
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.1017/s0263574701003770openalex-snapshot
Velocity, acceleration and deceleration bounds for a time-optimal planner of a wheeled mobile robot
inferred← citeshttps://doi.org/10.1109/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1109/21.61210openalex-snapshot
Path tracking through uncharted moving obstacles
inferred← citeshttps://doi.org/10.1109/3468.686708openalex-snapshot
Two algorithms for a reachability problem in one-dimensional space
inferred← citeshttps://doi.org/10.1109/70.62041openalex-snapshot
Fast collision avoidance for manipulator arms: a sequential search strategy
inferred← citeshttps://doi.org/10.1109/70.650166openalex-snapshot
Incorporating body dynamics into sensor-based motion planning: the maximum turn strategy
inferred← citeshttps://doi.org/10.1109/70.88018openalex-snapshot
A hierarchical strategy for path planning among moving obstacles (mobile robot)
inferred← citeshttps://doi.org/10.1109/70.954753openalex-snapshot
Kinematic controllability for decoupled trajectory planning in underactuated mechanical systems
inferred← citeshttps://doi.org/10.1109/etfa.1992.683310openalex-snapshot
Minimum-time Smooth Path Planning For A Mobile Robot With Kinematic Constraints
inferred← citeshttps://doi.org/10.1109/icra.2012.6225233openalex-snapshot
Optimal acceleration-bounded trajectory planning in dynamic environments along a specified path
inferred← citeshttps://doi.org/10.1109/iros.1992.594208openalex-snapshot
Motion Planning With Acceleration Constraint
inferred← citeshttps://doi.org/10.1109/iros.1992.594217openalex-snapshot
Kinodynamic Planning With Moving Obstacles: The Case Of A Structured Workspace
inferred← citeshttps://doi.org/10.1109/iros.1993.583794openalex-snapshot
Dynamic trajectory planning with dynamic constraints: A 'state-time space' approach
inferred← citeshttps://doi.org/10.1109/iros.2001.973334openalex-snapshot
Reducing metric sensitivity in randomized trajectory design
inferred← citeshttps://doi.org/10.1109/isic.1989.238674openalex-snapshot
Near-optimal kinodynamic planning for robots with coupled dynamics bounds
inferred← citeshttps://doi.org/10.1109/ivs.2007.4290163openalex-snapshot
Planning of minimal-time trajectories for high speed autonomous vehicles
inferred← citeshttps://doi.org/10.1109/ivs.2013.6629533openalex-snapshot
Optimal longitudinal control planning with moving obstacles
inferred← citeshttps://doi.org/10.1109/robot.1990.125963openalex-snapshot
Time-optimal trajectories for a robot manipulator: a provably good approximation algorithm
inferred← citeshttps://doi.org/10.1109/robot.1990.126258openalex-snapshot
Fast collision avoidance for manipulator arms: a sequential search strategy
inferred← citeshttps://doi.org/10.1109/robot.1991.131638openalex-snapshot
Time-safety trade-offs and a bang-bang algorithm for kinodynamic planning
inferred← citeshttps://doi.org/10.1109/robot.1992.220039openalex-snapshot
Kinodynamic planning in a structured and time-varying 2-D workspace
inferred← citeshttps://doi.org/10.1109/robot.1992.220041openalex-snapshot
On motion planning amidst transient obstacles
inferred← citeshttps://doi.org/10.1109/robot.1993.292121openalex-snapshot
Path-velocity decomposition revisited and applied to dynamic trajectory planning
inferred← citeshttps://doi.org/10.1109/robot.1994.351009openalex-snapshot
Car-like robots and moving obstacles
inferred← citeshttps://doi.org/10.1109/robot.1996.506925openalex-snapshot
Time optimal trajectory planning in dynamic environments
inferred← citeshttps://doi.org/10.1109/robot.1999.770022openalex-snapshot
Randomized kinodynamic planning
inferred← citeshttps://doi.org/10.1109/robot.2001.933127openalex-snapshot
Kinematic controllability and decoupled trajectory planning for underactuated mechanical systems
inferred← citeshttps://doi.org/10.1109/robot.2007.363587openalex-snapshot
Decidability of Motion Planning with Differential Constraints
inferred← citeshttps://doi.org/10.1109/robot.2010.5509481openalex-snapshot
Balancing state-space coverage in planning with dynamics
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21947openalex-snapshot
On the complexity of kinodynamic planning
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.1145/160985.161012openalex-snapshot
Optimal motion planning for a rod in the plane subject to velocity constraints
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/73393.73422openalex-snapshot
Motion planning in the presence of movable obstacles
inferred← citeshttps://doi.org/10.1145/98524.98584openalex-snapshot
An exact algorithm for kinodynamic planning in the plane
inferred← citeshttps://doi.org/10.1163/156855399x00928openalex-snapshot
Trajectory planning in a dynamic workspace: a 'state-time space' approach
inferred← citeshttps://doi.org/10.1177/02783640122067453openalex-snapshot
Randomized Kinodynamic Planning
inferred← citeshttps://doi.org/10.1177/02783640122067633openalex-snapshot
Algorithms for Computing Numerical Optimal Feedback Motion Strategies
inferred← citeshttps://doi.org/10.1177/0278364905051974openalex-snapshot
Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths
inferred← citeshttps://doi.org/10.1177/0278364915614386openalex-snapshot
Asymptotically optimal sampling-based kinodynamic planning
inferred← citeshttps://doi.org/10.1177/027836499401300502openalex-snapshot
Motion Planning Amid Transient Obstacles
inferred← citeshttps://doi.org/10.1177/027836499401300603openalex-snapshot
Avoidance of Obstacles With Unknown Trajectories: Locally Optimal Paths and Periodic Sensor Readings
inferred← citeshttps://doi.org/10.21236/ada325994openalex-snapshot
Nonholonomic Motion Planning versus Controllability via the Multibody Car System Example,
inferred← citeshttps://doi.org/10.31274/rtd-20201118-79openalex-snapshot
Reducing RRT metric sensitivity for motion planning with differential constraints
inferred← citeshttps://doi.org/10.4995/thesis/10251/10294openalex-snapshot
Trajectory planning for industrial robot using genetic algorithms
inferred← citeshttps://doi.org/10.5555/313852.314093openalex-snapshot
Approximation algorithms for curvature-constrained shortest paths
inferred← citeshttps://doi.org/10.5772/4780openalex-snapshot
Optimal Velocity Planning of Wheeled Mobile Robots on Specific Paths in Static and Dynamic Environments
inferred← citeshttps://doi.org/10.70675/d87a4af2zc2dez4270z8792z497250fa7108openalex-snapshot
Kinodynamic motion planning for quadrotor-like aerial robots
inferred← citeshttps://doi.org/10.7210/jrsj.11.1124openalex-snapshot
Special Issue: Robot Behavior. Strategy & Algorithm. Motion Strategies and Algorithms.
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.