.png){kind=icon}
返回
Cooperative Pathfinding Based on Memory-Efficient Multi-Agent RRT*
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3023200.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In cooperative pathfinding problems, non-conflict paths that bring several agents from their start location to their destination need to be planned. This problem can be efficiently solved by Multi-agent RRT*(MA-RRT*) algorithm, which is still state-of-the-art in the field of coupled methods. However, the implementation of this algorithm is hindered in systems with limited memory because the number of nodes in the tree of RRT* grows indefinitely as the paths get optimized. This paper proposes an improved version of MA-RRT*, called Multi-agent RRT* Fixed Node(MA-RRT*FN), which limits the number of nodes stored in the tree of RRT* by removing the weak nodes on the path which are not likely to reach the goal. The results show that MA-RRT*FN performs close to MA-RRT* in terms of scalability and solution quality while the memory required is much lower and fixed.
Keyword:
Scalability
Memory management
Computational efficiency
Skeleton
Planning
Path planning
Licenses
Cooperative pathfinding
collision avoidance
multi-agent motion planning
path planning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Analysis of plate and colony precipitates decorating stacking faults in a single-crystal silicon
PREAI
分享收藏Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间？
PREAI
分享收藏Decentralized path planning for multi-agent teams with complex constraints具有复杂约束的多智能体团队分散路径规划.png)
AUTONOMOUS ROBOTS
AUTONOMOUS ROBOTSIF4.3
PREAI
分享收藏分享收藏The Efficacy of Transurethral Resection of the Prostate in the Patients with Weak Bladder Contractility IndexUrology
UrologyIF0
PREAI
分享收藏
查看更多内容