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

基于Boustrophedon分解算法的环境采样

Environmental Sampling with the Boustrophedon Decomposition Algorithm

Carnegie Mellon University(卡内基梅隆大学);Chevron CTC(雪佛龙能源技术公司)

Hannah He, Joe Norby, Sean Wang, Natasha Sihota, Thomas P. Hoelen, Gregory V. Lowry, Aaron M. Johnson

摘要:

通过移动机器人进行数据汇集的自动化有望提高环境调查的效率,但需要系统自主确定如何在避开障碍物的同时对环境进行采样。现有的方法,如boustrophedon分解算法,使完全覆盖的环境,以指定的分辨率,但在许多情况下,采样的分辨率分布将产生长路径与不可行的数量的测量。对这些路径进行下采样可以以牺牲分布估计准确性为代价得到可行的计划。这项工作探讨了boustrophedon分解算法的分布精度和路径长度之间的权衡。我们量化算法的性能,通过计算指标的准确性和路径长度在蒙特卡洛模拟分布的环境。我们强调的条件下,一个目标应优先于其他,并提出了修改算法,以提高其有效性,采样更均匀。这些结果展示了boustrophedon算法的智能部署如何有效地指导自主环境采样。

英文摘要:

The automation of data collection via mobile robots holds promise for increasing the efficacy of environmental investigations, but requires the system to autonomously determine how to sample the environment while avoiding obstacles. Existing methods such as the boustrophedon decomposition algorithm enable complete coverage of the environment to a specified resolution, yet in many cases sampling at the resolution of the distribution would yield long paths with an infeasible number of measurements. Downsampling these paths can result in feasible plans at the expense of distribution estimation accuracy. This work explores this tradeoff between distribution accuracy and path length for the boustrophedon decomposition algorithm. We quantify algorithm performance by computing metrics for accuracy and path length in a Monte-Carlo simulation across a distribution of environments. We highlight conditions where one objective should be prioritized over the other and propose a modification to the algorithm to improve its effectiveness by sampling more uniformly. These results demonstrate how intelligent deployment of the boustrophedon algorithm can effectively guide autonomous environmental sampling.

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

↑