Task-Parameterized Dynamic Movement Primitives With Reinforcement Learning for Improved Motion Planning

Online trajectory planning in unstructured environments poses significant challenges for mobile robots, particularly when navigating complex obstacles. Traditional learning-from-demonstration (LfD) methods depend on offline datasets, limiting their ability to adapt to varying obstacle shapes and dynamic conditions. To address these limitations, we propose a novel motion planning framework that combines global trajectory generation with local adaptability. Dynamic Movement Primitives (DMPs) are employed to generate global trajectories based on demonstrations, while Task-Parameterized Potential Fields (TPPFs) enhance local adaptability. The Policy Improvement through Path Integrals (PI<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula>) algorithm is utilized to optimize model parameters. The TPPF framework consists of two key components: (a) an obstacle avoidance field, which accounts for the robot's size, obstacle dimensions, and relative distances, allowing effective volumetric avoidance without extensive modeling; and (b) an attractive field, which directs the robot toward task-specific goals while steering it away from undesirable paths. By leveraging the PI<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula> algorithm, model parameters are optimized to produce trajectories that preserve the characteristics of demonstrated motions, while improving obstacle avoidance and task-oriented navigation. Experiments conducted in both simulations and dynamic real-world scenarios validate the proposed framework's effectiveness, demonstrating smoother trajectories and enhanced obstacle avoidance compared to baseline approaches.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2025-04-14
DOI
https://doi.org/10.1109/lra.2025.3560876
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.28

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Task-Parameterized Dynamic Movement Primitives With Reinforcement Learning for Improved Motion Planning

Kaiqi Huang, Xiaoyi Qu, Jianhua Su, X. L. Ji
1 citations
IEEE Robotics and Automation Letters
Robotic Path Planning Algorithms
1.28
article

Task-Parameterized Dynamic Movement Primitives With Reinforcement Learning for Improved Motion Planning

Kaiqi Huang, Xiaoyi Qu, Jianhua Su, X. L. Ji
article en
1 citations

Abstract

Online trajectory planning in unstructured environments poses significant challenges for mobile robots, particularly when navigating complex obstacles. Traditional learning-from-demonstration (LfD) methods depend on offline datasets, limiting their ability to adapt to varying obstacle shapes and dynamic conditions. To address these limitations, we propose a novel motion planning framework that combines global trajectory generation with local adaptability. Dynamic Movement Primitives (DMPs) are employed to generate global trajectories based on demonstrations, while Task-Parameterized Potential Fields (TPPFs) enhance local adaptability. The Policy Improvement through Path Integrals (PI<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula>) algorithm is utilized to optimize model parameters. The TPPF framework consists of two key components: (a) an obstacle avoidance field, which accounts for the robot's size, obstacle dimensions, and relative distances, allowing effective volumetric avoidance without extensive modeling; and (b) an attractive field, which directs the robot toward task-specific goals while steering it away from undesirable paths. By leveraging the PI<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$^{2}$</tex-math></inline-formula> algorithm, model parameters are optimized to produce trajectories that preserve the characteristics of demonstrated motions, while improving obstacle avoidance and task-oriented navigation. Experiments conducted in both simulations and dynamic real-world scenarios validate the proposed framework's effectiveness, demonstrating smoother trajectories and enhanced obstacle avoidance compared to baseline approaches.

IEEE Robotics and Automation LettersVol. 10(6)
Beijing Academy of Artificial Intelligence (CN), University of Chinese Academy of Sciences (CN), Jiangxi University of Science and Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 21%
Robotic Path Planning Algorithms
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.