用压缩感知优化无人机采样路径,少走90%路还能更准地画污染地图。
A Novel Monte-Carlo Compressed Sensing and Dictionary Learning Method for the Efficient Path Planning of Remote Sensing Robots
- 用蒙特卡洛优化生成测量矩阵,让机器人采样更高效
- 路径长度缩至全覆盖的10%以下,重建误差降低五倍以上
- 适合需要长时巡检的环境监测机器人应用
近年来,压缩感知(CS)作为一种技术,能够在远低于奈奎斯特采样率的情况下获取高分辨率传感数据。与此同时,无人机和巡视车等自主机器人平台在环境监测任务中日益普及,包括温度、湿度和空气质量等参数的测量。在此背景下,本文首次探究了压缩感知测量矩阵的结构如何用于设计优化的机器人采样轨迹。我们提出一种新型蒙特卡洛优化框架,生成能最小化机器人行进路径长度与信号重建误差的测量矩阵。核心在于采用字典学习(DL)获取数据驱动的稀疏变换,提升重建精度并进一步减少所需采样点数。通过重建海湾地区NO₂污染地图的实验验证,结果表明:本方法可将机器人行驶距离控制在全覆盖路径的10%以内,相较于基于DCT和多项式字典的传统压缩感知方法,重建精度提升超过五倍;相比先前提出的有信息量路径规划(IPP)方法,精度也提高两倍。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。