betaFeedback

WorksComputer Science

SearchDiffusion: Information-Guided Diffusion Planning for Object Search

Abstract

Object search in unknown environments requires robots to gather useful observations while avoiding obstacles and accounting for limited sensor visibility. We present SearchDiffusion, a diffusion-based planner that generates position and heading trajectories using a learned dense utility map. The map represents geometric accessibility, useful visibility, and semantic progress. It conditions trajectory generation and provides an objective for sampling guidance. Sampled map hypotheses provide additional geometric context, while geometric and heading guidance, validity checks, and analytical selection support execution. Across 90 simulated tasks on 24 map layouts, SearchDiffusion achieved 95.6% target detection at greater computational cost. Ablations show complementary benefits from utility and guidance, with limited additional detection benefit from runtime map hypotheses. In ten physical quadruped trials using OneMap relevance maps, eight were successful under operator assessment, without fine-tuning on real-robot data. These results support combining learned spatial utility with guided trajectory generation for object search under partial observability.

SearchDiffusion for object search in a partially observed environment

Figure 1. SearchDiffusion for object search in a partially observed environment.

INTRODUCTION

Autonomous object search requires robots to gather useful observations while avoiding obstacles. Observation quality depends on the camera’s field of view, range, and viewing direction. Informative path planning therefore considers expected observation value alongside motion and safety constraints.

Diffusion planners learn trajectory distributions and generate candidates through iterative denoising [1], [2]. Object search requires adaptation to new geometric and semantic evidence. Semantic relevance alone does not indicate accessibility or routes that provide useful views, motivating a spatial utility map that relates available evidence to search progress.

We propose SearchDiffusion, a trajectory planner that learns dense utility from geometric accessibility, useful visibility, and semantic relevance. The predicted map conditions trajectory denoising and provides a differentiable objective for sampling guidance.

Counterfactual map hypotheses provide context about unobserved geometry while preserving observed free and occupied cells. Utility, geometric, and heading guidance refine candidates before validity checks and analytical ranking. The robot executes an initial portion of the selected trajectory, updates observations, and replans.

We compare detection, trajectory efficiency, and planning time under matched simulated conditions. Ablations disable inference components with network weights fixed. Physical robot experiments use OneMap [3] relevance maps to demonstrate compatibility with perception-derived inputs.

The main contributions are:

  • Utility-conditioned trajectory generation. A learned dense utility map encodes geometric accessibility, useful visibility, and semantic progress to condition trajectory diffusion.

  • Guidance, validation, and selection. Utility, geometric, and heading objectives refine candidates during sampling. Validity checks and analytical scoring select a trajectory for partial execution.

  • Evaluation of component interactions. Across 90 simulated tasks in 24 map clusters, SearchDiffusion improves detection over the tested baselines. Ablations support combining utility and guidance, with limited additional detection benefit from runtime hypotheses.

Classical exploration methods plan from the robot’s current map. Yamauchi [4] introduced frontier-based exploration toward boundaries between known free space and unexplored regions. FASTER [5] plans through known and unknown space while maintaining a stopping backup in known free space. EGO-Planner [6] derives obstacle-avoidance gradients without a Euclidean signed distance field. Hollinger and Sukhatme [7] combine sampling-based search and pruning to maximize information quality under motion and budget constraints. Schmid et al. [8] expand and rewire a trajectory tree to balance information gain and motion cost.

Language and vision models connect semantic information to robot behavior. FlockGPT [9] translates instructions into UAV formations executed by a flocking controller. UAV-VLA [10] combines language models and satellite imagery to generate flight paths and action plans. GoalSwarm [11] combines open-vocabulary perception, shared semantic mapping, and decentralized frontier allocation for multi-UAV object navigation.

Diffusion planners model multimodal trajectory distributions. Janner et al. [2] introduced trajectory denoising with goal conditioning and reward guidance. Applications include autonomous driving [12] and quadruped path planning [13]. EmbodiedDiffusion [14] conditions generation on predicted dense traversability and uses a traversability-based training objective across robot platforms.

For exploration, DARE [15] conditions diffusion on an attention-encoded graph of observed free space and frontier utilities. It learns from complete-map demonstrations but uses partial observations during deployment. GUIDE [16] adds LaMa-predicted free-space nodes, filtered by proximity to the robot and observed frontiers, to condition trajectory generation.

Other methods predict unseen environments for planning. MapEx [17] combines ensemble LaMa predictions, probabilistic visibility, and travel distance to select frontiers, then plans with A*. For goal-directed navigation, BeliefDiffusion [18] samples occupancy maps with diffusion, generates A* proposals on individual samples, and evaluates them using an aggregated map. Schrödinger’s Navigator [19] generates trajectory-conditioned 3D futures and combines their semantic, exploration, and risk cues into a value map, used alongside observed information for waypoint selection.

SearchDiffusion uses learned dense search utility to condition trajectory denoising and guide sampling. Observation-consistent map hypotheses provide geometric context, while validity checks and analytical selection support execution.

PROBLEM FORMULATION

We consider object search in a partially observed M×MM \times M grid under limited sensing range and field of view. At planning step tt, the robot pose is qt=(xt,yt,θt)q_t = (x_t, y_t, \theta_t), where θt\theta_t denotes body yaw and determines the viewing direction through a fixed sensor mounting. Position and body heading are planned jointly. Heading may differ from the direction of translation; guidance encourages alignment through a soft penalty rather than a hard constraint.

