Learning Qnetwork for Active Information Acquisition In this paper, we propose a novel Reinforcement Learning approach for solving the Active Information Acquisition problem, which requires an agent to choose a sequence of actions in order to acquire information about a process of interest using onboard sensors. The classic challenges in the information acquisition problem are the dependence of a planning algorithm on known models and the difficulty of computing informationtheoretic cost functions over arbitrary distributions. In contrast, the proposed framework of reinforcement learning does not require any knowledge on models and alleviates the problems during an extended training stage. It results in policies that are efficient to execute online and applicable for realtime control of robotic systems. Furthermore, the stateoftheart planning methods are typically restricted to short horizons, which may become problematic with local minima. Reinforcement learning naturally handles the issue of planning horizon in information problems as it maximizes a discounted sum of rewards over a long finite or infinite time horizon. We discuss the potential benefits of the proposed framework and compare the performance of the novel algorithm to an existing information acquisition method for multitarget tracking scenarios.

Maximum Information Bounds for Planning Active Sensing Trajectories This paper considers the problem of planning trajectories for robots equipped with sensors whose task is to track an evolving target process in the world. We focus on processes which can be represented by a Gaussian random variable, which is known to reduce the general stochastic information acquisition problem to a deterministic problem, which is much simpler to solve. Previous work on solving the resulting deterministic problem focuses on computing a search tree by Forward Value Iteration and pruning uninformative nodes early on in the search via a domination criteria. In this work we formulate the Active Information Acquisition problem as a deterministic planning problem where algorithms like Dijkstra and mathrmA* can produce optimal solutions. To use mathrmA* effectively in long planning horizons we derive a consistent and admissible heuristic as a function of the sensor model which can be used in information acquisition tasks such as actively mapping static and moving targets in an environment with obstacles. We validate the results in several simulations indicating that the resulting heuristic informed algorithm can recover optimal solutions faster than existing searchbased methods.