Saved in:
Bibliographic Details
Main Authors: Choe, Hyeongmin, Han, SooJean
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.21302
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911617121255424
author Choe, Hyeongmin
Han, SooJean
author_facet Choe, Hyeongmin
Han, SooJean
contents We study sensor scheduling for continuous-discrete Kalman filtering with Poisson measurement arrivals and propose an information-form deterministic surrogate for scalable offline design. Unlike the covariance-form surrogate, the sensing rates enter through sensor-specific additive information increments, eliminating mixed state-input derivatives in the transcribed nonlinear program and thereby yielding a simpler derivative structure. We further show that, together with the covariance-form surrogate, the proposed surrogate provides computable two-sided performance bounds for a given schedule under stochastic measurement arrivals. Numerical experiments demonstrate substantial computational savings, especially in many-sensor settings, while retaining comparable realized Monte Carlo performance and providing computable two-sided performance bounds for the returned schedule.
format Preprint
id arxiv_https___arxiv_org_abs_2604_21302
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Scalable Sensor Scheduling for Continuous-Discrete Kalman Filtering via Information-Form Surrogate Dynamics
Choe, Hyeongmin
Han, SooJean
Systems and Control
We study sensor scheduling for continuous-discrete Kalman filtering with Poisson measurement arrivals and propose an information-form deterministic surrogate for scalable offline design. Unlike the covariance-form surrogate, the sensing rates enter through sensor-specific additive information increments, eliminating mixed state-input derivatives in the transcribed nonlinear program and thereby yielding a simpler derivative structure. We further show that, together with the covariance-form surrogate, the proposed surrogate provides computable two-sided performance bounds for a given schedule under stochastic measurement arrivals. Numerical experiments demonstrate substantial computational savings, especially in many-sensor settings, while retaining comparable realized Monte Carlo performance and providing computable two-sided performance bounds for the returned schedule.
title Scalable Sensor Scheduling for Continuous-Discrete Kalman Filtering via Information-Form Surrogate Dynamics
topic Systems and Control
url https://arxiv.org/abs/2604.21302