The robot accumulates observations into disjoint binary known-free and known-occupied masks, ftf_t and oto_t, starting with the observations available at initialization. Their complement ut=1−ft−otu_t = 1 - f_t - o_t marks unknown space. A semantic relevance map rt(x)∈[0,1]r_t(x) \in[0,1] represents the available evidence associated with the target, while a Gaussian heatmap btb_t represents the robot’s position. All five maps are spatially aligned M×MM \times M grids and are stacked into the neural spatial input:

Ot=[ft,ot,ut,rt,bt]∈R5×M×M.(1)O_t = [f_t, o_t, u_t, r_t, b_t] \in\mathbb{R}^{5 \times M \times M}. \tag*{(1)}

The current heading is supplied separately as (sin⁡θt,cos⁡θt)(\sin\theta_t, \cos\theta_t).

Temporal inputs are executed-pose history HtH_t and the unexecuted previous plan PtP_t. Each contains up to 16 poses represented by

ξi=[xilocal,yilocal,sin⁡(Δθi),cos⁡(Δθi),ρi].(2)\xi_i = [x_i^{\mathrm{local}}, y_i^{\mathrm{local}}, \sin(\Delta\theta_i), \cos(\Delta\theta_i), \rho_i]. \tag*{(2)}

Position and heading are relative to the current pose. Normalized sequence position ρi\rho_i spans [−1,0][-1,0] for history and [0,1][0,1] for the previous plan. Both inputs are padded 16 × 5 arrays with validity masks, encoded separately from OtO_t.

PROPOSED METHOD

System Overview

SearchDiffusion (Figure 2) combines conditional map diffusion, deterministic dense utility prediction, and conditional trajectory diffusion. Observation-consistent map hypotheses and OtO_t support utility prediction. Spatial features, predicted utility, current heading, and temporal context condition trajectory generation. Guidance refines candidates during denoising; validity checks assess their execution prefixes and a short lookahead before analytical selection.

SearchDiffusion overview

Figure 2. SearchDiffusion overview. Predicted utility conditions trajectory denoising and guides sampling. Geometric and heading guidance refine candidates, followed by validity checks and analytical selection. The robot executes a trajectory prefix before replanning.

With M=128M = 128, each planning step generates 32 candidates, each represented by 16 control tokens and decoded into T=32T = 32 heading-aware poses:

Tt(j)=[(xi,yi,sin⁡θi,cos⁡θi)]i=0T−1.(3)\mathcal{T}_t^{(j)} = \left[(x_i,y_i,\sin\theta_i,\cos\theta_i)\right]_{i=0}^{T-1}. \tag*{(3)}

The first pose matches the current robot pose. The robot executes a prefix of the selected trajectory, updates observations and temporal context, and replans.

Counterfactual Map Hypotheses

The map generator samples KK complete layouts that preserve observed geometry while varying unknown regions. Its conditioning input is

Ct=[ft,ot,zt]∈R3×M×M,(4)C_t = [f_t,o_t,z_t] \in\mathbb{R}^{3 \times M \times M}, \tag*{(4)}

where zt=ft+otz_t = f_t + o_t marks observed cells.

A four-scale encoder (32/64/128/192 channels) conditions a U-Net with timestep-modulated residual blocks. The bottleneck uses a four-layer, four-head transformer (128-dimensional tokens on a 16×1616 \times16 grid), 2D positional encoding, a global token, and a spectral residual block. Decoding predicts diffusion velocity and an auxiliary signed-distance field (SDF).

DDIM sampling starts from independent Gaussian noise and clamps predicted clean maps to known observations. Final samples are thresholded into binary maps mt(k)m_t^{(k)} (1: free, 0: occupied), then clamped again.

For planning, SDFs dt(k)d_t^{(k)} are recomputed from binary geometry rather than taken from the auxiliary head. Positive values indicate free-space clearance and negative values indicate obstacle interiors; distances are clipped to [−12,12][-12, 12] cells and divided by 12. The planner receives

Ht={(mt(k),dt(k))}k=1K,K=4,(5)\mathcal{H}_t = \left\{\left(m_t^{(k)},d_t^{(k)}\right)\right\}_{k=1}^{K}, \qquad K = 4, \tag*{(5)}

with two aligned M×MM \times M grids per hypothesis. The generator is trained separately and frozen during planner training. Figure 3 shows example outputs.

Observed geometry, relevance input, disagreement, exact SDF, and four map hypotheses

Figure 3. Observed geometry (a), relevance input (b), and four map hypotheses (e–h). An exact SDF is computed for each hypothesis; (d) shows the first.

Dense Utility Prediction

For each training state, we compute a target map describing whether movement improves the search. Targets are defined on AtA_t, the robot-connected subset of known-free cells in ftf_t. Let ata_t be the robot’s rounded grid cell and Dgeo(x,y)D_{\mathrm{geo}}(x,y) the shortest-path distance within this subset, using eight-neighbor moves without diagonal corner cutting.

The target combines frontier and semantic progress. Remaining search need nt∈[0,1]M×Mn_t \in[0,1]^{M \times M} marks cells that would benefit from further observation, and confidence ct∈[0,1]c_t \in[0,1] controls their relative importance. Training uses synthetic semantic observations (Sec. IV-E); benchmark and physical-robot inference use nt=utn_t = u_t and ct=max⁡xrt(x)c_t = \max_x r_t(x). These are search heuristics, not calibrated probabilities.

