Obstacle Avoidance using Dynamic Movement Primitives and Reinforcement Learning

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Urbaniak, Dominik, Agostini, Alejandro, Ramon, Pol, Rosell, Jan, Suárez, Raúl, Suppa, Michael
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866909834953097216
author Urbaniak, Dominik
Agostini, Alejandro
Ramon, Pol
Rosell, Jan
Suárez, Raúl
Suppa, Michael
author_facet Urbaniak, Dominik
Agostini, Alejandro
Ramon, Pol
Rosell, Jan
Suárez, Raúl
Suppa, Michael
contents Learning-based motion planning can quickly generate near-optimal trajectories. However, it often requires either large training datasets or costly collection of human demonstrations. This work proposes an alternative approach that quickly generates smooth, near-optimal collision-free 3D Cartesian trajectories from a single artificial demonstration. The demonstration is encoded as a Dynamic Movement Primitive (DMP) and iteratively reshaped using policy-based reinforcement learning to create a diverse trajectory dataset for varying obstacle configurations. This dataset is used to train a neural network that takes as inputs the task parameters describing the obstacle dimensions and location, derived automatically from a point cloud, and outputs the DMP parameters that generate the trajectory. The approach is validated in simulation and real-robot experiments, outperforming a RRT-Connect baseline in terms of computation and execution time, as well as trajectory length, while supporting multi-modal trajectory generation for different obstacle geometries and end-effector dimensions. Videos and the implementation code are available at https://github.com/DominikUrbaniak/obst-avoid-dmp-pi2.
format Preprint
id arxiv_https___arxiv_org_abs_2510_09254
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Obstacle Avoidance using Dynamic Movement Primitives and Reinforcement Learning
Urbaniak, Dominik
Agostini, Alejandro
Ramon, Pol
Rosell, Jan
Suárez, Raúl
Suppa, Michael
Robotics
Artificial Intelligence
Learning-based motion planning can quickly generate near-optimal trajectories. However, it often requires either large training datasets or costly collection of human demonstrations. This work proposes an alternative approach that quickly generates smooth, near-optimal collision-free 3D Cartesian trajectories from a single artificial demonstration. The demonstration is encoded as a Dynamic Movement Primitive (DMP) and iteratively reshaped using policy-based reinforcement learning to create a diverse trajectory dataset for varying obstacle configurations. This dataset is used to train a neural network that takes as inputs the task parameters describing the obstacle dimensions and location, derived automatically from a point cloud, and outputs the DMP parameters that generate the trajectory. The approach is validated in simulation and real-robot experiments, outperforming a RRT-Connect baseline in terms of computation and execution time, as well as trajectory length, while supporting multi-modal trajectory generation for different obstacle geometries and end-effector dimensions. Videos and the implementation code are available at https://github.com/DominikUrbaniak/obst-avoid-dmp-pi2.
title Obstacle Avoidance using Dynamic Movement Primitives and Reinforcement Learning
topic Robotics
Artificial Intelligence
url https://arxiv.org/abs/2510.09254