Pith. sign in

REVIEW 2 major objections 4 minor 51 references

Risk Sensitive Filtering for Singular Systems subject to Round-Robin Protocol

T0 review · 2 major / 4 minor · reviewed 2026-07-11 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A recursive risk-sensitive Kalman filter for singular systems under round-robin measurement scheduling improves robustness by adapting the risk parameter online from covariance information.

desk verdict Solid incremental RSKF for singular systems under round-robin: the recursion and adaptive µ rule are usable, but Gaussian closure of the information state is assumed rather than proved for the non-causal RRIPS. read the letter →

arxiv 2607.04734 v1 pith:TLMW25RC submitted 2026-07-06 math.OC

Ashna Goel , Shovan Bhaumik , Nutan Kumar Tomar This is my paper · ORCID
classification math.OC MSC 93E1193C5593B07
keywords singularsystemsnetworkedcontrolround-robinprotocolWeierstrasscanonicalformKalmanfilteringrisk-sensitiveperiodicadaptiveriskparameter
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper shows how to estimate the state of a linear singular system when only a rotating subset of sensors can talk at each time step. It first rewrites the singular plant, via the Weierstrass form, as an ordinary but non-causal periodic system induced by the round-robin schedule. On that model it derives a recursive risk-sensitive Kalman filter that minimises an exponential quadratic cost, then recovers the original singular-state estimate by a simple linear transformation. An adaptive rule chooses the risk weight from the current covariance so that the predicted covariance stays positive definite while the filter becomes more or less risk-averse as uncertainty grows. Under uniform complete observability and controllability of the uncertain periodic system the posterior covariance remains bounded, and the scheme collapses to ordinary Kalman filtering when the risk weight vanishes. Numerical trials indicate lower RMSE than the classical Kalman filter once model mismatch appears.

What carries the argument

The Weierstrass-to-RRIPS transformation together with the information-state recursion that replaces the ordinary prediction covariance by (P^{-1}-2µI)^{-1}; the adaptive rule that selects µ so that this matrix remains positive definite is what carries both the recursion and the robustness claim.

What would settle it

Run the adaptive risk-sensitive recursion on a regular singular plant with known nonzero modelling error and a fixed round-robin schedule; if the empirical RMSE never falls below that of the ordinary Kalman filter, or if the predicted covariance loses positive-definiteness despite the adaptive µ rule, the central claim fails.

Watch

Extended reading notes

Core claim

For a regular discrete-time linear singular system whose measurements are transmitted under a round-robin protocol, the Weierstrass canonical form yields an equivalent round-robin-induced periodic system on which a Bayesian risk-sensitive Kalman filter can be written in closed recursive form; an online covariance-dependent choice of the risk parameter keeps the predicted covariance positive definite and, under uniform complete observability and controllability, guarantees uniform boundedness of the posterior covariance even under bounded plant uncertainty.

Load-bearing premise

The filter treats the information state as remaining an unnormalised Gaussian for every small enough risk weight, which is assumed rather than proved after the non-causal singular-to-state-space conversion and the periodic measurement selection.

Editorial extensions

If this is right

  • When the risk weight is set to zero the algorithm recovers the classical Kalman filter for singular systems under round-robin scheduling.
  • When the singular matrix is the identity the algorithm recovers the ordinary risk-sensitive Kalman filter for non-singular systems.
  • Uniform complete observability and controllability of the uncertain periodic system are sufficient for uniform boundedness of the filter covariance.
  • The same transformation-plus-adaptive-risk pattern can be applied once packet dropouts or random delays are added to the communication model.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same adaptive-µ idea could be attached to other exponential-cost estimators (e.g., risk-sensitive H∞ hybrids) without re-deriving the entire singular-system theory.
  • Because the algebraic subsystem is non-causal, any future extension to multi-step packet loss will have to track finite-horizon noise correlations that ordinary causal filters never see.
  • If the nilpotency index of the Weierstrass block is larger than one, the effective process-noise covariance becomes a moving average of future noises; this may limit how aggressively µ can be increased before the Gaussian closure assumption breaks.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper develops a risk-sensitive Kalman filter for discrete-time linear stochastic singular systems under a round-robin communication protocol. Using the Weierstrass canonical form, the singular system is converted into an equivalent non-causal augmented state-space model with periodically scheduled measurements (RRIPS). A recursive RSKF is derived via a Bayesian information-state formulation that minimizes an exponential quadratic cost; an adaptive rule for the risk parameter µ1 is introduced to keep the predicted covariance positive definite; and uniform boundedness of the posterior covariance is claimed under uniform complete observability/controllability of the uncertain periodic system (Theorems 1, 4, 6). The filter recovers ordinary KF when the risk parameter vanishes and ordinary RSKF when E = I. Numerical Monte-Carlo comparisons with the standard KF under parametric uncertainty are provided.

