Active Localization of Unstable Systems with Coarse Information

• URL: http://arxiv.org/abs/2602.06191v1
• Date: Thu, 05 Feb 2026 20:56:16 GMT
• Title: Active Localization of Unstable Systems with Coarse Information
• Abstract summary: We study localization and control for unstable systems under coarse, single-bit sensing.<n>We develop an active localization algorithm that integrates a set-based estimator with a control strategy derived from Voronoi partitions.
• Score: 2.094349987888854
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study localization and control for unstable systems under coarse, single-bit sensing. Motivated by understanding the fundamental limitations imposed by such minimal feedback, we identify sufficient conditions under which the initial state can be recovered despite instability and extremely sparse measurements. Building on these conditions, we develop an active localization algorithm that integrates a set-based estimator with a control strategy derived from Voronoi partitions, which provably estimates the initial state while ensuring the agent remains in informative regions. Under the derived conditions, the proposed approach guarantees exponential contraction of the initial-state uncertainty, and the result is further supported by numerical experiments. These findings can offer theoretical insight into localization in robotics, where sensing is often limited to coarse abstractions such as keyframes, segmentations, or line-based features.

Related papers

• Knowledge-Informed Local Causal Discovery of Optimal Adjustment Sets [40.628201358330976]
  Local causal discovery is a scalable alternative to global structure learning.<n>We propose b-LOAD, a knowledge-informed extension of the LOAD algorithm for local discovery of optimal adjustment sets.<n>Results on real-world biological networks show that locally targeted prior knowledge provides the largest gains.
  arXiv  Detail & Related papers  (2026-07-05T18:18:42Z)
• Limits of Learning Linear Dynamics from Experiments [8.916035365052398]
  We show that the experimental setup dictates a fundamental limit on the information recoverable from the observed trajectory.<n>We prove that even when the full system is not identifiable, the restricted dynamics on the subspace reachable by the experiment remain uniquely determined.
  arXiv  Detail & Related papers  (2026-05-12T12:00:37Z)
• Uncertainty Estimation for Deep Reconstruction in Actuatic Disaster Scenarios with Autonomous Vehicles [68.82821445619759]
  principled uncertainty quantification is critical for active sensing strategies.<n>Evidential Deep Learning achieves the best reconstruction accuracy and uncertainty calibration across all sensor configurations.<n>These findings support Evidential Deep Learning as the preferred method for uncertainty-aware field reconstruction in real-time autonomous vehicle deployments.
  arXiv  Detail & Related papers  (2026-04-07T19:17:44Z)
• Anticipatory Reinforcement Learning: From Generative Path-Laws to Distributional Value Functions [0.0]
  This paper introduces Anticipatory Reinforcement Learning (ARL), a novel framework designed to bridge the gap between non-Markovian decision processes and classical reinforcement learning architectures.<n>In environments characterised by jump-diffusions and structural breaks, traditional state-based methods often fail to capture the essential path-dependent geometry required for accurate foresight.
  arXiv  Detail & Related papers  (2026-04-06T13:15:44Z)
• Sparse, self-organizing ensembles of local kernels detect rare statistical anomalies [7.472760645164855]
  Weak or rare signals can remain hidden within the apparent regularity of normal data, creating a gap in our ability to detect and interpret anomalies.<n>We propose a class of self-organizing local kernels that adaptively partition the representation space around regions of statistical imbalance.<n>We provide theoretical insights into the mechanisms that drive detection and self-organization in the proposed model, and demonstrate the effectiveness of this approach on realistic high-dimensional problems.
  arXiv  Detail & Related papers  (2025-11-05T00:55:56Z)
• Recurrent neural network-based robust control systems with closed-loop regional incremental ISS and application to MPC design [0.43748379918040853]
  This paper investigates the design of output-feedback schemes for systems described by a class of recurrent neural networks.<n>We propose a procedure based on linear matrix inequalities for designing an observer and a static state-feedback controller.<n>We introduce an alternative scheme in which the static law is replaced with a tube-based nonlinear model predictive controller.
  arXiv  Detail & Related papers  (2025-06-25T11:44:28Z)
• Rethinking State Disentanglement in Causal Reinforcement Learning [78.12976579620165]
  Causality provides rigorous theoretical support for ensuring that the underlying states can be uniquely recovered through identifiability. We revisit this research line and find that incorporating RL-specific context can reduce unnecessary assumptions in previous identifiability analyses for latent states. We propose a novel approach for general partially observable Markov Decision Processes (POMDPs) by replacing the complicated structural constraints in previous methods with two simple constraints for transition and reward preservation.
  arXiv  Detail & Related papers  (2024-08-24T06:49:13Z)
• Beyond the Edge of Stability via Two-step Gradient Updates [49.03389279816152]
  Gradient Descent (GD) is a powerful workhorse of modern machine learning. GD's ability to find local minimisers is only guaranteed for losses with Lipschitz gradients. This work focuses on simple, yet representative, learning problems via analysis of two-step gradient updates.
  arXiv  Detail & Related papers  (2022-06-08T21:32:50Z)
• Toward Certified Robustness Against Real-World Distribution Shifts [65.66374339500025]
  We train a generative model to learn perturbations from data and define specifications with respect to the output of the learned model. A unique challenge arising from this setting is that existing verifiers cannot tightly approximate sigmoid activations. We propose a general meta-algorithm for handling sigmoid activations which leverages classical notions of counter-example-guided abstraction refinement.
  arXiv  Detail & Related papers  (2022-06-08T04:09:13Z)
• Learning-based Localizability Estimation for Robust LiDAR Localization [13.298113481670038]
  LiDAR-based localization and mapping is one of the core components in many modern robotic systems. This work proposes a neural network-based estimation approach for detecting (non-)localizability during robot operation.
  arXiv  Detail & Related papers  (2022-03-11T01:12:00Z)
• Sparsity in Partially Controllable Linear Systems [56.142264865866636]
  We study partially controllable linear dynamical systems specified by an underlying sparsity pattern. Our results characterize those state variables which are irrelevant for optimal control.
  arXiv  Detail & Related papers  (2021-10-12T16:41:47Z)
• Versatile and Robust Transient Stability Assessment via Instance Transfer Learning [6.760999627905228]
  This paper introduces a new data collection method in a data-driven algorithm incorporating the knowledge of power system dynamics. We introduce a new concept called Fault-Affected Area, which provides crucial information regarding the unstable region of operation. The test results on the IEEE 39-bus system verify that this model can accurately predict the stability of previously unseen operational scenarios.
  arXiv  Detail & Related papers  (2021-02-20T09:10:29Z)
• GenDICE: Generalized Offline Estimation of Stationary Values [108.17309783125398]
  We show that effective estimation can still be achieved in important applications. Our approach is based on estimating a ratio that corrects for the discrepancy between the stationary and empirical distributions. The resulting algorithm, GenDICE, is straightforward and effective.
  arXiv  Detail & Related papers  (2020-02-21T00:27:52Z)

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.