Information Acquisition with Sensing Robots: Algorithms and Error Bounds
Abstract
Utilizing the capabilities of configurable sensing systems requires addressing difficult information gathering problems. Near-optimal approaches exist for sensing systems without internal states. However, when it comes to optimizing the trajectories of mobile sensors the solutions are often greedy and rarely provide performance guarantees. Notably, under linear Gaussian assumptions, the problem becomes deterministic and can be solved off-line. Approaches based on submodularity have been applied by ignoring the sensor dynamics and greedily selecting informative locations in the environment. This paper presents a non-greedy algorithm with suboptimality guarantees, which does not rely on submodularity and takes the sensor dynamics into account. Our method performs provably better than the widely used greedy one. Coupled with linearization and model predictive control, it can be used to generate adaptive policies for mobile sensors with non-linear sensing models. Applications in gas concentration mapping and target tracking are presented.
Cite
@article{arxiv.1309.5390,
title = {Information Acquisition with Sensing Robots: Algorithms and Error Bounds},
author = {Nikolay Atanasov and Jerome Le Ny and Kostas Daniilidis and George J. Pappas},
journal= {arXiv preprint arXiv:1309.5390},
year = {2013}
}
Comments
9 pages (two-column); 2 figures; Manuscript submitted to the 2014 IEEE International Conference on Robotics and Automation