We develop a methodology for set-based state estimation from noisy input-output trajectories, without a predefined model structure for the unknown state dynamics or access to training state measurements. We derive a bound on the state set diameter that depends on the sensor map and leverage it as a surrogate to formulate a tractable linear program balancing state set tightness against output trajectory coverage. Combining this certificate with deterministic or probabilistically certified measurement noise sets and leveraging the results from scenario optimization with relaxation, we provide joint a posteriori probabilistic guarantees for state inclusion and state set diameter. Numerical simulations corroborate our developed theoretical guarantees.
Figures & tables
Figure 1: (a) Empirical violations Vcs , V and bound ϵN(sN,βy) averaged over 15 repetitions for N∈{500,1000,2000} , ρ=5 and ηw=1 . Shaded regions indicate the min/max range across the 15 independent repetitions. (b) State set diameter and bound dˉk:=dk+bv , both averaged over time steps, test trajectories, and 15 independent repetitions, for ρ∈{3,5,10} , N=1000 , and ηw=1 . (c) Evolution of the mean actual and surrogate state set diameters for ηw∈{0.3,0.5,1} , with N=2000 and ρ=5 . Solid and dashed lines represent the actual and surrogate diameters, respectively, while shaded regions indicate the min–max range across 15 independent repetitions.
We study finite horizon reachable set estimation for unknown discrete-time dynamical systems using only sampled state trajectories. Rather than treating scenario optimization as a black-box tool, we show how it can be tailored to reachable set estimation, where one must learn a family of sets based on whole trajectories, while preserving probabilistic guarantees on future trajectory inclusion for the entire horizon. To this end, we formulate a relaxed scenario program with slack variables that yields a tunable trade-off between reachable set size and out-of-sample trajectory inclusion over the horizon, thereby reducing sensitivity to outliers. Leveraging the recent results in adversarially robust scenario optimization, we then extend this formulation to account for bounded adversarial perturbations of the observed trajectories and derive a posteriori probabilistic guarantees on future trajectory inclusion. When probability distribution shifts in the Wasserstein distance occur, we obtain an explicit bound on how gracefully the theoretical probabilistic guarantees degrade. For different geometries, i.e., p-norm balls, ellipsoids, and zonotopes, we derive tractable convex reformulations and corroborate our theoretical results in simulation.
Georgios Pantazis, Michelle S. Chong
Dynamics and Control (D&C) section at the Department of Mechanical Engineering, Eindhoven University of Technology, the Netherlands.
Proprioceptive-only state estimation is attractive for legged robots since it is computationally cheaper and is unaffected by perceptually degraded conditions. The history of joint-level measurements contains rich information that can be used to infer the dynamics of the system and subsequently produce navigational measurements. Recent approaches produce these estimates with learned measurement models and fuse with IMU data, under a Gaussian noise assumption. However, this assumption can easily break down with limited training data and render the estimates inconsistent and potentially divergent. In this work, we propose a proprioceptive-only state estimation framework for legged robots that characterizes the measurement noise using set-coverage statements that do not assume any distribution. We develop a practical and computationally inexpensive method to use these set-coverage measurements with a Gaussian filter in a systematic way. We validate the approach in both simulation and two real-world quadrupedal datasets. Comparison with the Gaussian baselines shows that our proposed method remains consistent and is not prone to drift under real noise scenarios.
Abhijeet M. Kulkarni, Ioannis Poulakakis, Guoquan Huang
Department of Mechanical Engineering, University of Delaware, Newark, DE, USA · Robotics Institute, Athena Research Center, Marousi, Greece; School of Mechanical Engineering, National Technical University of Athens, Greece; HERON–Center of Excellence in Robotics, Athens, Greece
This paper studies finite-sample set-membership identification for discrete-time bilinear systems under bounded symmetric log-concave disturbances. Our analysis considers trajectory-dependent regressors and allows marginally stable dynamics with polynomial mean-square state growth. We prove that the diameter of the feasible parameter set shrinks with sample complexity O(1/ε) where ε is the estimation error. Simulation supports the theory and illustrates the advantage of the proposed estimator for uncertainty quantification.
Hongyu Yi, Chenbei Lu, Jing Yu
Department of Electrical and Computer Engineering, University of Washington, Seattle, WA, USA. · Cornell University AI for Science Institute, Cornell University, Ithaca, NY, USA.