Autonomous Robot Navigation Using Deep Reinforcement Learning for Obstacle Avoidance and Path Optimization

This paper compares the performance of a traditional approach for autonomous robot navigation and a new approach for the same problem, all within the framework of reinforcement learning. A new approach for the problem has been introduced and compared against the traditional approach, referred to as the value iteration approach for holonomic robots and the new approach for the same problem in relation to the traditional approach. These approaches include sampling-based policy estimation and interpolation and optimization-based filtering for obstacle avoidance. Actor critic methods for non-holonomic scenarios include Deep Deterministic Policy Gradient (DDPG) and Soft Actor-Critic (SAC) approaches. The simulation of various 2D and 3D scenarios, ranging from simple to complex, shows that value iteration method convergence occurs rapidly, while at the same time a success rate of over 95% can be attained within 31 minutes of virtual time. DRL techniques, however, succeed in attaining an average of 88.5% ± 4.2% in 300 scenarios, where in each case, 35% faster convergence of SAC compared to DDPG could be attained. The efficacy of reinforcement learning approaches to find practical solutions to robot navigation in various scenarios, while meeting constraints, has been proven.

Authors

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2026-03-02
DOI
https://doi.org/10.1051/epjconf/202635403001/pdf
Primary Topic
Reinforcement Learning in Robotics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Autonomous Robot Navigation Using Deep Reinforcement Learning for Obstacle Avoidance and Path Optimization

Jayaram Boga, Shailendra Kumar Bohidar, Raziya Sultana Sharief, H. S. Ganesha et al.
Springer Link (Chiba Institute of Technology)
Reinforcement Learning in Robotics
article

Autonomous Robot Navigation Using Deep Reinforcement Learning for Obstacle Avoidance and Path Optimization

Jayaram Boga, Shailendra Kumar Bohidar, Raziya Sultana Sharief, H. S. Ganesha, E. Afreen Banu, A. Vijaya Mahendra Varman
article en

Abstract

This paper compares the performance of a traditional approach for autonomous robot navigation and a new approach for the same problem, all within the framework of reinforcement learning. A new approach for the problem has been introduced and compared against the traditional approach, referred to as the value iteration approach for holonomic robots and the new approach for the same problem in relation to the traditional approach. These approaches include sampling-based policy estimation and interpolation and optimization-based filtering for obstacle avoidance. Actor critic methods for non-holonomic scenarios include Deep Deterministic Policy Gradient (DDPG) and Soft Actor-Critic (SAC) approaches. The simulation of various 2D and 3D scenarios, ranging from simple to complex, shows that value iteration method convergence occurs rapidly, while at the same time a success rate of over 95% can be attained within 31 minutes of virtual time. DRL techniques, however, succeed in attaining an average of 88.5% ± 4.2% in 300 scenarios, where in each case, 35% faster convergence of SAC compared to DDPG could be attained. The efficacy of reinforcement learning approaches to find practical solutions to robot navigation in various scenarios, while meeting constraints, has been proven.

Springer Link (Chiba Institute of Technology)
Openalex Percentile: Top 34%
Reinforcement Learning in Robotics
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.