arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.16489cs.ROcs.SYeess.SY
收藏

多机器人系统的时空分布式信息路径规划

Spatially temporally distributed informative path planning for multi-robot systems

Texas A&M University–Corpus Christi(德州农工大学科珀斯克里斯蒂分校);Northern Arizona University(北亚利桑那大学);Federation University Australia(澳大利亚联邦大学);University of Nevada, Reno(内华达大学雷诺分校)

Binh Nguyen, Linh Nguyen, Truong X. Nghiem, Hung La, Jose Baca, Pablo Rangel, Miguel Cid Montoya, Thang Nguyen

AI总结:

本文研究移动机器人传感器网络在时空分布式建图中的信息路径规划问题,提出基于局部成本函数的多步预测优化策略,并利用 dual decomposition 方法实现分布式求解,经真实数据集验证能有效获取最大信息增益并保持连通性。

摘要:

本文研究了移动机器人传感器网络在时空分布式建图中的信息路径规划问题。机器人在移动过程中能够从感兴趣区域收集带噪声的测量值,以构建时空场的 Gaussian Process (GP) 模型。该模型随后被用于预测不同兴趣点处的时空现象。为了在保持连通性的同时,对机器人群体进行时空导航,使其能够最优地获取最大信息增益,我们提出了一种采用新定义的局部成本函数的新型多步预测信息路径规划优化策略。通过使用 dual decomposition 方法,以分布式方式有效解决该优化问题是可行且实用的。所提出的方法通过利用真实世界数据集的合成实验得到了验证。

英文摘要:

This paper investigates the problem of informative path planning for a mobile robotic sensor network in spatially temporally distributed mapping. The robots are able to gather noisy measurements from an area of interest during their movements to build a Gaussian Process (GP) model of a spatio-temporal field. The model is then utilized to predict the spatio-temporal phenomenon at different points of interest. To spatially and temporally navigate the group of robots so that they can optimally acquire maximal information gains while their connectivity is preserved, we propose a novel multistep prediction informative path planning optimization strategy employing our newly defined local cost functions. By using the dual decomposition method, it is feasible and practical to effectively solve the optimization problem in a distributed manner. The proposed method was validated through synthetic experiments utilizing real-world data sets.

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

↑