AURA: Asymptotically Optimal Uncertainty-Robust Replanning Algorithm for Kinodynamic Systems

• URL: http://arxiv.org/abs/2605.27699v1
• Date: Tue, 26 May 2026 21:20:09 GMT
• Title: AURA: Asymptotically Optimal Uncertainty-Robust Replanning Algorithm for Kinodynamic Systems
• Abstract summary: Sampling-based motion planners offer a practical and scalable approach to kinodynamic motion planning.<n>These planners are typically used offline, requiring execution to begin only after the trajectory has been computed.<n>In this work, these limitations were addressed within a unified framework, method, that improves both path quality and tracking performance during execution.
• Score: 1.137457877869062
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Sampling-based motion planners offer a practical and scalable approach to kinodynamic motion planning, notably for high-dimensional, underactuated, or non-holonomic systems. However, these planners are typically used offline, requiring execution to begin only after the trajectory has been computed. In addition, the planned trajectory may not be accurately tracked in the presence of motion uncertainty, leading to deviations from the nominal solution. In this work, these limitations were addressed within a unified framework, \method, an asymptotically-optimal meta-planner framework that improves both path quality and tracking performance during execution. In addition to the main execution thread, this framework comprises a replanning method that continuously explores the state space and refines the trajectory during execution, and an optimization process that refines future control inputs to reduce tracking error. Together, these components enable \method to leverage asymptotically optimal planning online while improving execution accuracy under uncertainty. The proposed approach is evaluated in both simulation and real-world environments across multiple systems, demonstrating consistent improvements in trajectory quality, tracking accuracy, and overall performance compared with baseline methods.

Related papers

• Dynamic Evaluation of Classical and Control-Aware Optimal Trajectory Planning in Robot Manipulators [0.0]
  Trajectory planning influences tracking accuracy, actuator demand, and overall execution behavior in robotic manipulators.<n>Classical planners such as cubic, quintic, and trapezoidal profiles are widely used for their simplicity and smoothness.<n>This paper presents a control-aware optimal trajectory planning framework that explicitly incorporates manipulator dynamics and actuator effort.
  arXiv  Detail & Related papers  (2026-07-06T18:26:48Z)
• Feedback Motion Planning for Stochastic Nonlinear Systems with Signal Temporal Logic Specifications [25.484834028091083]
  We study feedback motion planning for continuous-time nonlinear systems under signal temporal logic (STL) specifications.<n>We propose a framework that synthesizes control policies for chance-constrained STL trajectory optimization problems.
  arXiv  Detail & Related papers  (2026-05-04T09:02:16Z)
• Sampling-Based Control via Entropy-Regularized Optimal Transport [18.278741443124655]
  OT-MPC is a sampling-based algorithm that overcomes limitations through an entropy-regularized optimal transport formulation.<n>We derive closed-form, gradient-free updates via the Sinkhorn algorithm, enabling real-time performance.
  arXiv  Detail & Related papers  (2026-05-04T02:07:15Z)
• Closing the Train-Test Gap in World Models for Gradient-Based Planning [64.36544881136405]
  We propose improved methods for training world models that enable efficient gradient-based planning.<n>At test time, our approach outperforms or matches the classical gradient-free cross-entropy method.
  arXiv  Detail & Related papers  (2025-12-10T18:59:45Z)
• Online Inference of Constrained Optimization: Primal-Dual Optimality and Sequential Quadratic Programming [55.848340925419286]
  We study online statistical inference for the solutions of quadratic optimization problems with equality and inequality constraints.<n>We develop a sequential programming (SSQP) method to solve these problems, where the step direction is computed by sequentially performing an approximation of the objective and a linear approximation of the constraints.<n>We show that our method global almost moving-average convergence and exhibits local normality with an optimal primal-dual limiting matrix in the sense of Hjek and Le Cam.
  arXiv  Detail & Related papers  (2025-11-27T06:16:17Z)
• Locally Optimal Descent for Dynamic Stepsize Scheduling [45.6809308002043]
  We introduce a novel dynamic learning scheduling scheme grounded in theory with the goal of simplifying the manual and time-consuming tuning of schedules in phases. Our approach is based on estimating a locally-optimal practice tuning-rate in the direction of a smooth gradient. Our findings indicate that our method needs minimal tuning when compared to existing approaches.
  arXiv  Detail & Related papers  (2023-11-23T09:57:35Z)
• A Unifying Variational Framework for Gaussian Process Motion Planning [44.332875416815384]
  We introduce a framework for robot motion planning based on variational Gaussian processes. Our framework provides a principled and flexible way to incorporate equality-based, inequality-based, and soft motion-planning constraints. Results show that our proposed approach yields a good balance between success rates and path quality.
  arXiv  Detail & Related papers  (2023-09-02T07:51:29Z)
• Introduction to Online Control [31.67032731719622]
  In online nonstochastic control, both the cost functions as well as the perturbations from the assumed dynamical model are chosen by an adversary.<n>The target is to attain low regret against the best policy in hindsight from a benchmark class of policies.
  arXiv  Detail & Related papers  (2022-11-17T16:12:45Z)
• Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs [113.8752163061151]
  We study episodic reinforcement learning (RL) in non-stationary linear kernel Markov decision processes (MDPs)<n>We propose the underlineperiodically underlinerestarted underlineoptimistic underlinepolicy underlineoptimization algorithm (PROPO)<n>PROPO features two mechanisms: sliding-window-based policy evaluation and periodic-restart-based policy improvement.
  arXiv  Detail & Related papers  (2021-10-18T02:33:20Z)
• On Constraints in First-Order Optimization: A View from Non-Smooth Dynamical Systems [99.59934203759754]
  We introduce a class of first-order methods for smooth constrained optimization. Two distinctive features of our approach are that projections or optimizations over the entire feasible set are avoided. The resulting algorithmic procedure is simple to implement even when constraints are nonlinear.
  arXiv  Detail & Related papers  (2021-07-17T11:45:13Z)
• Application-Driven Learning: A Closed-Loop Prediction and Optimization Approach Applied to Dynamic Reserves and Demand Forecasting [41.94295877935867]
  We present application-driven learning, a new closed-loop framework in which the processes of forecasting and decision-making are merged and co-optimized. We show that the proposed methodology is scalable and yields consistently better performance than the standard open-loop approach.
  arXiv  Detail & Related papers  (2021-02-26T02:43:28Z)
• Reinforcement Learning for Low-Thrust Trajectory Design of Interplanetary Missions [77.34726150561087]
  This paper investigates the use of reinforcement learning for the robust design of interplanetary trajectories in presence of severe disturbances. An open-source implementation of the state-of-the-art algorithm Proximal Policy Optimization is adopted. The resulting Guidance and Control Network provides both a robust nominal trajectory and the associated closed-loop guidance law.
  arXiv  Detail & Related papers  (2020-08-19T15:22:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.