检索结果-内蒙古大学图书馆

Deep reinforcement learning for path planning of autonomous mobile robots in complicated environments

Complex and Intelligent systems 2025年第6期11卷 1-15页

作者： Zhang, Zhijie Fu, Hao Yang, Juan Lin, Yunhan School of Computer Science and Technology Wuhan University of Science and Technology No. 947 Heping Avenue Hubei Wuhan 430081 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System No. 947 Heping Avenue Hubei Wuhan 430081 China Institute of Robotics and Intelligent Systems Wuhan University of Science and Technology No. 947 Heping Avenue Hubei Wuhan 430081 China

In complicated environments, which include dynamic and narrow areas, the path planning of Autonomous Mobile Robots (AMRs) encounters challenges, like slow model convergence and limited representational capabilities, often resulting in the robot taking longer, less efficient paths or even colliding with obstacles. To tackle these challenges, the Gated Attention Prioritized Experience Replay Soft Actor-Critic (GAP_ SAC) algorithm is proposed. Key improvements include expanding the state space for better perception, designing a dynamic heuristic reward function to more effectively guide the AMR in achieving its path planning objectives and integrating Prioritized Experience Replay (PER) to improve sample efficiency and accelerate convergence. Additionally, a gated attention mechanism is also introduced to focus on critical environmental features, enhancing the models’ perception capability. Comparative experiments validate that the proposed GAP_SAC algorithm outperforms TD3, SAC and SAC’s variant, demonstrating superior robustness and generalization in complicated environments. © The Author(s) 2025.

关键词： Autonomous mobile robot (AMR) Deep reinforcement learning (DRL) Dynamic and narrow areas Gated attention mechanism Path planning

来源：评论

学校读者我要写书评

暂无评论

Efficient TD3 based path planning of mobile robot in dynamic environments using prioritized experience replay and LSTM

引用

Scientific reports 2025年第1期15卷 18331页

作者： Yunhan Lin Zhijie Zhang Yijian Tan Hao Fu Huasong Min School of Computer Science and Technology Wuhan University of Science and Technology Wuhan 430081 China. Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology Wuhan 430081 China. Institute of Robotics and Intelligent Systems Wuhan University of Science and Technology Wuhan 430081 China. Institute of Robotics and Intelligent Systems Wuhan University of Science and Technology Wuhan 430081 China. mhuasong@***.

To address the challenges of sample utilization efficiency and managing temporal dependencies, this paper proposes an efficient path planning method for mobile robot in dynamic environments based on an improved twin delayed deep deterministic policy gradient (TD3) algorithm. The proposed method, named PL-TD3, integrates prioritized experience replay (PER) and long short-term memory (LSTM) neural networks, which enhance both sample efficiency and the ability to handle time-series data. To verify the effectiveness of the proposed method, simulation and practical experiments were designed and conducted. In the simulation experiments, both static and dynamic obstacles were included in the test environment, along with experiments to assess generalization capabilities. The algorithm demonstrated superior performance in terms of both execution time and path efficiency. The practical experiments, based on the assumptions from the simulation tests, further confirmed that PL-TD3 has improved the effectiveness and robustness of path planning for mobile robot in dynamic environments.

关键词： Long short-term memory (LSTM ) Path planning in dynamic environment Prioritized experience replay (PER) Reinforcement learning Twin delayed deep deterministic policy gradient (TD3) algorithm

来源：评论

学校读者我要写书评

暂无评论

Generating Manipulation Sequences using Reinforcement Learning and Behavior Trees for Peg-In-Hole Task

Generating Manipulation Sequences using Reinforcement Learni...

引用

2022 IEEE International Conference on systems, Man, and Cybernetics, SMC 2022

