Abstract
In recent years, Compressed Sensing (CS) has gained significant interest as a technique for acquiring high-resolution sensory data using fewer measurements than traditional Nyquist sampling requires. At the same time, autonomous robotic platforms such as drones and rovers have become increasingly popular tools for remote sensing and environmental monitoring tasks, including measurements of temperature, humidity, and air quality. Within this context, this paper presents, to the best of our knowledge, the first investigation into how the structure of CS measurement matrices can be exploited to design optimized sampling trajectories for robotic environmental data collection. We propose a novel Monte Carlo optimization framework that generates measurement matrices designed to minimize both the robot's traversal path length and the signal reconstruction error within the CS framework. Central to our approach is the application of Dictionary Learning (DL) to obtain a data-driven sparsifying transform, which enhances reconstruction accuracy while further reducing the number of samples that the robot needs to collect. We demonstrate the effectiveness of our method through experiments reconstructing $NO_2$ pollution maps over the Gulf region. The results indicate that our approach can reduce robot travel distance to less than $10\%$ of a full-coverage path, while improving reconstruction accuracy by over a factor of five compared to traditional CS methods based on DCT and polynomial dictionaries, as well as by a factor of two compared to previously-proposed Informative Path Planning (IPP) methods.
Abstract (translated)
近年来,压缩感知(Compressed Sensing, CS)作为一种技术引起了广泛兴趣,它能够使用比传统Nyquist采样所需的更少的测量次数来获取高分辨率的感觉数据。与此同时,自主机器人平台如无人机和探测车已成为远程传感和环境监测任务中越来越受欢迎的工具,这些任务包括温度、湿度和空气质量等参数的测量。在此背景下,本文首次(据我们所知)探讨了如何利用压缩感知测量矩阵的结构来为机器人环保数据收集设计优化的采样轨迹。我们提出了一种新颖的蒙特卡洛优化框架,该框架生成旨在同时最小化机器人的行进路径长度和信号重建误差的测量矩阵,在压缩感知框架内进行操作。 我们的方法的核心是应用字典学习(Dictionary Learning, DL)以获得一种数据驱动的稀疏变换,这不仅增强了重构准确性,还进一步减少了机器人所需收集的数据样本数量。通过在海湾地区$NO_2$污染图的重建实验中展示了我们方法的有效性。结果显示,与传统的基于DCT和多项式字典的方法相比,我们的方法将机器人的行进距离减少到了完全覆盖路径长度的大约10%以内,并提高了五倍以上的重构精度;而相较于之前提出的知情路径规划(Informative Path Planning, IPP)方法,则提高了两倍的重构准确性。
URL
https://arxiv.org/abs/2507.18462