Dynamic Neural Potential Field: Online Trajectory Optimization in the Presence of Moving Obstacles

• URL: http://arxiv.org/abs/2410.06819v2
• Date: Sat, 04 Oct 2025 10:47:48 GMT
• Title: Dynamic Neural Potential Field: Online Trajectory Optimization in the Presence of Moving Obstacles
• Authors: Aleksei Staroverov, Muhammad Alhaddad, Aditya Narendra, Konstantin Mironov, Aleksandr Panov,
• Abstract summary: We present Dynamic Potential Field (NPFieldGPT) as a learning predictive model control (MPC) framework.<n>NPField-GPT produces safer, more conservative trajectories under motion changes.<n>We also compare with the CIAO* and MPPI baselines.
• Score: 45.02872365395957
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Generalist robot policies must operate safely and reliably in everyday human environments such as homes, offices, and warehouses, where people and objects move unpredictably. We present Dynamic Neural Potential Field (NPField-GPT), a learning-enhanced model predictive control (MPC) framework that couples classical optimization with a Transformer-based predictor of footprint-aware repulsive potentials. Given an occupancy sub-map, robot footprint, and optional dynamic-obstacle cues, our autoregressive NPField-GPT head forecasts a horizon of differentiable potentials that are injected into a sequential quadratic MPC program via L4CasADi, yielding real-time, constraint-aware trajectory optimization. We additionally study two baselines: (NPField-D1) static-frame decomposition and (NPField-D2) parallel MLP heads for all steps. In dynamic indoor scenarios from BenchMR and on a Husky UGV in office corridors, NPField-GPT produces safer, more conservative trajectories under motion changes, while D1/D2 offer lower latency. We also compare with the CIAO* and MPPI baselines. Across methods, the Transformer+MPC synergy preserves the transparency and stability of model-based planning while learning only the part that benefits from data: spatiotemporal collision risk. Code and trained models are available at https://github.com/CognitiveAISystems/Dynamic-Neural-Potential-Field

Related papers

• Composable Model-Free RL for Navigation with Input-Affine Systems [3.2917282915992883]
  As autonomous robots move into complex, dynamic real-world environments, they must learn to navigate safely in real time.<n>We propose a composable, model-free reinforcement learning method that learns a value function and an optimal policy for each individual environment element.
  arXiv  Detail & Related papers  (2026-02-13T00:19:35Z)
• Model-Based Policy Adaptation for Closed-Loop End-to-End Autonomous Driving [54.46325690390831]
  We propose Model-based Policy Adaptation (MPA), a general framework that enhances the robustness and safety of pretrained E2E driving agents during deployment.<n>MPA first generates diverse counterfactual trajectories using a geometry-consistent simulation engine.<n>MPA trains a diffusion-based policy adapter to refine the base policy's predictions and a multi-step Q value model to evaluate long-term outcomes.
  arXiv  Detail & Related papers  (2025-11-26T17:01:41Z)
• Amortized Active Generation of Pareto Sets [48.56811624922571]
  A-GPS is a new framework for online discrete black-box multi-objective optimization.<n>Method employs a class probability estimator to predict non-dominance relations.<n>We show that this non-dominance CPE implicitly estimates the probability of hypervolume improvement.
  arXiv  Detail & Related papers  (2025-10-23T23:49:23Z)
• SP2RINT: Spatially-Decoupled Physics-Inspired Progressive Inverse Optimization for Scalable, PDE-Constrained Meta-Optical Neural Network Training [23.920752887898658]
  SP2RINT is a spatially decoupled, progressive training framework for meta-optical neural systems.<n>It achieves digital-comparable accuracy while being 1825 times faster than simulation-in-the-loop approaches.
  arXiv  Detail & Related papers  (2025-05-23T21:05:40Z)
• Future-Oriented Navigation: Dynamic Obstacle Avoidance with One-Shot Energy-Based Multimodal Motion Prediction [10.379552390135226]
  This paper proposes an integrated approach for the safe and efficient control of mobile robots in dynamic and uncertain environments. The approach consists of two key steps: one-shot multimodal motion prediction to anticipate motions of dynamic obstacles and model predictive control to incorporate these predictions into the motion planning process.
  arXiv  Detail & Related papers  (2025-05-01T01:13:56Z)
• Monte Carlo Tree Search with Velocity Obstacles for safe and efficient motion planning in dynamic environments [49.30744329170107]
  We propose a novel approach for optimal online motion planning with minimal information about dynamic obstacles. The proposed methodology combines Monte Carlo Tree Search (MCTS), for online optimal planning via model simulations, with Velocity Obstacles (VO), for obstacle avoidance. We show the superiority of our methodology with respect to state-of-the-art planners, including Non-linear Model Predictive Control (NMPC), in terms of improved collision rate, computational and task performance.
  arXiv  Detail & Related papers  (2025-01-16T16:45:08Z)
• Probabilistic Reach-Avoid for Bayesian Neural Networks [71.67052234622781]
  We show that an optimal synthesis algorithm can provide more than a four-fold increase in the number of certifiable states. The algorithm is able to provide more than a three-fold increase in the average guaranteed reach-avoid probability.
  arXiv  Detail & Related papers  (2023-10-03T10:52:21Z)
