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

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Staroverov, Aleksei, Alhaddad, Muhammad, Narendra, Aditya, Mironov, Konstantin, Panov, Aleksandr
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866917360212901888
author Staroverov, Aleksei
Alhaddad, Muhammad
Narendra, Aditya
Mironov, Konstantin
Panov, Aleksandr
author_facet Staroverov, Aleksei
Alhaddad, Muhammad
Narendra, Aditya
Mironov, Konstantin
Panov, Aleksandr
contents 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 NPField-GPT model 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-StaticMLP, where a dynamic scene is treated as a sequence of static maps; and NPField-DynamicMLP, which predicts the future potential sequence in parallel with an MLP. In dynamic indoor scenarios from BenchMR and on a Husky UGV in office corridors, NPField-GPT produces more efficient and safer trajectories under motion changes, while StaticMLP/DynamicMLP 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
format Preprint
id arxiv_https___arxiv_org_abs_2410_06819
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Dynamic Neural Potential Field: Online Trajectory Optimization in the Presence of Moving Obstacles
Staroverov, Aleksei
Alhaddad, Muhammad
Narendra, Aditya
Mironov, Konstantin
Panov, Aleksandr
Robotics
Artificial Intelligence
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 NPField-GPT model 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-StaticMLP, where a dynamic scene is treated as a sequence of static maps; and NPField-DynamicMLP, which predicts the future potential sequence in parallel with an MLP. In dynamic indoor scenarios from BenchMR and on a Husky UGV in office corridors, NPField-GPT produces more efficient and safer trajectories under motion changes, while StaticMLP/DynamicMLP 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
title Dynamic Neural Potential Field: Online Trajectory Optimization in the Presence of Moving Obstacles
topic Robotics
Artificial Intelligence
url https://arxiv.org/abs/2410.06819