For frontier progress, we sample up to two reachable viewpoints per frontier component and four headings per viewpoint. Let νt(x∣v,θ)\nu_t(x \mid v,\theta) be the fraction of hypotheses in which cell xx is visible from position vv and heading θ\theta, and let σt(x)\sigma_t(x) be the population standard deviation of binary free-space predictions, measuring disagreement. For a weighting map w∈{nt,σt}w \in\{n_t,\sigma_t\}, define

Bw(v,θ)=1−exp⁡(−∑xνt(x∣v,θ)w(x)180),B_w(v,\theta) = 1 - \exp\left(-\frac{\sum_x \nu_t(x \mid v,\theta)w(x)}{180}\right),
Qt(v)=max⁡θBnt(v,θ)[1+Bσt(v,θ)]2.(6)Q_t(v) = \max_\theta\frac{B_{n_t}(v,\theta)\left[1+B_{\sigma_t}(v,\theta)\right]}{2}. \tag*{(6)}

Thus, disagreement boosts a viewpoint only when it reveals search need. Viewpoint quality is propagated through free space with a distance penalty and centered at the robot:

Wt(x)=max⁡v:Qt(v)>0[Qt(v)−Dgeo(x,v)M],W_t(x) = \max_{\substack{v:Q_t(v)>0}} \left[Q_t(v) - \frac{D_{\mathrm{geo}}(x,v)}{M}\right],
Ft(x)=Wt(x)−Wt(at).(7)F_t(x) = W_t(x) - W_t(a_t). \tag*{(7)}

Positive FtF_t indicates improved access to useful viewpoints. Semantic progress reduces the cost of reaching relevant evidence. The cost of reaching a destination cell yy combines path length plus a penalty M(1−rt(y))M(1-r_t(y)), so more relevant destinations cost less:

CR(x)=min⁡y∈Atrt(y)>0[Dgeo(x,y)+M(1−rt(y))].(8)C_R(x) = \min_{\substack{y \in A_t\\ r_t(y)>0}} \left[D_{\mathrm{geo}}(x,y) + M\left(1-r_t(y)\right)\right]. \tag*{(8)}

Moving to xx is progress when its remaining cost is lower than at the robot. Define this reduction as ΔC(x)=CR(at)−CR(x)\Delta C(x) = C_R(a_t) - C_R(x) and normalize it:

GR(x)=ΔC(x)M+∣ΔC(x)∣.(9)G_R(x) = \frac{\Delta C(x)}{M+\lvert\Delta C(x)\rvert}. \tag*{(9)}

The computed utility target is

Vtgt(x)=1−ct2tanh⁡(gFt(x))+1+ct2tanh⁡(gGR(x)),(10)V_t^{\mathrm{gt}}(x) = \frac{1-c_t}{2}\tanh(gF_t(x))+\frac{1+c_t}{2}\tanh(gG_R(x)), \tag*{(10)}

where g=M/(2Rs)g=M/(2R_s) for sensor range RsR_s. The target lies in [−1,1][-1,1], is zero at ata_t, and shifts from equal weighting at ct=0c_t=0 to semantic-only weighting at ct=1c_t=1 (Figure 4). Convolutional encoders and order-invariant hypothesis attention produce spatial features Zt∈R192×16×16Z_t \in\mathbb{R}^{192\times16\times16}. A three-stage upsampling decoder with a final tanh predicts V^t\hat{V}_t. To condition trajectories, a three-layer strided convolutional encoder EVE_V embeds the masked prediction:

Figure 4. Frontier (top) and semantic (bottom) progress fields at successive planning states. These are the components used to construct the utility target; they are not the final predicted utility map.

