Inspection Robot Navigation Based on Improved TD3 Algorithm

Author:

Huang Bo1,Xie Jiacheng1,Yan Jiawei1

Affiliation:

1. School of Mechanical Engineering, Sichuan University of Science and Engineering, Zigong 643099, China

Abstract

The swift advancements in robotics have rendered navigation an essential task for mobile robots. While map-based navigation methods depend on global environmental maps for decision-making, their efficacy in unfamiliar or dynamic settings falls short. Current deep reinforcement learning navigation strategies can navigate successfully without pre-existing map data, yet they grapple with issues like inefficient training, slow convergence, and infrequent rewards. To tackle these challenges, this study introduces an improved two-delay depth deterministic policy gradient algorithm (LP-TD3) for local planning navigation. Initially, the integration of the long–short-term memory (LSTM) module with the Prioritized Experience Re-play (PER) mechanism into the existing TD3 framework was performed to optimize training and improve the efficiency of experience data utilization. Furthermore, the incorporation of an Intrinsic Curiosity Module (ICM) merges intrinsic with extrinsic rewards to tackle sparse reward problems and enhance exploratory behavior. Experimental evaluations using ROS and Gazebo simulators demonstrate that the proposed method outperforms the original on various performance metrics.

Funder

Science & Technology Department of Sichuan Province

Graduate Innovation Fund of Sichuan University of Science & Engineering

Publisher

MDPI AG

Reference35 articles.

1. Mobile Robot Navigation and Obstacle Avoidance Techniques: A Review;Pandey;Int. Robot. Autom. J.,2017

2. A review: On path planning strategies for navigation of mobile robot;Patle;Def. Technol.,2019

3. Zhang, H.-Y., Lin, W.-M., and Chen, A.-X. (2018). Path Planning for the Mobile Robot: A Review. Symmetry, 10.

4. A Formal Basis for the Heuristic Determination of Minimum Cost Paths;Hart;IEEE Trans. Syst. Sci. Cybern.,1968

5. A note on two problems in connexion with graphs;Dijkstra;Numer. Math.,1959

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3