Significance. If the Gaussian-closure and stability arguments hold, the work fills a genuine gap: risk-sensitive filtering for networked singular systems under explicit scheduling has not been treated, and the combination of WCF, periodic measurements, adaptive risk, and a stability claim is a natural and useful extension of both the authors’ earlier KF-for-RRP result and classical RSKF. The adaptive mechanism that enforces positive-definiteness online is a practical contribution. The reductions to known filters are clean. The main technical value therefore hinges on whether the information-state recursion remains exact for the non-causal RRIPS; that point is currently the load-bearing open issue.

major comments (2)
  1. [§3.1–3.2, Theorems 1 & 4] After (13) and throughout Theorems 1 and 4 the information state Φk is assumed to remain an unnormalized Gaussian for sufficiently small µ1,k-1 satisfying 2µ1P̄k-1|k-1 < I. For ordinary causal linear-Gaussian systems this is classical, but the WCF produces a non-causal process (5b)–(6) whose process noise is correlated with the initial state (Remark 2) and whose measurement matrix is periodically time-varying. No inductive argument is supplied showing that the product of the non-causal transition density, the exponential risk factor and the periodic likelihood stays Gaussian (or that the resulting covariance remains finite) under the online choice of µ1. The adaptive rule of §3.3 only enforces the algebraic inequality after the fact; it does not restore the missing closure. If Gaussianity fails, the claimed closed-form recursion (18),(26) is no longer exact.
  2. [§4, Theorem 6] Theorem 6 asserts uniform boundedness of P̄k|k under uniform complete observability/controllability of the uncertain RRIPS, but the proof is only a one-sentence reference to “Appendix B of [27]”. That appendix treats a different (causal, delayed-measurement) setting. The non-causal structure, the periodic measurement schedule, and the adaptive risk parameter all alter the Gramian and Riccati arguments; a self-contained sketch (or an explicit verification that the cited appendix applies verbatim) is required before the stability claim can be accepted.
minor comments (4)
  1. [Remark 1] The process-noise covariance Q̄k is written as a double sum involving future noises and then reduced to a single sum (Remark 1). A short explicit verification that the cross terms vanish under the white-noise assumption would remove any ambiguity.
  2. [§5] Figures 1–3 report RMSE/Avg-MSE for only two of the three state components and a single uncertainty level range; adding the third component and a brief discussion of the algebraic subsystem would strengthen the numerical section.
  3. [§2.2 and Lemmas 2–3] Notation for the partitioned measurement matrices H̄mk and Rmk is introduced twice with slightly different indexing; a single consistent definition would improve readability.
  4. [Introduction] Several self-citations ([38],[39]) are appropriate background, but the relation of the present adaptive-risk construction to the fixed-risk RSKF of Zhang et al. could be stated more sharply in the introduction.

Circularity Check

0 steps flagged · score 1.0 of 10

No load-bearing circularity: recursive RSKF equations follow from Bayesian update of an exponential quadratic cost under an external Gaussian-closure citation; self-cites supply only background KF/RRP and delayed-RS results.

full rationale

