Abstract

The current study focuses on how reinforcement learning algorithms tackle complex tasks, specifically analyzing the Swimmer-v1 environment with the reassembly of a serpentine robot in robotic surgeries. Herein, the review pays close attention to two algorithms- Proximal Policy Optimization (PPO) and Deep Deterministic Policy Gradients (DDPG)- focusing on exploration strategies in the Swimmer-v1 environment. Of particular importance here is the mentioning of the fact that the scope of exploration includes the use of parameter noise. Findings show that the DDPG learning algorithm faces outstanding difficulties with local maxima convergence. PPO emerged as the first in terms of algorithm category studied despite continuing issues of high variance. The use of a novel method which consists of tempering the range of variation of standard deviation in action noise gives promising results and can be a road to future improvement and exploration. The study provides a critical understanding of the underlying complexities that may lie hidden within the existing reinforcement learning algorithms. It brings up for repair weak points, particularly in the development of exploration capabilities and convergence stabilities.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.