Deep Reinforcement Learning with Optimized Reward Functions for Robotic Trajectory Planning

78Citations
Citations of this article
62Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

To improve the efficiency of deep reinforcement learning (DRL)-based methods for robotic trajectory planning in the unstructured working environment with obstacles. Different from the traditional sparse reward function, this paper presents two brand-new dense reward functions. First, the azimuth reward function is proposed to accelerate the learning process locally with a more reasonable trajectory by modeling the position and orientation constraints, which can reduce the blindness of exploration dramatically. To further improve the efficiency, a reward function at subtask-level is proposed to provide global guidance for the agent in the DRL. The subtask-level reward function is designed under the assumption that the task can be divided into several subtasks, which reduces the invalid exploration greatly. The extensive experiments show that the proposed reward functions are able to improve the convergence rate by up to three times with the state-of-the-art DRL methods. The percentage increase in convergence means is 2.25%-13.22% and the percentage decreases with respect to standard deviation by 10.8%-74.5%.

Cite

CITATION STYLE

APA

Xie, J., Shao, Z., Li, Y., Guan, Y., & Tan, J. (2019). Deep Reinforcement Learning with Optimized Reward Functions for Robotic Trajectory Planning. IEEE Access, 7, 105669–105679. https://doi.org/10.1109/ACCESS.2019.2932257

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free