The derivation chain begins from the regular singular system (1), applies the classical Weierstrass form (3) to obtain the non-causal but nonsingular RRIPS (8), then defines the information state Φk via the exponential risk factor (13) and obtains the prediction (18) and update (26) by completing the square under the maintained Gaussian assumption (explicitly attributed to Boel et al. [26], not to the authors). The adaptive rule of §3.3 simply enforces the algebraic inequality 2µ1,k−1P̄k−1|k−1 < I so that the inverse remains positive definite; it is not fitted to any RMSE or simulation data. Stability (Theorem 6) invokes uniform complete observability/controllability of the periodic system and follows the argument of Appendix B of the authors’ earlier delayed-measurement paper [27]; that citation is background technique, not a uniqueness theorem that forces the present claim. Self-citation [38] is likewise only the authors’ prior ordinary KF under RRP and is not used to justify the risk-sensitive recursion. No quantity is defined in terms of itself, no parameter is fitted and then re-presented as a prediction, and the reduction to ordinary KF when µ1 = 0 is an immediate special case of the same equations rather than a circular re-labeling. The only residual weakness is the unproved Gaussian closure for the non-causal periodic case, which is a correctness gap, not circularity. Hence the score is 1 solely for the presence of non-load-bearing self-cites.

Assumptions & free parameters 1 free parameters · 4 assumptions · 1 invented entities

The derivation rests on standard regularity of matrix pencils, Gaussian noise, the classical Weierstrass form, and the information-state construction of risk-sensitive filtering. The only free parameter is the adaptive risk scalar µ1, chosen online from covariance eigenvalues rather than fitted to data. No new physical entities are postulated; the RRIPS is merely a notational packaging of the transformed system under periodic scheduling.

free parameters (1)
  • adaptive risk parameter µ1,k−1 = online, covariance-dependent
    Chosen online so that 2µ1 P̄ < I (below the smallest positive root of the determinant condition). Not fitted to RMSE data, but still a free design choice that directly controls the filter gain.
assumptions (4)
  • domain assumption Matrix pair (E,A) is regular (det(λE−A)≢0)
    Assumption 1; required for existence of Weierstrass form and unique solutions for consistent initials.
  • domain assumption Process and measurement noises are zero-mean Gaussian, uncorrelated, with known covariances Qk, Rk
    Assumption 2; used throughout the Bayesian derivation and covariance recursions.
  • ad hoc to paper Information state Φk remains unnormalized Gaussian for sufficiently small µ1
    Stated after Eq. (13) and used to close the recursion in Theorems 1 and 4; not proved for the non-causal periodic case.
  • standard math Existence of nonsingular U,V putting (E,A) into Weierstrass form
    Classical result for regular pencils; invoked in §2.1 to obtain the dynamic/algebraic split.
invented entities (1)
  • round-robin induced periodic system (RRIPS)
    purpose: Packages the Weierstrass-transformed singular system together with the periodic measurement selection induced by the round-robin protocol so that standard periodic-system tools apply.
    Notational construct; no new dynamics beyond the already-transformed model and the known scheduling rule.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Risk Sensitive Filtering for Singular Systems subject to Round-Robin Protocol." pith.science (2026). https://pith.science/paper/TLMW25RC

@misc{pith2026260704734,
  author       = {Pith},
  title        = {Pith review of: Risk Sensitive Filtering for Singular Systems subject to Round-Robin Protocol},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TLMW25RC}},
  note         = {Machine review of arXiv:2607.04734}
}
read the original abstract

This paper develops a risk sensitive (RS) Kalman filtering framework for discrete-time linear stochastic singular systems operating under communication constraints imposed by a round-robin protocol. Due to limited network bandwidth, only a subset of the available measurements can be transmitted at each sampling instant, resulting in a periodically varying measurement structure. By employing the Weierstrass canonical form (WCF), the singular system is transformed into an equivalent augmented state space model, yielding a round-robin induced periodic system (RRIPS). A recursive risk sensitive Kalman filter (RSKF) is then developed for the RRIPS through a Bayesian formulation and the minimization of an exponential quadratic cost function, from which the recursive filtering equations are obtained for the original singular system. To enhance robustness against modeling uncertainties and disturbances, an adaptive RS mechanism is introduced in which the risk parameter is adjusted online according to the available covariance information. This adaptive strategy guarantees the positive definiteness of the predicted covariance matrix while adjusting the degree of risk sensitivity to the prevailing estimation uncertainty. Furthermore, sufficient conditions ensuring the filter stability are established using the observability and controllability concepts of periodic systems. The proposed framework reduces to the standard KF for singular systems when the RS parameter vanishes and recovers the standard RSKF when the singular matrix reduces to the identity matrix. Finally, numerical results are presented to demonstrate the effectiveness, robustness, and improved estimation performance of the proposed approach in comparison with the standard KF.

