Distributed Adaptive Estimation with ISS Guarantees for Sensor Networks with Partially Unknown Source Dynamics

arXiv:2511.07646 · eess.SY, cs.MA, cs.SY, math.DS · Submitted 2025-11-10 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.

Rosa: I'm Rosa.

Dev: And I'm Dev, here with Taro.

Rosa: We're looking at the paper: "Distributed Adaptive Estimation with ISS Guarantees for Sensor Networks with Partially Unknown Source Dynamics".

Dev: Here's the gist of the paper. This paper studies distributed adaptive estimation over sensor networks with partially unknown source dynamics to establish stability guarantees for both continuous-time and discrete-time systems.

Rosa: The main objective is to design a distributed adaptive law such that, under the balanced condition (1) and the sourcereachability assumption in Remark 1, all sensing node estimates are ISS stable with respect to the bounded disturbance on the source.

Dev: System Modeling and Network Topology The problem considers a network of m+1 agents where agent 0 is the source (system being estimated) and agents 1,..., m are sensing nodes that run local adaptive observers and exchange information.

Rosa: Communication is modeled by a weighted directed graph G = (V, E, W) with edge set E ⊆ V × V and nonnegative weights W = diag

wij: .

Paper summary: Rosa: So to wrap up, this paper, "Distributed Adaptive Estimation with ISS Guarantees for Sensor Networks with Partially Unknown Source Dynamics," it establishes a unified framework for both continuous-time and discrete-time distributed adaptive estimation >

Dev: It proves that by using specific architectural choices—like constant adaptive gains for discrete time versus smooth adaptation for continuous time—we can guarantee convergence of each node’s estimate to the source, even with model uncertainty and bounded process noise >

Taro: What this means in practice is that we have a method to build distributed estimation systems where the performance isn't just good under perfect conditions but stays stable when the world misbehaves with noise or if some parts of the network are less connected >

Rosa: It’s about providing these transparent design guidelines and explicit trade-offs between network connectivity, local damping, and how much robustness we get against uncertainties like source growth >

Dev: And for someone who only listens to the show, it means we have a robust method for sensor networks where you can trust the estimates because they are bounded by some constant c from the source disturbance and converge perfectly when there's no noise >

Conclusion: Rosa: So, we’re wrapping up on this paper about distributed adaptive estimation over sensor networks with partially unknown source dynamics. The main point is they’ve set up a way to guarantee stability for both continuous and discrete systems >

Dev: Right, so it’s not just getting the estimate right when everything is perfect conditions but showing that the estimates stay stable even when there are disturbances on the source side >

Taro: I mean, what this means in practice is that we can build these distributed estimation systems where you don't have to worry about them completely blowing up if the source signal itself starts changing unpredictably >

Rosa: Exactly. They designed a distributed adaptive law that works under two specific conditions: the balanced condition and some sourcereachability assumption >

Dev: And they prove that under those assumptions, all the sensor node estimates are ISS stable with respect to any bounded disturbance on that source >

Taro: That sounds like a safety case for real-world deployment. If you have a sensor network where the source signal is noisy or changing, this paper gives you a mathematical guarantee that your estimates won't spiral out of control >

Rosa: It’s about giving designers concrete bounds on how much noise they can expect without losing stability across both continuous and discrete time systems >

Dev: And the distinction they make is that for continuous time, you use smooth adaptation, while for discrete time, you need this constant adaptive gain thing to handle the sampling and those non-strongly convex problems >

Taro: So it’s a different recipe depending on whether your system is running in real-time loops or sampled measurements >

Rosa: The authors show this works on three different network setups—star, cyclic, and path—and they found the star topology was the best performer because every node gets direct source info >

Dev: And for the discrete version, it’s actually quite efficient computationally; it runs in constant time per step because each node only needs to do local updates and neighbor communication >

Taro: It’s good to see those numerical validations. If this holds up in simulation, it suggests we can actually deploy these complex adaptive estimators on hardware without needing massive computational overhead >

Rosa: So the big picture is they’ve built a robust mathematical framework that handles uncertainty and distributed information sharing in these kinds of sensor setups >

