pith. sign in

arxiv: 1907.01309 · v1 · pith:KCTCZCK6new · submitted 2019-07-02 · 📡 eess.SY · cs.MA· cs.SY· math.OC

Scalar Field Estimation with Mobile Sensor Networks

Rihab Abdul Razak , Sukumar Srikant , Hoam Chung This is my paper

Pith reviewed 2026-05-25 11:01 UTC · model grok-4.3

classification 📡 eess.SY cs.MAcs.SYmath.OC
keywords scalar field estimationmobile sensor networksadaptive controlLyapunov stabilityradial basis functionspersistence of excitationparameter convergencemotion planning
0
0 comments X

The pith

Mobile sensors estimate a scalar field exactly when their paths satisfy persistence-like conditions on the measurements.

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

The paper establishes that a network of mobile sensors, each measuring the field value only at its current position, can recover the exact parameters of a scalar field. The field is modeled as a finite sum of positive definite radial basis kernels whose centers and shapes are known in advance. Adaptive control laws combined with Lyapunov analysis prove that the parameter estimates remain stable and converge to the true values provided the sensors' trajectories are chosen to meet persistence-like excitation conditions. A reader would care because this supplies a concrete motion-planning rule that guarantees convergence without requiring advance knowledge of the field values themselves.

Core claim

For a scalar field that can be expressed exactly as a finite sum of positive definite radial basis kernels with known centers and shapes, the parameter vector estimated from instantaneous point measurements by mobile sensors converges asymptotically to the true parameter vector whenever the collective sensor trajectories satisfy persistence-like conditions; the proof proceeds by constructing an adaptive estimator whose stability is shown via a Lyapunov function whose derivative is made negative semi-definite under those motion constraints.

What carries the argument

Persistence-like conditions on the collective trajectories of the mobile sensors, which ensure that the regressor matrix formed by the radial basis evaluations remains sufficiently exciting for the adaptive parameter update law.

If this is right

  • Parameter estimates converge to their true values under the designed motion.
  • The closed-loop estimator remains stable in the Lyapunov sense.
  • Sensor paths can be generated without prior knowledge of the field values.
  • The same framework applies to any finite network of mobile sensors that can be steered to meet the excitation conditions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same persistence-based motion planning could be tested on fields that are only approximately representable by radial basis kernels, with the resulting error bounds derived from the approximation residual.
  • The method suggests a separation between path planning (done without field knowledge) and online parameter adaptation that might be useful for other distributed sensing tasks such as gradient field reconstruction.
  • If the radial basis centers are allowed to be adapted as well, the persistence conditions would need to be strengthened to guarantee joint convergence of both centers and weights.

Load-bearing premise

The scalar field must be exactly equal to a finite sum of positive definite radial basis kernels whose centers and shapes are known before any measurements are taken.

What would settle it

A counter-example in which sensors follow trajectories that satisfy the stated persistence conditions yet the parameter estimates fail to converge when the true field deviates from the assumed radial-basis representation.

Figures

Figures reproduced from arXiv: 1907.01309 by Hoam Chung, Rihab Abdul Razak, Sukumar Srikant.

