Active Sensing and Deferred-Decision Trajectory Optimization for Robust Target Identification

• URL: http://arxiv.org/abs/2606.22277v1
• Date: Sun, 21 Jun 2026 00:09:45 GMT
• Title: Active Sensing and Deferred-Decision Trajectory Optimization for Robust Target Identification
• Abstract summary: Trajectory optimization in mobile sensing systems must identify which member of a finite candidate set is the true target.<n>We propose Active-Sensing DDTO (AS-DDTO), which extends DDTO by adding a trajectory-dependent information-acquisition term to the planning objective.
• Score: 2.1774928300623615
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study trajectory optimization in mobile sensing systems that must identify which member of a finite candidate set is the true target, while maintaining reachability to all potential candidate targets, under resource constraints. Deferred-Decision Trajectory Optimization (DDTO) addresses this setting by computing trajectories that reach individual targets but remain coincident for as long as possible before separating toward different targets. We propose Active-Sensing DDTO (AS-DDTO), which extends DDTO by adding a trajectory-dependent information-acquisition term to the planning objective. The resulting planner maintains reachability to candidate targets while biasing the coincident portion of the trajectories toward regions that enable earlier target identification. The framework supports Bayesian updates and conformal candidate-set updates for distance-dependent sensing. We derive a mixed-integer conic reformulation and provide guarantees on recursive feasibility, belief concentration, and fixed-time coverage for the raw conformal candidate set. Numerical simulations show improved target identification compared with standard DDTO under distance-dependent sensing uncertainty and limited sensing budget.

Related papers

• Beyond Uniform Forgetting: A Study of Sequential Direct Preference Optimization Across Preference Settings [11.551054698858266]
  We study sequential Direct Preference optimisation across four preference settings.<n>We find that sequential DPO does not produce a single forgetting pattern.<n>Mechanistic diagnostics show that Stage2 gradients and adapter updates are near-orthogonal to the previous objective across all settings.
  arXiv  Detail & Related papers  (2026-06-18T03:20:41Z)
• MPPI-based Informative Trajectory Planning for Search and Capture of Drifting Targets with ASVs [0.8602553195689513]
  We address the problem of search and capture of drifting targets using a hybrid planning framework.<n>A planner directly generates kinematic-level commands by optimising continuous trajectories over long horizons.<n>Experiments show that our planner outperforms the chosen planning baselines.
  arXiv  Detail & Related papers  (2026-06-10T12:44:25Z)
• Dynamic Objective Selection with Safeguards and LLM Oversight for Financial Decision-Making [33.643275739813056]
  We propose DOSS (Dynamic Objective Selection with Safeguards), a learning-based selector that directly chooses the decision-relevant objective function at each time point.<n> DOSS formulates objective selection as a classification problem over objectives and performs sequential updates with a rolling window.<n>To mitigate misselection and excessive switching in deployment, DOSS applies confidence-aware gating with a fail-safe that overrides low-confidence proposals to a conservative default and enforces explicit controls tied to switching frequency.
  arXiv  Detail & Related papers  (2026-06-02T14:22:07Z)
• HAD: Combining Hierarchical Diffusion with Metric-Decoupled RL for End-to-End Driving [51.268878540511054]
  We propose HAD, an end-to-end planning framework with a Hierarchical Diffusion Policy.<n>We show that HAD achieves new state-of-the-art performance on both NAVSIM and HUGSIM.
  arXiv  Detail & Related papers  (2026-04-04T04:12:47Z)
• Removing Planner Bias in Goal Recognition Through Multi-Plan Dataset Generation [0.0]
  All existing datasets suffer from a systematical bias induced by the planning systems that generated them.<n>We propose a new method that uses top-k planning to generate multiple, different, plans for the same goal hypothesis.<n>This allows us to introduce a new metric called Version Coverage Score (VCS) to measure the resilience of the goal recogniser when inferring a goal based on different sets of plans.
  arXiv  Detail & Related papers  (2026-02-16T12:25:35Z)
• ResAD: Normalized Residual Trajectory Modeling for End-to-End Autonomous Driving [64.42138266293202]
  ResAD is a Normalized Residual Trajectory Modeling framework.<n>It reframes the learning task to predict the residual deviation from an inertial reference.<n>On the NAVSIM benchmark, ResAD achieves a state-of-the-art PDMS of 88.6 using a vanilla diffusion policy.
  arXiv  Detail & Related papers  (2025-10-09T17:59:36Z)
• RTracker: Recoverable Tracking via PN Tree Structured Memory [71.05904715104411]
  We propose a recoverable tracking framework, RTracker, that uses a tree-structured memory to dynamically associate a tracker and a detector to enable self-recovery. Specifically, we propose a Positive-Negative Tree-structured memory to chronologically store and maintain positive and negative target samples. Our core idea is to use the support samples of positive and negative target categories to establish a relative distance-based criterion for a reliable assessment of target loss.
  arXiv  Detail & Related papers  (2024-03-28T08:54:40Z)
• Discrete Factorial Representations as an Abstraction for Goal Conditioned Reinforcement Learning [99.38163119531745]
  We show that applying a discretizing bottleneck can improve performance in goal-conditioned RL setups. We experimentally prove the expected return on out-of-distribution goals, while still allowing for specifying goals with expressive structure.
  arXiv  Detail & Related papers  (2022-11-01T03:31:43Z)
• Generative multitask learning mitigates target-causing confounding [61.21582323566118]
  We propose a simple and scalable approach to causal representation learning for multitask learning. The improvement comes from mitigating unobserved confounders that cause the targets, but not the input. Our results on the Attributes of People and Taskonomy datasets reflect the conceptual improvement in robustness to prior probability shift.
  arXiv  Detail & Related papers  (2022-02-08T20:42:14Z)
• Pareto Domain Adaptation [35.48609986914723]
  Domain adaptation (DA) attempts to transfer the knowledge from a labeled source domain to an unlabeled target domain. We propose a new approach to control the overall optimization direction, aiming to cooperatively optimize all training objectives.
  arXiv  Detail & Related papers  (2021-12-08T06:31:13Z)
• Domain Adaptive Semantic Segmentation with Self-Supervised Depth Estimation [84.34227665232281]
  Domain adaptation for semantic segmentation aims to improve the model performance in the presence of a distribution shift between source and target domain. We leverage the guidance from self-supervised depth estimation, which is available on both domains, to bridge the domain gap. We demonstrate the effectiveness of our proposed approach on the benchmark tasks SYNTHIA-to-Cityscapes and GTA-to-Cityscapes.
  arXiv  Detail & Related papers  (2021-04-28T07:47:36Z)

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.