Local-Enhanced Guidance

• Local-enhanced guidance is a methodological framework that augments a strong global backbone with fine-grained local cues to improve short-range decision-making.
• It leverages soft, adaptive guidance across diverse domains—from multi-agent pathfinding and reinforcement learning to image enhancement and Bayesian regression—to refine local actions without constraining global optimization.
• Empirical studies report significant improvements in metrics such as throughput, accuracy, and efficiency by integrating local cues that finely bias system behavior while preserving scalability.

Searching arXiv for the cited papers to ground the article in current records. Local-enhanced guidance denotes a family of mechanisms in which a planner, controller, or neural network augments its default update rule with fine-grained local cues while preserving a broader optimization, search, or inference process. In the literature, those cues appear as short spatiotemporal paths for agents, reference-path embeddings for navigation policies, channel-wise co-attention between local and global features, local planar priors in dense prediction, geometry-aware control terms in diffusion sampling, and guidance-modulated shrinkage in Bayesian regression. Across these settings, guidance is typically soft rather than mandatory: it biases local decisions, reweights features, or modulates update directions, with the stated aims of reducing congestion, improving robustness, sharpening local detail, or increasing signal–noise separation (Arita et al., 16 May 2026, Haro et al., 14 Mar 2026, Zhou et al., 2022, Jia et al., 12 Mar 2026, Das, 3 Apr 2026).

1. Conceptual scope and recurring design pattern

A recurring pattern is that local-enhanced guidance is introduced where an existing method already has a strong global backbone but weak short-range discrimination. In multi-agent pathfinding, the backbone is a configuration-based solver and the guidance is a short local path. In long-range navigation, the backbone is a recurrent policy and the guidance is a reference path embedding. In image enhancement and reconstruction, the backbone is a CNN-, transformer-, or state-space-based network and the guidance is a bidirectional exchange between local and global features. In diffusion sampling, the backbone is the reverse-time sampler and the guidance is a locally computed control update. In sparse regression, the backbone is a global–local shrinkage prior and the guidance is marginal association information embedded in the local variance map (Arita et al., 16 May 2026, Haro et al., 14 Mar 2026, Liu et al., 15 Apr 2025, Jia et al., 12 Mar 2026, Das, 3 Apr 2026).

Domain	Guidance carrier	Reported role
Lifelong MAPF	Guidance paths $\Phi[i]$	Mitigate congestion, reduce waiting
Long-range navigation	Reference path embedding $e^{\rm path}$	Soft heuristic for local execution
Image enhancement	Mutual guidance between branches	Bidirectional global-local exchange
CT correction	Global–local interaction guidance	Stripe extraction and correction
Diffusion sampling	Riemannian control update	Correct off-manifold drift
Sparse regression	$e^{\eta z_j^*}$ in variance mapping	Adaptive shrinkage

This suggests a unifying interpretation: local-enhanced guidance is not a single algorithmic primitive but a design strategy for injecting high-value local structure into a system that would otherwise rely on coarser heuristics or globally symmetric updates.

2. Configuration-based pathfinding and lifelong MAPF

The most explicit formalization appears in configuration-based MAPF. In “Local Guidance for Configuration-Based Multi-Agent Pathfinding,” local guidance is recomputed around the current configuration $Q$ as a short spatiotemporal window of paths that anticipate future collisions over the next $w$ timesteps. Each agent’s cue is its first guided step $\Phi[i][1]$, and PIBT’s standard move ordering $\langle \dist(v,g_i),\epsilon\rangle$ is replaced by $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$. The paper states that LaCAM’s completeness is preserved because guidance only biases preferences and does not forbid exploration of collision-free neighbors; empirically it reports flowtime reductions up to $50\%$, with typical sweet-spots $w\in[10,20]$ and $e^{\rm path}$0 (Arita et al., 21 Oct 2025).

“Lifelong LaCAM with Local Guidance for Lifelong MAPF” lifts the same idea to the lifelong setting by combining a receding-horizon windowed framework with warm-started guidance. For agent $e^{\rm path}$1, the guidance path $e^{\rm path}$2 starts at $e^{\rm path}$3 and minimizes a cost that trades off remaining goal distance against predicted local collisions:

$e^{\rm path}$4

The resulting guidance is injected into PIBT through the lexicographic ranking

$e^{\rm path}$5

so that following the guidance path is preferred, then true goal distance, then a hindrance estimate, then a small random bias. The lifelong solver warm-starts guidance by shifting the previous window ahead by one step, rebuilds it with small-horizon space–time A*, and carries the newly planned window forward after executing the first joint move (Arita et al., 16 May 2026).

