Navigation of autonomous mobile robots in dynamic unknown environments based on dueling double deep q networks

This study focuses on applying the algorithm of Dueling Double Deep Q Networks to create a robust and adaptable navigation system for autonomous robots. The main objective of the study is to propose a network model that is capable of making a robot explore unknown areas, avoid static and dynamic obstacles efficiently, recognize predefined targets, and achieve them with high accuracy. Toward this, three different network models have been designed and trained with depth images obtained from a depth camera and directional and distance information from an RGB camera. First, these models were trained and tested in simple and complex simulated environments. The D3QN-C model demonstrated strong performance, achieving a success rate of 89% in the simple environment and of 87% in the complex environment. Tests were further extended by adding real-world data with different obstacle densities in order to prove the strength of the model in increasingly difficult and realistic scenarios. During all tests, the D3QN-C model could sustain high performance, showing 90% success rates in low-density, 85% in medium-density, and 82% in high-density environments. These results are evidence of the efficiency, robustness, and flexibility of this model and underline the potential of the algorithm of the Dueling Double Deep Q Networks as a main tool in using robots within real-world scenarios characterized by dynamics and complexity. • Enables a mobile robot to navigate to specified targets in unknown environments. • Has a complex reward function for time reduction and orientation adjustment. • Includes dynamic and static obstacles with real-world data to increase its strength. • Uses a sophisticated recognition system that determines the targets.

Authors

Institutions

Publication Details

Journal
Engineering Applications of Artificial Intelligence
Published
2024-10-28
DOI
https://doi.org/10.1016/j.engappai.2024.109498
Citations
11
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
2.74

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Navigation of autonomous mobile robots in dynamic unknown environments based on dueling double deep q networks

Adem Tuncer, Koray Özdemir
11 citations
Engineering Applications of Artificial Intelligence
Robotic Path Planning Algorithms
2.74
article

Navigation of autonomous mobile robots in dynamic unknown environments based on dueling double deep q networks

Adem Tuncer, Koray Özdemir
article en
11 citations

Abstract

This study focuses on applying the algorithm of Dueling Double Deep Q Networks to create a robust and adaptable navigation system for autonomous robots. The main objective of the study is to propose a network model that is capable of making a robot explore unknown areas, avoid static and dynamic obstacles efficiently, recognize predefined targets, and achieve them with high accuracy. Toward this, three different network models have been designed and trained with depth images obtained from a depth camera and directional and distance information from an RGB camera. First, these models were trained and tested in simple and complex simulated environments. The D3QN-C model demonstrated strong performance, achieving a success rate of 89% in the simple environment and of 87% in the complex environment. Tests were further extended by adding real-world data with different obstacle densities in order to prove the strength of the model in increasingly difficult and realistic scenarios. During all tests, the D3QN-C model could sustain high performance, showing 90% success rates in low-density, 85% in medium-density, and 82% in high-density environments. These results are evidence of the efficiency, robustness, and flexibility of this model and underline the potential of the algorithm of the Dueling Double Deep Q Networks as a main tool in using robots within real-world scenarios characterized by dynamics and complexity. • Enables a mobile robot to navigate to specified targets in unknown environments. • Has a complex reward function for time reduction and orientation adjustment. • Includes dynamic and static obstacles with real-world data to increase its strength. • Uses a sophisticated recognition system that determines the targets.

Engineering Applications of Artificial IntelligenceVol. 139
Yalova University (TR)
Yalova Üniversitesi
Openalex Percentile: Top 8%
Robotic Path Planning Algorithms
2.74
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.