Search arXivSearch

arXiv · 2511.06409

Sensor Importance towards Observability Degree via Shapley Values

Abstract

Sensor selection is an often under-appreciated aspect of state estimator or Kalman filter design. The basic minimum requirement for the choice of a sensor set while designing Kalman filters is that all states are observable. In addition, the sensors should be chosen with a view towards estimating the states with a desired accuracy. Often observability is treated as true/false check during filter design. Beyond observability -- the observability degree -- which measures \emph{how observable} the states are, has been used as the metric of choice to for sensor selection or placement applications. The higher the degree of observability, the better the possibility of designing Kalman filters that achieve the desired state estimation accuracy and consistency requirements. When a wide variety of sensors are available, sometimes with cost and physical constraints involved, sensor selection plays a crucial role in filter design. In such situations it is important to know the expected contribution of each sensor towards observability degree. Shapley values, developed in cooperative game theory for fair allocation of the payout of a multi-player game to individual players, are widely used in machine learning to assess feature importance. This paper shows that Shapley values can indeed be leveraged to quantify the expected marginal contribution of each sensor in any given sensor set towards the observability degree. This quantification of the fair contribution of each sensor towards the observability degree can be leveraged by filter designers for sensor selection, placement and filter (state estimator) design.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vishal Cholapadi Ravindra. 2025-11-09. Sensor Importance towards Observability Degree via Shapley Values. https://arxiv.org/abs/2511.06409

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Ensuring Stability of Non-Minimal Modes in Input-Output Data-Driven Representation

Many recent data-driven control approaches for linear time-invariant systems are based on output trajectory prediction using input-output data matrices. The system dynamics described by this predictor, which we refer to as the input-output data-driven representation, yields non-unique autoregressive with exogenous inputs (ARX) models having possibly unstable non-minimal modes. In this note, we show that the stability of these non-minimal modes is ensured by a certain choice of ARX model, which coincides with the minimum-norm least-squares predictor using the Moore-Penrose inverse of the data matrix. This stability guarantee holds regardless of the underlying system's stability. Moreover, the stability persists under sufficiently small noise in data when a suitably truncated Moore-Penrose inverse is used. Consequently, the ARX model need not be reduced to the true system order in order to avoid unstable additional modes.

eess.SY

Optimization-Based Formation Flight on Libration Point Orbits

A model predictive control (MPC) framework is developed for station-keeping in spacecraft formation flight along libration point orbits. At each control period, the MPC policy solves a multi-vehicle optimal control problem (MVOCP) that tracks a reference trajectory, while enforcing path constraints on the relative motion of the formation. The control policy makes use of a limited set of control nodes consistent with operational constraints that allow only a small number of maneuver opportunities per revolution. To promote recursive feasibility, path constraints are progressively tightened across the prediction horizon. An isoperimetric reformulation of the constraints is used to prevent inter-sample violations. The resulting MVOCP is a nonconvex program, which is solved via sequential convex programming. The proposed approach is evaluated in a high-fidelity ephemeris model under uncertainties for a formation along the near-rectilinear halo orbit (NRHO), and subject to path constraints on inter-spacecraft separation and relative Sun phase angle. The results demonstrate maintenance of a spacecraft formation that satisfies the path constraints with realistic cumulative propellant consumption.

eess.SY

Certificates Synthesis for A Class of Observational Properties in Stochastic Systems: A Unified Approach

In this paper, we investigate the probabilistic formal verification of stochastic dynamical systems over continuous state spaces. Motivated by problems in state estimation and information-flow security, we introduce the notion of observational properties, which characterize the inferences an external observer can draw from system outputs. These properties are formulated as probabilistic hyperproperties based on HyperLTL over finite traces, yielding a unified framework that subsumes several existing notions studied separately in the literature. We reduce the verification problem to reachability analysis over an augmented structure that integrates the system dynamics with an automaton representation of the specification. Building on this construction, we develop stochastic barrier certificates that provide probabilistic guarantees for property satisfaction while avoiding explicit state-space discretization. The effectiveness of the proposed framework is demonstrated through a case study.

eess.SY