Dev: It's about moving from just getting an estimate to having a provable stability guarantee under realistic, noisy conditions >

Taro: And next up, we look at how this structure could translate into actual control systems for physical robots or autonomous vehicles >

Moh Kamalul Wafi, Hamidreza Montazeri Hedesh, Milad Siami

Department of Electrical & Computer Engineering, Northeastern University

eess.SY, cs.MA, cs.SY, math.DS

Submitted: 2025-11-10

Updated: 2026-11-02

Comments: This version is accepted for publication in the 2026 IFAC World Conference

License: http://creativecommons.org/licenses/by-nc-sa/4.0/

Importance score: 77/100

The gist: This paper studies distributed adaptive estimation over sensor networks with partially unknown source dynamics to establish stability guarantees for both continuous-time and discrete-time systems.

Key concepts

Distributed Adaptive Law
This is a set of rules for each sensor node to adjust its estimation parameters dynamically. These rules are coordinated across the network, allowing nodes to learn the source's behavior while communicating with neighbors, ensuring that even if some information is missing or noisy, the estimates remain accurate and stable.
Input-to-State Stability (ISS)
ISS is a stability guarantee for systems where small external disturbances (inputs) lead to bounded errors in the system's state. In this context, it means that if the source dynamics are slightly unpredictable or noisy, the estimation errors will also remain bounded and not grow uncontrollably.
Balanced Condition
This is a specific mathematical requirement on the network topology weights (W = Im) that ensures the overall system structure is positive stable. This condition guarantees that all eigenvalues of a key matrix related to the network dynamics have strictly positive real parts, which is crucial for achieving stability in distributed estimation.
Source Reachability Assumption
This assumption relates to how well the sensing nodes can influence or observe the source dynamics. It ensures that the sensing nodes have enough information flow from the source to allow them to successfully estimate its behavior, which is a necessary condition for proving ISS stability.

Terminology

Summary

This paper studies distributed adaptive estimation over sensor networks with partially unknown source dynamics to establish stability guarantees for both continuous-time and discrete-time systems. p. 0

Where the paper says it

Abstract: This paper studies distributed adaptive estimation over sensor networks with partially unknown source dynamics. We present parallel continuous-time and discrete-time designs in which each node runs a local adaptive observer and exchanges information over a directed graph.

The main objective is to design a distributed adaptive law such that, under the balanced condition (1) and the sourcereachability assumption in Remark 1, all sensing node estimates are ISS stable with respect to the bounded disturbance on the source. p. 2
Where the paper says it

Main objective: Design a distributed adaptive law such that, under the balanced condition (1) and the sourcereachability assumption in Remark 1, all sensing node estimates are ISS stable with respect to the bounded disturbance on the source, i. , lim supt→∞ ∥xi(t) − zi(t)∥ ≤ ccd ∗ , ∀i, (4a) for cc > 0 and, in the disturbance-free case d ∗ = 0 limt→∞ ei(t) := xi(t) − zi(t) = 0.

System Modeling and Network Topology

The problem considers a network of m+1 agents where agent 0 is the source (system being estimated) and agents 1,..., m are sensing nodes that run local adaptive observers and exchange information. p. 1

Where the paper says it

, m}, where agent 0 is the source (system being estimated) and agents 1, . , m are sensing nodes that run local adaptive observers and exchange information.

Communication is modeled by a weighted directed graph G = (V, E, W) with edge set E ⊆ V × V and nonnegative weights W = diag[wij]. p. 1
Where the paper says it

, m are sensing nodes that run local adaptive observers and exchange information. Communication is modeled by a weighted directed graph G = (V, E, W) with edge set E ⊆ V × V and nonnegative weights W = {wij}.

The augmented Laplacian L is defined as L:= Lm + A0 = W − Am. p. 1
Where the paper says it

, wm} with wi := di + wi0 (total incoming weight). The augmented Laplacian is L := Lm + A0 = W − Am.

Under the balanced condition W = Im, or di+wi0 = 1, the augmented Laplacian L is positive stable, ensuring that all eigenvalues have strictly positive real parts. p. 1
Where the paper says it