作者： Xu, Jiahua Lin, Yunhan Zhou, Haotian Min, Huasong Wuhan University of Science and Technology College of Computer Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan430065 China Institute of Robotics and Intelligent Systems Wuhan University of Science and Technology Wuhan430081 China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Reinforcement Learning (RL), a method of learning skills through trial-and-error, has been successfully used in many robotics applications in recent years. We combine manipulation primitives (MPs), behavior trees (BTs), and reinforcement learning to propose an algorithm for peg-in-hole tasks, which speeds up the convergence of the RL model and enhance the adaptability of the dynamic environment. Manipulation primitives are used as actions for RL, which can reduce the gap between control instruction and robotic actions and speed up the convergence of the RL model. Behavior trees are used as robot behavior control, which makes robots can actively adapt to the changes in the environment. In experiments, RL-BT, from the combination of RL and BT, is designed for the peg-in-hole task in the Gazebo simulation environment by using UR5 as the actuator. The experiments are conducted on a simple peg and a complex multi-hole peg by three aspects, which include convergence speed verification experiment, adaptability of dynamic environment experiment, and algorithm robustness experiment. The experiment result proves that our RL-BT can speed up the convergence and adapt to the changes in the environment. © 2022 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

PL-TD3: A Dynamic Path Planning Algorithm of Mobile Robot

PL-TD3: A Dynamic Path Planning Algorithm of Mobile Robot

引用

2022 IEEE International Conference on systems, Man, and Cybernetics, SMC 2022

作者： Tan, Yijian Lin, Yunhan Liu, Tong Min, Huasong Wuhan University of Science and Technology College of Computer Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan430065 China Institute of Robotics and Intelligent Systems Wuhan University of Science and Technology Wuhan430081 China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

In this paper, Prioritized Experience Replay (PER) strategy and Long Short Term Memory (LSTM) neural network are introduced to the path planning process of mobile robots, which solves the problems of slow convergence and inaccurate perception of dynamic obstacles with the Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm. We dubbed this new method as PL-TD3. Firstly, we improve the convergence speed of the algorithm by introducing PER strategy. Secondly, we use LSTM neural network to achieve the improvement of the algorithm for dynamic obstacle perception. In order to verify the method of this paper, we design static environment, dynamic environment and adaptability to dynamic experiments to compare and analyze the methods before and after improvement. The experimental results show that PL-TD3 outperforms TD3 in terms of execution time and execution path length in all environments. © 2022 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Stability Analysis and Performance Evaluation of Delayed Bilateral Telerobotic systems over a Lossy Communication Channel

引用

Journal of systems Science & Complexity 2021年第1期34卷 157-179页

作者： BAKHSHI Ali ALFI Alireza TALEBI Heidar Ali SOURATGAR Amir Aboulfazl YOUSEFI Mahdi Faculty of Electrical and Robotic Engineering Shahrood University of TechnologyShahrood 36199-95161Iran Power Plants Control Systems Technology Development Plan Department of monitoring and ControlNiroo Research InstituteTehran 14665-517Iran Real-Time and Robotics system Laboratory Faculty of Electrical EngineeringAmirkabir University of TechnologyHafez AvenueTehran 15914Iran Electrical and Computer Engineering Department The University of British Columbia2385East MallVan couverBC V6T 1Z4Canada

The focus of this paper is to address a novel control technique for stability and transparency analysis of bilateral telerobotic systems in the presence of data loss and time delay in the communication channel. Different control strategies have been reported to compensate the effects of time delay in the communication channel;however, most of them result in poor performance under data loss. First, a model for data loss is proposed using a finite series representation of a set of periodic continuous *** improve the performance and data reconstruction, a holder circuits is also introduced. The passivity of the overall system is provided via the wave variable technique based on the proposed model for the data loss. The stability analysis of the system is then derived using the Lyapunov theorem under the time delay and the data loss. Finally, experimental results are given to illustrate the capability of the proposed control technique.

关键词： Lossy channel passivity stability telerobotic transparency

来源：评论

学校读者我要写书评

暂无评论

Multi-stage Objective Function Optimized Hand-Eye Self-calibration of Robot in Autonomous Environment 1

引用

17th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2022

