Backend
Worth Another Look:Constrained World-Model Planning for Visual Inspection
arXiv cs.RO0 views
arXiv:2611.24187v1 Announce Type: new Abstract: Visual inspection in field robotics and environmental monitoring must localize multiple targets under strict compute and sensing caps. Exhaustive sweeps waste calls on absent classes, while myopic and search-free policies stumble over heterogeneous tariff cliffs or discard viewport edits whose value emerges only after re-querying. We formulate inspection over frozen detectors as neuro-symbolic observation planning under partial observability, decoupling a compact recurrent world model (WM) from exact symbolic feasibility and tariff rules. Receding-horizon beam search with online replanning jointly schedules class queries, crops, enhancements, and termination (stop), paired with slack-aware shadow pricing and legal fallback at larger budgets. Across eight terrestrial, optical, and sonar benchmarks, multi-step lookahead outperforms static schedules and search-free offline RL under tight budgets -- gaining up to 28.4 AP percentage points over static priority on RUOD and 15.1 on ARIS -- while dynamic pricing lifts large-budget performance on all eight domains at 11 ms planning cost. Ultimately, pairing lightweight learned dynamics with exact symbolic constraints turns frozen detectors into adaptive, budget-aware inspection agents without retraining.
Source:https://arxiv.org/abs/2611.24187PreviousDual-Actuation Emulation of Scaled Relative Orbital Dynamics on a Free-FlyerNextHigh-Precision Docking of Differential-Drive Mobile Robots Through LiDAR and Vision Collaboration
Related posts
Learning to Decide with AI Assistance under Human-Alignment
0arXiv cs.HC
From Defense to Advocacy: Empowering Users to Leverage the Blind Spot of AI Inference
0arXiv cs.HC
Noise-induced enhancement of regime lifetimes -- A data-driven approach using deterministic trajectories
0arXiv cs.NA
fOGA: An Orthogonal Greedy Algorithm for Fractional Laplacian Problems
0arXiv cs.NA
Bad Genius: Counterfactual-Guided Harness Evolution Beyond Task-Specific Shortcuts
0arXiv stat.ML
Kinetic Langevin Splitting Schemes for Constrained Sampling
0arXiv stat.ML