Figures

Figures reproduced from arXiv: 2607.04734 by the authors.

Figure 1
Figure 1. RMSE comparison for first state of x 9 [PITH_FULL_IMAGE:figures/full_fig_p009_1.png] view at source ↗
Figure 2
Figure 2. RMSE comparison for second state of x -0.01 -0.008 -0.006 -0.004 -0.002 0 0.002 0.004 0.006 0.008 0.01 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 Average MSE KF RSKF [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Average MSE comparison for first state of [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

51 extracted references

  1. [27]

    Risk sensitive filtering with randomly delayed measurements,

    R. K. Tiwari and S. Bhaumik, “Risk sensitive filtering with randomly delayed measurements,” Automatica, vol. 142, p. 110409, 2022

    2022

  2. [1]

    A new approach to linear filtering and prediction problems,

    R. E. Kalman, “A new approach to linear filtering and prediction problems,” Journal of Basic Engineering , 1960

    1960

  3. [2]

    B. D. Anderson and J. B. Moore, Optimal filtering . New Jersey: Englewood Cliffs, N J: Prentice-Hall, 1979

    1979

  4. [3]

    The Kalman filter-Its recognition and development for aerospace applications,

    S. F. Schmidt, “The Kalman filter-Its recognition and development for aerospace applications,” Journal of Guidance and Control , vol. 4, no. 1, pp. 4–7, 1981

    1981

  5. [4]

    Contact-aided invariant extended Kalman filtering for rob ot state estimation,

    R. Hartley, M. Ghaffari, R. M. Eustice, and J. W. Grizzle, “Contact-aided invariant extended Kalman filtering for rob ot state estimation,” The International Journal of Robotics Research, vol. 39, no. 4, pp. 402–430, 2020

    2020

  6. [5]

    Development of trajectories through the Kalman algorithm and application to an industrial robot in the automotive industry,

    C. Garriz and R. Domingo, “Development of trajectories through the Kalman algorithm and application to an industrial robot in the automotive industry,” IEEE Access, vol. 7, pp. 23570–23578, 2019

    2019

  7. [6]

    Minimal invasive equivalent grid impedance estimation in inductive-resistive power networks using extended Kalman filter,

    N. Hoffmann and F. W. Fuchs, “Minimal invasive equivalent grid impedance estimation in inductive-resistive power networks using extended Kalman filter,” IEEE Transactions on Power Electronics , vol. 29, no. 2, pp. 631–641, 2013

    2013

  8. [7]

    Networked control system: Overview and research trends,

    R. A. Gupta and M.-Y. Chow, “Networked control system: Overview and research trends,” IEEE Transactions on Industrial Electronics, vol. 57, no. 7, pp. 2527–2535, 2009

    2009

Show all 51 references
  1. [8]

    Stability o f networked control systems,

    W. Zhang, M. S. Branicky, and S. M. Phillips, “Stability o f networked control systems,” IEEE control systems magazine , vol. 21, no. 1, pp. 84–99, 2001

    2001

  2. [9]

    Networked control systems: A survey of trends and techniques,

    X.-M. Zhang, Q.-L. Han, X. Ge, D. Ding, L. Ding, D. Yue, and C. Peng, “Networked control systems: A survey of trends and techniques,” IEEE/CAA Journal of Automatica Sinica , vol. 7, no. 1, pp. 1–17, 2019

    2019

  3. [10]

    Network-induced constraints in networked control systems—a survey,

    L. Zhang, H. Gao, and O. Kaynak, “Network-induced constraints in networked control systems—a survey,” IEEE Transactions on Industrial Informatics, vol. 9, no. 1, pp. 403– 416, 2012

    2012

  4. [11]

    Design of networked control systems with packet dropouts,

    J. W u and T. Chen, “Design of networked control systems with packet dropouts,” IEEE Transactions on Automatic control, vol. 52, no. 7, pp. 1314–1319, 2007

    2007

  5. [12]

    Y. Xia, M. Fu, and G.-P. Liu, Analysis and synthesis of networked control systems . Berlin: Springer Verlag, 2011

    2011

  6. [13]

    A review on wireless networked control system: The communication perspective,

    Y. W ang, S. W u, C. Lei, J. Jiao, and Q. Zhang, “A review on wireless networked control system: The communication perspective,” IEEE Internet of Things Journal , vol. 11, no. 5, pp. 7499–7524, 2023

    2023

  7. [14]

    Distributed adaptiv e tracking control for fuzzy nonlinear mass under round-robi n protocol,

    S. Fan, M. Meng, Y. Fu, and C. Deng, “Distributed adaptiv e tracking control for fuzzy nonlinear mass under round-robi n protocol,” IEEE Transactions on Fuzzy Systems , vol. 33, no. 5, pp. 1488–1498, 2025

    2025

  8. [15]

    Observer-based sliding mode control for networked fuzzy singularly perturbed systems under weighted try-once- discard protocol,

    J. W ang, C. Yang, J. Xia, Z.-G. W u, and H. Shen, “Observer-based sliding mode control for networked fuzzy singularly perturbed systems under weighted try-once- discard protocol,” IEEE Transactions on Fuzzy Systems , vol. 30, no. 6, pp. 1889–1899, 2021. 10

    2021

  9. [16]

    Observer-based H∞ control of networked systems with stochastic communication protocol : The finite-horizon case,

    L. Zou, Z. W ang, and H. Gao, “Observer-based H∞ control of networked systems with stochastic communication protocol : The finite-horizon case,” Automatica, vol. 63, pp. 366–373, 2016

    2016

  10. [17]

    Quantiz ed control under round-robin communication protocol,

    K. Liu, E. Fridman, K. H. Johansson, and Y. Xia, “Quantiz ed control under round-robin communication protocol,” IEEE Transactions on Industrial Electronics , vol. 63, no. 7, pp. 4461–4471, 2016

    2016

  11. [18]

    Communication and control co-design for networked control systems,

    L. Zhang and D. Hristu-Varsakelis, “Communication and control co-design for networked control systems,” Automatica, vol. 42, no. 6, pp. 953–958, 2006

    2006

  12. [19]

    Recursive state estimation for stochastic complex networ ks under round-robin communication protocol: Handling packe t disorders,

    D. Liu, Z. W ang, Y. Liu, F. E. Alsaadi, and F. E. Alsaadi, “Recursive state estimation for stochastic complex networ ks under round-robin communication protocol: Handling packe t disorders,” IEEE Transactions on Network Science and Engineering, vol. 8, no. 3, pp. 2455–2468, 2021

    2021

  13. [20]

    Sensor data scheduling for optimal state estimation with communication energy constraint,

    L. Shi, P. Cheng, and J. Chen, “Sensor data scheduling for optimal state estimation with communication energy constraint,” Automatica, vol. 47, no. 8, pp. 1693–1698, 2011

    2011

  14. [21]

    Robust H∞ filtering for discrete nonlinear delayed stochastic systems with missing measurements and randomly occurring nonlinearities,

    Y. Liu, F. E. Alsaadi, X. Yin, and Y. W ang, “Robust H∞ filtering for discrete nonlinear delayed stochastic systems with missing measurements and randomly occurring nonlinearities,” International Journal of General Systems , vol. 44, no. 2, pp. 169–181, 2015

    2015

  15. [22]

    H∞ estimation for uncertain systems with limited communication capacity,

    H. Gao and T. Chen, “ H∞ estimation for uncertain systems with limited communication capacity,” IEEE Transactions on Automatic Control , vol. 52, no. 11, pp. 2070–2084, 2007

  16. [23]

    Particle-method-based formulation of risk-sensitive fil ter,

    S. Sadhu, S. Bhaumik, A. Doucet, and T. K. Ghoshal, “Particle-method-based formulation of risk-sensitive fil ter,” Signal Processing, vol. 89, no. 3, pp. 314–319, 2009

    2009

  17. [24]

    Robust Kalman filtering for uncertain discrete-time systems,

    L. Xie, Y. C. Soh, and C. E. De Souza, “Robust Kalman filtering for uncertain discrete-time systems,” IEEE Transactions on Automatic Control , vol. 39, no. 6, pp. 1310– 1314, 1994

    1994

  18. [25]

    A Bayesian approach to problems in stochastic estimation and control,

    Y. C. Ho and R. Lee, “A Bayesian approach to problems in stochastic estimation and control,” IEEE Transactions on Automatic Control, vol. 9, no. 4, pp. 333–339, 1964

    1964

  19. [26]

    Robustness a nd risk-sensitive filtering,

    R. K. Boel, M. R. James, and I. R. Petersen, “Robustness a nd risk-sensitive filtering,” IEEE Transactions on Automatic Control, vol. 47, no. 3, pp. 451–461, 2002

    2002

  20. [28]

    A. A. Belov, O. G. Andrianova, and A. P. Kurdyukov, Control of discrete-time descriptor systems , vol. 39. Switzerland: Springer International Publishing, 2018

    2018

  21. [29]

    State estimation f or singular systems with finite random measurement delays and packet dropouts,

    A. Goel, S. Bhaumik, and N. K. Tomar, “State estimation f or singular systems with finite random measurement delays and packet dropouts,” Circuits, Systems, and Signal Processing , pp. 1–21, 2025

    2025

  22. [30]

    State estimation schemes for singular systems ,

    L. Dai, “State estimation schemes for singular systems ,” IF AC Proceedings Volumes, vol. 20, no. 5, pp. 209–213, 1987

    1987

  23. [31]

    Filtering and LQG problems for discrete- time stochastic singular systems,

    L. Dai, “Filtering and LQG problems for discrete- time stochastic singular systems,” IEEE Transactions on Automatic Control, vol. 34, no. 10, pp. 1105–1108, 1989

    1989

  24. [32]

    Optimal filtering and a smoothing algori thm for a singular system with a complex stochastic uncertain parameter matrix,

    X. Yu and J. Li, “Optimal filtering and a smoothing algori thm for a singular system with a complex stochastic uncertain parameter matrix,” IEEE Transactions on Circuits and Systems II: Express Briefs , vol. 67, no. 4, pp. 780–784, 2019

    2019

  25. [33]

    Observer design for descriptor systems,

    M. Hou and P. Muller, “Observer design for descriptor systems,” IEEE Transactions on Automatic Control , vol. 44, no. 1, pp. 164–169, 2002

    2002

  26. [34]

    Robust H∞ design of uncertain descriptor systems with discrete and distributed delays,

    D. Yue and Q. L. Han, “Robust H∞ design of uncertain descriptor systems with discrete and distributed delays,” IEEE Transactions on Signal Processing , vol. 52, no. 11, pp. 3200–3212, 2004

    2004

  27. [35]

    Descriptor recursive estimation f or multiple sensors with different delay rates,

    J. Feng and M. Zeng, “Descriptor recursive estimation f or multiple sensors with different delay rates,” International journal of control , vol. 84, no. 3, pp. 584–596, 2011

    2011

  28. [36]

    H∞ filtering for discrete-time singular networked systems wit h communication delays and data missing,

    Z.-X. Li, H.-Y. Su, Y. Gu, and Z.-G. W u, “ H∞ filtering for discrete-time singular networked systems wit h communication delays and data missing,” International Journal of Systems Science , vol. 44, no. 4, pp. 604–614, 2013

    2013

  29. [37]

    Distributed fusion robust filter for multisensor networked singular control system with uncertain variances and missing measurement,

    J. Zheng and C. Ran, “Distributed fusion robust filter for multisensor networked singular control system with uncertain variances and missing measurement,” Optimal Control Applications and Methods , vol. 44, no. 6, pp. 3080– 3098, 2023

    2023

  30. [38]

    Kalman filtering for linear singular systems subject to round-robin protoco l,

    A. Goel, S. Bhaumik, and N. K. Tomar, “Kalman filtering for linear singular systems subject to round-robin protoco l,” Control Theory and Technology , vol. 22, no. 4, pp. 543–551, 2024

    2024

  31. [39]

    Risk-sensitive filterin g, prediction and smoothing for discrete-time singular syste ms,

    H. Zhang, L. Xie, and Y. C. Soh, “Risk-sensitive filterin g, prediction and smoothing for discrete-time singular syste ms,” Automatica, vol. 39, no. 1, pp. 57–66, 2003

    2003

  32. [40]

    H∞ state estimation for discrete-time nonlinear singularly pertur bed complex networks under the round-robin protocol,

    X. W an, Z. W ang, M. W u, and X. Liu, “ H∞ state estimation for discrete-time nonlinear singularly pertur bed complex networks under the round-robin protocol,” IEEE transactions on neural networks and learning systems, vol. 30, no. 2, pp. 415–426, 2018

    2018

  33. [41]

    Secure recursi ve state estimation for singularly perturbed discrete sequen tial systems under round-robin-like multichannel access polic y,

    Y. Li, L. W ei, J. Liu, X. Xie, and E. Tian, “Secure recursi ve state estimation for singularly perturbed discrete sequen tial systems under round-robin-like multichannel access polic y,” IEEE Transactions on Automation Science and Engineering , vol. 22, pp. 3719–3730, 2024

    2024

  34. [42]

    G. R. Duan, Analysis and design of descriptor linear systems , vol. 23. New York: Springer Science & Business Media, 2010

    2010

  35. [43]

    The quasi-Kronecker form for matrix pencils,

    T. Berger and S. Trenn, “The quasi-Kronecker form for matrix pencils,” SIAM Journal on Matrix Analysis and Applications, vol. 33, no. 2, pp. 336–368, 2012

    2012

  36. [44]

    On extended state estimation for nonlinear uncertain systems with round-robin protocol,

    Y. Xu, W. Lv, W. Lin, R. Lu, and D. E. Quevedo, “On extended state estimation for nonlinear uncertain systems with round-robin protocol,” Automatica, vol. 138, p. 110154, 2022

    2022

  37. [45]

    A tutorial on particle filters for online nonlinear/non-gaus sian bayesian tracking,

    M. S. Arulampalam, S. Maskell, N. Gordon, and T. Clapp, “ A tutorial on particle filters for online nonlinear/non-gaus sian bayesian tracking,” IEEE Transactions on Signal Processing, vol. 50, no. 2, pp. 174–188, 2002

    2002

  38. [46]

    Bar Shalom, X

    Y. Bar Shalom, X. R. Li, and T. Kirubarajan, Estimation with applications to tracking and navigation: theory algorithms and software . John Wiley & Sons, 2001

    2001

  39. [47]

    Challa, Fundamentals of object tracking

    S. Challa, Fundamentals of object tracking . Cambridge University Press, 2011

    2011

  40. [48]

    State estimation using randomly delayed measurements,

    A. Ray, L. Liou, and J. Shen, “State estimation using randomly delayed measurements,” Journal of Dynamic Systems, Measurement, and Control , 1993

    1993

  41. [49]

    Risk-sensitive filtering and smoothing via reference probability methods,

    S. Dey and J. B. Moore, “Risk-sensitive filtering and smoothing via reference probability methods,” IEEE Transactions on Automatic Control, vol. 42, no. 11, pp. 1587– 1591, 2002

    2002

  42. [50]

    Bittanti and P

    S. Bittanti and P. Colaneri, Periodic systems: Filtering and control, vol. 5108985. New York: Springer Science & Business Media, 2009

    2009

  43. [51]

    A. H. Jazwinski, Stochastic processes and filtering theory . New York: Academic Press, 2007. 11

    2007

Pith tools

Reviewed July 11, 2026 · model on record in the stance chip above.