Homotopic information gain for sparse active target tracking
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Homotopic Gradients of Generative Density Priors for MR Image Reconstruction
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 ReconstructionBias of Homotopic Gradient Descent for the Hinge Loss
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 LearningStrong homotopy of digitally continuous functions
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
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 SamplingHomoDistil: Homotopic Task-Agnostic Distillation of Pre-trained Transformers
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