Informative Planning in the Presence of Outliers

@article{Chen2021InformativePI,
  title={Informative Planning in the Presence of Outliers},
  author={Weizhe (Wesley) Chen and Lantao Liu},
  journal={2022 International Conference on Robotics and Automation (ICRA)},
  year={2021},
  pages={5311-5318}
}
Informative planning seeks a sequence of actions that guide the robot to collect the most informative data to build a large-scale environmental model or learn a dynamical system. Existing work in informative planning mainly focuses on proposing new planners and applying them to various robotic applications such as environmental monitoring, autonomous exploration, and system identification. The informative planners optimize an objective given by a probabilistic model, e.g., Gaussian process… 

Figures from this paper

Approximation Algorithms for Robot Tours in Random Fields with Guaranteed Estimation Accuracy

—We study the sample placement and shortest tour problem for robots tasked with mapping environmental phenomena modeled as stationary random fields. The objective is to minimize the resources used

Model-Agnostic Multi-Agent Perception Framework

A model-agnostic multi-agent perception framework to reduce the negative effect caused by the model discrepancies without sharing the model information, and the results show that the proposed framework improves the baseline 3D object detection performance of heterogeneous agents.

References

SHOWING 1-10 OF 40 REFERENCES

Adaptive continuous‐space informative path planning for online environmental monitoring

A novel IPP algorithm that uses an evolutionary strategy to optimize a parameterized path in continuous space, which is subject to various constraints regarding path budgets and motion capabilities of an autonomous mobile robot is introduced.

An Efficient Sampling-Based Method for Online Informative Path Planning in Unknown Environments

A new RRT*-inspired online informative path planning algorithm that continuously expands a single tree of candidate trajectories and rewires nodes to maintain the tree and refine intermediate paths, allowing the algorithm to achieve global coverage and maximize the utility of a path in a global context, using a single objective function.

Optimizing waypoints for monitoring spatiotemporal phenomena

A graph-based informative path planning algorithm for a mobile robot which explicitly handles time is introduced and how this framework can handle the case in which the robot takes samples along the edges of the graph is shown.

Information-theoretic exploration with Bayesian optimization

This work proposes a novel approach to predict mutual information (MI) using Bayesian optimization, and demonstrates that the proposed method provides not only computational efficiency and rapid map entropy reduction, but also robustness in comparison with competing approaches.

Data-driven planning via imitation learning

A novel data-driven imitation learning framework to efficiently train planning policies by imitating a clairvoyant oracle: an oracle that at train time has full knowledge about the world map and can compute optimal decisions.

Sampling-based incremental information gathering with applications to robotic exploration and environmental monitoring

A sampling-based motion-planning algorithm equipped with an information-theoretic convergence criterion for incremental informative motion planning that allows dense map representations and incorporates the full state uncertainty into the planning process.

Nonmyopic Informative Path Planning in Spatio-Temporal Models

A new efficient algorithm is presented, exploiting dynamic programming and submodularity of the information collected, that efficiently plans data collection tours for an entire (finite) horizon.

Information-Guided Robotic Maximum Seek-and-Sample in Partially Observable Continuous Environments

PLUMES is a planner for localizing and collecting samples at the global maximum of an a priori unknown and partially observable continuous environment, using an information-theoretic reward heuristic with continuous-observation Monte Carlo Tree Search to efficiently localize and sample from the globalmaximum.

Data‐driven learning and planning for environmental sampling

This paper presents a planning and learning method that enables a sampling robot to perform persistent monitoring tasks by learning and refining a dynamic “ data map” that models a spatiotemporal environment attribute such as ocean salinity content.

Efficient Planning of Informative Paths for Multiple Robots

This paper presents an efficient path planning algorithm that coordinates multiple robots, each having a resource constraint, to maximize the "informativeness" of their visited locations, using a Gaussian Process to model the underlying phenomenon.