Searcharxiv⌕ Search

arXiv · 2611.12113

Motion Belief Action: From a Visual Scene Map to Physical Decisions

Abstract

A robot that works among people must judge what it cannot see: whether an object is still where it was last seen, and whether a pull on a door or drawer is worth its risk. Maps that track object change hold nothing about force, maps of physical properties answer a risk question at a fixed risk level, and vision-language-action models keep no explicit estimate of hidden physics. We propose Motion Belief Action (MBA), a decision layer on the scene map. From how often people move an object and how much force it needs, how much load it holds and whether it is blocked, MBA chooses under a force limit to look again, nudge, open, brace or decline, with its risk set by the task's costs. On real activity in 9 kitchens, it predicts whether an object is still in place better than FreMEn and Perpetua, and decides when to look again at lower cost than these and the persistence filter, because about a quarter of placements end in a pick-up within 30 s. On real pulls of doors and drawers in 17 locations, made by a person with a force-sensing gripper, the map's force estimates decide better than a part-type average. Setting the risk from the costs also beats a published risk rule at its fixed level. In simulation, with the force limit at the training parts' median force, MBA raises SmolVLA's and Octo's scores by declining pulls; most declined door pulls would fail, but on drawers more would have opened, and a part-type average gets about half of this gain. In both, a published risk rule set to the risk these costs imply is MBA's rule for a single pull and decides as well in the main settings. A link between opening and holding force, a probing nudge and an action prior for camera tracking do not help in the main settings, and over the real-pull sweep the nudge costs a little.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dibyendu Ghosh. 2026-11-09. Motion Belief Action: From a Visual Scene Map to Physical Decisions. https://searcharxiv.com/abs/2611.12113

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Human-like Semantic Navigation for Autonomous Driving using Knowledge Representation and Large Language Models

Achieving full automation in self-driving vehicles remains a challenge, especially in dynamic urban environments where navigation requires real-time adaptability. Existing systems struggle to handle navigation plans when faced with unpredictable changes in road layouts, spontaneous detours, or missing map data, due to their heavy reliance on predefined cartographic information. In this work, we explore the use of Large Language Models to generate Answer Set Programming rules by translating informal navigation instructions into structured, logic-based reasoning. ASP provides non-monotonic reasoning, allowing autonomous vehicles to adapt to evolving scenarios without relying on predefined maps. We present an experimental evaluation in which LLMs generate ASP constraints that encode real-world urban driving logic into a formal knowledge representation. By automating the translation of informal navigation instructions into logical rules, our method improves adaptability and explainability in autonomous navigation. Results show that LLM-driven ASP rule generation supports semantic-based decision-making, offering an explainable framework for dynamic navigation planning that aligns closely with how humans communicate navigational intent.

cs.RO↗

InFeR: Informed Failure Resilience in Learned Visual Navigation Control

While imitation learning (IL) has enabled successful visual navigation in many common environments, IL policies are prone to unpredictable failures under out-of-distribution (OOD) scenarios. This necessitates failure-resilient policies, which not only detect failures, but also recognise their sources and recover from them autonomously. We propose InFeR, a general framework for building IL policies with informed failure resilience without failure or recovery demonstrations. Given an IL policy's architecture and training dataset, InFeR retrains a new OOD-aware policy with a latent space structured for OOD failure detection, with a modified objective based on the Variational Information Bottleneck. It applies a visual explainability technique, Grad-CAM, to attribute failures to specific image regions and inform a heuristic policy for recovery. All these are achieved without requiring additional training data. Real-world experiments show that InFeR enables informed failure recovery across two different policy architectures, supporting long-range navigation in complex environments.

cs.RO↗

Delay-Aware Distributed Multi-Robot Motion Planning

This paper examines why distributed optimization degrades when multi-robot systems coordinate under realistic communication delays. Using consensus ADMM as a representative framework for generating collision-free, dynamically feasible motion plans in both trajectory optimization and receding-horizon control settings, we show that delay degrades performance structurally: the consensus and dual updates weight stale and current information identically, so staleness enters the optimizer disguised as genuine disagreement and accumulates through the multipliers. Delay-agnostic adaptation (e.g. residual balancing) inherits this contamination and can perform worse than a fixed penalty. We introduce a Delay-Aware ADMM (DA-ADMM) variant that adapts penalty parameters to real-time delay statistics and re-derives the global consensus update as a delay-weighted average, down-weighting stale information in favor of recent updates. Simulations in 2D and 3D show that DA-ADMM improves robustness, success rate, and solution quality over fixed-parameter, residual-balancing, lower-bound, and fixed-constraint baselines. Degradation is therefore governed not by delay length or frequency, but by the optimizer's ability to reason over the age of the information it receives.

cs.RO↗