Task-Aware Environment Augmentation for Reliable Navigation via Shielded Conditional Diffusion

• URL: http://arxiv.org/abs/2606.15154v1
• Date: Sat, 13 Jun 2026 06:49:36 GMT
• Title: Task-Aware Environment Augmentation for Reliable Navigation via Shielded Conditional Diffusion
• Abstract summary: tbpSCoDA learns a conditional distribution over high-performing fiducial layouts from data.<n>We show that tbpSCoDA improves trajectory execution reliability and completion time over strong baselines.
• Score: 4.265905616031847
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reliable trajectory planning under partial observability depends not only on computing a feasible geometric path, but also on whether the robot receives informative observations while executing that trajectory. Existing approaches usually keep the environment fixed and adapt the robot through belief-space planning, active localization, or added sensing, often incurring costly uncertainty propagation and brittle behavior in observation-poor regions. We flip this perspective and address the largely open problem of \emph{task-aware environment augmentation}: given a mapped environment, a planned task trajectory, and a small budget of visual fiducial markers, where should the environment be augmented so that the planned trajectory can be executed reliably under uncertainty? Our key observation is that useful marker layouts are defined by the localization support they provide along the task trajectory: a small number of well-timed observations can be sufficient to prevent uncertainty from accumulating in regions where state-estimation error would otherwise compromise control. Building on this observation, we present \tbp{SCoDA}, $\textbf{S}$hielded $\textbf{Co}$nditional $\textbf{D}$iffusion for Environment $\textbf{A}$ugmentation. \tbp{SCoDA} learns a conditional distribution over high-performing fiducial layouts from data, using the environment, planned trajectory, disturbance context, and desired execution profile as conditioning. Its shielded sampler reasons over where along the planned execution pose corrections should occur, and steers this distribution toward task-relevant, finite-budget augmentations. Across simulated benchmarks and hardware deployments, we show that \tbp{SCoDA} improves trajectory execution reliability and completion time over strong baselines. Code, models and dataset available at: \hyperlink{scoda-diffusion.github.io}{https://scoda-diffusion.github.io/}

Related papers

• Keep Your Friends Close, and the Right Neighbours Closer: Disaster-Conditioned Kernel-Regularized Graph Attention for Building Damage Classification [0.9668407688201359]
  Using spatial context for damage classification remains surprisingly underexplored.<n>Floods, hurricanes, and wildfires can exhibit very different clustering behaviour.<n>We study this tension on xBD in a controlled post-localization, classification-only setup.
  arXiv  Detail & Related papers  (2026-08-20T20:20:10Z)
• Predicting Task Difficulty Without Rollouts [0.0]
  We study textitex ante difficulty prediction across 17 agentic benchmarks spanning coding, mathematics, machine learning, web navigation, function calling, and other domains.<n>We show that AUC can mask poor difficulty estimates, identify token-level entropy as a useful predictive signal, and show how residuals between expected and observed difficulty can expose hidden environment flaws such as contamination and infeasibility.
  arXiv  Detail & Related papers  (2026-08-06T09:33:09Z)
• Active Adversarial Perturbation-driven Associative Memory Retrieval for RGB-Event Visual Object Tracking [58.338848435042536]
  RGB-Event tracking improves localization by fusing RGB appearance textures and dense temporal motion cues from event sensors.<n>Real-world scenes suffer diverse structured signal degradations that hinder traditional multi-modal fusion.<n>We present a hierarchical perturbation and retrieval framework tailored for RGB-Event tracking with robustness against partial target missing and modal degradation.
  arXiv  Detail & Related papers  (2026-06-24T23:34:06Z)
• Tyche: One Step Flow for Efficient Probabilistic Weather Forecasting [48.263481135566316]
  We present Tyche, a one-step conditional flow model for efficient probabilistic weather forecasting.<n>Experiments on ERA5 at 1.5$circ$ and 6-hour resolution show that our Tyche, using merely a single NFE, matches or exceeds the forecast skill and calibration of state-of-the-art multi-step generative baselines.
  arXiv  Detail & Related papers  (2026-05-07T20:25:28Z)
• Manifold-Aware Exploration for Reinforcement Learning in Video Generation [62.48300523142513]
  Group Relative Policy Optimization (GRPO) methods for video generation like FlowGRPO remain far less reliable than their counterparts for language models and images.<n>This gap arises because video generation has a complex solution space, and the ODE-to-SDE conversion used for exploration can inject excess noise.<n>We propose SAGE-GRPO (Stable Alignment via Exploration), which applies constraints at both micro and macro levels.
  arXiv  Detail & Related papers  (2026-03-23T12:04:38Z)
• Amortizing Trajectory Diffusion with Keyed Drift Fields [2.5352713493505785]
  Keyed Drifting Policies is a one-step trajectory generator trained with a drift-field objective.<n>It repels generated trajectories toward condition-matched dataset windows.<n>It achieves strong performance with one-step inference and substantially lower planning latency than diffusion sampling.
  arXiv  Detail & Related papers  (2026-03-14T17:56:15Z)
• AdaSpot: Spend Resolution Where It Matters for Precise Event Spotting [59.31340724915079]
  Event Spotting is a key task for applications in sports analytics, robotics, and autonomous systems.<n>bfAdaSpot achieves state-of-the-art performance under strict evaluation metrics.
  arXiv  Detail & Related papers  (2026-02-25T16:24:48Z)
• ProAct: Agentic Lookahead in Interactive Environments [56.50613398808361]
  ProAct is a framework that enables agents to internalize accurate lookahead reasoning through a two-stage training paradigm.<n>We introduce Grounded LookAhead Distillation (GLAD), where the agent undergoes supervised fine-tuning on trajectories derived from environment-based search.<n>We also propose the Monte-Carlo Critic (MC-Critic), a plug-and-play auxiliary value estimator designed to enhance policy-gradient algorithms.
  arXiv  Detail & Related papers  (2026-02-05T05:45:16Z)
• LoGoPlanner: Localization Grounded Navigation Policy with Metric-aware Visual Geometry [41.054069737969876]
  Trajectory planning in unstructured environments is a fundamental and challenging capability for mobile robots.<n>We introduce LoGoPlanner, a localization-grounded, end-to-end navigation framework.<n>We evaluate LoGoPlanner in both simulation and real-world settings, where its fully end-to-end design reduces cumulative error.
  arXiv  Detail & Related papers  (2025-12-22T18:03:08Z)
• Unifying Environment Perception and Route Choice Modeling for Trajectory Representation Learning [47.00223863430964]
  Tray Learning (TRL) aims to encode raw trajectories into low-dimensional vectors, which can be leveraged in various downstream tasks, including travel time estimation, location prediction, and trajectory similarity analysis.<n>We propose a framework that unifies comprehensive environment textbfPertemporal explicit textRoute choice modeling for effective textbfPRTrajectory representation learning, dubbed textbfPRTraj.
  arXiv  Detail & Related papers  (2025-10-16T15:55:28Z)
• Belief-Conditioned One-Step Diffusion: Real-Time Trajectory Planning with Just-Enough Sensing [1.6984211127623137]
  We present Belief-Conditioned One-Step Diffusion (B-COD), the first planner that, in a 10 ms forward pass, returns a short-horizon trajectory.<n>We show that this single proxy suffices for a soft-actor-critic to choose sensors online, optimising energy while bounding pose-co growth.
  arXiv  Detail & Related papers  (2025-08-16T21:34:16Z)
• FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracy [84.45004766136663]
  Federated learning is an emerging distributed machine learning framework. It suffers from the non-vanishing biases introduced by the local inconsistent optimal and the rugged client-drifts by the local over-fitting. We propose a novel and practical method, FedSpeed, to alleviate the negative impacts posed by these problems.
  arXiv  Detail & Related papers  (2023-02-21T03:55:29Z)
• Patch-level Gaze Distribution Prediction for Gaze Following [49.93340533068501]
  We introduce the patch distribution prediction ( PDP) method for gaze following training. We show that our model regularizes the MSE loss by predicting better heatmap distributions on images with larger annotation variances. Experiments show that our model bridging the gap between the target prediction and in/out prediction subtasks, showing a significant improvement on both subtasks on public gaze following datasets.
  arXiv  Detail & Related papers  (2022-11-20T19:25:15Z)
• Semi-signed neural fitting for surface reconstruction from unoriented point clouds [53.379712818791894]
  We propose SSN-Fitting to reconstruct a better signed distance field. SSN-Fitting consists of a semi-signed supervision and a loss-based region sampling strategy. We conduct experiments to demonstrate that SSN-Fitting achieves state-of-the-art performance under different settings.
  arXiv  Detail & Related papers  (2022-06-14T09:40:17Z)

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.