Figure 1
Figure 1. Figure 1: Illustration of four mobile sensors with a partition of [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Illustration of four mobile sensors with the directed [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: Left: Initial positions (blue squares), corresponding par [PITH_FULL_IMAGE:figures/full_fig_p009_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Algorithm S1: Average parameter estimation error with time mobile sensor i (denoted Qi) consists of those points which are closer to sensor i as compared to all other sensors: Qi = {q ∈ Q : kq − xik ≤ kq − xjk, j = 1, 2, . . . , N; j 6= i} (55) For motion control of the sensors, we use a proportional control law ui = k(xi − xgi) where xgi is made to switch between all the centres in the region Qi making su… view at source ↗
Figure 6
Figure 6. Figure 6: The reconstructed field using algorithm S [PITH_FULL_IMAGE:figures/full_fig_p010_6.png] view at source ↗
Figure 10
Figure 10. Figure 10: Unknown Centres: Reconstructed field. this we consider the continuous scalar field given by φ(x, y) = 3x 2 e −(x−0.7)2−(y−0.7)2 0.05 + e −(x−0.4)2−(y−0.4)2 0.06 + 1 3 e −(x−0.2)2−(y−0.2)2 0.08 . over the unit square region Q. A plot of φ(·) is shown in figure 11. We use N = 5 mobile sensors with the partitions Qi determined as follows: We first run a uniform coverage algorithm (coverage algorithm presente… view at source ↗
Figure 11
Figure 11. Figure 11: The scalar field φ(x, y) used in the simulation [PITH_FULL_IMAGE:figures/full_fig_p010_11.png] view at source ↗
Figure 8
Figure 8. Figure 8: Algorithm S3: Average parameter estimation error with time Algorithm Max. est. error S1 0.16 S2 0.62 S3 0.44 (a) Max. parameter estimation errors. (b) Algorithm S1 [PITH_FULL_IMAGE:figures/full_fig_p010_8.png] view at source ↗
Figure 15
Figure 15. Figure 15: Reconstructed field (p = 196) with algorithm S1. 0 0.2 0.4 0.6 0.8 1 0 0.2 0.4 0.6 0.8 1 (a) σi = 0.03. 0 0.2 0.4 0.6 0.8 1 0 0.2 0.4 0.6 0.8 1 (b) σi = 0.04 [PITH_FULL_IMAGE:figures/full_fig_p011_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: Reconstructed field (p = 196) with algorithm S2. comparison of various algorithms is given in table III. We see that algorithm S1 gives better approximation com￾pared to the others as expected. Also the algorithm S3 per￾forms significantly better compared to algorithm S2. Increas￾ing the number of parameters gives better approximation as expected for algorithm 1, though for the other algorithms this is no… view at source ↗
Figure 17
Figure 17. Figure 17: Reconstructed field (p = 196) with algorithm S3. σi = 0.03 T (sec) kek2 σi = 0.04 T (sec) kek2 Algorithm S1 6.6 0.031 Algorithm S1 8.9 0.008 Algorithm S2 6.6 0.059 Algorithm S2 8.8 0.073 Algorithm S3 6.6 0.053 Algorithm S3 8.8 0.039 TABLE III: Comparison of algorithms for p = 196 parameters [PITH_FULL_IMAGE:figures/full_fig_p011_17.png] view at source ↗
read the original abstract

In this paper, we consider the problem of estimating a scalar field using a network of mobile sensors which can measure the value of the field at their instantaneous location. The scalar field to be estimated is assumed to be represented by positive definite radial basis kernels and we use techniques from adaptive control and Lyapunov analysis to prove the stability of the proposed estimation algorithm. The convergence of the estimated parameter values to the true values is guaranteed by planning the motion of the mobile sensors to satisfy persistence-like conditions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper considers estimating a scalar field using mobile sensors that measure the field at their locations. The field is modeled as a finite sum of positive definite radial basis kernels with a priori known centers and shapes. An adaptive estimation scheme is proposed whose stability is proved via Lyapunov analysis drawn from adaptive control. Parameter estimates are shown to converge to their true values provided the sensors' trajectories are planned to satisfy persistence-like excitation conditions.

Significance. If the central claims hold, the work supplies a Lyapunov-based guarantee that sensor motion can be designed to enforce parameter convergence for fields exactly spanned by a known finite RBF dictionary. This links adaptive-control persistence conditions directly to trajectory planning and could inform coverage or exploration strategies in environmental monitoring. The approach is parameter-free in the sense that the regressor structure is fixed before deployment, which is a positive feature when the modeling assumption is satisfied.

major comments (2)
  1. [Abstract / Problem Formulation] Abstract and problem statement: the claim that estimated parameters converge to the 'true values' is load-bearing on the modeling assumption that the scalar field lies exactly in the finite-dimensional span of the chosen RBFs whose centers and widths are known a priori. If the field contains components outside this span, the Lyapunov argument only establishes convergence to the orthogonal projection onto that span, not to the claimed true parameters. This distinction must be stated explicitly and the result reframed accordingly.
  2. [Motion Planning / Persistence Conditions] Motion-planning section: the persistence-like conditions must be shown to be satisfiable using only quantities known before deployment (sensor kinematics and the fixed RBF centers), without dependence on the unknown field values or on the running parameter estimates. If the planner uses estimates in a way that can destroy excitation, the convergence guarantee is circular. A concrete verification that the generated trajectories remain persistently exciting independently of the field is required.
minor comments (2)
  1. [Abstract] Notation for the RBF widths and centers should be introduced once and used consistently; the abstract refers to 'positive definite radial basis kernels' without specifying whether widths are identical or per-kernel.
  2. [Abstract] The phrase 'persistence-like conditions' should be replaced by a precise reference to the standard persistence-of-excitation definition used in the Lyapunov analysis (e.g., the integral condition on the regressor).

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments, which help clarify the scope and assumptions of our work. We address each major comment below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract / Problem Formulation] Abstract and problem statement: the claim that estimated parameters converge to the 'true values' is load-bearing on the modeling assumption that the scalar field lies exactly in the finite-dimensional span of the chosen RBFs whose centers and widths are known a priori. If the field contains components outside this span, the Lyapunov argument only establishes convergence to the orthogonal projection onto that span, not to the claimed true parameters. This distinction must be stated explicitly and the result reframed accordingly.

    Authors: We agree that the distinction is important for precision. The manuscript explicitly assumes that the scalar field lies exactly in the finite span of the chosen RBFs (see abstract and Section II). Under this assumption, the Lyapunov analysis establishes convergence to the true parameters. If the field has components outside the span, the estimates converge to the orthogonal projection. In the revision we will add an explicit statement of this modeling assumption in the abstract and problem formulation, and reframe the convergence claim to hold under the exact-span assumption (or to the projection otherwise). revision: yes

  2. Referee: [Motion Planning / Persistence Conditions] Motion-planning section: the persistence-like conditions must be shown to be satisfiable using only quantities known before deployment (sensor kinematics and the fixed RBF centers), without dependence on the unknown field values or on the running parameter estimates. If the planner uses estimates in a way that can destroy excitation, the convergence guarantee is circular. A concrete verification that the generated trajectories remain persistently exciting independently of the field is required.

    Authors: The regressor is formed from sensor positions and the a priori known RBF centers/shapes; the persistence conditions are therefore defined solely in terms of these known quantities and the sensor kinematics. The motion planner is designed to generate trajectories that satisfy the persistence conditions using only these pre-deployment quantities and does not feed back the running parameter estimates in a manner that can destroy excitation. In the revised manuscript we will add a concrete verification (e.g., an explicit trajectory construction or numerical check) demonstrating that the generated paths remain persistently exciting independently of the unknown field values. revision: yes

Circularity Check

0 steps flagged

No circularity: standard adaptive control + Lyapunov applied to exact RBF span assumption

full rationale

The derivation chain rests on the explicit modeling assumption that the unknown scalar field lies exactly in the finite-dimensional span of a priori known positive-definite RBF kernels, followed by application of classical persistence-of-excitation results from adaptive control theory (external to the paper) and standard Lyapunov analysis to guarantee parameter convergence when sensor trajectories satisfy the PE condition. No step reduces a claimed prediction to a fitted parameter by construction, no self-citation is invoked as a load-bearing uniqueness theorem, and the motion-planning requirement is stated as an independent design task using only known quantities. The central claim therefore remains non-tautological and externally grounded.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the assumption that the field admits an exact finite radial basis expansion and that persistence conditions can be enforced via motion planning; no free parameters or invented entities are mentioned in the abstract.

axioms (2)
  • domain assumption The scalar field is exactly representable by a finite linear combination of known positive definite radial basis kernels.
    Stated directly in the abstract as the representation used for estimation.
  • domain assumption Sensor trajectories can be planned to satisfy persistence-like excitation conditions.
    Invoked to guarantee parameter convergence; no proof or method for planning is given in abstract.

pith-pipeline@v0.9.0 · 5608 in / 1367 out tokens · 20861 ms · 2026-05-25T11:01:35.468238+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    Coordination of groups of mobile autonomous agents using nearest neighbor rules,

    A. Jadbabaie and J. Lin, “Coordination of groups of mobile autonomous agents using nearest neighbor rules,” Automatic Control, IEEE Transac- tions on, vol. 48, no. 6, pp. 988–1001, 2003

    work page 2003

  2. [2]

    Recent research in cooperative control of multivehicle systems,

    R. M. Murray, “Recent research in cooperative control of multivehicle systems,” Journal of Dynamic Systems, Measurement, and Control , vol. 129, no. 5, pp. 571–583, 2007

    work page 2007

  3. [3]

    Consensus and cooperation in networked multi-agent systems,

    R. Olfati-Saber, A. Fax, and R. M. Murray, “Consensus and cooperation in networked multi-agent systems,” Proceedings of the IEEE , vol. 95, no. 1, pp. 215–233, 2007

    work page 2007

  4. [4]

    Flocking in fixed and switching networks,

    H. Tanner, A. Jadbabaie, and G. Pappas, “Flocking in fixed and switching networks,” Automatic Control, IEEE Transactions on, vol. 52, no. 5, pp. 863–868, May 2007

    work page 2007

  5. [5]

    Coverage control for mobile sensing networks,

    J. Cortes, S. Martinez, T. Karatas, and F. Bullo, “Coverage control for mobile sensing networks,” IEEE Transactions on Automatic Control , vol. 20, no. 2, pp. 243–255, Apr. 2004

    work page 2004

  6. [6]

    Estimating inhomogeneous fields using wireless sensor networks,

    R. Nowak, U. Mitra, and R. Willett, “Estimating inhomogeneous fields using wireless sensor networks,” IEEE Journal on Selected Areas in Communications, vol. 22, no. 6, pp. 999–1006, Aug 2004

    work page 2004

  7. [7]

    Matched source-channel commu- nication for field estimation in wireless sensor network,

    W. Bajwa, A. Sayeed, and R. Nowak, “Matched source-channel commu- nication for field estimation in wireless sensor network,” in IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005., April 2005, pp. 332–339

    work page 2005

  8. [8]

    Static field estimation using a wireless sensor network based on the finite element method,

    T. Van Waterschoot and G. Leus, “Static field estimation using a wireless sensor network based on the finite element method,” in 2011 4th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) , Dec 2011, pp. 369–372

    work page 2011

  9. [9]

    Spatio-temporal characteristics of point and field sources in wireless sensor networks,

    M. C. Vuran and O. B. Akan, “Spatio-temporal characteristics of point and field sources in wireless sensor networks,” in 2006 IEEE International Conference on Communications , vol. 1, June 2006, pp. 234–239

    work page 2006

  10. [10]

    Dynamic field estimation using wireless sensor networks: Tradeoffs between estimation error and communication cost,

    H. Zhang, J. M. F. Moura, and B. Krogh, “Dynamic field estimation using wireless sensor networks: Tradeoffs between estimation error and communication cost,” IEEE Transactions on Signal Processing, vol. 57, no. 6, pp. 2383–2395, June 2009

    work page 2009

  11. [11]

    Mathematical evaluation of environmental monitoring estimation error through energy- efficient wireless sensor networks,

    D. Dardari, A. Conti, C. Buratti, and R. Verdone, “Mathematical evaluation of environmental monitoring estimation error through energy- efficient wireless sensor networks,” IEEE Transactions on Mobile Com- puting, vol. 6, no. 7, pp. 790–802, July 2007

    work page 2007

  12. [12]

    Distributed estimation and detection for sensor networks using hidden markov random field models,

    A. Dogandzic and B. Zhang, “Distributed estimation and detection for sensor networks using hidden markov random field models,” IEEE Transactions on Signal Processing , vol. 54, no. 8, pp. 3200–3215, Aug 2006

    work page 2006

  13. [13]

    Adaptive information collection by robotic sensor networks for spatial estimation,

    R. Graham and J. Cortes, “Adaptive information collection by robotic sensor networks for spatial estimation,” IEEE Transactions on Automatic Control, vol. 57, no. 6, pp. 1404–1419, June 2012

    work page 2012

  14. [14]

    Random field reconstruction with quantization in wireless sensor networks,

    I. Nevat, G. W. Peters, and I. B. Collings, “Random field reconstruction with quantization in wireless sensor networks,” IEEE Transactions on Signal Processing, vol. 61, no. 23, pp. 6020–6033, Dec 2013

    work page 2013

  15. [15]

    The effect of communication topology on scalar field estimation by large networks with partially accessible measurements,

    R. K. Ramachandran and S. Berman, “The effect of communication topology on scalar field estimation by large networks with partially accessible measurements,” in 2017 American Control Conference (ACC), May 2017, pp. 3886–3893

    work page 2017

  16. [16]

    Scalar field estimation using adaptive networks,

    Y . P. Bergamo and C. G. Lopes, “Scalar field estimation using adaptive networks,” in 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , March 2012, pp. 3565–3568

    work page 2012

  17. [17]

    Distributed sensor fusion for scalar field map- ping using mobile sensor networks,

    H. M. La and W. Sheng, “Distributed sensor fusion for scalar field map- ping using mobile sensor networks,” IEEE Transactions on Cybernetics, vol. 43, no. 2, pp. 766–778, April 2013

    work page 2013

  18. [18]

    Cooperative and active sensing in mobile sensor networks for scalar field mapping,

    H. M. La, W. Sheng, and J. Chen, “Cooperative and active sensing in mobile sensor networks for scalar field mapping,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , vol. 45, no. 1, pp. 1–12, Jan 2015

    work page 2015

  19. [19]

    Masset, R

    W. Wu and F. Zhang, “Cooperative exploration of level surfaces of three dimensional scalar fields,” Automatica, vol. 47, no. 9, pp. 2044–2051, Sep. 2011. [Online]. Available: http://dx.doi.org/10.1016/j. automatica.2011.06.001

    work page doi:10.1016/j 2044

  20. [20]

    Adaptive sampling for estimating a scalar field using a robotic boat and a sensor network,

    B. Zhang and G. S. Sukhatme, “Adaptive sampling for estimating a scalar field using a robotic boat and a sensor network,” in Proceedings 2007 IEEE International Conference on Robotics and Automation, April 2007, pp. 3673–3680

    work page 2007

  21. [21]

    Decentralized, adaptive cover- age control for networked robots,

    M. Schwager, D. Rus, and J.-J. Slotine, “Decentralized, adaptive cover- age control for networked robots,” Int. J. Rob. Res. , vol. 28, no. 3, pp. 357–375, Mar. 2009

    work page 2009

  22. [22]

    Decentralized Adaptive Coverage Control of Nonholonomic Mobile Robots,

    R. Abdul Razak, S. Srikant, and H. Chung, “Decentralized Adaptive Coverage Control of Nonholonomic Mobile Robots,” in 10th IFAC Symposium on Nonlinear Control Systems , 2016, pp. 1173–1178

    work page 2016

  23. [23]

    Decentralized and adaptive control of multiple nonholonomic robots for sensing coverage,

    ——, “Decentralized and adaptive control of multiple nonholonomic robots for sensing coverage,” International Journal of Robust and Nonlinear Control , vol. 28, no. 6, pp. 2636–2650, 2018. [Online]. Available: https://onlinelibrary.wiley.com/doi/abs/10.1002/rnc.4041

    work page doi:10.1002/rnc.4041 2018

  24. [24]

    Distributed coverage control of mobile sensors: Generalized approach using distance functions,

    R. A. Razak, S. Srikant, and H. Chung, “Distributed coverage control of mobile sensors: Generalized approach using distance functions,” in 2018 IEEE Conference on Decision and Control (CDC) , Dec 2018, pp. 3323–3328

    work page 2018

  25. [25]

    Universal approximation using radial-basis- function networks,

    J. Park and I. W. Sandberg, “Universal approximation using radial-basis- function networks,” Neural Computation , vol. 3, no. 2, pp. 246–257, June 1991

    work page 1991

  26. [26]

    Lavretsky and K

    E. Lavretsky and K. A. Wise, Robust Adaptive Control. Springer, 2013

    work page 2013

  27. [27]

    Interpolation of scattered data: distance matrices and conditionally positive definite functions,

    C. Micchelli, “Interpolation of scattered data: distance matrices and conditionally positive definite functions,” Constr. Approx., vol. 2, pp. 11–22, 1986

    work page 1986

  28. [28]

    On the persistency of excitation in radial basis function network identification of nonlinear systems,

    D. Gorinevsky, “On the persistency of excitation in radial basis function network identification of nonlinear systems,” IEEE Transactions on Neural Networks, vol. 6, no. 5, pp. 1237–1244, 1995

    work page 1995

  29. [29]

    Mesbahi and M

    M. Mesbahi and M. Egerstedt, Graph theoretic methods in multiagent networks. Princeton University Press, 2010, vol. 33

    work page 2010