The reported empirical effects are unusually concrete. In dense scenes, stop-counts per vertex drop by $e^{\rm path}$6–$e^{\rm path}$7, average wait-time drops by $e^{\rm path}$8–$e^{\rm path}$9, and throughput routinely surpasses fast suboptimal methods by $e^{\eta z_j^*}$0–$e^{\eta z_j^*}$1. On the random-64-64-10 map with $e^{\eta z_j^*}$2 agents, the reproduced comparison is:

Method	Throughput	Runtime (s/step)
PIBT	14.7	0.0015
LaCAM (no LG)	17.1	0.043
Guided-PIBT	16.0	0.015
RHCR	20.7	2.13
LLLG	21.1	0.21

The same study reports up to $e^{\eta z_j^*}$3 throughput over RHCR in the densest cases, per-step overhead typically under $e^{\eta z_j^*}$4 for $e^{\eta z_j^*}$5 agents when $e^{\eta z_j^*}$6 is small, and real-time viability up to $e^{\eta z_j^*}$7 agents with per-step planning remaining under $e^{\eta z_j^*}$8 (Arita et al., 16 May 2026).

3. Local guidance in navigation and reinforcement learning

In long-range embodied navigation, local-enhanced guidance appears as path conditioning rather than hard path tracking. “Path-conditioned Reinforcement Learning-based Local Planning for Long-Range Navigation” formulates the problem as a POMDP with observations

$e^{\eta z_j^*}$9

where $Q$0 is a fixed-length egocentric reference path encoding. Each waypoint is converted to a $Q$1D feature, the path is processed by a self-attention block followed by a cross-attention layer with a learnable query, and the resulting embedding $Q$2 is concatenated with the recurrent hidden state before the actor–critic heads. The reward combines task, regularization, penalty, and shortcut terms, but the paper explicitly notes that there is no explicit “stay on path” term; path-following emerges implicitly from conditioning plus the goal-driven reward. On the reported benchmarks, the baseline without path gives $Q$3 and $Q$4, the method with an optimal path gives $Q$5 and $Q$6, and the degraded-path condition falls back to approximately baseline performance with $Q$7 and $Q$8 (Haro et al., 14 Mar 2026).

A more general control-theoretic version appears in “Enhancing Reinforcement Learning Agents with Local Guides.” There, a local guide is a policy $Q$9 paired with a confidence map $w$0. The paper’s Perturbed Action Guided policy-switching scheme uses the guide action when $w$1 but adds a bounded perturbation around it:

$w$2

A key technical point is that the same hybrid policy is used in Approximate Policy Evaluation, avoiding distribution-shift bias in the bootstrap target. Across six environments, the reported mean normalized AUC rises to $w$3 for PAG, versus $w$4 for Strict Action Guided, $w$5 for Policy-Improvement Guided, and $w$6 for unguided SAC (Daoudi et al., 2024).

A lighter-weight instance is the Destination Assistant Agent in “The User-Centric Geo-Experience.” It does not run a local graph planner; instead it continuously computes a great-circle bearing $w$7 and a user-relative direction $w$8, then renders textual or AR cues at approximately $w$9. The paper reports a $\Phi[i][1]$0 reduction in critical navigation errors and a $\Phi[i][1]$1 success rate for the last-$\Phi[i][1]$2-meter task, explicitly characterizing the system as “which way” guidance rather than exact micro-routing (Deng et al., 9 Jul 2025).

4. Bidirectional global-local guidance in vision and imaging

In image enhancement, the phrase is often realized through mutual or interaction guidance between global and local branches. “Mutual Guidance and Residual Integration for Image Enhancement” introduces a two-branch network: a transformer-based global branch compressing image-wide context to a vector $\Phi[i][1]$3, and a CNN-based local branch retaining full-resolution feature maps $\Phi[i][1]$4. At each interaction stage, pooled local features attend to the global vector and the global vector reweights local channels via a compact channel-wise co-attention. Afterward, a residual integration scheme decomposes a global residual map into coarse-to-fine slices before adaptive reconstruction. On MIT-Adobe-5K-UPE, naive channel concatenation yields PSNR/SSIM $\Phi[i][1]$5, one-way Local$\Phi[i][1]$6Global yields $\Phi[i][1]$7, one-way Global$\Phi[i][1]$8Local yields $\Phi[i][1]$9, and full bidirectional mutual guidance reaches $\langle \dist(v,g_i),\epsilon\rangle$0; increasing the number of guidance blocks from $\langle \dist(v,g_i),\epsilon\rangle$1 to $\langle \dist(v,g_i),\epsilon\rangle$2 improves PSNR from $\langle \dist(v,g_i),\epsilon\rangle$3 to $\langle \dist(v,g_i),\epsilon\rangle$4 dB (Zhou et al., 2022).

In CT artifact correction, “Ring Artifacts Correction Based on Global-Local Features Interaction Guidance in the Projection Domain” explicitly decomposes a corrupted projection $\langle \dist(v,g_i),\epsilon\rangle$5 by DWT into a low-frequency sub-band $\langle \dist(v,g_i),\epsilon\rangle$6 and three high-frequency detail sub-bands. A VSS-based global branch corrects the smooth projection component, a Dense-block local branch models stripe artifacts, and the Global–Local Features Interaction Guidance module performs cross-attention in both directions before adaptive re-fusion. The reported Mayo’16 projection metrics improve from PSNR $\langle \dist(v,g_i),\epsilon\rangle$7 dB, SSIM $\langle \dist(v,g_i),\epsilon\rangle$8, RMSE $\langle \dist(v,g_i),\epsilon\rangle$9 at input to PSNR $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$0 dB, SSIM $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$1, RMSE $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$2 after correction; on reconstructions the values move from PSNR $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$3 dB, SSIM $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$4, RMSE $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$5 HU to PSNR $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$6 dB, SSIM $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$7, RMSE $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$8 HU. An ablation without GLFIG drops projection PSNR by $\langle \mathbf{1}[\Phi[i][1]\ne v],\dist(v,g_i),\epsilon\rangle$9 dB and increases RMSE by $50\%$0 (Liu et al., 15 Apr 2025).

“Adaptive Low Light Enhancement via Joint Global-Local Illumination Adjustment” uses a different coupling. The Local Contrast Enhancement Network processes non-overlapping patches through enhancement and feature-modulation blocks, while a Local Discriminative Module predicts a readiness score $50\%$1 and triggers early exit for sufficiently illuminated patches. The Global Illumination Guidance Network computes image-wide features $50\%$2 and injects them into local patch processing through a Spatial Feature Transformation. On a $50\%$3-image test set from LOL, MIT-Adobe FiveK, and SICE, the method reports PSNR $50\%$4 dB and SSIM $50\%$5, exceeding the stated second-best values of $50\%$6 and $50\%$7; on no-reference evaluation it reports LOE $50\%$8 and NIQE $50\%$9 (Wang et al., 1 Apr 2025).

Dense prediction offers another interpretation. “From Big to Small: Multi-Scale Local Planar Guidance for Monocular Depth Estimation” inserts Local Planar Guidance layers at resolutions $w\in[10,20]$0, $w\in[10,20]$1, and $w\in[10,20]$2, each predicting a plane for a corresponding $w\in[10,20]$3 full-resolution patch. The ray–plane intersection formula

$w\in[10,20]$4

converts those plane parameters into local depth estimates. On NYU v2 with a ResNet-101 backbone, $w\in[10,20]$5 improves from $w\in[10,20]$6 with ASPP and upconvolution to $w\in[10,20]$7 after adding LPG, and the full system reaches $w\in[10,20]$8; with DenseNet-161, the paper reports $w\in[10,20]$9 (Lee et al., 2019).

A related unfolding-based instance appears in “Local-Global Transformer Enhanced Unfolding Network for Pan-sharpening,” where PAN guidance is injected in the data module of each PGD stage, while the prior module uses a Local-Global Transformer that combines windowed self-attention and global Fourier-domain mixing. The reported implementation uses $e^{\rm path}$00 unfolding stages and a simple $e^{\rm path}$01 reconstruction loss (Li et al., 2023).

5. Guidance in generative models and exemplar-based transfer

Example-based stylization provides an early and explicit notion of local guidance. “StyleBlit” distinguishes global guidance from local guidance by the spatial variation of the guiding channels, with normals, UV coordinates, and dense displacement fields given as representative local signals. For each target pixel $e^{\rm path}$02, the core mapping is

$e^{\rm path}$03

followed by chunk growth under a guidance error threshold. The final seed-hierarchy algorithm achieves $e^{\rm path}$04 complexity, with reported performance of about $e^{\rm path}$05 for a $e^{\rm path}$06 megapixel frame on a single CPU core, about $e^{\rm path}$07 for a $e^{\rm path}$08K frame on a GeForce GTX 970, about $e^{\rm path}$09 fps on a Samsung Galaxy A3, and a speed-up on the order of $e^{\rm path}$10 over StyLit (Sýkora et al., 2018).

In video diffusion, local guidance is fused with global context. “Video Diffusion Models with Local-Global Context Guidance” conditions each fragment on a small set of local frames $e^{\rm path}$11 and positional masks $e^{\rm path}$12, while a sequential encoder produces a global embedding $e^{\rm path}$13 from the previous fragment. Local information is concatenated channel-wise, and the global embedding is injected through cross-attention inside a 2D-convolutional UNet with residual and self-attention blocks. The paper further introduces a two-stage training strategy in which the second stage uses the model’s own predicted fragment as the condition for the next ground-truth fragment. On Cityscapes, the reported comparison improves FVD from $e^{\rm path}$14 to $e^{\rm path}$15, LPIPS from $e^{\rm path}$16 to $e^{\rm path}$17, and SSIM from $e^{\rm path}$18 to $e^{\rm path}$19; on BAIR, PSNR improves from approximately $e^{\rm path}$20 to approximately $e^{\rm path}$21 and SSIM from approximately $e^{\rm path}$22 to approximately $e^{\rm path}$23 (Yang et al., 2023).

“Manifold-Optimal Guidance” reframes diffusion guidance as a local optimal-control problem on a noisy data manifold. Standard CFG uses

$e^{\rm path}$24

where $e^{\rm path}$25, and the paper attributes oversaturation, texture artifacts, and structural collapse at large guidance scales to Euclidean extrapolation off the data manifold. MOG instead solves

$e^{\rm path}$26

yielding the guided score

$e^{\rm path}$27

With a rank-$e^{\rm path}$28 anisotropic metric based on the unconditional score direction, the update can be applied in $e^{\rm path}$29 by Sherman–Morrison, and the paper states that this yields virtually no added computational overhead. Auto-MOG further sets

$e^{\rm path}$30

removing the need for manual guidance-scale tuning (Jia et al., 12 Mar 2026).

A task-specific dense-prediction instance is “SLENet,” where the Localization Guidance Branch produces a semantic map $e^{\rm path}$31 that modulates each decoder scale through affine parameters. On DeepCamo-test, the full model improves $e^{\rm path}$32 from $e^{\rm path}$33 in the unguided setting to $e^{\rm path}$34, while reducing MAE from $e^{\rm path}$35 to $e^{\rm path}$36 (Wang et al., 4 Sep 2025).

6. Statistical and algorithmic generalizations

Local-enhanced guidance is not confined to spatial fields. “Bayesian Global-Local Shrinkage with Univariate Guidance for Ultra-High-Dimensional Regression” embeds marginal association information directly into the nonlinear variance structure of a regularized horseshoe prior. The effective variance is

$e^{\rm path}$37

so high-guidance predictors require smaller $e^{\rm path}$38 to reach the slab regime, while weakly supported predictors remain strongly shrunk. The paper proves prior concentration, posterior contraction, and guidance-induced shrinkage separation, and also proves robustness under uninformative guidance. Its BUGS-Active variant restricts local updates to an active set $e^{\rm path}$39, reducing per-iteration local-update complexity from $e^{\rm path}$40 to $e^{\rm path}$41; the reported scale reaches $e^{\rm path}$42, and in a DNA methylation study with $e^{\rm path}$43 and approximately $e^{\rm path}$44 CpG sites, BUGS-Active improves test RMSE from $e^{\rm path}$45 for the unguided method to $e^{\rm path}$46 (Das, 3 Apr 2026).

A closely related, though polarity-reversed, formulation appears in SMT-based model checking. “Global Guidance for Local Generalization in Model Checking” argues that IC3-style rules are local and can fail through myopic generalization, excessive generalization, or being stuck in a rut. Govind et al. add three rules—Subsume, Concretize, and Conjecture—so that the current set of frames acts as a tentative global proof guiding subsequent local reasoning. The paper reports that GSpacer is significantly more effective than both SPACER and sole global reasoning, and that it is insensitive to interpolation (K et al., 2020).

Several misconceptions recur across the literature. Guidance is often treated as if it were a hard constraint, but many of the strongest results arise when guidance remains soft: LaCAM preserves completeness because guidance only biases preferences; path-conditioned RL has no explicit path-following reward; and StyleBlit uses guidance to identify transferable chunks rather than to solve a global optimization (Arita et al., 21 Oct 2025, Haro et al., 14 Mar 2026, Sýkora et al., 2018). Another misconception is that stronger guidance is always better. High CFG scales can induce oversaturation and structural collapse, and MAPF guidance parameters that are too large increase planning time or make agents overly conservative; this is why adaptive schedules such as Auto-MOG and empirically tuned windows such as $e^{\rm path}$47 recur in practice (Jia et al., 12 Mar 2026, Arita et al., 21 Oct 2025).

Taken together, these works define local-enhanced guidance as a broad methodological family: local cues are made explicit, encoded, and reinjected into an existing decision loop so that global objectives can be pursued with finer situational awareness. The implementations differ sharply across graph search, continuous control, inverse problems, generative modeling, and Bayesian inference, but the underlying logic is consistent: local information becomes most useful when it is informative enough to alter short-range behavior and lightweight enough not to destroy the scalability of the surrounding system.