提出近似最优的主动重建算法,可保证视觉观测选择的理论性能。
Near-optimal Active Reconstruction
- 基于高斯过程优化,设计具有理论保证的下一最佳视角算法。
- 首次在该领域给出累积后悔的次线性上界,实现近似最优。
- 适合需可靠性保障的安全关键系统,如自动驾驶感知模块。
随着自主系统中基于视觉任务的需求增长,高效且复杂的算法需求日益迫切。当前许多方法追求超越现有水平,却常忽视底层理论分析,仅依赖仿真或真实实验的实证评估。此类方法虽表现良好,但机制不透明,难以应用于安全关键系统。本文针对主动物体重建中的下一最佳视角(NBV)问题,设计了一种可提供相对于真最优性的定性性能保证的算法。据我们所知,此前无工作对该类方法进行类似理论分析。基于高斯过程优化的已有研究,本文严格推导出算法累积后悔的次线性上界,确保近似最优性。同时,在仿真框架中对算法性能进行了实证评估,并通过大量实验分析不同目标函数的影响,揭示与相关工作的差异。
原文摘要 · Abstract (English)
With the growing practical interest in vision-based tasks for autonomous systems, the need for efficient and complex methods becomes increasingly larger. In the rush to develop new methods with the aim to outperform the current state of the art, an analysis of the underlying theory is often neglected and simply replaced with empirical evaluations in simulated or real-world experiments. While such methods might yield favorable performance in practice, they are often less well understood, which prevents them from being applied in safety-critical systems. The goal of this work is to design an algorithm for the Next Best View (NBV) problem in the context of active object reconstruction, for which we can provide qualitative performance guarantees with respect to true optimality. To the best of our knowledge, no previous work in this field addresses such an analysis for their proposed methods. Based on existing work on Gaussian process optimization, we rigorously derive sublinear bounds for the cumulative regret of our algorithm, which guarantees near-optimality. Complementing this, we evaluate the performance of our algorithm empirically within our simulation framework. We further provide additional insights through an extensive study of potential objective functions and analyze the differences to the results of related work.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。