作者： Liu, Kaibo Zheng, Wangli Min, Huasong Lin, Yunhan School of Computer Science and Technology Wuhan University of Science and Technology Hubei Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan University of Science and Technology Hubei Wuhan430065 China State Grid Electric Power Research Institute Jiangsu Nanjing211106 China Institute of Robotics and Intelligent Systems Wuhan University of Science and Technology Hubei Wuhan430081 China

ISBN: (数字)9789819915491

ISBN: (纸本)9789819915484

In the application scenario of robot autonomous tasks, the robot needs to be able to complete calibration online and automatically to achieve self-maintenance, which differs from traditional robot hand-eye calibration in that the traditional robot hand-eye calibration requires a dedicated calibration board to assist offline completion. Aiming at the problem that the existing self-calibration methods cannot be optimized as a whole, which leads to low accuracy and instability of the solution, a multi-stage objective function optimization self-calibration algorithm is proposed, which describes the solution of hand-eye self-calibration as a minimization objective function problem involving multiple stages. An optimization method based on the minimization of re-projection error is designed to compensate for the results, which uses an efficient Oriented fast and rotated brief (ORB) feature extraction algorithm and introduces a scoring mechanism to retain more correct matching points in the feature matching stage. Two different types of experiments were designed to validate our method. One is a single camera dataset experiment, which shows that our method is more accurate and robust than the existing self-calibration method;the other is an application platform experiment, which verifies the feasibility and availability of our method. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

Adjacency-hopping de Bruijn Sequences for Non-repetitive Coding

arXiv

引用

arXiv 2023年

作者： Chen, Bin Liang, Zhenglin Wu, Shiqian The Institute of Robotics and Intelligent Systems School of Information Science and Engineering Wuhan University of Science and Technology Wuhan430081 China The Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan430072 China

A special type of cyclic sequences named adjacency-hopping de Bruijn sequences is introduced in this paper. It is theoretically proved the existence of such sequences, and the number of such sequences is derived. These sequences guarantee that all neighboring codes are different while retaining the uniqueness of subsequences, which is a significant characteristic of original de Bruijn sequences in coding and matching. At last, the adjacency-hopping de Bruijn sequences are applied to structured light coding, and a color fringe pattern coded by such a sequence is presented. In summary, the proposed sequences demonstrate significant advantages in structured light coding by virtue of the uniqueness of subsequences and the adjacency-hopping characteristic, and show potential for extension to other fields with similar requirements of non-repetitive coding and efficient matching. Copyright © 2023, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dense dilated network with probability regularized walk for vessel detection

arXiv

引用

arXiv 2019年

作者： Mou, Lei Chen, Li Cheng, Jun Gu, Zaiwang Zhao, Yitian Liu, Jiang School of Computer Science and Technology Wuhan University of Science and Technology Wuhan430081 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology Wuhan430081 China Cixi Institute of Biomedical Engineering Chinese Academy of Sciences Zhejiang315201 China UBTech Research UBTech Robotics Corp Ltd Guangdong518055 China Department of Computer Science and Engineering Southern University of Science and Technology Guangdong518055 China Cixi Institute of Biomedical Engineering Ningbo Institute of Industrial Technology Chinese Academy of Sciences Zhejiang315201 China

The detection of retinal vessel is of great importance in the diagnosis and treatment of many ocular diseases. Many methods have been proposed for vessel detection. However, most of the algorithms neglect the connectivity of the vessels, which plays an important role in the diagnosis. In this paper, we propose a novel method for retinal vessel detection. The proposed method includes a dense dilated network to get an initial detection of the vessels and a probability regularized walk algorithm to address the fracture issue in the initial detection. The dense dilated network integrates newly proposed dense dilated feature extraction blocks into an encoder-decoder structure to extract and accumulate features at different scales. A multi-scale Dice loss function is adopted to train the network. To improve the connectivity of the segmented vessels, we also introduce a probability regularized walk algorithm to connect the broken vessels. The proposed method has been applied on three public data sets: DRIVE, STARE and CHASE_DB1. The results show that the proposed method outperforms the state-of-the-art methods in accuracy, sensitivity, specificity and also area under receiver operating characteristic curve. Copyright © 2019, The Authors. All rights reserved.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：