Random Network Distillation Based Deep Reinforcement Learning for AGV Path Planning
Huilin Yin, Shengkai Su, Yinjia Lin, Pengju Zhen, Karin Festl, Daniel, Watzenig

TL;DR
This paper introduces a novel deep reinforcement learning approach using Random Network Distillation to improve AGV path planning in complex, continuous environments with sparse rewards, demonstrating faster and more efficient navigation.
Contribution
The paper proposes a new AGV path planning method combining RND with deep RL in continuous environments, addressing limitations of previous grid-based approaches.
Findings
Enhanced path planning speed in continuous environments
Effective handling of sparse reward scenarios
Improved AGV navigation efficiency
Abstract
With the flourishing development of intelligent warehousing systems, the technology of Automated Guided Vehicle (AGV) has experienced rapid growth. Within intelligent warehousing environments, AGV is required to safely and rapidly plan an optimal path in complex and dynamic environments. Most research has studied deep reinforcement learning to address this challenge. However, in the environments with sparse extrinsic rewards, these algorithms often converge slowly, learn inefficiently or fail to reach the target. Random Network Distillation (RND), as an exploration enhancement, can effectively improve the performance of proximal policy optimization, especially enhancing the additional intrinsic rewards of the AGV agent which is in sparse reward environments. Moreover, most of the current research continues to use 2D grid mazes as experimental environments. These environments have…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Manufacturing and Logistics Optimization · Vehicle License Plate Recognition