• Domain Randomization for Robust, Affordable and Effective Closed-loop Control of Soft Robots [10.977130974626668]
  Soft robots are gaining popularity thanks to their intrinsic safety to contacts and adaptability. We show how Domain Randomization (DR) can solve this problem by enhancing RL policies for soft robots. We introduce a novel algorithmic extension to previous adaptive domain randomization methods for the automatic inference of dynamics parameters for deformable objects.
  arXiv  Detail & Related papers  (2023-03-07T18:50:00Z)
• ProDMPs: A Unified Perspective on Dynamic and Probabilistic Movement Primitives [0.0]
  Movement Primitives (MPs) are a well-known concept to represent and generate modular trajectories. MPs can be broadly categorized into two types: Dynamic Movement Primitives (DMPs) and Probabilistic Movement Primitives (ProMPs)
  arXiv  Detail & Related papers  (2022-10-04T11:20:20Z)
• Constrained Dynamic Movement Primitives for Safe Learning of Motor Skills [25.06692536893836]
  We present constrained dynamic movement primitives (CDMP) which can allow for constraint satisfaction in the robot workspace. A video showing the implementation of the proposed algorithm using different manipulators in different environments could be found here.
  arXiv  Detail & Related papers  (2022-09-28T22:59:33Z)
• Learning Robust Policy against Disturbance in Transition Dynamics via State-Conservative Policy Optimization [63.75188254377202]
  Deep reinforcement learning algorithms can perform poorly in real-world tasks due to discrepancy between source and target environments. We propose a novel model-free actor-critic algorithm to learn robust policies without modeling the disturbance in advance. Experiments in several robot control tasks demonstrate that SCPO learns robust policies against the disturbance in transition dynamics.
  arXiv  Detail & Related papers  (2021-12-20T13:13:05Z)
• Nonprehensile Riemannian Motion Predictive Control [57.295751294224765]
  We introduce a novel Real-to-Sim reward analysis technique to reliably imagine and predict the outcome of taking possible actions for a real robotic platform. We produce a closed-loop controller to reactively push objects in a continuous action space. We observe that RMPC is robust in cluttered as well as occluded environments and outperforms the baselines.
  arXiv  Detail & Related papers  (2021-11-15T18:50:04Z)
• GPU-accelerated Optimal Path Planning in Stochastic Dynamic Environments [0.0]
  Planning time and energy optimal paths for autonomous marine vehicles is essential to reduce operational costs. Decision Processes (MDPs) provide a natural framework for sequential decision-making for robotic agents in such environments. We introduce an efficient end-to-end-accelerated algorithm that builds the MDP model and solves the MDP to compute an optimal policy.
  arXiv  Detail & Related papers  (2021-09-02T12:14:34Z)
• SABER: Data-Driven Motion Planner for Autonomously Navigating Heterogeneous Robots [112.2491765424719]
  We present an end-to-end online motion planning framework that uses a data-driven approach to navigate a heterogeneous robot team towards a global goal. We use model predictive control (SMPC) to calculate control inputs that satisfy robot dynamics, and consider uncertainty during obstacle avoidance with chance constraints. recurrent neural networks are used to provide a quick estimate of future state uncertainty considered in the SMPC finite-time horizon solution. A Deep Q-learning agent is employed to serve as a high-level path planner, providing the SMPC with target positions that move the robots towards a desired global goal.
  arXiv  Detail & Related papers  (2021-08-03T02:56:21Z)
• MPC-MPNet: Model-Predictive Motion Planning Networks for Fast, Near-Optimal Planning under Kinodynamic Constraints [15.608546987158613]
  Kinodynamic Motion Planning (KMP) is computation to find a robot motion subject to concurrent kinematics and dynamics constraints. We present a scalable, imitation learning-based, Model-Predictive Motion Planning Networks framework that finds near-optimal path solutions. We evaluate our algorithms on a range of cluttered, kinodynamically constrained, and underactuated planning problems with results indicating significant improvements in times, path qualities, and success rates over existing methods.
  arXiv  Detail & Related papers  (2021-01-17T23:07:04Z)
• Neural Dynamic Policies for End-to-End Sensorimotor Learning [51.24542903398335]
  The current dominant paradigm in sensorimotor control, whether imitation or reinforcement learning, is to train policies directly in raw action spaces. We propose Neural Dynamic Policies (NDPs) that make predictions in trajectory distribution space. NDPs outperform the prior state-of-the-art in terms of either efficiency or performance across several robotic control tasks.
  arXiv  Detail & Related papers  (2020-12-04T18:59:32Z)
• Risk-Averse MPC via Visual-Inertial Input and Recurrent Networks for Online Collision Avoidance [95.86944752753564]
  We propose an online path planning architecture that extends the model predictive control (MPC) formulation to consider future location uncertainties. Our algorithm combines an object detection pipeline with a recurrent neural network (RNN) which infers the covariance of state estimates. The robustness of our methods is validated on complex quadruped robot dynamics and can be generally applied to most robotic platforms.
  arXiv  Detail & Related papers  (2020-07-28T07:34:30Z)
• Path Planning in Dynamic Environments using Generative RNNs and Monte Carlo Tree Search [11.412720572948086]
  State of the art methods for robotic path planning in dynamic environments, such as crowds or traffic, rely on hand crafted motion models for agents. This paper proposes an integrated path planning framework using generative Recurrent Neural Networks within a Monte Carlo Tree Search (MCTS) We show that the proposed framework can considerably improve motion prediction accuracy during interactions.
  arXiv  Detail & Related papers  (2020-01-30T22:46:37Z)

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.