Multi-Robot Navigation System Design Based on Proximal Policy Optimization Algorithm

doi:10.3390/info15090518

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 期刊論文 > Item 987654321/127576

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/127576

Title:	Multi-Robot Navigation System Design Based on Proximal Policy Optimization Algorithm
Authors:	Wong, Ching-Chang;Weng, Kun-Duo;Yu, Bo-Yun
Keywords:	multi-robot navigation;multi-agent path finding;path planning;topological map;A* algorithm;path conflicts;deep reinforcement learning;proximal policy optimization
Date:	2024-08-26
Issue Date:	2025-07-28 12:05:52 (UTC+8)
Publisher:	MDPI
Abstract:	The more path conflicts between multiple robots, the more time it takes to avoid each other, and the more navigation time it takes for the robots to complete all tasks. This study designs a multi-robot navigation system based on deep reinforcement learning to provide an innovative and effective method for global path planning of multi-robot navigation. It can plan paths with fewer path conflicts for all robots so that the overall navigation time for the robots to complete all tasks can be reduced. Compared with existing methods of global path planning for multi-robot navigation, this study proposes new perspectives and methods. It emphasizes reducing the number of path conflicts first to reduce the overall navigation time. The system consists of a localization unit, an environment map unit, a path planning unit, and an environment monitoring unit, which provides functions for calculating robot coordinates, generating preselected paths, selecting optimal path combinations, robot navigation, and environment monitoring. We use topological maps to simplify the map representation for multi-robot path planning so that the proposed method can perform path planning for more robots in more complex environments. The proximal policy optimization (PPO) is used as the algorithm for deep reinforcement learning. This study combines the path selection method of deep reinforcement learning with the A* algorithm, which effectively reduces the number of path conflicts in multi-robot path planning and improves the overall navigation time. In addition, we used the reciprocal velocity obstacles algorithm for local path planning in the robot, combined with the proposed global path planning method, to achieve complete and effective multi-robot navigation. Some simulation results in NVIDIA Isaac Sim show that for 1000 multi-robot navigation tasks, the maximum number of path conflicts that can be reduced is 60,375 under nine simulation conditions.
Relation:	Information 15(9), 518
DOI:	10.3390/info15090518
Appears in Collections:	[電機工程學系暨研究所] 期刊論文

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	92	View/Open

Loading...