source (wi0 > 0 for some i), and (ii) every sensing node is reachable from the source via a directed path in G. Under these assumptions and the balanced condition, the augmented Laplacian L is positive stable: all eigenvalues have strictly positive real parts, ℜ{λi(L)} > 0 for all i.

Error Dynamics and Stability Analysis

The estimation error dynamics in network-level form are derived from the source and sensing node equations. The error dynamics inspired by [Wafi et al. p. 2

Where the paper says it

(13) From (4b), the estimation error defined as in (9a) is e¯(t) = (L ⊗ In)¯x(t) − (A0 ⊗ In)¯y0(t) := ¯x(t) − z¯(t). (14) Thus, the estimation error dynamics inspired by [Wafi et al.

(2024); Wafi and Siami (2024)] become e¯˙(t) = He¯(t) + (L ⊗ In)Ξc(t)¯ηc(t) − omega ¯d0(t), where H:= [(L ⊗ In)H + (Am ⊗ In)F0]. p. 2
Where the paper says it

(14) Thus, the estimation error dynamics inspired by [Wafi et al. (2024); Wafi and Siami (2024)] become e¯˙(t) = (L ⊗ In)x¯˙(t) − (A0 ⊗ In)x¯˙ 0(t) = (L ⊗ In) [ Hx¯(t) + (Fˆ(t) − H)¯z(t) + Gˆ (t)¯v0(t) ] − (A0 ⊗ In) [ F0x¯0(t) + G0v¯0(t) + ¯d0(t) ] = (L ⊗ In) [ Hx¯(t) + Fˆ(t)¯z(t) − Hz¯(t) + Gˆ (t)¯v0(t) ] + F0e¯(t) − (L ⊗ In) [ F0x¯(t) + G0v¯0(t) + ¯d0(t) ] = (L ⊗ In) [ Fˆz¯(t) + He¯(t) + Gˆ (t)¯v0(t) ] + (Am ⊗ In)F0e¯(t) − (L ⊗ In) [ F0z¯(t) + G0v¯0(t) + ¯d0(t) ] = He¯(t) + (L ⊗ In)Ξc(t)¯ηc(t) − Ω ¯d0(t), (15) where H := [ (L ⊗ In)H + (Am ⊗ In)F0 ] , (16) adaptive parameter Ξc(t) := [Φc(t), Ψc(t)], time-varying regressor η¯c(t) := [¯z ⊤(t), v¯ ⊤ 0 (t)]⊤, and Ω := (L ⊗ In).

The stability of the coupling operator H is ensured by Proposition 1 and Corollary 1, which provide sufficient conditions for H to be Hurwitz. p. 3
Where the paper says it

If there exist PL = P ⊤ L ≻ 0 and τ > 0 such that H⊤(L ⊤PL ⊗ In) + (PLL ⊗ In)H + F ⊤ ∗ (A ⊤ mPL ⊗ In) + (PLAm ⊗ In)F∗ + τ Im ⊗ In ≺ 0, (17) and 2∥PLAm∥2f < τ, (18) then H is Hurwitz for all admissible ∆F. With the stability of the coupling operator H ensured by Proposition 1 and Corollary 1, we proceed to design adaptive laws for the parameter estimates.

Adaptive Laws and Robustness Guarantees

The paper presents distinct adaptive laws for continuous-time and discrete-time systems, highlighting the need for constant adaptive gains and per-step regressor normalization in the discrete setting. For continuous time, Theorem 1 provides asymptotic convergence in the disturbance-free case and ISS under bounded source disturbances. p. 3

Where the paper says it

(22) In particular, if ¯d ∗ = 0, then e¯(t) → 0 as t → ∞. This completes the continuous-time analysis: Theorem 1 provides asymptotic convergence in the disturbance-free case, while Theorem 2 ensures ISS under bounded source disturbances.

The discrete-time analysis shows that the normalized adaptive law renders the estimation error ISS with respect to bounded process noise. p. 4
Where the paper says it

Theorem 3 shows asymptotic stability in the disturbancefree case. We now reintroduce bounded process noise in the source and show that the same normalized adaptive law renders the estimation error ISS with respect to ¯δ0,k—the discrete-time counterpart of Theorem 2.

Numerical Validation and Scalability

The theoretical results are validated through simulations on three network topologies—star, cyclic, and path—for both time scales. The star topology performs best, which is expected since every sensing node directly receives source information. p. 5

Where the paper says it

3e–3g for discrete time, with the corresponding bounded error norms shown in Figs. The star topology performs best, which is expected since every sensing node directly receives source information.

The discrete-time algorithm performs explicit updates with per-step complexity O(m), as each iteration requires only local state propagation, neighbor aggregation, and a low-rank adaptive update per node. p. 5
Where the paper says it

Table 1 reports the total runtime ttot as the number of sensing nodes m increases for each topology. The discretetime algorithm performs explicit updates with per-step complexity O(m), as each iteration requires only local state propagation, neighbor aggregation, and a low-rank adaptive update per node.

Both continuous and discrete distributed adaptive estimators achieve accurate tracking, ISS robustness, and nearlinear computational growth. p. 5
Where the paper says it

Both continuous and discrete formulations thus demonstrate linear computational scaling and practical efficiency for large sensor networks. Both continuous and discrete distributed adaptive estimators achieve accurate tracking, ISS robustness, and nearlinear computational growth, confirming the theoretical predictions and demonstrating the framework’s scalability to large directed networks.

Conclusion

In both cases we established stability of the network operators—H (continuous) and S (discrete)—and proved convergence of the estimation error; moreover, with bounded source disturbances we derived ISS bounds for both time scales. The main distinction is architectural: continuous-time uses smooth adaptation, whereas discretetime requires per-step normalization with a constant gain to handle sampling and non–strongly convex regressors. p. 5

Where the paper says it

In both cases we established stability of the network operators—H (continuous) and S (discrete)—and proved convergence of the estimation error; moreover, with bounded source disturbances we derived ISS bounds for both time scales. The main distinction is architectural: continuous-time uses smooth adaptation, whereas discretetime requires per-step normalization with a constant gain to handle sampling and non–strongly convex regressors.

Future research will focus on extending the proposed adaptive estimation framework toward control-oriented architectures. p. 5
Where the paper says it

The framework also scales efficiently with the number of sensing nodes, demonstrating both robustness and computational feasibility for larger networks. Future research will focus on extending the proposed adaptive estimation framework toward control-oriented architectures.

REFERENCES

Bozdag, M., Honarpisheh, A. p. 5

Where the paper says it

REFERENCES Bozdag, M. , Honarpisheh, A.

, and Sznaier, M. p. 5
Where the paper says it

, Honarpisheh, A. , and Sznaier, M.

p. 5
Where the paper says it

, Honarpisheh, A. , and Sznaier, M.

(2025). Safe control for pursuit-evasion with density functions. p. 5
Where the paper says it

, and Sznaier, M. Safe control for pursuit-evasion with density functions.

IEEE Control Systems Letters, 9, 432–437. p. 5
Where the paper says it

Safe control for pursuit-evasion with density functions. IEEE Control Systems Letters, 9, 432–437.

doi:10.1109/LCSYS. p. 5
Where the paper says it

IEEE Control Systems Letters, 9, 432–437. 1109/LCSYS.

2025.3573252

Fisher, P.A. and Annaswamy, A. p. 4

Where the paper says it

To simplify the adaptive law design, we first consider the disturbance-free case ¯δ0,k = 0mn, corresponding to the nominal dynamics. In this setting, the prediction mismatch [Fisher and Annaswamy (2023)] can be expressed as ϵ¯k+1 := Ξd,kη¯d,k = [ (L ⊤L) −1L ⊤ ⊗ In ] (¯ek+1 − Se¯k), (29) where ϵ¯k+1 = [ϵ ⊤ 1,k+1, .

M. (2023). Discrete-time adaptive control of a class of nonlinear systems using high-order tuners. p. 5
Where the paper says it

and Annaswamy, A. Discrete-time adaptive control of a class of nonlinear systems using high-order tuners.

In 2023 American Control Conference (ACC), 2393–2398

Hedesh, H.M., Wafi, M.K., Shafai, B. p. 5

Where the paper says it

In 2023 American Control Conference (ACC), 2393–2398. , Shafai, B.

, and Siami, M. p. 0
Where the paper says it

Distributed Adaptive Estimation with ISS Guarantees for Sensor Networks with Partially Unknown Source Dynamics Moh Kamalul Wafi ∗ Hamidreza Montazeri Hedesh ∗ Milad Siami ∗ ∗ Department of Electrical & Computer Engineering, Northeastern University, Boston, MA 02115, USA (e-mail: wafi. m, montazerihedesh.

p. 0
Where the paper says it

Distributed Adaptive Estimation with ISS Guarantees for Sensor Networks with Partially Unknown Source Dynamics Moh Kamalul Wafi ∗ Hamidreza Montazeri Hedesh ∗ Milad Siami ∗ ∗ Department of Electrical & Computer Engineering, Northeastern University, Boston, MA 02115, USA (e-mail: wafi. m, montazerihedesh.

(2025). Robust stability analysis of positive lur’e system

Hu, Z., Hu, J., and Yang, G. p. 0

Where the paper says it

INTRODUCTION Distributed state estimation over sensor networks has emerged as an underlying problem in multi-agent systems, with applications spanning environmental monitoring, surveillance systems, distributed robotics, and cooperative control [Hu et al. (2020); Yang et al.

(2020). A survey on distributed filtering, estimation and fusion for nonlinear systems with communication constraints: new advances and prospects. p. 6
Where the paper says it

, and Yang, G. A survey on distributed filtering, estimation and fusion for nonlinear systems with communication constraints: new advances and prospects.

Systems Science & Control Engineering, 8(1), 189–205

Javanfar, E., Rahmani, M. p. 6

Where the paper says it

Javanfar, E. , Rahmani, M.

, and Wafi, M. p. 0
Where the paper says it

Distributed Adaptive Estimation with ISS Guarantees for Sensor Networks with Partially Unknown Source Dynamics Moh Kamalul Wafi ∗ Hamidreza Montazeri Hedesh ∗ Milad Siami ∗ ∗ Department of Electrical & Computer Engineering, Northeastern University, Boston, MA 02115, USA (e-mail: wafi. m, montazerihedesh.

K. (2025). Robust estimation-based non-fragile control for discrete-time non-linear systems. p. 6
Where the paper says it

, and Wafi, M. Robust estimation-based non-fragile control for discrete-time non-linear systems.

International Journal of Robust and Nonlinear Control, 35(6), 2462–2471

Li, C., Dong, H., Li, J., and Wang, F. p. 0

Where the paper says it

Existing approaches to distributed state estimation broadly fall into consensus-based observers and distributed Kalman filtering. Consensus-based methods [Wang et al.

(2019). Distributed kalman filtering for sensor network with balanced topology. p. 6
Where the paper says it

, and Wang, F. Distributed kalman filtering for sensor network with balanced topology.

Systems & Control Letters, 131, 104500

Olfati-Saber, R. (2007). Distributed kalman filtering for sensor networks. p. 6

Where the paper says it

Olfati-Saber, R. Distributed kalman filtering for sensor networks.

In 2007 46th IEEE Conference on Decision and Control, 5492–5498

Oliveira, A., Zheng, J. p. 6

Where the paper says it

Oliveira, A. , Zheng, J.

, and Sznaier, M. (2025). Convex data-driven contraction with riemannian metrics. p. 6
Where the paper says it

, and Sznaier, M. Convex data-driven contraction with riemannian metrics.

IEEE Control Systems Letters, 9, 595–600

Raj, A., Jagannathan, S. p. 6

Where the paper says it

1109/LCSYS. , Jagannathan, S.

, and Yucelen, T. p. 6
Where the paper says it

, Jagannathan, S. , and Yucelen, T.

(2020). Distributed adaptive state estimation and tracking scheme for nonlinear systems using active passive sensor networks. p. 6
Where the paper says it

, and Yucelen, T. Distributed adaptive state estimation and tracking scheme for nonlinear systems using active passive sensor networks.

In 2020 American Control Conference (ACC), 2587–2592

Rong, L., Wang, S., Jiang, G. p. 6

Where the paper says it

23919/ACC45564. , Jiang, G.

p. 6
Where the paper says it

23919/ACC45564. , Jiang, G.

P., and Xu, S. (2020). Distributed observer-based consensus over directed networks with limited communication bandwidth constraints. p. 6
Where the paper says it

, and Xu, S. Distributed observer-based consensus over directed networks with limited communication bandwidth constraints.

IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50(12), 5361–5368

Stegagno, P. and Yuan, C. p. 0

Where the paper says it

Recent works have explored distributed adaptive estimation to address such uncertainties, combining local learning with networked coordination [Raj et al. (2020); Wang and Meng (2021); Stegagno and Yuan (2019)].

(2019). Distributed cooperative adaptive state estimation and system identification for multi-agent systems. p. 6
Where the paper says it

and Yuan, C. Distributed cooperative adaptive state estimation and system identification for multi-agent systems.

IET Control Theory & Applications, 13(6), 815–822

Talebi, S.P. and Werner, S. p. 0

Where the paper says it

Distributed Kalman filters [Olfati-Saber (2007); Li et al. (2019); Talebi and Werner (2018)] handle stochastic uncertainty but require knowledge of noise statistics and system matrices.

(2018). Distributed kalman filtering: Consensus, diffusion, and mixed. p. 6
Where the paper says it

and Werner, S. Distributed kalman filtering: Consensus, diffusion, and mixed.

In 2018 IEEE Conference on Control Technology and Applications (CCTA), 1126–1132

Vivas, C., Siri, S., Ferrara, A. p. 6

Where the paper says it

In 2018 IEEE Conference on Control Technology and Applications (CCTA), 1126–1132. , Ferrara, A.

, Sacone, S. p. 6
Where the paper says it

, Ferrara, A. , Sacone, S.

, Cavanna, G. p. 6
Where the paper says it

, Sacone, S. , Cavanna, G.

, and Rubio, F. p. 6
Where the paper says it

, Cavanna, G. , and Rubio, F.

R. (2015). Distributed consensus-based switched observers for freeway traffic density estimation. p. 6
Where the paper says it

, and Rubio, F. Distributed consensus-based switched observers for freeway traffic density estimation.

In 2015 54th IEEE Conference on Decision and Control (CDC), 3445–3450

Wafi, M.K., Ataka, A. p. 6

Where the paper says it

In 2015 54th IEEE Conference on Decision and Control (CDC), 3445–3450. , Ataka, A.

, Nazaruddin, Y. p. 6
Where the paper says it

, Ataka, A. , Nazaruddin, Y.

Y., and Jayawardhana, B. p. 6
Where the paper says it

, Nazaruddin, Y. , and Jayawardhana, B.

(2026a). Distributed nonlinear control of networked two-wheeled robots under adversarial interactions. p. 6
Where the paper says it

, and Jayawardhana, B. Distributed nonlinear control of networked two-wheeled robots under adversarial interactions.

arXiv preprint arXiv:2604. p. 6
Where the paper says it

Distributed nonlinear control of networked two-wheeled robots under adversarial interactions. arXiv preprint arXiv:2604.

p. 6
Where the paper says it

Distributed nonlinear control of networked two-wheeled robots under adversarial interactions. arXiv preprint arXiv:2604.

03917

Wafi, M.K., Indriawati, K. p. 6

Where the paper says it

org/abs/2604. , Indriawati, K.

, and Widjiantoro, B. p. 6
Where the paper says it

, Indriawati, K. , and Widjiantoro, B.

L. (2024). Model reference adaptive control of networked systems with state and input delays. p. 6
Where the paper says it

, and Widjiantoro, B. Model reference adaptive control of networked systems with state and input delays.

International Journal of Electrical and Computer Engineering (IJECE), 14(5), 5055

Wafi, M.K., Nugraha, Y. p. 6

Where the paper says it

pp5055-5063. , Nugraha, Y.

E., Widjiantoro, B. p. 6
Where the paper says it

, Indriawati, K. , and Widjiantoro, B.

L., and Indriawati, K. p. 6
Where the paper says it

org/abs/2604. , Indriawati, K.

(2026b). Cooperative H∞ fault-tolerant tracking with iss guarantees for networked systems with sensor faults. p. 6
Where the paper says it

, and Indriawati, K. Cooperative H∞ fault-tolerant tracking with iss guarantees for networked systems with sensor faults.

arXiv preprint arXiv:2604.03921

Wafi, M.K. and Siami, M. (2023). A comparative analysis of reinforcement learning and adaptive control techniques for linear uncertain systems. p. 6

Where the paper says it

and Siami, M. A comparative analysis of reinforcement learning and adaptive control techniques for linear uncertain systems.

In 2023 Proceedings of the Conference on Control and its Applications (CT), 25–32

Wang, S. and Meng, X. p. 0

Where the paper says it

Recent works have explored distributed adaptive estimation to address such uncertainties, combining local learning with networked coordination [Raj et al. (2020); Wang and Meng (2021); Stegagno and Yuan (2019)].

(2021). Adaptive consensus and parameter estimation of multiagent systems with an uncertain leader. p. 6
Where the paper says it

and Meng, X. Adaptive consensus and parameter estimation of multiagent systems with an uncertain leader.

IEEE Transactions on Automatic Control, 66(9), 4393–4400

Wang, X., Jiang, G.P., Su, H., and Zeng, Z. p. 6

Where the paper says it

, Jiang, G. , and Zeng, Z.

(2022). Consensus-based distributed reduced-order observer design for lti systems. p. 6
Where the paper says it

, and Zeng, Z. Consensus-based distributed reduced-order observer design for lti systems.

IEEE Transactions on Cybernetics, 52(7), 6331–6341

Yang, G., Barboni, A. p. 7

Where the paper says it

52(7), 6331–6341. , Barboni, A.

, Rezaee, H. p. 7
Where the paper says it

, Barboni, A. , Rezaee, H.

, and Parisini, T. p. 7
Where the paper says it

, Rezaee, H. , and Parisini, T.

(2022). State estimation using a network of distributed observers with unknown inputs. p. 7
Where the paper says it

, and Parisini, T. State estimation using a network of distributed observers with unknown inputs.

Automatica, 146, 110631

Zhu, M., Sui, T., and Wang, R. p. 0

Where the paper says it

Existing approaches to distributed state estimation broadly fall into consensus-based observers and distributed Kalman filtering. Consensus-based methods [Wang et al.

(2023). Distributed kalman filtering over sensor networks with fading measurements and random link failures. p. 7
Where the paper says it

, and Wang, R. Distributed kalman filtering over sensor networks with fading measurements and random link failures.

Journal of the Franklin Institute, 360(4), 2457–2475

Zolfaghari, S. and Moradi, H. p. 5

Where the paper says it

Integrating safety principles and density-based coordination [Bozdag et al. (2025)], as well as robust active control in network systems [Zolfaghari and Moradi (2025); Wafi et al.

(2025). Design of a robust active controller to suppress the undesirable vibrations of power transmission lines by using the intermediate actuators & optimization of their locations: A comparison between linear & nonlinear models. p. 7
Where the paper says it

and Moradi, H. Design of a robust active controller to suppress the undesirable vibrations of power transmission lines by using the intermediate actuators & optimization of their locations: A comparison between linear & nonlinear models.

Structures, 82, 110396

Appendix A. PROOFS

Proof of Proposition 1: Let P = PL ⊗ In ≻ 0 and consider V (¯e) = ¯e⊤Pe. Along e¯˙ = He, we have V˙ = ¯e⊤(H⊤P + PH)¯e

Proof of Corollary 1: Let P = PL⊗In. By definition F0 = F∗ + ∆F, define F∗ = Im ⊗ F∗ and ∆F = Im ⊗ ∆F

Proof of Theorem 1: Define the Lyapunov function V (t) = ¯e⊤(t)Pce¯(t) + tr[Φc(t)Γ−1ϕ Φc(t)] + tr[Ψc(t)Γ−1ψ Ψc(t)]

Proof of Theorem 2: Consider the Lyapunov function V (t) given in (A.1) with Φc(t), Ψc(t) as in (13). p. 2

Where the paper says it

There exist optimal parameter values of the source dynamics in (11a), denoted as Fˆ ∗ and Gˆ ∗ , such that Fˆ ∗ := F0 and Gˆ ∗ := G0. Then, we introduce the parameter errors Φc(t) ≜ Fˆ(t) − F0, Ψc(t) ≜ Gˆ (t) − G0.

Along the error dynamics and using the adaptive laws (20), all mixed terms involving Ξc(t)¯ηc(t) cancel by construction

Proof of Proposition 2: Let P = PL ⊗ In ≻ 0 and consider Vk = ¯e⊤k Pe¯k. Along e¯k+1 = Se¯k, Vk+1 − Vk = ¯e⊤k(S⊤PS − P)e¯k

Proof of Corollary 2: Let A0 = A∗+∆A,∥∆A∥2 ≤ a, and define A∗ = Im ⊗ A∗ and ∆A = Im ⊗ ∆A

Proof of Lemma 1: Define the Lyapunov function Vk = Ξd,k 2F = tr(Ξ T d,kΞd,k). Using the adaptive update (35), the parameter recursion can be written as Ξd k+1 = Ξd k − γ∇Jˆ k

Proof of Theorem 3: From Lemma 1, Ξd k is bounded and Vk nonincreasing. Summing (A. p. 8

Where the paper says it

Proof of Theorem 3: From Lemma 1, Ξd,k is bounded and Vk nonincreasing. Summing (A.

3) over k gives ∑∞ k=0 ϵ¯k+1 2Nk ≤ V0 γ(2 − γ) < ∞, which implies ϵ¯k+1/Nk → 0 as k → ∞

Proof of Theorem 4: Define the Lyapunov function Vk = ¯e⊤k Pde¯k + tr[Φ T d,kΓ−1ϕ Φd,k] + tr[Ψ T d,kΓ−1ψ Ψd k]

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Adaptive estimation in sensor networks can be made robust to unknown source dynamics by using local adaptive observers that exchange information over directed graphs, ensuring all node estimates converge to the source state despite parametric uncertainty and bounded process noise.

  2. The system can achieve input-to-state stability (ISS) with respect to bounded process disturbances, meaning the estimation error is guaranteed to remain bounded by a constant proportional to the disturbance bound.

  3. Discrete-time systems can utilize constant adaptive gains and per-step regressor normalization to handle sampling effects and non strongly convex cost functions, leading to ISS bounds under bounded source noise.

  4. The framework allows for explicit design guidelines establishing trade-offs among network connectivity, local damping, and source growth to ensure robustness against normbounded uncertainties.

  5. The distributed estimator can be validated across various network topologies (star, cyclic, path) to demonstrate accurate tracking and scalability with the number of sensing nodes using a linear computational complexity of O(m).

Abstract

This paper studies distributed adaptive estimation over sensor networks with partially unknown source dynamics. We present parallel continuous-time and discrete-time designs in which each node runs a local adaptive observer and exchanges information over a directed graph. For both time scales, we establish stability of the network coupling operators, prove boundedness of all internal signals, and show convergence of each node's estimate to the source despite model uncertainty and disturbances. We further derive input-to-state stability (ISS) bounds that quantify robustness to bounded process noise. A key distinction is that the discrete-time design uses constant adaptive gains and per-step regressor normalization to handle sampling effects, whereas the continuous-time design does not. A unified Lyapunov framework links local observer dynamics with graph topology. Simulations on star, cyclic, and path networks corroborate the analysis, demonstrating accurate tracking, robustness, and scalability with the number of sensing nodes.

Sources

Related papers