mlsanityData to 14 Oct 2026

Fast Kinodynamic Planning on the Constraint Manifold with Deep Neural Networks

arXiv 2301.04330 ↗First posted 11 Jan 2023cs.RO cs.AIcited by 9

Not on the map. Why?

Abstract (arXiv)

Motion planning is a mature area of research in robotics with many well-established methods based on optimization or sampling the state space, suitable for solving kinematic motion planning. However, when dynamic motions under constraints are needed and computation time is limited, fast kinodynamic planning on the constraint manifold is indispensable. In recent years, learning-based solutions have become alternatives to classical approaches, but they still lack comprehensive handling of complex constraints, such as planning on a lower-dimensional manifold of the task space while considering the robot's dynamics. This paper introduces a novel learning-to-plan framework that exploits the concept of constraint manifold, including dynamics, and neural planning methods. Our approach generates plans satisfying an arbitrary set of constraints and computes them in a short constant time, namely the inference time of a neural network. This allows the robot to plan and replan reactively, making our approach suitable for dynamic environments. We validate our approach on two simulated tasks and in a demanding real-world scenario, where we use a Kuka LBR Iiwa 14 robotic arm to perform the hitting movement in robotic Air Hockey.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 23 of its 88 references that are in the map. First posted on arXiv 11 Jan 2023.

Builds on

23 of 88 references.

References · 23

  1. 2020Responsive Safety in Reinforcement Learning by PID Lagrangian Methodscited by 316
  2. 2019Motion Planning Networks: Bridging the Gap Between Learning-based and Classical Motion Plannerscited by 66
  3. 2017Continuous-Time Gaussian Process Motion Planning via Probabilistic Inferencecited by 49
  4. 2014Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphscited by 39
  5. 2020Learning to Play Table Tennis From Scratch using Muscular Robotscited by 35
  6. 2020Perspectives on Sim2Real Transfer for Robotics: A Summary of the R:SS 2020 Workshopcited by 25
  7. 2017Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Searchcited by 23
  8. 2014Asymptotically Optimal Sampling-based Kinodynamic Planningcited by 17
  9. 2018Learning Implicit Sampling Distributions for Motion Planningcited by 16
  10. 2020High Acceleration Reinforcement Learning for Real-World Juggling with Binary Rewardscited by 14
  11. 2020Constrained Motion Planning Networks Xcited by 9
  12. 2021MPC-MPNet: Model-Predictive Motion Planning Networks for Fast, Near-Optimal Planning under Kinodynamic Constraintscited by 8
11 more
  1. 2021Efficient and Reactive Planning for High Speed Robot Air Hockeycited by 8
  2. 2019Learn and Link: Learning Critical Regions for Efficient Planningcited by 7
  3. 2019Trajectory Optimization on Manifolds: A Theoretically-Guaranteed Embedded Sequential Convex Programming Approachcited by 4
  4. 2020Learning from Experience for Rapid Generation of Local Car Maneuverscited by 4
  5. 2020An analytical diabolo model for robotic learning and controlcited by 3
  6. 2022State Supervised Steering Function for Sampling-based Kinodynamic Planningcited by 3
  7. 2015An Asymptotically-Optimal Sampling-Based Algorithm for Bi-directional Motion Planningcited by 2
  8. 2017RRT-CoLearn: towards kinodynamic planning without numerical trajectory optimizationcited by 2
  9. 2020Batch and Incremental Kinodynamic Motion Planning using Dynamic Factor Graphscited by 2
  10. 2022Speeding up deep neural network-based planning of local car maneuvers via efficient B-spline path constructioncited by 2
  11. 2021Accelerating Kinodynamic RRT* Through Dimensionality Reductioncited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 6; 2025: 1; 2026: 2.

9 papers.