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

带预算约束的分布式多机器人在线采样

Distributed Multi-robot Online Sampling with Budget Constraints

University of California, Merced(加州大学默塞德分校);Plaksha University(普拉卡莎大学)

Azin Shamshirgaran, Sandeep Manjanna, Stefano Carpin

AI总结:

本文提出一种基于MCTS的在线分布式多机器人采样算法,在预算约束下通过机器人间通信迭代选择采样位置,实验证明在预算紧张时能实现更小的重建误差。

摘要:

在多机器人信息路径规划中,问题是为团队中的每个机器人找到一条路线,访问一组能够提供最有用数据的位置,以重建未知的标量场。在预算版本中,每个机器人受限于限制其行驶距离的旅行预算。我们对这个问题的兴趣源于精准农业中的应用,其中机器人用于收集测量数据,以估计与领域相关的标量参数,如土壤湿度或硝酸盐浓度。在本文中,我们提出了一种基于蒙特卡洛树搜索(MCTS)的在线分布式多机器人采样算法,其中每个机器人通过与其他机器人通信并考虑其剩余预算,迭代地选择下一个采样位置。我们在不同环境中评估了所提方法在不同团队规模下的表现,并将我们的解决方案与四种不同的基线方法进行了比较。实验表明,当预算紧张时,我们的解决方案通过收集导致较小重建误差的测量数据,优于基线方法。

英文摘要:

In multi-robot informative path planning the problem is to find a route for each robot in a team to visit a set of locations that can provide the most useful data to reconstruct an unknown scalar field. In the budgeted version, each robot is subject to a travel budget limiting the distance it can travel. Our interest in this problem is motivated by applications in precision agriculture, where robots are used to collect measurements to estimate domain-relevant scalar parameters such as soil moisture or nitrates concentrations. In this paper, we propose an online, distributed multi-robot sampling algorithm based on Monte Carlo Tree Search (MCTS) where each robot iteratively selects the next sampling location through communication with other robots and considering its remaining budget. We evaluate our proposed method for varying team sizes and in different environments, and we compare our solution with four different baseline methods. Our experiments show that our solution outperforms the baselines when the budget is tight by collecting measurements leading to smaller reconstruction errors.

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

↑