SOURCE-LINKED INTELLIGENCE

Rapidly-Iterating Grid-Based Near-Optimal Kinodynamic Motion Planning

arXiv · AI, language, vision and robotics · article · Sep 19, 2026 · UTC

This paper develops the Rapidly-iterating kinoDynamic Grid (RDG) algorithm, an asymptotically near-optimal kinodynamic motion planning algorithm that produces high quality solutions through rapid iteration. The algorithm leverages a state space grid decomposition to perform node selection, dynamics propagation, and graph revision in constant time complexity with respect to the number of nodes in the trajectory tree. Through a covering ball sequence induction proof, the algorithm is shown to be asymptotically near-optimal and probabilistically complete. Different subsystems of the algorithm are

Read original source ↗ Open in workspace

recordType

paper

region

Global