8,752 research outputs found
Informative Path Planning for Active Field Mapping under Localization Uncertainty
Information gathering algorithms play a key role in unlocking the potential
of robots for efficient data collection in a wide range of applications.
However, most existing strategies neglect the fundamental problem of the robot
pose uncertainty, which is an implicit requirement for creating robust,
high-quality maps. To address this issue, we introduce an informative planning
framework for active mapping that explicitly accounts for the pose uncertainty
in both the mapping and planning tasks. Our strategy exploits a Gaussian
Process (GP) model to capture a target environmental field given the
uncertainty on its inputs. For planning, we formulate a new utility function
that couples the localization and field mapping objectives in GP-based mapping
scenarios in a principled way, without relying on any manually tuned
parameters. Extensive simulations show that our approach outperforms existing
strategies, with reductions in mean pose uncertainty and map error. We also
present a proof of concept in an indoor temperature mapping scenario.Comment: 8 pages, 7 figures, submission (revised) to Robotics & Automation
Letters (and IEEE International Conference on Robotics and Automation
Information Acquisition with Sensing Robots: Algorithms and Error Bounds
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.Comment: 9 pages (two-column); 2 figures; Manuscript submitted to the 2014
IEEE International Conference on Robotics and Automatio
Closed-loop Bayesian Semantic Data Fusion for Collaborative Human-Autonomy Target Search
In search applications, autonomous unmanned vehicles must be able to
efficiently reacquire and localize mobile targets that can remain out of view
for long periods of time in large spaces. As such, all available information
sources must be actively leveraged -- including imprecise but readily available
semantic observations provided by humans. To achieve this, this work develops
and validates a novel collaborative human-machine sensing solution for dynamic
target search. Our approach uses continuous partially observable Markov
decision process (CPOMDP) planning to generate vehicle trajectories that
optimally exploit imperfect detection data from onboard sensors, as well as
semantic natural language observations that can be specifically requested from
human sensors. The key innovation is a scalable hierarchical Gaussian mixture
model formulation for efficiently solving CPOMDPs with semantic observations in
continuous dynamic state spaces. The approach is demonstrated and validated
with a real human-robot team engaged in dynamic indoor target search and
capture scenarios on a custom testbed.Comment: Final version accepted and submitted to 2018 FUSION Conference
(Cambridge, UK, July 2018
- …