V~t(x)={V^t(x),x∈At,0,x∉At,(11)\widetilde{V}_t(x)= \begin{cases} \hat{V}_t(x), & x\in A_t,\\ 0, & x\notin A_t, \end{cases} \tag*{(11)}
Zt′=Zt+γEV(stopgrad⁡(V~t)).Z'_t=Z_t+\gamma E_V(\operatorname{stopgrad}(\widetilde{V}_t)).

Here γ\gamma warms up from zero to one. The stop-gradient operation preserves values but blocks trajectory-loss gradients through this feedback path. The backbone remains shared; predicted utility is used during training and inference.

Conditional Trajectory Generation

The model generates L=16L=16 controls in the initial robot frame:

ui=[Δxiloc/sp,Δyiloc/sp,sin⁡Δθi,cos⁡Δθi],(12)u_i=[\Delta x_i^{\mathrm{loc}}/s_p,\Delta y_i^{\mathrm{loc}}/s_p,\sin\Delta\theta_i,\cos\Delta\theta_i], \tag*{(12)}

where sp=4s_p=4 is the position-normalization scale. Eight transformer blocks use 192-dimensional tokens and six attention heads. All blocks attend to Zt′Z'_t; alternating blocks also attend to history and the previous plan. Diffusion-step and heading context modulate the blocks through adaptive normalization.

A cubic B-spline decoder integrates the controls, preserves the current pose, incorporates measured initial motion, and resamples position and heading at shared locations into 32 poses. This encourages smoothness without imposing full vehicle dynamics. Inference uses ten DDIM steps, independent candidate noise, and cached conditioning features.

Training Data and Objectives

The map generator learns from HouseExpo [20] with map splits preceding simulated observations and rotation/reflection augmentation. Denoising, reconstruction, and SDF objectives emphasize boundaries and narrow passages. After freezing it, a privileged teacher uses complete geometry to produce up to four diverse demonstrations per state. Planner pretraining starts at 3–10% coverage; later training mixes these episodes equally with 30–90% coverage episodes.

Synthetic relevance follows free-space distance to the target and is revealed only in observed cells. Detection raises confidence from zero to one, shifts relevance toward target approach, and sets search need to zero. Before detection, need is high in unknown cells and decreases with observations according to synthetic semantic uncertainty. Need and confidence construct utility targets and analytical scores, not separate neural inputs. Complete geometry and target coordinates remain restricted to simulation and the teacher.

The utility predictor and trajectory denoiser are trained jointly. For each training state, we sample one valid expert trajectory, favoring higher teacher scores. For a clean map (encoded in [−1,1][-1,1]) or expert controls X0X_0, diffusion step κ\kappa mixes signal and Gaussian noise:

Xκ=aκX0+sκϵ,ϵ∼N(0,I),X_\kappa=a_\kappa X_0+s_\kappa\epsilon,\qquad\epsilon\sim\mathcal{N}(0,I),
vκ=aκϵ−sκX0,v_\kappa=a_\kappa\epsilon-s_\kappa X_0,
X^0=aκXκ−sκv^κ.(13)\hat{X}_0=a_\kappa X_\kappa-s_\kappa\hat{v}_\kappa. \tag*{(13)}

Here κ\kappa indexes the diffusion steps, aκ=αˉκa_\kappa=\sqrt{\bar{\alpha}_\kappa}, and sκ=1−αˉκs_\kappa=\sqrt{1-\bar{\alpha}_\kappa}.

The planner objective combines denoising, utility prediction, and trajectory quality:

L=Ldenoise+Lutility+Ltrajectory.(14)\mathcal{L}=\mathcal{L}_{\mathrm{denoise}}+\mathcal{L}_{\mathrm{utility}}+\mathcal{L}_{\mathrm{trajectory}}. \tag*{(14)}

Here Ldenoise\mathcal{L}_{\mathrm{denoise}} is the mean Huber error against vκv_\kappa. The utility loss is the Huber error against VtgtV_t^{\mathrm{gt}}, averaged within AtA_t for each state. The trajectory loss is

Ltrajectory=E[aκ(ℓquality+0.10ℓobserved+0.08ℓhypothesis+0.05ℓclearance)].(15)\mathcal{L}_{\mathrm{trajectory}}=\mathbb{E}\left[a_\kappa\left(\ell_{\mathrm{quality}}+0.10\ell_{\mathrm{observed}}+0.08\ell_{\mathrm{hypothesis}}+0.05\ell_{\mathrm{clearance}}\right)\right]. \tag*{(15)}

The expectation covers states, expert choice, noise, and diffusion steps; aκa_\kappa weakens auxiliary penalties at high noise. The quality term combines expert-trajectory agreement, initial-motion continuity, previous-plan consistency, smoothness, and heading-change penalties.

The safety losses ℓobserved\ell_{\mathrm{observed}}, ℓhypothesis\ell_{\mathrm{hypothesis}}, ℓclearance\ell_{\mathrm{clearance}} evaluate closely spaced points along the decoded trajectory. Let di(k)d_i^{(k)} be the normalized signed distance at point ii in hypothesis kk.

At each point, hypothesis risk increases as clearance falls below this margin. We average this risk across the KK hypotheses:

piH=1K∑k=1Kclip⁡(1−di(k)μ,0,1).(16)p_i^H=\frac{1}{K}\sum_{k=1}^{K}\operatorname{clip}\left(1-\frac{d_i^{(k)}}{\mu},0,1\right). \tag*{(16)}

where we define a normalized clearance margin μ=0.08\mu=0.08, corresponding to 0.96 grid cells. A hypothesis contributes zero risk when clearance is at least μ\mu, and unit risk inside an obstacle. Observed-obstacle risk piOp_i^O is obtained by bilinearly sampling the known-occupied mask oto_t.

Pointwise risks are accumulated along the trajectory:

ℓobserved=1−∏i(1−piO),ℓhypothesis=1−∏i(1−piH).(17)\ell_{\mathrm{observed}} = 1 - \prod_i (1-p_i^{O}), \qquad \ell_{\mathrm{hypothesis}} = 1 - \prod_i (1-p_i^{H}). \tag*{(17)}

These losses increase when more trajectory points are risky or individual risks become larger. They are collision-risk surrogates, not calibrated collision probabilities.

The additional clearance loss uses the largest predicted clearance across hypotheses at each point:

ℓclearance=mean⁡i[1−exp⁡(−[1−max⁡kdi(k)μ]+2)].(18)\ell_{\mathrm{clearance}} = \operatorname{mean}_i\left[1-\exp\left(-\left[1-\frac{\max_k d_i^{(k)}}{\mu}\right]_+^2\right)\right]. \tag*{(18)}

where [a]+=max⁡(a,0)[a]_+ = \max(a,0). This term is zero whenever at least one hypothesis provides sufficient clearance. It adds a penalty where all hypotheses predict clearance below the margin.

Learning rate warms up over 5% of the configured budget, remains constant until 80%, then decays by cosine to 20% of its initial value.

Guidance, Safety, and Trajectory Selection

During the final five denoising steps, guidance updates clean controls with weights and context fixed. Utility changes ΔVE\Delta V_E and ΔVT\Delta V_T compare the start with the execution-prefix and full-path endpoints, each truncated before first leaving AtA_t. With observed-obstacle, hypothesis-clearance, and heading costs COC_O, CHC_H, CθC_\theta, guidance maximizes

JG=ΔVE+τgΔVT−(4CO+CH+Cθ).(19)J_G = \Delta V_E + \tau_g \Delta V_T - (4C_O+C_H+C_\theta). \tag*{(19)}

The tail weight τg=0.25\tau_g = 0.25 reduces emphasis on distant poses. For one-cell margin m=1m=1, define ϕ(d)=[1−d/m]+2\phi(d)=[1-d/m]_+^2. At dense position sample pip_i, the geometric penalties are

ciO=ϕ(dtobs(pi))+dist⁡(pi,B)2m2,ciH=1K∑k=1Kϕ(12dt(k)(pi)).(20)c_i^O = \phi\left(d_t^{\mathrm{obs}}(p_i)\right)+\frac{\operatorname{dist}(p_i,B)^2}{m^2}, \qquad c_i^H = \frac{1}{K}\sum_{k=1}^{K}\phi\left(12d_t^{(k)}(p_i)\right). \tag*{(20)}

Here dtobsd_t^{\mathrm{obs}} is signed distance from observed obstacles in cells, B=[0,M−1]2B=[0,M-1]^2 is the map domain, and multiplication by 12 restores SDF cell units. Let ICI_C include the execution prefix and four lookahead poses, and IRI_R the remaining samples. For either cost sequence,

R(c)=12(max⁡i∈ICci+mean⁡i∈ICci)+τgmean⁡i∈IRci.(21)\mathcal{R}(c)=\frac{1}{2}\left(\max_{i\in I_C}c_i+\operatorname{mean}_{i\in I_C}c_i\right)+\tau_g\operatorname{mean}_{i\in I_R}c_i. \tag*{(21)}

We use CO=R(cO)C_O=\mathcal{R}(c^O) and CH=R(cH)C_H=\mathcal{R}(c^H), with an empty-tail mean of zero. Heading cost CθC_\theta penalizes the squared excess of the wrapped heading–motion angle beyond 30∘30^\circ, divided by π2\pi^2, at both endpoints of moving segments. It equally combines the checked-prefix mean and root-mean-square (RMS) penalty, plus the weighted tail mean. Segments shorter than 0.05 cells are exempt, and this cost updates heading controls only.

Let η\eta contain position controls and angular corrections, and gηg_\eta the gradient of JGJ_G, with heading-alignment gradients restricted to angular controls. Guidance proposes

η+=Π(η+βSSgηmax⁡(∥Sgη∥∞,10−9)).(22)\eta^+ = \Pi\left(\eta+\beta S\frac{Sg_\eta}{\max(\lVert Sg_\eta\rVert_\infty,10^{-9})}\right). \tag*{(22)}

Diagonal SS sets 0.1-unit position and 10∘10^\circ angle steps. Projection Π\Pi limits changes to 0.25 units and 30∘30^\circ while preserving the initial tangent. Backtracking tests β=1,1/2,1/4,1/8\beta=1,1/2,1/4,1/8, accepting the first finite improvement above 10−710^{-7}, otherwise leaving controls unchanged.

After decoding, validity checks reject nonfinite poses, inconsistent starts, known-obstacle intersections, and out-of-map samples over the execution prefix plus four lookahead poses. They also reject any checked point with clearance at most 0.02 (0.24 cells) in more than half the hypotheses.

The analytical selector counts each cell visible along the contiguous reachable path once. For this set Ω\Omega, let Iw=1−exp⁡(−∑x∈Ωwt(x)/180)I_w=1-\exp(-\sum_{x\in\Omega}w_t(x)/180) for w∈{n,σ}w\in\{n,\sigma\}, and Ir=∑x∈Ωrt(x)/max⁡(∑xrt(x),10−6)I_r=\sum_{x\in\Omega}r_t(x)/\max(\sum_x r_t(x),10^{-6}). The score is

J(τ)=2In+1.5Ir+Iσ+2ctrt(pend)+0.5D−10R−Cmotion+Bexplore.(23)J(\tau)=2I_n+1.5I_r+I_\sigma+2c_t r_t(p_{\mathrm{end}}) +0.5D-10R-C_{\mathrm{motion}}+B_{\mathrm{explore}}. \tag*{(23)}

Here pendp_{\mathrm{end}} is the last reachable position, DD the minimum along the full path of mean normalized hypothesis clearance, and RR the sum of known-obstacle and mean hypothesis-violation fractions. Motion cost CmotionC_{\mathrm{motion}} weights path length, mean absolute curvature, RMS third position difference, mean heading change, and previous-plan directional disagreement by 0.025, 0.20, 0.04, 0.08, and 0.20, respectively.

The exploration bonus is

Bexplore=0.4Fs+0.3Ws+0.1E+0.08N−0.1Q1+exp⁡((ct−0.5)/0.1).(24)B_{\mathrm{explore}}=\frac{0.4F_s+0.3W_s+0.1E+0.08N-0.1Q}{1+\exp((c_t-0.5)/0.1)}. \tag*{(24)}

FsF_s measures usefulness-weighted geodesic progress toward frontiers. WsW_s rewards new cells visible after turning one field-of-view width to either side at the endpoint, excluding cells already visible along the path. It uses the saturating information score with weights (nt+rt+σt+μt)/4(n_t+r_t+\sigma_t+\mu_t)/4. Efficiency EE is endpoint displacement divided by reachable path length (zero for a stationary path). Novelty NN is the endpoint’s distance to the nearest recorded history position, divided by 16 cells and clipped to [0,1][0,1] (zero for empty history). The low-efficiency penalty is Q=[(0.35−E)/0.35]+Q=[(0.35-E)/0.35]_+. Analytical features determine candidate ranking; predicted utility influences generation and guidance. The highest-scoring valid candidate is selected; if none passes the checks, no trajectory is issued.

Robot-Specific Execution Constraints

A holonomic controller tracks position and body heading, including lateral and reverse motion. Fresh observations revalidate the remaining prefix; local swept-footprint and stopping checks can halt execution. Map invalidation may trigger bounded replanning. Footprint constraints are enforced during execution, not learned.

MethodDetection (%) ↑AUC ↑Distance (cells)†Time (ms) ↓
SearchDiffusion95.6 [88.4, 100.0]0.803 [0.734, 0.872]78.2 [45.0, 116.7]307.3 [299.0, 325.7]
MapEx (stock)83.3 [73.3, 92.3]0.607 [0.512, 0.695]206.1 [161.7, 269.2]45.2 [44.6, 45.7]
MapEx (fine-tuned)85.6 [75.3, 94.3]0.639 [0.542, 0.729]177.9 [135.3, 240.0]44.6 [44.2, 45.4]
Nearest frontier85.6 [75.0, 94.8]0.696 [0.598, 0.780]150.5 [101.7, 191.2]0.86 [0.76, 0.97]

Table 1. Baseline comparison on 90 tasks: estimates [95% confidence intervals].

KKUGDetection (%) ↑AUC ↑Distance (cells)†Time (ms) ↓
4OnOn95.6 [88.4, 100.0]0.803 [0.734, 0.872]78.2 [45.0, 116.7]307.3 [299.0, 325.7]
1OnOn93.3 [87.0, 98.9]0.819 [0.744, 0.891]71.6 [34.3, 113.3]293.9 [282.8, 311.1]
0OnOn94.4 [90.2, 98.0]0.823 [0.763, 0.879]77.0 [33.5, 119.0]235.7 [221.4, 265.4]
0OffOn85.6 [77.6, 92.9]0.728 [0.629, 0.818]51.8 [37.8, 82.0]127.0 [125.9, 128.6]
4OnOff65.6 [57.1, 73.9]0.588 [0.501, 0.674]54.2 [32.6, 81.8]151.6 [150.9, 152.1]
4OffOff68.9 [60.0, 78.2]0.612 [0.524, 0.700]57.3 [37.5, 87.2]146.2 [145.4, 146.7]
0OffOff62.2 [48.9, 73.8]0.578 [0.456, 0.690]40.0 [30.0, 72.9]70.0 [69.5, 70.6]
4OffOn82.2 [73.8, 90.6]0.687 [0.605, 0.777]71.5 [40.4, 121.0]212.1 [210.7, 214.9]

Table 2. Frozen-checkpoint ablations on the same tasks: estimates [95% confidence intervals].

Figure 5. Target-detection success versus planning cycles for the compared planners.

Executed search paths on one matched task for SearchDiffusion, fine-tuned MapEx, and nearest frontier

Figure 6. Executed search paths on one matched task for SearchDiffusion, fine-tuned MapEx, and nearest frontier. Each path combines motion across successive replanning cycles; these are not individual diffusion candidates.

EXPERIMENTS AND RESULTS

Experimental Setup and Evaluation Protocol

We evaluated 90 tasks across 24 maps using one inference seed, with matched initial poses, observed areas, targets, and sensing conditions. The simulated sensor had an 18-cell range, a 60° field of view, and obstacle occlusion. Runs allowed 200 planning cycles, executing up to ten poses per cycle. SearchDiffusion generated 32 candidates with ten denoising steps per decision.

Targets started undiscovered; runs ended at first detection. Success curves retain failures in the denominator and use planning cycles or travelled distance as budgets. Success–cycle AUC averages success over cycle budgets 1–200. Planning latency included map prediction, generation, guidance, safety checks, and selection, measured on 32 shared initial states on one workstation (RTX 4080 for learned models).

Excluding 51 tasks overlapping MapEx’s fine-tuning validation maps leaves 39 tasks across nine maps with no detected fine-tuning overlap.

We report 95% percentile confidence intervals from 2,000 map-cluster bootstrap resamples, drawing maps with replacement and retaining all their tasks. Shared resamples preserve paired method comparisons and ablation contrasts. Intervals do not capture inference-seed variability and are unadjusted for multiple comparisons.

Tables I and II report median planning times and median distances over each method’s successful episodes. Successful subsets differ, so shorter distances alone do not establish greater efficiency.

Comparison with Baseline Planners

Baselines included MapEx with released predictors or predictors fine-tuned for five epochs on HouseExpo, and nearest-frontier planning, which selects nearby boundaries of unexplored space. SearchDiffusion achieved the highest detection rate and success–cycle AUC, at greater planning cost (Table I).

SearchDiffusion, fine-tuned MapEx, and nearest frontier recorded no executed-path obstacle contacts; their median per-episode minimum clearances were 0.71, 0.50, and 0.50 cells. On the restricted subset, they detected 38/39, 36/39, and 37/39 targets, respectively, indicating smaller performance differences.

Figure 7. Target-detection success versus planning cycles for the four utility–guidance ablations.

Component Ablation Studies

Eight variants changed the number of map hypotheses, utility, and guidance while keeping network weights fixed. Guidance included geometric and heading refinement; validity checks remained active throughout.

Utility helped most with guidance (Figure 8). With four hypotheses, adding utility increased success from 82.2% to 95.6% when guidance was enabled. Without guidance, success changed from 68.9% to 65.6%; this −3.3-point difference had an interval of [−11.7, 5.7], providing no clear evidence of harm. The difference between utility effects was +16.7 percentage points, with an interval of [5.0, 27.9].

Figure 8. The utility–guidance interaction.

With utility enabled, guidance reduced failures due to no valid candidate from 26 to two. With guidance enabled, utility reduced budget-exhaustion failures from 15 to two, suggesting complementary roles in executable motion and productive search.

With utility and guidance enabled, four, one, and zero hypotheses produced 86, 84, and 85 detections (Table II). The four-versus-zero difference was +1.1 points, with an interval of [−5.1, 6.5]. Removing hypotheses reduced median planning latency from 307 to 236 ms (approximately 23%), suggesting a lower-cost configuration.

Real-World Evaluation

We deployed SearchDiffusion on a ZSL-1 quadruped with a Livox MID-360 LiDAR/IMU and an Intel RealSense D455 RGB-D camera. GLIM [21] mapping and trajectory execution run onboard a 16-GB Jetson Orin NX, while the diffusion models and OneMap run on an external RTX 4090 workstation. Both diffusion models also support onboard inference: warmed-up recorded-input tests without ROS or GLIM required approximately 3.6–3.8 s per plan, including map-hypothesis generation.

The planner receives a 128 × 128 occupancy grid at 0.1 m resolution, accumulating observations from a 60° forward sector with a 4 m range. This restriction applies only to planner observations. OneMap asynchronously processes RGB-D inputs at up to 2 Hz to generate relevance maps for a user-specified text query. The robot executes up to 16 subsequent poses per 32-pose plan, with speed limits of 0.20 m/s and 0.50 rad/s. Independent local-costmap and swept-footprint checks supervise execution. Pretrained weights were deployed without real-robot fine-tuning. Robot-specific settings used a soft guidance clearance margin of 0.65 m and a hard minimum-clearance threshold of 0.20 m for trajectory validation. Across ten physical object-search environments, success was approximately 80%, with unsuccessful trials attributed to false positives in the relevance maps.

Table III reports computation-time ranges across deployment platforms. Planning includes guidance, validity checks, and selection; network communication and OneMap are excluded.

Computation time by platform (s)
DeviceMap gen.PlanningTotal
Jetson Orin NX1.08–1.092.49–2.743.57–3.82
GeForce MX4501.57–1.581.11–1.212.67–2.79
RTX 40900.32–0.350.30–0.340.63–0.69
Recorded robot runs
Success rate8/10
Minimum obstacle distance (m)0.26
Median replans7.50
Median episode time (s)79.61

Table III. Computation times by platform and recorded robot-run performance.

Figure 9 shows consecutive plans from one physical run. With sparse initial observations, the first 0.92 m prefix changes body heading by approximately 282°. By the next decision, observed grid coverage increases from 4.7% to 18.8%. The next prefix spans 1.29 m, with mean heading–translation deviation decreasing from 86° to 11°. These examples illustrate independent planning of translation and viewing direction, without establishing that rotation is optimal or caused solely by map coverage.

Position and body-heading plans under successive observations

Figure 9. Position and body-heading plans under successive observations.

CONCLUSIONS

SearchDiffusion combines learned dense utility with diffusion planning for object search under partial observability. The utility map conditions trajectory generation and guides refinement, followed by validity checks and analytical selection. In matched simulations, the method achieved higher detection success across planning budgets than the tested frontier baselines, at greater computational cost. Deployment on a quadruped achieved an operator-assessed success rate of 80% without fine-tuning on real-robot data.

Ablations indicate complementary benefits: guidance reduced invalid-trajectory failures, while utility reduced failures caused by exhausting the search budget. Runtime map hypotheses provided limited additional detection benefit; removing them reduced computation while maintaining similar observed success. These findings support combining learned search utility with guided trajectory generation.

Future work will improve onboard planning efficiency, incorporate the robot’s physical footprint and sensing uncertainty into trajectory generation, and evaluate performance in a broader range of simulated and real environments.

References

  1. [1]J. Ho, A. Jain, and P. Abbeel, “Denoising diffusion probabilistic models,” in Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 6840–6851.arxiv.org/abs/2006.11239
  2. [2]M. Janner, Y. Du, J. Tenenbaum, and S. Levine, “Planning with diffusion for flexible behavior synthesis,” in Proceedings of the 39th International Conference on Machine Learning, ser. Proceedings of Machine Learning Research, K. Chaudhuri, S. Jegelka, L. Song, C. Szepesvari, G. Niu, and S. Sabato, Eds., vol. 162. PMLR, 17–23 Jul 2022, pp. 9902–9915. [Online]. Available: https://proceedings.mlr.press/v162/janner22a.htmlarxiv.org/abs/2205.09991
  3. [3]F. L. Busch, H. Homberger, J. Ortega-Permebert, Q. Yang, and O. Andersson, “One map to find them all: Real-time open-vocabulary mapping for zero-shot multi-object navigation,” in 2025 IEEE International Conference on Robotics and Automation (ICRA), 2025, pp. 14835–14842.arxiv.org/abs/2409.11764
  4. [4]B. Yamauchi, “A frontier-based approach for autonomous exploration,” in Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA’97, ’Towards New Computational Principles for Robotics and Automation’, 1997, pp. 146–151.
  5. [5]J. Tordesillas, B. T. Lopez, M. Everett, and P. J. How, “FASTER: Fast and safe trajectory planner for navigation in unknown environments,” IEEE Transactions on Robotics, vol. 38, no. 2, pp. 922–938, 2022.arxiv.org/abs/2001.04420
  6. [6]X. Zhou, Z. Wang, H. Ye, C. Xu, and F. Gao, “An esdf-free gradient-based local planer for quadrotors,” IEEE Robotics and Automation Letters, vol. 6, no. 2, pp. 478–485, 2021.DOI
  7. [7]G. A. Hollinger and G. S. Sukhatme, “Sampling-based robotic information gathering algorithms,” The International Journal of Robotics Research, vol. 33, no. 9, pp. 1271–1287, 2014.DOI
  8. [8]L. Schmid, M. Pantic, R. Khanna, L. Ott, R. Siegwart, and J. Nieto, “An efficient sampling-based method for online informative path planning in unknown environments,” IEEE Robotics and Automation Letters, vol. 5, no. 2, pp. 1500–1507, 2020.DOI
  9. [9]A. Lykov, S. Karaf, M. Martynov, V. Serpiva, A. Fedoseev, M. Konenkov, and D. Tsetserukou, “Flockgpt: Guiding UAV flocking with linguistic orchestration,” 2024 IEEE International Symposium on Mixed and Augmented Reality Adjunct (ISMAR-Adjunct), pp. 485–488, 2024. [Online]. Available: https://api.semanticscholar.org/CorpusID: 269635461arxiv.org/abs/2405.05872
  10. [10]O. Sautenkov, Y. Yaqoot, A. Lykov, M. A. Mustafa, G. Tadevosyan, A. Akhmetkazy, M. A. Cabrera, M. Martynov, S. Karaf, and D. Tsetserukou, “Uav-vla: Vision-language-action system for large scale aerial mission generation,” 2025 20th ACM/IEEE International Conference on Human-Robot Interaction (HRI), pp. 1588–1592, 2025. [Online]. Available: https://api.semanticscholar.org/CorpusID: 274500563arxiv.org/abs/2501.05014
  11. [11]M. W. James, A. A. Hebel, A. Fedoseev, and D. Tsetserukou, “GoalSwarm: Multi-uav semantic coordination for open-vocabulary object navigation,” 2026. [Online]. Available: https://arxiv.org/abs/2603.12908
  12. [12]Y. Zheng, R. Liang, K. Zheng, J. Zheng, L. Mao, J. Li, W. Gu, R. Ai, S. E. Li, X. Zhan, and J. Liu, “Diffusion-based planning for autonomous driving with flexible guidance,” in The Thirteenth International Conference on Learning Representations, 2025. [Online]. Available: https://openreview.net/forum?id=wM2sfVgMDHarxiv.org/abs/2501.15564
  13. [13]M. Stamatopoulou, J. Liu, and D. Kanoulas, “Dippest: Diffusion-based path planner for synthesizing trajectories applied on quadruped robots,” 2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 7787–7793, 2024. [Online]. Available: https://api.semanticscholar.org/CorpusID: 270095017arxiv.org/abs/2405.19232
  14. [14]I. Zhura, S. Karaf, F. Batool, N. D. W. Mudalige, V. Serpiva, A. A. Abdulkarm, A. Fedoseev, D. Seyidov, H. Amjad, and D. Tsetserukou, “Embodieddiffusion: End-to-end traversability-guided visual diffusion for heterogeneous robot navigation,” IEEE Robotics and Automation Letters, vol. 11, no. 10, pp. 11697–11704, 2026.DOI
  15. [15]Y. Cao, J. Lew, J. Liang, J. Cheng, and G. Sartoretti, “DARE: Diffusion policy for autonomous robot exploration,” in 2025 IEEE International Conference on Robotics and Automation (ICRA), 2025, pp. 11 987–11 993.arxiv.org/abs/2410.16687
  16. [16]Z. Che, Y. Zhang, S. Liang, B. Zhou, J. Ma, and J. Zhou, “GUIDE: A diffusion-based autonomous robot exploration framework using global graph inference,” 2025, arXiv:2509.19916, version 3, revised 5 March 2026. [Online]. Available: https://arxiv.org/abs/2509.19916v3
  17. [17]C. Ho, S. Kim, B. Moon, A. Parandekar, N. Harutyunyan, C. Wang, K. Sycara, G. Best, and S. Scherer, “MapEx: Indoor structure exploration with probabilistic information gain from global map predictions,” in 2025 IEEE International Conference on Robotics and Automation (ICRA), 2025, pp. 13074–13080.arxiv.org/abs/2409.15590
  18. [18]T. Quilter, Y. Zhu, G. Quan, M. Sun, and S. Kaski, “Generative-model predictive planning for navigation in partially observable environments,” 2026, arXiv:2606.18888, version 1, submitted 17 June 2026. [Online]. Available: https://arxiv.org/abs/2606.18888v1
  19. [19]Y. He, D. Huang, Z. Liu, Z. Gu, Q. Sun, G. Ye, Y. Fu, and Y.-G. Jiang, “Schrödinger’s navigator: Imagining an ensemble of futures for zero-shot object navigation,” 2025, arXiv:2512.21201, version 3, revised 12 June 2026. [Online]. Available: https://arxiv.org/abs/2512.21201v3
  20. [20]T. Li, D. Ho, C. Li, D. Zhu, C. Wang, and M. Q. H. Meng, “HouseExpo: A large-scale 2d indoor layout dataset for learning-based algorithms on mobile robots,” 2020. [Online]. Available: https://arxiv.org/abs/1903.09845
  21. [21]K. Koide, M. Yokozuka, S. Oishi, and A. Banno, “GLIM: 3d range-inertial localization and mapping with gpu-accelerated scan matching factors,” Robotics and Autonomous Systems, vol. 179, p. 104750, 2024. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0921889024001349DOI

Paper details

vlnc:W_zavcn8yz
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents