paper-with-me

홈 › Papers

Homotopic information gain for sparse active target tracking

2026-02-20 · Jennifer Wakulicz, Ki Myung Brian Lee, Teresa Vidal-Calleja, Robert Fitch arxiv

The problem of planning sensing trajectories for a mobile robot to collect observations of a target and predict its future trajectory is known as active target tracking. Enabled by probabilistic motion models, one may solve this problem by exploring the belief space of all trajectory predictions given future sensing actions to maximise information gain. However, for multi-modal motion models the notion of information gain is often ill-defined. This paper proposes a planning approach designed around maximising information regarding the target's homotopy class, or high-level motion. We introduce homotopic information gain, a measure of the expected high-level trajectory information given by a measurement. We show that homotopic information gain is a lower bound for metric or low-level information gain, and is as sparsely distributed in the environment as obstacles are. Planning sensing trajectories to maximise homotopic information results in highly accurate trajectory estimates with fewer measurements than a metric information approach, as supported by our empirical evaluation on real and simulated pedestrian data.

📄 PDF Abstract BibTeX arXiv:2602.17926

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Homotopic Gradients of Generative Density Priors for MR Image Reconstruction

2020-08-14 · Cong Quan, Jinjie Zhou, Yuanzheng Zhu, Yang Chen 외

Deep learning, particularly the generative model, has demonstrated tremendous potential to significantly speed up image reconstruction with reduced measurements recently. Rather than the existing generative models that o…

DenoisingImage ReconstructionMRI Reconstruction

Bias of Homotopic Gradient Descent for the Hinge Loss

2019-07-26 · Denali Molitor, Deanna Needell, Rachel Ward

Gradient descent is a simple and widely used optimization method for machine learning. For homogeneous linear classifiers applied to separable data, gradient descent has been shown to converge to the maximal margin (or e…

BIG-bench Machine Learning

Strong homotopy of digitally continuous functions

2019-03-02 · P. Christopher Staecker

We introduce a new type of homotopy relation for digitally continuous functions which we call ``strong homotopy.'' Both digital homotopy and strong homotopy are natural digitizations of classical topological homotopy: th…

Asynchronous Multi Agent Active Search

2020-06-25 · Ramina Ghods, Arundhati Banerjee, Jeff Schneider

Active search refers to the problem of efficiently locating targets in an unknown environment by actively making data-collection decisions, and has many applications including detecting gas leaks, radiation sources or hu…

Bayesian OptimizationCompressive SensingThompson Sampling

HomoDistil: Homotopic Task-Agnostic Distillation of Pre-trained Transformers

2023-02-19 · Chen Liang, Haoming Jiang, Zheng Li, Xianfeng Tang 외

Knowledge distillation has been shown to be a powerful model compression approach to facilitate the deployment of pre-trained language models in practice. This paper focuses on task-agnostic distillation. It produces a c…

Knowledge DistillationModel CompressionTransfer Learning