Predictive Probability Density Mapping for Search and Rescue Using An Agent-Based Approach with Sparse Data

• URL: http://arxiv.org/abs/2412.13317v1
• Date: Tue, 17 Dec 2024 20:37:26 GMT
• Title: Predictive Probability Density Mapping for Search and Rescue Using An Agent-Based Approach with Sparse Data
• Authors: Jan-Hendrik Ewers, David Anderson, Douglas Thomson,
• Abstract summary: We introduce an agent-based model designed to replicate diverse psychological profiles of lost persons.<n>The model allows these agents to navigate real-world landscapes while making decisions autonomously.<n>This work introduces a flexible agent that can be employed in search and rescue operations, offering adaptability across various geographical locations.
• Score: 0.294944680995069
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Predicting the location where a lost person could be found is crucial for search and rescue operations with limited resources. To improve the precision and efficiency of these predictions, simulated agents can be created to emulate the behavior of the lost person. Within this study, we introduce an innovative agent-based model designed to replicate diverse psychological profiles of lost persons, allowing these agents to navigate real-world landscapes while making decisions autonomously without the need for location-specific training. The probability distribution map depicting the potential location of the lost person emerges through a combination of Monte Carlo simulations and mobility-time-based sampling. Validation of the model is achieved using real-world Search and Rescue data to train a Gaussian Process model. This allows generalization of the data to sample initial starting points for the agents during validation. Comparative analysis with historical data showcases promising outcomes relative to alternative methods. This work introduces a flexible agent that can be employed in search and rescue operations, offering adaptability across various geographical locations.

Related papers

• Rejection via Learning Density Ratios [50.91522897152437]
  Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions. We propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance. Our framework is tested empirically over clean and noisy datasets.
  arXiv  Detail & Related papers  (2024-05-29T01:32:17Z)
• Distributional Black-Box Model Inversion Attack with Multi-Agent Reinforcement Learning [19.200221582814518]
  This paper proposes a novel Distributional Black-Box Model Inversion (DBB-MI) attack by constructing the probabilistic latent space for searching the target privacy data. As the latent probability distribution closely aligns with the target privacy data in latent space, the recovered data will leak the privacy of training samples of the target model significantly. Experiments conducted on diverse datasets and networks show that the present DBB-MI has better performance than state-of-the-art in attack accuracy, K-nearest neighbor feature distance, and Peak Signal-to-Noise Ratio.
  arXiv  Detail & Related papers  (2024-04-22T04:18:38Z)
• Source-Free Unsupervised Domain Adaptation with Hypothesis Consolidation of Prediction Rationale [53.152460508207184]
  Source-Free Unsupervised Domain Adaptation (SFUDA) is a challenging task where a model needs to be adapted to a new domain without access to target domain labels or source domain data. This paper proposes a novel approach that considers multiple prediction hypotheses for each sample and investigates the rationale behind each hypothesis. To achieve the optimal performance, we propose a three-step adaptation process: model pre-adaptation, hypothesis consolidation, and semi-supervised learning.
  arXiv  Detail & Related papers  (2024-02-02T05:53:22Z)
• Zero-shot Imitation Policy via Search in Demonstration Dataset [0.16817021284806563]
  Behavioral cloning uses a dataset of demonstrations to learn a policy. We propose to use latent spaces of pre-trained foundation models to index a demonstration dataset. Our approach can effectively recover meaningful demonstrations and show human-like behavior of an agent in the Minecraft environment.
  arXiv  Detail & Related papers  (2024-01-29T18:38:29Z)
• JRDB-Traj: A Dataset and Benchmark for Trajectory Forecasting in Crowds [79.00975648564483]
  Trajectory forecasting models, employed in fields such as robotics, autonomous vehicles, and navigation, face challenges in real-world scenarios. This dataset provides comprehensive data, including the locations of all agents, scene images, and point clouds, all from the robot's perspective. The objective is to predict the future positions of agents relative to the robot using raw sensory input data.
  arXiv  Detail & Related papers  (2023-11-05T18:59:31Z)
• Improving Heterogeneous Model Reuse by Density Estimation [105.97036205113258]
  This paper studies multiparty learning, aiming to learn a model using the private data of different participants. Model reuse is a promising solution for multiparty learning, assuming that a local model has been trained for each party.
  arXiv  Detail & Related papers  (2023-05-23T09:46:54Z)
• Predicting Seriousness of Injury in a Traffic Accident: A New Imbalanced Dataset and Benchmark [62.997667081978825]
  The paper introduces a new dataset to assess the performance of machine learning algorithms in the prediction of the seriousness of injury in a traffic accident. The dataset is created by aggregating publicly available datasets from the UK Department for Transport.
  arXiv  Detail & Related papers  (2022-05-20T21:15:26Z)
• Sampling Strategy for Fine-Tuning Segmentation Models to Crisis Area under Scarcity of Data [0.76146285961466]
  We propose a method to guide data collection during fine-tuning, based on estimated model and sample properties. We have applied our method to a deep learning model for semantic segmentation, U-Net, in a remote sensing application of building detection.
  arXiv  Detail & Related papers  (2022-02-09T23:16:58Z)
• Lifelong Unsupervised Domain Adaptive Person Re-identification with Coordinated Anti-forgetting and Adaptation [127.6168183074427]
  We propose a new task, Lifelong Unsupervised Domain Adaptive (LUDA) person ReID. This is challenging because it requires the model to continuously adapt to unlabeled data of the target environments. We design an effective scheme for this task, dubbed CLUDA-ReID, where the anti-forgetting is harmoniously coordinated with the adaptation.
  arXiv  Detail & Related papers  (2021-12-13T13:19:45Z)
• Bayesian Imaging With Data-Driven Priors Encoded by Neural Networks: Theory, Methods, and Algorithms [2.266704469122763]
  This paper proposes a new methodology for performing Bayesian inference in imaging inverse problems where the prior knowledge is available in the form of training data. We establish the existence and well-posedness of the associated posterior moments under easily verifiable conditions. A model accuracy analysis suggests that the Bayesian probability probabilities reported by the data-driven models are also remarkably accurate under a frequentist definition.
  arXiv  Detail & Related papers  (2021-03-18T11:34:08Z)
• Predicting Human Strategies in Simulated Search and Rescue Task [2.801609183344662]
  In a search and rescue scenario, rescuers may have different knowledge of the environment and strategies for exploration. We build models of the rescuers based on their trajectory observations to predict their strategies. We show results in terms of prediction accuracy of our computational approaches as compared with that of human observers.
  arXiv  Detail & Related papers  (2020-11-15T23:24:23Z)

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.