Adaptive learning-based navigation and obstacle avoidance for autonomous robots in unstructured environments

Among the many fascinating and useful aspects of AI, reinforcement learning performs well. Using the principles of action and reward, reinforcement learning makes it easier to learn new tasks. The issue of robot navigation is tackled by motion planning. The ability to automatically react in real-time to changes in the environment is currently missing from motion planning methods. An intricate setting full of impediments exacerbates the situation. As a result of the capabilities of the reward system and feedback to the environment, robotic systems can be enhanced through reinforcement learning. Managing a complicated setting may get easier by using this. Current path planning algorithms converge to a solution late because they are computationally expensive, less responsive to the environment, and slow. Additionally, because of the need for post- processing, they are not as effective for task learning. The problem-solving capabilities of reinforcement learning lie in its action feedback and reward policies. This study introduces a new reinforcement algorithm that combines deep learning with Q-learning. The suggested method is tested in a space with limited space and a lot of obstacles. Additionally, we handle ways to improve the merging of collision avoidance and motion planning based on reinforcement learning. At the 640th and 690th episodes in a crowded and a small route environment, the agent of the suggested method converged. Based on the amount of turns and the planner's ability to converge the path, a state-of-the-art comparison reveals that the suggested strategy beat existing alternatives.

Authors

Publication Details

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

Adaptive learning-based navigation and obstacle avoidance for autonomous robots in unstructured environments

Loganathan Ganesh Babu, Saravanan Gokul, Paramasivam Sundara Pandian, Ramamoorthy Harshitha et al.
Springer Link (Chiba Institute of Technology)
Robotic Path Planning Algorithms
article

Adaptive learning-based navigation and obstacle avoidance for autonomous robots in unstructured environments

Loganathan Ganesh Babu, Saravanan Gokul, Paramasivam Sundara Pandian, Ramamoorthy Harshitha, Sakthivel Dilip Kumar, Parasuraman Smirthi Shree, Johnson Jebaraj Bercy Miraclean, Kannan Selva Lakshmi
article en

Abstract

Among the many fascinating and useful aspects of AI, reinforcement learning performs well. Using the principles of action and reward, reinforcement learning makes it easier to learn new tasks. The issue of robot navigation is tackled by motion planning. The ability to automatically react in real-time to changes in the environment is currently missing from motion planning methods. An intricate setting full of impediments exacerbates the situation. As a result of the capabilities of the reward system and feedback to the environment, robotic systems can be enhanced through reinforcement learning. Managing a complicated setting may get easier by using this. Current path planning algorithms converge to a solution late because they are computationally expensive, less responsive to the environment, and slow. Additionally, because of the need for post- processing, they are not as effective for task learning. The problem-solving capabilities of reinforcement learning lie in its action feedback and reward policies. This study introduces a new reinforcement algorithm that combines deep learning with Q-learning. The suggested method is tested in a space with limited space and a lot of obstacles. Additionally, we handle ways to improve the merging of collision avoidance and motion planning based on reinforcement learning. At the 640th and 690th episodes in a crowded and a small route environment, the agent of the suggested method converged. Based on the amount of turns and the planner's ability to converge the path, a state-of-the-art comparison reveals that the suggested strategy beat existing alternatives.

Springer Link (Chiba Institute of Technology)
Openalex Percentile: Top 38%
Robotic Path Planning Algorithms
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.