TL;DR
This paper introduces a resource-efficient, task-driven visual cue selection method for fast visual-inertial navigation that anticipates future utility, ensuring high performance in constrained computational environments.
Contribution
It proposes a novel, anticipatory, greedy algorithm for visual cue selection in VIN that guarantees near-optimal performance with formal submodularity-based bounds.
Findings
Outperforms appearance-based feature selection in simple scenarios.
Enables accurate navigation during aggressive maneuvers in challenging environments.
Maintains state-of-the-art performance with reduced computational load.
Abstract
We study a Visual-Inertial Navigation (VIN) problem in which a robot needs to estimate its state using an on-board camera and an inertial sensor, without any prior knowledge of the external environment. We consider the case in which the robot can allocate limited resources to VIN, due to tight computational constraints. Therefore, we answer the following question: under limited resources, what are the most relevant visual cues to maximize the performance of visual-inertial navigation? Our approach has four key ingredients. First, it is task-driven, in that the selection of the visual cues is guided by a metric quantifying the VIN performance. Second, it exploits the notion of anticipation, since it uses a simplified model for forward-simulation of robot dynamics, predicting the utility of a set of visual cues over a future time horizon. Third, it is efficient and easy to implement,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
