On the public citation graph
Provably good approximation algorithms for optimal kinodynamic planning: Robots with decoupled dynamics bounds
0 signed · 74 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/978-1-4613-8997-2_28openalex-snapshot
Motion Planning for an Autonomous Vehicle
inferredcites →https://doi.org/10.1007/978-1-4615-3176-0_8openalex-snapshot
Planning Smooth Paths for Mobile Robots
inferredcites →https://doi.org/10.1007/bf01586637openalex-snapshot
Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open-chain manipulators
inferredcites →https://doi.org/10.1007/bf01840370openalex-snapshot
Motion planning with inertial constraints
inferredcites →https://doi.org/10.1007/bf02187878openalex-snapshot
Computing convolutions by reciprocal search
inferredcites →https://doi.org/10.1016/0020-0190(85)90029-8openalex-snapshot
An algorithm for shortest-path motion in three dimensions
inferredcites →https://doi.org/10.1090/s0273-0979-1987-15479-6openalex-snapshot
On the time-optimality of bang-bang trajectories in 𝐑³
inferredcites →https://doi.org/10.1109/cdc.1985.268795openalex-snapshot
Remarks on the time-optimal control of two-link manipulators
inferredcites →https://doi.org/10.1109/robot.1985.1087233openalex-snapshot
Planning a minimum-time trajectories for robot arms
inferredcites →https://doi.org/10.1109/robot.1986.1087463openalex-snapshot
Time-optimal control of manipulators
inferredcites →https://doi.org/10.1109/robot.1988.12076openalex-snapshot
Global time optimal motions of robotic manipulators in the presence of obstacles
inferredcites →https://doi.org/10.1109/robot.1988.12106openalex-snapshot
Motion planning for an autonomous vehicle
inferredcites →https://doi.org/10.1109/robot.1989.99959openalex-snapshot
Planning smooth paths for mobile robots
inferredcites →https://doi.org/10.1109/robot.1991.131638openalex-snapshot
Time-safety trade-offs and a bang-bang algorithm for kinodynamic planning
inferredcites →https://doi.org/10.1109/sfcs.1987.42openalex-snapshot
New lower bound techniques for robot motion planning problems
inferredcites →https://doi.org/10.1109/sfcs.1988.21947openalex-snapshot
On the complexity of kinodynamic planning
inferredcites →https://doi.org/10.1109/tc.1983.1676196openalex-snapshot
Spatial Planning: A Configuration Space Approach
inferredcites →https://doi.org/10.1109/tpami.1986.4767773openalex-snapshot
Collision Detection for Moving Polyhedra
inferredcites →https://doi.org/10.1145/10515.10525openalex-snapshot
Computing convolutions by reciprocal search
inferredcites →https://doi.org/10.1145/98524.98584openalex-snapshot
An exact algorithm for kinodynamic planning in the plane
inferredcites →https://doi.org/10.1177/027836498500400301openalex-snapshot
Time-Optimal Control of Robotic Manipulators Along Specified Paths
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
inferredcites →https://doi.org/10.23919/acc.1983.4788214openalex-snapshot
Dynamic Scaling of Manipulator Trajectories
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rob.20285openalex-snapshot
Differentially constrained mobile robot motion planning in state lattices
inferred← citeshttps://doi.org/10.1007/11889342_48openalex-snapshot
Algorithmic Motion Planning: The Randomized Approach
inferred← citeshttps://doi.org/10.1007/3-540-36224-x_2openalex-snapshot
From Dynamic Programming to RRTs: Algorithmic Design of Feasible Trajectories
inferred← citeshttps://doi.org/10.1007/978-3-031-88042-1_17openalex-snapshot
GeMoP: General Motion Planning in High Speed & Accuracy and Fast-Settle Application
inferred← citeshttps://doi.org/10.1007/978-3-540-45058-0_33openalex-snapshot
Trajectory Planning for Kinematically Controllable Underactuated Mechanical Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_5openalex-snapshot
The Compass That Steered Robotics
inferred← citeshttps://doi.org/10.1007/bf01586637openalex-snapshot
Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open-chain manipulators
inferred← citeshttps://doi.org/10.1007/bfb0036070openalex-snapshot
Guidelines in nonholonomic motion planning for mobile robots
inferred← citeshttps://doi.org/10.1007/s12206-011-0522-9openalex-snapshot
Dynamic self-collision detection and prevention for 2-DOF robot arms using interval-based analysis
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.04.002openalex-snapshot
On soft predicates in subdivision motion planning
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00019-3openalex-snapshot
Diagnosis of large active systems
inferred← citeshttps://doi.org/10.1017/cbo9780511546877.016openalex-snapshot
Planning Under Differential Constraints
inferred← citeshttps://doi.org/10.1017/cbo9780511546877.018openalex-snapshot
Sampling-Based Planning Under Differential Constraints
inferred← citeshttps://doi.org/10.1089/cmb.2006.13.1267openalex-snapshot
A Polynomial-Time Algorithm for De Novo Protein Backbone Structure Determination from Nuclear Magnetic Resonance Data
inferred← citeshttps://doi.org/10.1109/70.843168openalex-snapshot
Programming and control of robots by means of differential algebraic inequalities
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/access.2024.3389962openalex-snapshot
Path Generation Based on Electrostatic Equipotential Curves
inferred← citeshttps://doi.org/10.1109/icia.2005.1635121openalex-snapshot
A dynamic balanced algorithm for life-escaping
inferred← citeshttps://doi.org/10.1109/icra.2019.8793705openalex-snapshot
Improved A-search guided tree construction for kinodynamic planning
inferred← citeshttps://doi.org/10.1109/iros.2001.973334openalex-snapshot
Reducing metric sensitivity in randomized trajectory design
inferred← citeshttps://doi.org/10.1109/iros.2003.1250700openalex-snapshot
Exploiting group symmetries to improve precision in kinodynamic and nonholonomic planning
inferred← citeshttps://doi.org/10.1109/iros.2005.1545515openalex-snapshot
Dynamic interference avoidance of 2-DOF robot arms using interval analysis
inferred← citeshttps://doi.org/10.1109/iros.2009.5354274openalex-snapshot
Complementarity-based dynamic simulation for kinodynamic motion planning
inferred← citeshttps://doi.org/10.1109/iros.2015.7354072openalex-snapshot
Metric cells: Towards complete search for optimal trajectories
inferred← citeshttps://doi.org/10.1109/robot.1998.676243openalex-snapshot
Planning paths for a flexible surface patch
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.2002.1013372openalex-snapshot
Resolution complete rapidly-exploring random trees
inferred← citeshttps://doi.org/10.1109/robot.2004.1302404openalex-snapshot
Improving the performance of sampling-based planners by using a symmetry-exploiting gap reduction algorithm
inferred← citeshttps://doi.org/10.1109/robot.2004.1307395openalex-snapshot
Inverse kinematics-based motion planning for underactuated systems
inferred← citeshttps://doi.org/10.1109/tase.2018.2864773openalex-snapshot
Energy-Optimal Collision-Free Motion Planning for Multiaxis Motion Systems: An Alternating Quadratic Programming Approach
inferred← citeshttps://doi.org/10.1109/tcst.2024.3367468openalex-snapshot
Hierarchical Planning for Autonomous Parking in Dynamic Environments
inferred← citeshttps://doi.org/10.1137/s0097539798331975openalex-snapshot
Nonuniform Discretization for Kinodynamic Motion Planning and its Applications
inferred← citeshttps://doi.org/10.1145/2462356.2462386openalex-snapshot
On soft predicates in subdivision motion planning
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.2316/journal.206.2006.3.206-2804openalex-snapshot
RANDOMIZED MOTION PLANNING: A TUTORIAL
inferred← citeshttps://doi.org/10.23919/acc45564.2020.9147980openalex-snapshot
Improving Path Accuracy for Autonomous Parking Systems: An Optimal Control Approach
inferred← citeshttps://doi.org/10.2514/6.2016-0638openalex-snapshot
Adaptive Step-length RRT Algorithm for Improved Coverage
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.48550/arxiv.2005.12514openalex-snapshot
Batch and Incremental Kinodynamic Motion Planning using Dynamic Factor Graphs
inferred← citeshttps://doi.org/10.70675/d87a4af2zc2dez4270z8792z497250fa7108openalex-snapshot
Kinodynamic motion planning for quadrotor-like aerial 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.