MEXGEN: An Effective and Efficient Information Gain Approximation for Information Gathering Path Planning

• URL: http://arxiv.org/abs/2405.02605v1
• Date: Sat, 4 May 2024 08:09:16 GMT
• Title: MEXGEN: An Effective and Efficient Information Gain Approximation for Information Gathering Path Planning
• Authors: Joshua Chesser, Thuraiappah Sathyan, Damith C. Ranasinghe,
• Abstract summary: Planning algorithms for autonomous robots need to solve sequential decision making problems under uncertainty. We develop a computationally efficient and effective approximation for the difficult problem of predicting the likely sensor measurements from uncertain belief states. We demonstrate improved performance gains in radio-source tracking and localization problems using extensive simulated and field experiments with a multirotor aerial robot.
• Score: 3.195234044113248
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Autonomous robots for gathering information on objects of interest has numerous real-world applications because of they improve efficiency, performance and safety. Realizing autonomy demands online planning algorithms to solve sequential decision making problems under uncertainty; because, objects of interest are often dynamic, object state, such as location is not directly observable and are obtained from noisy measurements. Such planning problems are notoriously difficult due to the combinatorial nature of predicting the future to make optimal decisions. For information theoretic planning algorithms, we develop a computationally efficient and effective approximation for the difficult problem of predicting the likely sensor measurements from uncertain belief states}. The approach more accurately predicts information gain from information gathering actions. Our theoretical analysis proves the proposed formulation achieves a lower prediction error than the current efficient-method. We demonstrate improved performance gains in radio-source tracking and localization problems using extensive simulated and field experiments with a multirotor aerial robot.

Related papers

• Online Auditing of Information Flow [4.557963624437785]
  We consider the problem of online auditing of information flow/propagation with the goal of classifying news items as fake or genuine. We propose a probabilistic Markovian information spread model over networks modeled by graphs. We find the optimal detection algorithm minimizing the aforementioned risk and prove several statistical guarantees.
  arXiv  Detail & Related papers  (2023-10-23T06:03:55Z)
• Implicit Occupancy Flow Fields for Perception and Prediction in Self-Driving [68.95178518732965]
  A self-driving vehicle (SDV) must be able to perceive its surroundings and predict the future behavior of other traffic participants. Existing works either perform object detection followed by trajectory of the detected objects, or predict dense occupancy and flow grids for the whole scene. This motivates our unified approach to perception and future prediction that implicitly represents occupancy and flow over time with a single neural network.
  arXiv  Detail & Related papers  (2023-08-02T23:39:24Z)
• Extension of Dynamic Mode Decomposition for dynamic systems with incomplete information based on t-model of optimal prediction [69.81996031777717]
  The Dynamic Mode Decomposition has proved to be a very efficient technique to study dynamic data. The application of this approach becomes problematic if the available data is incomplete because some dimensions of smaller scale either missing or unmeasured. We consider a first-order approximation of the Mori-Zwanzig decomposition, state the corresponding optimization problem and solve it with the gradient-based optimization method.
  arXiv  Detail & Related papers  (2022-02-23T11:23:59Z)
• Compactness Score: A Fast Filter Method for Unsupervised Feature Selection [66.84571085643928]
  We propose a fast unsupervised feature selection method, named as, Compactness Score (CSUFS) to select desired features. Our proposed algorithm seems to be more accurate and efficient compared with existing algorithms.
  arXiv  Detail & Related papers  (2022-01-31T13:01:37Z)
• Adaptive Information Belief Space Planning [9.365993173260316]
  We focus on making informed decisions efficiently, using reward functions that explicitly deal with uncertainty. We derive bounds on the expected information-theoretic reward function and, as a consequence, on the value function. We then propose a method to refine aggregation to achieve identical action selection with a fraction of the computational time.
  arXiv  Detail & Related papers  (2022-01-14T21:12:00Z)
• Robustification of Online Graph Exploration Methods [59.50307752165016]
  We study a learning-augmented variant of the classical, notoriously hard online graph exploration problem. We propose an algorithm that naturally integrates predictions into the well-known Nearest Neighbor (NN) algorithm.
  arXiv  Detail & Related papers  (2021-12-10T10:02:31Z)
• A dynamic programming algorithm for informative measurements and near-optimal path-planning [0.0]
  An informative measurement is the most efficient way to gain information about an unknown state. We give a first-principles derivation of a general-purpose dynamic programming algorithm that returns a sequence of informative measurements. This algorithm can be used by an autonomous agent or robot to decide where best to measure next.
  arXiv  Detail & Related papers  (2021-09-24T08:40:06Z)
• Deep Multi-Task Learning for Joint Localization, Perception, and Prediction [68.50217234419922]
  This paper investigates the issues that arise in state-of-the-art autonomy stacks under localization error. We design a system that jointly performs perception, prediction, and localization. Our architecture is able to reuse computation between both tasks, and is thus able to correct localization errors efficiently.
  arXiv  Detail & Related papers  (2021-01-17T17:20:31Z)
• MATS: An Interpretable Trajectory Forecasting Representation for Planning and Control [46.86174832000696]
  Reasoning about human motion is a core component of modern human-robot interactive systems. One of the main uses of behavior prediction in autonomous systems is to inform robot motion planning and control. We propose a new output representation for trajectory forecasting that is more amenable to downstream planning and control use.
  arXiv  Detail & Related papers  (2020-09-16T07:32:37Z)
• Autonomous Exploration Under Uncertainty via Deep Reinforcement Learning on Graphs [5.043563227694137]
  We consider an autonomous exploration problem in which a range-sensing mobile robot is tasked with accurately mapping the landmarks in an a priori unknown environment efficiently in real-time. We propose a novel approach that uses graph neural networks (GNNs) in conjunction with deep reinforcement learning (DRL), enabling decision-making over graphs containing exploration information to predict a robot's optimal sensing action in belief space.
  arXiv  Detail & Related papers  (2020-07-24T16:50:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.