arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.13065cs.MAcs.RO
收藏

多智能体 Vulcan:一种信息驱动的多智能体路径规划方法

Multi-Agent Vulcan: An Information-Driven Multi-Agent Path Finding Approach

Jake Olkin, Viraj Parimi, Brian Williams

AI总结:

本文提出信息驱动的多智能体路径规划方法,通过可采纳启发式放宽互信息增益并扩展至分布式系统,解决有限通信下的多智能体自适应采样问题,在真实场景中显著提升现象定位效率。

摘要:

科学家在探索新环境时经常搜寻感兴趣的现象。自主车辆被部署到人类操作成本高昂或危险的区域进行探索。用于信息收集的自主车辆在线控制被称为自适应采样,可被构建为以信息增益为主要目标的 POMDP。先前的工作主要集中在单智能体场景,本文则直面多智能体自适应采样所特有的挑战,如避免冗余观测、防止车辆碰撞以及在有限通信下促进路径规划。我们从 Multi-Agent Path Finding (MAPF) 方法出发,该方法通过将 MAPF 问题分解为一系列单智能体路径规划问题来解决碰撞避免。随后,我们提出了信息驱动的 MAPF,以解决有限通信下的多智能体信息增益问题。首先,我们引入一个可采纳启发式,将互信息增益放宽为可加函数,该函数可作为一组独立的单智能体路径规划问题进行评估。其次,我们将该方法扩展至对有限通信具有鲁棒性的分布式系统。当所有智能体在通信范围内时,群体共同规划以最大化信息;当部分智能体移出范围时,会形成通信子群,各子群独立规划。由于车辆相距较远时冗余观测可能性较低,该方法仅导致信息增益的少量损失,从而实现从完全通信到部分通信的平滑过渡。我们在包括真实世界机器人应用在内的多种场景中,将该方法与其他自适应采样策略进行了评估。在特定场景中,我们的方法能定位多达 200% 更多的独特现象,且每个智能体定位其首个独特现象的速度最多提升 50%。

英文摘要:

Scientists often search for phenomena of interest while exploring new environments. Autonomous vehicles are deployed to explore such areas where human-operated vehicles would be costly or dangerous. Online control of autonomous vehicles for information-gathering is called adaptive sampling and can be framed as a POMDP that uses information gain as its principal objective. While prior work focuses largely on single-agent scenarios, this paper confronts challenges unique to multi-agent adaptive sampling, such as avoiding redundant observations, preventing vehicle collision, and facilitating path planning under limited communication. We start with Multi-Agent Path Finding (MAPF) methods, which address collision avoidance by decomposing the MAPF problem into a series of single-agent path planning problems. We then present information-driven MAPF which addresses multi-agent information gain under limited communication. First, we introduce an admissible heuristic that relaxes mutual information gain to an additive function that can be evaluated as a set of independent single agent path planning problems. Second, we extend our approach to a distributed system that is robust to limited communication. When all agents are in range, the group plans jointly to maximize information. When some agents move out of range, communicating subgroups are formed and the subgroups plan independently. Since redundant observations are less likely when vehicles are far apart, this approach only incurs a small loss in information gain, resulting in an approach that gracefully transitions from full to partial communication. We evaluate our method against other adaptive sampling strategies across various scenarios, including real-world robotic applications. Our method was able to locate up to 200% more unique phenomena in certain scenarios, and each agent located its first unique phenomenon faster by up to 50%.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