Deep Reinforcement Learning-Based Multi-Robotic Agent Motion Planning
OPJU International Technology Conference on Smart Computing for Innovation and Advancement in Industry (OTCON) · 1-6
The deep Q-network (DQN) technique, as a classic value-based deep reinforcement learning process, has been widely applied in fields such as multi-robotic agent motion planning. However, the DQN method faces a series of tasks, such as overestimating Q-values, complex Q-value computations, neural networks lacking historical memory proficiencies, and inefficient exploration when using ε-greedy strategies. This paper proposes a DQN-based multi-robot agent deep reinforcement learning motion planning approach to solve these problems. To accomplish their objectives without colliding with one another, agents can acquire stable and efficient motion planning techniques with the aid of this method. Initially, a Dueling-based optimization tool is suggested, which is based on the DQN approach. It simplifies and improves the calculation of Q-values by calculating state values and advantage function values, and by choosing the appropriate action based on the parameters of the presently updating Q-value network. Additionally, we provide a GRU-based memory mechanism that incorporates GRU modules to facilitate the network's temporal data acquisition and handling of agents' historical information. And lastly, we offer a noise-based exploration technique that works. By introducing parameterized noise, the exploration technique in DQN is modified, improving the examination efficiency of agents, and achieving a balance between exploration and exploitation in multi-robotic agent systems. Tests were conducted in six different simulation scenarios on the PyBullet simulation platform. Experimental results show that the proposed method enables efficient collaboration among multi-robotic agent teams, agreeing them to go where they're going without running into each other, and the methods' training is steady.
