PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 28, 2026Unmanned Systems1 citations

Attention-Based Reinforcement Learning with Center Reward Classification for Redundant Manipulators Motion Optimization

View Full Paper
QYQing YangXZXiaoying ZhouJCJu Chen

Key Points

  • The goal is to optimize motion planning for redundant manipulators in environments with irregular obstacles using an advanced reinforcement learning approach.
  • Incorporated an attention mechanism to capture spatial features.
  • Developed a novel experience replay mechanism to utilize offline trajectories effectively.
  • Designed a parallel replay buffer with temporal and path-length constraints.
  • Achieved significantly shorter paths in complex environments.
  • Reduced completion times during obstacle avoidance tasks.
  • Demonstrated faster convergence compared to traditional methods.

Abstract

Reliable and efficient obstacle-avoidance motion planning for redundant manipulators remains challenging, especially in environments with irregular obstacles and high-dimensional constraints. Although deep reinforcement learning (DRL) offers promising solutions, existing methods still suffer from slow convergence and suboptimal trajectory quality. This paper accounts for practical path-length and time constraints and proposes an improved DRL-based approach that exhibits significantly faster convergence. Firstly, an attention mechanism is incorporated into the deep reinforcement learning framework to improve the model’s ability to capture spatial features in complex environments. Secondly, a novel experience replay mechanism is proposed to enhance the effective utilization of offline trajectories, thereby substantially accelerating the training process. Thirdly, a parallel experience replay buffer with temporal and path-length constraints is designed, enabling further policy refinement once the robotic manipulator consistently reaches the target position. Experimental results demonstrate that our method achieves significantly shorter paths and lower completion times in complex environments characterized by irregular obstacles.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Yang et al. (2026) studied this question.

synapsesocial.com/papers/69c771988bbfbc51511e1898https://doi.org/10.1142/s2301385028500094
Ask AI
Helpful
Bookmark
Share
View Full Paper