arXiv (All)
open access
Rapidly-Iterating Grid-Based Near-Optimal Kinodynamic Motion Planning
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Machine-Learning-Enhanced Discretize-then-Project Reduced-Order Modeling of Turbulent Flows on Collocated Grids#1035381
- Moving Mesh with Streamline Upwind Petrov-Galerkin (MM-SUPG) Method for Time-dependent Convection-Dominated Convection-Diffusion Problems#141605
- Neural Residual Modeling for Scientific Data Compression under Guaranteed Error Bounds#1048929
- A Decomposition Method for LQ Conditional McKean-Vlasov Control Problems with Random Coefficients#1012184
- Quantitative Target Convergence and Uniform-in-Time Propagation of Chaos for Langevin-Regularized SVGD#793065
Record · ID 1037416
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive