返回
Improved Multi-Agent Deep Deterministic Policy Gradient for Path Planning-Based Crowd Simulation
DOI:10.1109/ACCESS.2019.2946659.png)
摘要
En 中文
Deep reinforcement learning (DRL) has been proved to be more suitable than reinforcement learning for path planning in large-scale scenarios. In order to more effectively complete the DRL-based collaborative path planning in crowd evacuation, it is necessary to consider the space expansion problem brought by the increase of the number of agents. In addition, it is often faced with complicated circumstances, such as exit selection and congestion in crowd evacuation. However, few existing works have integrated these two aspects jointly. To solve this problem, we propose a planning approach for crowd evacuation based on the improved DRL algorithm, which will improve evacuation efficiency for large-scale crowd path planning. First, we propose a framework of congestion detection-based multi-agent reinforcement learning, the framework divides the crowd into leaders and followers and simulates leaders with a multi-agent system, it considers the congestion detection area is set up to evaluate the degree of congestion at each exit. Next, under the specification of this framework, we propose the improved Multi-Agent Deep Deterministic Policy Gradient (IMADDPG) algorithm, which adds the mean field network to maximize the returns of other agents, enables all agents to maximize the performance of a collaborative planning task in our training period. Then, we implement the hierarchical path planning method, which upper layer is based on the IMADDPG algorithm to solve the global path, and lower layer uses the reciprocal velocity obstacles method to avoid collisions in crowds. Finally, we simulate the proposed method with the crowd simulation system. The experimental results show the effectiveness of our method.
Keyword:
Deep reinforcement learning
multi-agent reinforcement learning
path planning
crowd simulation for evacuation
improved multi-agent deep deterministic policy gradient algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization基于多目标粒子群优化的移动机器人分层全局路径规划方法
A Top-Bottom Clustering Algorithm Based on Crowd Trajectories for Small Group Classification
IEEE ACCESS
IF3.6
Study of bi-directional buck-boost converter topologies for application in electrical vehicle motor drives应用于电动汽车电机驱动的双向buck-boost变换器拓扑研究
System Design Perspective for Human-Level Agents Using Deep Reinforcement Learning: A Survey
IEEE ACCESS
IF3.6

